Search results for "102"
showing 10 items of 2892 documents
Qualifying semantic graphs using model checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has 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 research concerns t…
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
Kolmogorov Superposition Theorem and Wavelet Decomposition for Image Compression
2009
International audience; Kolmogorov Superposition Theorem stands that any multivariate function can be decomposed into two types of monovariate functions that are called inner and external functions: each inner function is associated to one dimension and linearly combined to construct a hash-function that associates every point of a multidimensional space to a value of the real interval $[0,1]$. These intermediate values are then associated by external functions to the corresponding value of the multidimensional function. Thanks to the decomposition into monovariate functions, our goal is to apply this decomposition to images and obtain image compression. We propose a new algorithm to decomp…
Preprocessing of region of interest localization based on local surface curvature analysis for three-dimensional reconstruction with multiresolution
2009
We present an approach to integrate a preprocessing step of the region of interest ROI localization into 3-D scanners laser or ste- reoscopic. The definite objective is to make the 3-D scanner intelligent enough to localize rapidly in the scene, during the preprocessing phase, the regions with high surface curvature, so that precise scanning will be done only in these regions instead of in the whole scene. In this way, the scanning time can be largely reduced, and the results contain only per- tinent data. To test its feasibility and efficiency, we simulated the prepro- cessing process under an active stereoscopic system composed of two cameras and a video projector. The ROI localization is…
Kolmogorov Superposition Theorem and Its Application to Multivariate Function Decompositions and Image Representation
2008
International audience; In this paper, we present the problem of multivariate function decompositions into sums and compositions of monovariate functions. We recall that such a decomposition exists in the Kolmogorov's superposition theorem, and we present two of the most recent constructive algorithms of these monovariate functions. We first present the algorithm proposed by Sprecher, then the algorithm proposed by Igelnik, and we present several results of decomposition for gray level images. Our goal is to adapt and apply the superposition theorem to image processing, i.e. to decompose an image into simpler functions using Kolmogorov superpositions. We synthetise our observations, before …
Darboux systems with a cusp point and pseudo-abelian integrals
2018
International audience; We study pseudo-abelian integrals associated with polynomial deformations of Darboux systems having a cuspidal singularity. Under some genericity hypothesis we provide locally uniform boundedness of on the number of their zeros.
Sobolev and bounded variation functions on metric measure spaces
2014
International audience
Computational approach to compact Riemann surfaces
2017
International audience; A purely numerical approach to compact Riemann surfaces starting from plane algebraic curves is presented. The critical points of the algebraic curve are computed via a two-dimensional Newton iteration. The starting values for this iteration are obtained from the resultants with respect to both coordinates of the algebraic curve and a suitable pairing of their zeros. A set of generators of the fundamental group for the complement of these critical points in the complex plane is constructed from circles around these points and connecting lines obtained from a minimal spanning tree. The monodromies are computed by solving the defining equation of the algebraic curve on…
Darboux curves on surfaces I
2017
International audience; In 1872, G. Darboux defined a family of curves on surfaces of $\mathbb{R}^3$ which are preserved by the action of the Mobius group and share many properties with geodesics. Here, we characterize these curves under the view point of Lorentz geometry and prove that they are geodesics in a 3-dimensional sub-variety of a quadric $\Lambda^4$ contained in the 5-dimensional Lorentz space $\mathbb{R}^5_1$ naturally associated to the surface. We construct a new conformal object: the Darboux plane-field $\mathcal{D}$ and give a condition depending on the conformal principal curvatures of the surface which guarantees its integrability. We show that $\mathcal{D}$ is integrable w…
The pure descent statistic on permutations
2017
International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.