Search results for "A* algorithm"
showing 10 items of 2538 documents
Motif patterns in 2D
2008
AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …
On the exhaustive generation of k-convex polyominoes
2017
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
2006
A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are interested in a minimum multicoloring that uses the least total number of colors. The main focus of this work is to obtain upper bounds on the weighted chromatic number of some classes of graphs in terms of the weighted clique number. We first propose an 11/6-approximation algorithm for multicoloring any weighted planar graph. We then study the multicoloring problem on powers of square and triangular meshes. Among other results, we show that the infi…
An efficient method for fully automatic 3D digitization of unknown objects
2013
Our goal is to develop a complete and automatic scanning strategy with minimum prior information about the object shape. We aim to establish a methodology for the automation of the 3D digitization process. The paper presents a novel approach to determine the Next Best View (NBV) for an efficient reconstruction of highly accurate 3D models. Our method is based on the classification of the acquired surfaces into Well Visible and Barely Visible combined with a best view selection algorithm based on mean shift, which avoids unreachable positions. Our approach is applicable to all kinds of range sensors. To prove the efficiency and the robustness of our method, test objects are first scanned man…
Fundamental isomorphism theorems for quantum groups
2017
The lattice of subgroups of a group is the subject of numerous results revolving around the central theme of decomposing the group into "chunks" (subquotients) that can then be compared to one another in various ways. Examples of results in this class would be the Noether isomorphism theorems, Zassenhaus' butterfly lemma, the Schreier refinement theorem for subnormal series of subgroups, the Dedekind modularity law, and last but not least the Jordan-H\"older theorem. We discuss analogues of the above-mentioned results in the context of locally compact quantum groups and linearly reductive quantum groups. The nature of the two cases is different: the former is operator algebraic and the latt…
Minimal forbidden patterns of multi-dimensional shifts
2005
We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.
Large-scale calculations of excitation energies in coupled cluster theory: The singlet excited states of benzene
1996
Algorithms for calculating singlet excitation energies in the coupled cluster singles and doubles (CCSD) model are discussed and an implementation of an atomic-integral direct algorithm is presented. Each excitation energy is calculated at a cost comparable to that of the CCSD ground-state energy. Singlet excitation energies are calculated for benzene using up to 432 basis functions. Basis-set effects of the order of 0.2 eV are observed when the basis is increased from augmented polarized valence double-zeta (aug-cc-pVDZ) to augmented polarized valence triple-zeta (aug-cc-pVTZ) quality. The correlation problem is examined by performing calculations in the hierarchy of coupled cluster models…
Approximation of exit times for one-dimensional linear diffusion processes
2020
International audience; In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and the Ornstein-Uhlenbeck context, that is for particular time-homogeneous diffusion processes. Here the aim is therefore to generalize this efficient numerical approach in order to obtain an approximation of both the exit time and position for a general linear diffusion. The main challenge of such a generalization is to handle with time-inhomogeneous diffusions. The efficiency of the method is described with particular care through theoretical results and numerical example…
Efficiency Control for Permanent Magnet Synchronous Generators
2006
In this paper a control algorithm for the efficiency improvement of permanent magnet synchronous generators (PMSG) is presented. The proposed algorithm reduces the losses of the generator without affecting its performances. In details, after a description of a dynamic model of the PMSG, which has been purposely modified in order to take into account the iron losses, the basic equations and the constraints to obtain the loss minimization are presented and discussed. Some simulations of a specific PMSG employing the proposed algorithm are performed. The results of these simulations show that enhancement of the efficiency up to 3 % can be reached in comparison to a PMSG using a traditional con…
An Innovative Structural Dynamic Identification Procedure Combining Time Domain OMA Technique and GA
2022
In this paper an innovative and simple Operational Modal Analysis (OMA) method for structural dynamic identification is proposed. It combines the recently introduced Time Domain–Analytical Signal Method (TD–ASM) with the Genetic Algorithm (GA). Specifically, TD–ASM is firstly employed to estimate a subspace of candidate modal parameters, and then the GA is used to identify the structural parameters minimizing the fitness value returned by an appropriately introduced objective function. Notably, this method can be used to estimate structural parameters even for high damping ratios, and it also allows one to identify the Power Spectral Density (PSD) of the structural excitat…