Search results for "A* algorithm"
showing 10 items of 2538 documents
Overlapping community detection versus ground-truth in AMAZON co-purchasing network
2015
International audience; Objective evaluation of community detection algorithms is a strategic issue. Indeed, we need to verify that the communities identified are actually the good ones. Moreover, it is necessary to compare results between two distinct algorithms to determine which is most effective. Classically, validations rely on clustering comparison measures or on quality metrics. Although, various traditional performance measures are used extensively. It appears very clearly that they cannot distinguish community structures with different topological properties. It is therefore necessary to propose an alternative methodology more sensitive to the community structure variations in orde…
Bords d'une surface médiane : Identifications et applications
2014
National audience; Un squelette d'une forme fermée est une structure mince, centrée dans cette forme, décrivant sa topologie et sa géométrie. Les squelettes permettent de développer des applications interactives en synthèse d'images~: l'utilisateur peut manipuler intuitivement des formes en modifiant leurs squelettes. Parmi toutes les formulations de squelettes, nous nous intéressons en particulier à la surface médiane. Ses éléments, nommés atomes, sont les sphères maximales intérieures à la forme décrite. Les positions des atomes sont organisées en courbes et surfaces, qui composent la structure squelettale. Cette structure peut être d'une grande aide pour manipuler une forme. Cependant, e…
WSN localization scheme based on Received Signal Strength Indicator (RSSI) for ZigBee Networks
2015
International audience; Wireless Sensor Networks (WSNs) have diverse application domains such as smart home, smart care, industrial, etc. We present a WSN system based on the ZigBee technology (IEEE 802.15.4) in Smart Home. In our paper we interest to ZigBee protocol is often used in medical Rehabilitation, which is a relatively new concept involving wireless transmission of data from the sensors attached to a patient to a distant monitoring station. There is no standardized topology managing the current networks, therefore, we will compare and evaluate the performance the mobility of nodes for star topologies in different scenarios to determine which is the most suitable in a typical hospi…
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…
Cluster matching in time resolved imaging for VLSI analysis
2014
International audience; If scaling has the benefit of enabling manufacturers to design tomorrow's integrated circuits, from the failure analyst point of view it also has the drawback of making devices more complex. The test sequence for modern VLSI can be quite long, with thousands of vector. Dynamic photon emission databases can contain millions of photons representing thousands of state changes in the region of interest. Finding a candidate location where to perform physical analysis is quite challenging, especially if the fault occurs on a single vector. In this paper, we suggest a new methodology to find single vector fault in dynamic photon emission database. The process is applied at …
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 …
Convergence and applications of vector rational approximations
1992
The Padé approximants and their generalizations are for many years the matter of intense researchs .Yet , many theoritical problems stay in suspense : problems of exitence and unicity , problems of convergence and acceleration of convergence .The purpose of the present work vas to give answers to such questions .In the first section we take an in terest in vector Padé approximants of matrix series .Conditions of existence and unicity ,results of convergence are given ,as also the link with the theory of Lanczos method for the resolution of linear Systems . We utilize also the vector Padé approximants to provide a simultaneous approximation of a function and its derivative .In the second sec…
Interior Eigenvalue Density of Jordan Matrices with Random Perturbations
2017
International audience; We study the eigenvalue distribution of a large Jordan block subject to a small random Gaussian perturbation. A result by E. B. Davies and M. Hager shows that as the dimension of the matrix gets large, with probability close to 1, most of the eigenvalues are close to a circle.We study the expected eigenvalue density of the perturbed Jordan block in the interior of that circle and give a precise asymptotic description.; Nous étudions la distribution de valeurs propres d’un grand bloc de Jordan soumis à une petite perturbation gaussienne aléatoire. Un résultat de E. B. Davies et M. Hager montre que quand la dimension de la matrice devient grande, alors avec probabilité…
Spectral approach to D-bar problems
2017
We present the first numerical approach to D-bar problems having spectral convergence for real analytic, rapidly decreasing potentials. The proposed method starts from a formulation of the problem in terms of an integral equation that is numerically solved with Fourier techniques. The singular integrand is regularized analytically. The resulting integral equation is approximated via a discrete system that is solved with Krylov methods. As an example, the D-bar problem for the Davey-Stewartson II equations is considered. The result is used to test direct numerical solutions of the PDE.© 2017 Wiley Periodicals, Inc.
Méthodes géometriques en mécanique spatiale et aspects numériques
2005
We present in this thesis two research projectson the optimal control of the space vehicles.In the first, we have dealt with the orbit transferproblem. We study the minimum time control of a satellite that we want to reach a geostationary orbit. Our contribution is of two kinds. Geometric, first, since we study the controllability of the system together with the geometry of the transfer (structure of the command) by means of geometric control without state constraint tools (minimum principle). Then we present shootingalgorithm and homotopy method. These approaches allow the numerical resolution of problems with strong or low thrust satellites.The second project concerns to the calculation o…