Search results for "Graph theory"
showing 10 items of 784 documents
Variances as order parameter and complexity measure for random Boolean networks
2005
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
The F-pure threshold of quasi-homogeneous polynomials
2018
Abstract Inspired by the work of Bhatt and Singh [3] we compute the F-pure threshold of quasi-homogeneous polynomials. We first consider the case of a curve given by a quasi-homogeneous polynomial f in three variables x , y , z of degree equal to the degree of xyz and then we proceed with the general case of a Calabi–Yau hypersurface, i.e. a hypersurface given by a quasi-homogeneous polynomial f in n + 1 variables x 0 , … , x n of degree equal to the degree of x 0 ⋯ x n .
Detection and matching of curvilinear structures
2011
We propose an approach to curvilinear and wiry object detection and matching based on a new curvilinear region detector (CRD) and a shape context-like descriptor (COH). Standard methods for local patch detection and description are not directly applicable to wiry objects and curvilinear structures, such as roads, railroads and rivers in satellite and aerial images, vessels and veins in medical images, cables, poles and fences in urban scenes, stems and tree branches in natural images, since they assume the object is compact, i.e. that most elliptical patches around features cover only the object. However, wiry objects often have no flat parts and most neighborhoods include both foreground a…
Spatial correction in dynamic photon emission by affine transformation matrix estimation
2014
International audience; Photon emission microscopy and Time Resolved Imaging have proved their efficiency for defect localization on VLSI. A common process to find defect candidate locations is to draw a comparison between acquisitions on a normally working device and a faulty one. In order to be accurate and meaningful, this method requires that the acquisition scene remains the same between the two parts. In practice, it can be difficult to set. In this paper, a method to correct position by affine matrix transformation is suggested. It is based on image features detection, description and matching and affine transformation estimation.
An optimized algorithm of image stitching in the case of a multi-modal probe for monitoring the evolution of scars
2013
International audience; We propose a new system that makes possible to monitor the evolution of scars after the excision of a tumorous dermatosis. The hardware part of this system is composed of a new optical innovative probe with which two types of images can be acquired simultaneously: an anatomic image acquired under a white light and a functional one based on autofluorescence from the protoporphyrin within the cancer cells. For technical reasons related to the maximum size of the area covered by the probe, acquired images are too small to cover the whole scar. That is why a sequence of overlapping images is taken in order to cover the required area. The main goal of this paper is to des…
A new minimum trees-based approach for shape matching with improved time computing : application to graphical symbols recognition
2010
Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longe…
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 …
Integrability and Non Integrability of Some n Body Problems
2016
International audience; We prove the non integrability of the colinear 3 and 4 body problem, for any positive masses. To deal with resistant cases, we present strong integrability criterions for 3 dimensional homogeneous potentials of degree −1, and prove that such cases cannot appear in the 4 body problem. Following the same strategy, we present a simple proof of non integrability for the planar n body problem. Eventually, we present some integrable cases of the n body problem restricted to some invariant vector spaces.
3-manifolds which are orbit spaces of diffeomorphisms
2008
Abstract In a very general setting, we show that a 3-manifold obtained as the orbit space of the basin of a topological attractor is either S 2 × S 1 or irreducible. We then study in more detail the topology of a class of 3-manifolds which are also orbit spaces and arise as invariants of gradient-like diffeomorphisms (in dimension 3). Up to a finite number of exceptions, which we explicitly describe, all these manifolds are Haken and, by changing the diffeomorphism by a finite power, all the Seifert components of the Jaco–Shalen–Johannson decomposition of these manifolds are made into product circle bundles.
On local optima in minimum time control of the restricted three-body problem
2016
International audience; The structure of local minima for time minimization in the controlled three-body problem is studied. Several homotopies are systematically used to unfold the structure of these local minimizers, and the resulting singularity of the path associated with the value function is analyzed numerically.