Search results for "programming."
showing 10 items of 3035 documents
Bridging Sensing and Decision Making in Ambient Intelligence Environments
2009
Context-aware and Ambient Intelligence environments represent one of the emerging issues in the last decade. In such intelligent environments, information is gathered to provide, on one hand, autonomic and easy to manage applications, and, on the other, secured access controlled environments. Several approaches have been defined in the literature to describe context-aware application with techniques to capture and represent information related to a specified domain. However and to the best of our knowledge, none has questioned the reliability of the techniques used to extract meaningful knowledge needed for decision making especially if the information captured is of multimedia types (image…
Reconnaissance de la Forme 3D et Estimation de la Profondeur Implémentation sur FPGA Spartan 3A d'un SoC pour la Vision 3D (Shape From Focus) Problém…
2007
Le terme de « vision 3D » ou « de numérisation 3D », est apparu à la fin des années 1990, pour désigner des techniques d'acquisition de mesures tridimensionnelle sur des surfaces, techniques ayant la caractéristique de donner des nuages de points denses et importants dont l'ordre de grandeur est de quelques dizaines à plusieurs millions de points. Le nuage de points représente en fait l'information de l'image de profondeur et selon des différents traitements à l'image on peut aboutir à un ordre de précision de la reconstitution de l'objet ou scène en 3D. La vision 3D demeure une méthodologie de base pour réassurer le mécanisme de reconstitution des images tridimensionnelles. Outre les besoi…
XA2C Framework for XML Alteration/Adaptation
2010
XML has crossed the borders of software engineering and has spread to other areas such as e-commerce, identification, information storage, instant messaging and others. It is used to communicate crucial data over these domains. Thus, allowing non-expert programmers to manipulate and control their XML data is essential. In the literature, this issue has been dealt with from 3 perspectives: (i) XML alteration/adaptation techniques requiring a certain level of expertise to be implemented and are not unified yet, (ii) mashups, which are not formally defined yet and are not specific to XML data, and (iii) XML-oriented visual languages based on structural transformations and data extraction mainl…
Towards an XML Adaptation/Alteration Control Framework
2010
International audience
COBieOWL, an OWL ontology based on COBie standard
2015
International audience; Building Information Modelling (BIM) standards have been recognized by construction and political actors as a highly promising tool for resolving issues of data dematerialization, notably in the field of Architecture, Engineering, Construction and Facility Management. Among worldwide-adopted BIM standards, there is COBie. COBie’s goals are to dematerialize building data and to enhance building information interoperability. Nevertheless, COBie data is available in static formats such as STEP or spreadsheet templates. Such formats lack logical formalisms and semantic features provided by languages such as OWL. Because of this, in this paper, we propose a method for sem…
Temporal Logic To Query Semantic Graphs Using The Model Checking Method
2012
International audience; Semantic interoperability problems have found their solutions due to the use of languages and techniques from the Semantic Web. The proliferations of ontologies and meta-information have improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling, and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of rese…
A Symplectic Kovacic's Algorithm in Dimension 4
2018
Let $L$ be a $4$th order differential operator with coefficients in $\mathbb{K}(z)$, with $\mathbb{K}$ a computable algebraically closed field. The operator $L$ is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions $X$ satisfies $X^t J X=J$ where $J$ is the standard symplectic matrix. It is called projectively symplectic when it is projectively equivalent to a symplectic operator. We design an algorithm to test if $L$ is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order $4$. Moreover, using Klein's Theorem, algebraic solution…
LOFT: the Large Observatory For X-ray Timing
2012
The LOFT mission concept is one of four candidates selected by ESA for the M3 launch opportunity as Medium Size missions of the Cosmic Vision programme. The launch window is currently planned for between 2022 and 2024. LOFT is designed to exploit the diagnostics of rapid X-ray flux and spectral variability that directly probe the motion of matter down to distances very close to black holes and neutron stars, as well as the physical state of ultra-dense matter. These primary science goals will be addressed by a payload composed of a Large Area Detector (LAD) and a Wide Field Monitor (WFM). The LAD is a collimated (<1 degree field of view) experiment operating in the energy range 2-50 keV,…
Weeds sampling for map reconstruction: a Markov random field approach
2012
In the past 15 years, there has been a growing interest for the study of the spatial repartition of weeds in crops, mainly because this is a prerequisite to herbicides use reduction. There has been a large variety of statistical methods developped for this problem ([5], [7], [10]). However, one common point of all of these methods is that they are based on in situ collection of data about weeds spatial repartition. A crucial problem is then to choose where, in the eld, data should be collected. Since exhaustive sampling of a eld is too costly, a lot of attention has been paid to the development of spatial sampling methods ([12], [4], [6] [9]). Classical spatial stochastic model of weeds cou…
Échantillonnage adaptatif optimal dans les champs de Markov, application à l’échantillonnage d’une espèce adventice
2012
This work is divided into two parts: (i) the theoretical study of the problem of adaptive sampling in Markov Random Fields (MRF) and (ii) the modeling of the problem of weed sampling in a crop field and the design of adaptive sampling strategies for this problem. For the first point, we first modeled the problem of finding an optimal sampling strategy as a finite horizon Markov Decision Process (MDP). Then, we proposed a generic algorithm for computing an approximate solution to any finite horizon MDP with known model. This algorithm, called Least-Squared Dynamic Programming (LSDP), combines the concepts of dynamic programming and reinforcement learning. It was then adapted to compute adapt…