Constraint-based reachability

Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.Comment: In Proceedings Infinity 2012, arXiv:1302.310

The Process of Approaching the Taxation of the Exploitation of Personal Data

As pointed out, Harakat M. (2015), in seeking to elucidate the fiscal impact of such or such a measure on economic and social growth, through the evaluation of positive or negative distortions of the tax, it is necessary to take into account the social cost, the tax architecture of security and transparency, in order to satisfy the four maxims, put forward by Smith A. (1776): Proportionality, Stability, Equity, Efficiency. For this, the State has, at the time of the introduction or the re-examination of an instrument of state action, the possibility of examining its appropriateness to know if it has the expected effect, if it is the most effective and the least expensive to achieve the objective fixed by the law or if, on the contrary, other instruments better marketed, would be more appropriate, in reference to the famous duality Equity-Efficiency. This article follows up on our previous work of immersing ourselves in the literature dealing with instruments for taxing the negative externalities of the exploitation of Big Data by Data-Driven-Business-Models, and proposes narrative an overview of the theory of externalities by attempting to draw some lessons from environmental taxation, and then by presenting the various proposals for tax measures on Big Data, in order to prepare ourselves for a better approach to the framework for adopting a tax measure taxing the negative externalities of Big Data in Morocco, which is the subject of our doctoral thesis.   Keywords: Big-Data, Value, Externality, Taxation, Policy Strategies, Free Labour JEL Classification: F38, H20 Paper type: Theoretical ResearchAs pointed out, Harakat M. (2015), in seeking to elucidate the fiscal impact of such or such a measure on economic and social growth, through the evaluation of positive or negative distortions of the tax, it is necessary to take into account the social cost, the tax architecture of security and transparency, in order to satisfy the four maxims, put forward by Smith A. (1776): Proportionality, Stability, Equity, Efficiency. For this, the State has, at the time of the introduction or the re-examination of an instrument of state action, the possibility of examining its appropriateness to know if it has the expected effect, if it is the most effective and the least expensive to achieve the objective fixed by the law or if, on the contrary, other instruments better marketed, would be more appropriate, in reference to the famous duality Equity-Efficiency. This article follows up on our previous work of immersing ourselves in the literature dealing with instruments for taxing the negative externalities of the exploitation of Big Data by Data-Driven-Business-Models, and proposes narrative an overview of the theory of externalities by attempting to draw some lessons from environmental taxation, and then by presenting the various proposals for tax measures on Big Data, in order to prepare ourselves for a better approach to the framework for adopting a tax measure taxing the negative externalities of Big Data in Morocco, which is the subject of our doctoral thesis.   Keywords: Big-Data, Value, Externality, Taxation, Policy Strategies, Free Labour JEL Classification: F38, H20 Paper type: Theoretical Researc

Weak convergence of the Lazy Random Walk to the Brownian motion

En aquest article considerem una modificació del passeig aleatori simple, el Lazy Random Walk, i construïm una família de processos estocàstics a partir d’aquest procés que convergeix feblement cap a un moviment Brownia estàndard en una dimensió.In this paper we consider a modification of the simple random walk, the Lazy Random Walk, and construct a family of stochastic processes from the latter that converges weakly to a standard one-dimensional Brownian motion

On some properties of T0−ordered reflection

