Search results for "Graph theory"
showing 10 items of 784 documents
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
The Kuratowski convergence and connected components
2012
International audience; We investigate the Kuratowski convergence of the connected components of the sections of a definable set applying the result obtained to semialgebraic approximation of subanalytic sets. We are led to some considerations concerning the connectedness of the limit set in general. We discuss also the behaviour of the dimension of converging sections and prove some general facts about the Kuratowski convergence in tame geometry.
Representing 2D Digital Objects
2000
The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computati…
A greedy perturbation approach to accelerating consensus algorithms and reducing its power consumption
2011
The average consensus is part of a family of algorithms that are able to compute global statistics by only using local data. This capability makes these algorithms interesting for applications in which these distributed philosophy is necessary. However, its iterative nature usually leads to a large power consumption due to the repetitive communications among the iterations. This drawback highlights the necessity of minimizing the power consumption until consensus is reached. In this work, we propose a greedy approach to perturbing the connectivity graph, in order to improve the convergence time of the consensus algorithm while keeping bounded the power consumption per iteration step. These …
A General Mathematical Formulation for Winding Layout Arrangement of Electrical Machines
2018
Winding design methods have been a subject of research for many years of the past century. Many methods have been developed, each one characterized by some advantages and drawbacks. Nowadays, the star of slots is the most widespread design tool for electrical machine windings. In this context, this paper presents a simple and effective procedure to determine the distribution of the slot EMFs over the phases and of the winding configuration in all possible typologies of electrical machines equipped with symmetrical windings. The result of this procedure gives a Winding Distribution Table (WDT), which can be used to define coils and coil groups connections and also to simply implement winding…
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Development of Point-to-Point Path Control in Actuator Space for Hydraulic Knuckle Boom Crane
2020
This paper presents a novel method for point-to-point path control for a hydraulic knuckle boom crane. The developed path control algorithm differs from previous solutions by operating in the actuator space instead of the joint space or Cartesian space of the crane. By operating in actuator space, almost all the parameters and constraints of the system become either linear or constant, which greatly reduces the complexity of both the control algorithm and path generator. For a given starting point and endpoint, the motion for each actuator is minimized compared to other methods. This ensures that any change in direction of motion is avoided, thereby greatly minimizing fatigue, jerky motion,…
The project scheduling polyhedron: Dimension, facets and lifting theorems
1993
Abstract The Project scheduling with resource constraints can be formulated as follows: given a graph G with node set N, a set H of directed arcs corresponding to precedence relations, and a set H′ of disjunctive arcs reflecting the resource incompatibilities, find among the subsets of H′ satisfying the resource constraints the set S that minimizes the longest path in graph (N, H ∪ S). We define the project scheduling polyhedron Qs as the convex hull of the feasible solutions. We investigate several classes of inequalities with respect to their facet-defining properties for the associated polyhedron. The dimension of Qs is calculated and several inequalities are shown to define facets. For …
Elementary Integration of Superelliptic Integrals
2021
Consider a superelliptic integral $I=\int P/(Q S^{1/k}) dx$ with $\mathbb{K}=\mathbb{Q}(\xi)$, $\xi$ a primitive $k$th root of unity, $P,Q,S\in\mathbb{K}[x]$ and $S$ has simple roots and degree coprime with $k$. Note $d$ the maximum of the degree of $P,Q,S$, $h$ the logarithmic height of the coefficients and $g$ the genus of $y^k-S(x)$. We present an algorithm which solves the elementary integration problem of $I$ generically in $O((kd)^{\omega+2g+1} h^{g+1})$ operations.
Implementation of transition moments between excited states in the approximate coupled-cluster singles and doubles model
2008
An implementation of transition moments between excited states for the approximate coupled-cluster singles and doubles model (CC2) using the resolution of the identity (RI) approximation is reported. The accuracy of the RI approximation is analyzed for a testset of 7 molecules and 76 transitions. The RI error is found to be very small for both transition moments and oscillator strengths. Furthermore, the performance of the CC2 model in comparison with coupled-cluster singles and doubles (CCSD) is studied for 40 transitions of the same testset, yielding deviations of about 12% for the transition moments and 24% for the oscillator strengths. In addition, for 13 transitions of the testset the …