Search results for " graph"
showing 10 items of 1277 documents
3D part inspection path planning of a laser scanner with control on the uncertainty
2011
International audience; This article concerns the measurement process of mechanical parts using laser scanners. From the point of view of industrial applications, the objective is to guarantee the measurement accuracy during the scanning with regard to the geometrical product specifications. The proposed method can be summarized as follow: the first step consists of analyzing the interval of tolerance for the different specifications and to attribute to every geometrical entity a maximal uncertainty of measurement. This uncertainty depends on the angle of incidence between the laser plane and the scanned surface. In the second step, an approach based on the concept of visibility is used fro…
LDR Image to HDR Image Mapping with Overexposure Preprocessing
2013
International audience; Due to the growing popularity of High Dynamic Range (HDR) images and HDR displays, a large amount of existing Low Dynamic Range (LDR) images are required to be converted to HDR format to benefit HDR advantages, which give rise to some LDR to HDR algorithms. Most of these algorithms especially tackle overexposed areas during expanding, which is the potential to make the image quality worse than that before processing and introduces artifacts. To dispel these problems, we . present a new,LDR to HDR approach, unlike the existing techniques, it focuses on avoiding sophisticated treatment to overexposed areas in dynamic range expansion step. Based on a separating principl…
Design of a Real-time face detection parallel architecture using High-Level Synthesis
2008
Abstract We describe a High-Level Synthesis implementation of a parallel architecture for face detection. The chosen face detection method is the well-known Convolutional Face Finder (CFF) algorithm, which consists of a pipeline of convolution operations. We rely on dataflow modelling of the algorithm and we use a high-level synthesis tool in order to specify the local dataflows of our Processing Element (PE), by describing in C language inter-PE communication, fine scheduling of the successive convolutions, and memory distribution and bandwidth. Using this approach, we explore several implementation alternatives in order to find a compromise between processing speed and area of the PE. We …
Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
2014
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation…
Modélisation géométrique de formes fractales pour la CAO
2020
International audience
Presentations of constrained systems with unconstrained positions
2005
International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…
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…
Generation of aperiodic picosecond pulses sequences from incoherent optical waves
2007
We present an original method to generate optical pulses trains with random time-interval values from incoherent broadband sources. Our technique relies on the remarkable properties of a line made of cascaded SPM-based optical regenerators.
Inside Back Cover: First Step Towards a Devil's Staircase in Spin-Crossover Materials (Angew. Chem. Int. Ed. 30/2016)
2016
International audience; Periodic and aperiodic spin-state concentration waves form during “Devil's staircase”-type spin-crossover in a new bimetallic 2D coordination polymer {Fe[(Hg(SCN)3)2](4,4′-bipy)2}n. In their Communication on page 8675 ff., J. A. Real, E. Collet et al. describe the appearance of spin-state concentration waves between long-range spatially ordered structures of low- and high-spin states during multistep spin-crossover.
Quand et comment utiliser les graphes génétiques pour analyser la connectivité écologique dans des paysages hétérogènes ?
2019
National audience; Lorsque les espèces occupent des taches d’habitat au sein de paysages hétérogènes, la connectivité écologique est influencée par la topologie du réseau de populations qu’elles forment. Dans ce contexte, les méthodes basées sur les graphes génétiques permettent i) de révéler cette topologie en identifiant les chemins de dispersion directs et ii) de quantifier la résistance des éléments paysagers à la dispersion. Compte-tenu de l’intérêt croissant pour ces méthodes en génétique du paysage, il est nécessaire de mieux comprendre quand et comment il faut utiliser les graphes génétiques. Pour cela, nous avons simulé le flux génétique entre 50 populations dans différents paysage…