[EN] In [12], the authors give an explicit construction of the T0−ordered reflection of an ordered topological space (X, τ,≤) . All ordered topological spaces such that whose T0−ordered reflections are T1−ordered spaces are characterized. In this paper, some properties of the T0−ordered reflection of a given ordered topological space (X, τ,≤) are studies. The class of morphisms in ORDTOP orthogonal to all T0−ordered topological space is characterized.Lazaar, S.; Mhemdi, A. (2014). On some properties of T0−ordered reflection. Applied General Topology. 15(1):43-54. https://doi.org/10.4995/agt.2014.21444354151A. Ayache, O. Echi, The envelope of a subcategory in Topology and group theory, Int. J. Math. Math. Sci. 21 (2005), 3787-3404.Belaid, K., Echi, O., & Lazaar, S. (2004). T(α,β)-spaces and the Wallman compactification. International Journal of Mathematics and Mathematical Sciences, 2004(68), 3717-3735. doi:10.1155/s0161171204404050Casacuberta, C., Frei, A., & Tan, G. C. (1995). Extending localization functors. Journal of Pure and Applied Algebra, 103(2), 149-165. doi:10.1016/0022-4049(94)00099-5A. Deleanu, A. Frei, and P. Hilton, Generalized Adams completion, Cah. Topologie Géom. Différ. Catég.15 (1974), 61-82.R. El Bashir and J. Velebil, Simultaneously reflective and coreflective subcategories of presheaves, Theory Appl. Categ. 10 (2002), 410-423.Freyd, P. J., & Kelly, G. M. (1972). Categories of continuous functors, I. Journal of Pure and Applied Algebra, 2(3), 169-191. doi:10.1016/0022-4049(72)90001-1A. Grothendieck and J. Dieudonné, Eléments de géométrie algébrique, Springer-Verlag (1971).J. M. Harvey, Reflective subcategories, Ill. J. Math. 29 (1985), 365-369.Herrlich, H., & Strecker, G. (1997). Categorical Topology — Its Origins, as Exemplified by the Unfolding of the Theory of Topological Reflections and Coreflections before 1971. History of Topology, 255-341. doi:10.1007/978-94-017-0468-7_15Herrlich, H., & Strecker, G. E. (1968). H-closed spaces and reflective subcategories. Mathematische Annalen, 177(4), 302-309. doi:10.1007/bf01350722Künzi, H.-P. A., & Richmond, T. A. (2005). Ti-ordered reflections. Applied General Topology, 6(2), 207. doi:10.4995/agt.2005.1955H-P. A. Künzi, A. E. Mccluskey and T. A. Richmond, Ordered separation axioms and the Wallman ordered compactification, Publ. Math. Debrecen 73/3-4 (2008), 361-377.Lane, S. M. (1971). Categories for the Working Mathematician. Graduate Texts in Mathematics. doi:10.1007/978-1-4612-9839-7Tholen, W. (1987). Reflective subcategories. Topology and its Applications, 27(2), 201-212. doi:10.1016/0166-8641(87)90105-

Bifurcation Analysis for Prey-Predator Model with Holling Type III Functional Response Incorporating Prey Refuge

In this paper, we carried out the bifurcation analysis for a Lotka-Volterra prey-predator model with Holling type III functional response incorporating prey refuge protecting a constant proportion of the preys. We study the local bifurcation considering the refuge constant as a parameter. From the center manifold equation, we establish a transcritical bifurcation for the boundary equilibrium. In addition, we prove the occurrence of Hopf bifurcation for the homogeneous equilibrium. Moreover, we give the radius and period of the unique limit cycle for our syste

Effect of Feature Selection on Gene Expression Datasets Classification Accurac

Feature selection attracts researchers who deal with machine learning and data mining. It consists of selecting the variables that have the greatest impact on the dataset classification, and discarding the rest. This dimentionality reduction allows classifiers to be fast and more accurate. This paper traits the effect of feature selection on the accuracy of widely used classifiers in literature. These classifiers are compared with three real datasets which are pre-processed with feature selection methods. More than 9% amelioration in classification accuracy is observed, and k-means appears to be the most sensitive classifier to feature selection

Acquiring Qualitative Explainable Graphs for Automated Driving Scene Interpretation

The future of automated driving (AD) is rooted in the development of robust, fair and explainable artificial intelligence methods. Upon request, automated vehicles must be able to explain their decisions to the driver and the car passengers, to the pedestrians and other vulnerable road users and potentially to external auditors in case of accidents. However, nowadays, most explainable methods still rely on quantitative analysis of the AD scene representations captured by multiple sensors. This paper proposes a novel representation of AD scenes, called Qualitative eXplainable Graph (QXG), dedicated to qualitative spatiotemporal reasoning of long-term scenes. The construction of this graph exploits the recent Qualitative Constraint Acquisition paradigm. Our experimental results on NuScenes, an open real-world multi-modal dataset, show that the qualitative eXplainable graph of an AD scene composed of 40 frames can be computed in real-time and light in space storage which makes it a potentially interesting tool for improved and more trustworthy perception and control processes in AD

Preuve de validité du vérificateur de code octet Java

L'utilisation du langage Java dans plusieurs environnements (web, systèmes embarqués, systèmes mobiles, etc.) a élevé considérablement le niveau d'exigence envers ce langage, ce qui a amené les chercheurs et les développeurs à s'intéresser au système de sécurité de la Machine Virtuelle Java (MVJ) qui repose principalement sur le vérificateur du code octet. Dans ce mémoire, nous expliquons le fonctionnement du vérificateur Java, son rôle, les différentes techniques proposées pour son implémentation et un algorithme que nous proposons comme alternative sérieuse aux autres vérificateurs qui existent déjà. Nous nous intéresserons plus particulièrement à l'effet des sous-routines sur le bon typage des instructions. Nous présentons aussi une nouvelle approche de vérification de la synchronisation en nous basant sur l'analyse de flot de données et en identifiant les références qui pointent vers le même objet. ______________________________________________________________________________ MOTS-CLÉS DE L’AUTEUR : Machine Virtuelle Java, Code octet, Vérificateur, Synchronisation, Java, ClassLoader, Instructions, Treillis, Analyse de flot de données, Fonctions de transfert, Point fixe