Search results for "A* algorithm"

Global Chronic Total Occlusion Crossing Algorithm: JACC State-of-the-Art Review

2021

© 2021 The Authors. Published by Elsevier on behalf of the American College of Cardiology Foundation. This is an open access article under the CC-BY-NC-ND license.

Set-valued consensus for distributed clock synchronization

2009

This paper addresses the clock synchronization problem in a wireless sensor network (WSN) and proposes a distributed solution that consists of a form of consensus, where agents are able to exchange data representing intervals or sets. The solution is based on a centralized algorithm for clock synchronization, proposed by Marzullo, that determines the smallest interval that is in common with the maximum number of measured intervals. We first show how to convert such an algorithm into a problem involving only operations on sets, and then we convert it into a set–valued consensus. The solution is valid for more general scenarios where agents have uncertain measures of e.g. the position of an o…

A finite size scaling study of the five-dimensional Ising model

1994

For systems above the marginal dimension d*, where mean field theory starts to become valid, such as Ising models in d = 5 for which d* = 4, hyperscaling is invalid and hence it was suggested that finite size scaling is not ruled by the correlation length ξ (∝ |t| −1/2 in Landau theory, t being the distance from the critical point) but by a “thermodynamic length” l (∝ |t| −2/d). Early simulation work by Binder et al. using nearest neighbor hypercubic L5 lattices with L ⩽ 7 yielded some evidence for this prediction, but the renormalized coupling constant gL = −3 + 〈M4〉/〈M2〉2 at Tc was gL ≈ −1.0 instead of the prediction of Brezin and Zinn-Justin, gL(Tc) = −3 + Γ4(1/4)/(8 π2) ≈ −0.812. In the…

Sparse model-based network inference using Gaussian graphical models

2010

We consider the problem of estimating a sparse dynamic Gaussian graphical model with L1 penalized maximum likelihood of structured precision matrix. The structure can consist of specific time dynamics, known presence or absence of links in the graphical model or equality constraints on the parameters. The model is defined on the basis of partial correlations, which results in a specific class precision matrices. A priori L1 penalized maximum likelihood estimation in this class is extremely difficult, because of the above mentioned constraints, the computational complexity of the L1 constraint on the side of the usual positive-definite constraint. The implementation is non-trivial, but we sh…

Improving Nearest Neighbor Based Multi-target Prediction Through Metric Learning

2017

The purpose of this work is to learn specific distance functions to be applied for multi-target regression problems using nearest neighbors. The idea of preserving the order relation between input and output vectors considering their corresponding distances is used along a maximal margin criterion to formulate a specific metric learning problem. Extensive experiments and the corresponding discussion try to put forward the advantages of the proposed algorithm that can be considered as a generalization of previously proposed approaches. Preliminary results suggest that this line of work can lead to very competitive algorithms with convenient properties.

MICRODISSECTION AND DOP-PCR-BASED REVERSE CHROMOSOME PAINTING AS A FAST AND RELIABLE STRATEGY IN THE ANALYSIS OF VARIOUS STRUCTURAL CHROMOSOME ABNORM…

1996

Reverse chromosome painting has become a powerful tool in clinical genetics for the characterization of cytogenetically unclassifiable aberrations. In this report, the application of a sensitive and rapid procedure for the complete and precise identification of four different de novo structural chromosome abnormalities is presented. These chromosome rearrangements include a marker derived from chromosome 3(cen-q11), an interstitial deletion of chromosome 13 [del(13)(q14q22)], an unbalanced translocation [46,XY, -4, +der(4)t(4;8)(p 15.2;p21.1)] leading to Wolf-Hirschhorn syndrome, and a partial inverted duplication in conjunction with a partial deletion of chromosome 5p [46,XX, -5, +der(5)(:…

Familial mediterranean fever gene (MEVF) mutations in Crohnʼs disease in a Mediterranean area

2008

Gray codes and efficient exhaustive generation for several classes of restricted words

2015

We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to three major classes of restricted words, that are: (1) restricted growth sequences, (2) factor avoiding q-ary words, and (3) pattern avoiding permutations. For the first two classes, our Gray codes (and thus, our generating algorithms) are based on order relations obtained by specializing known order relations; namely Reflected Gray Code (RGC) order and its variations, and we call them Reflected Gray Code based orders. The Gray code and the generating algorithm for the third class are based on Steinhaus-Johnson-Trotter order, that is, order relation induced by Steinhaus-Johnson-Trotter Gray code …

EXAFS study of the local structure of crystalline and nanocrystalline Y2O3using evolutionary algorithm method

2015

Temperature-dependent local structure and lattice dynamics of yttria (Y2O3) were studied by X-ray absorption spectroscopy. Novel method, which combines the reverse Monte Carlo and evolutionary algorithm techniques, was applied for the analysis of extended X-ray absorption fine structure at the Y K-edge. This approach allowed us to reconstruct 3D atomic structure models of crystalline and nanocrystalline Y2O3.

Selecting and Retaining Friends on the Basis of Cigarette Smoking Similarity

2013

This study examines whether friend selection, deselection, and socialization differ as a function of the level of cigarette smoking in the friendship group. A total of 1419 students (median age = 16) from upper secondary and vocational schools in Finland were included as targets in the peer network. Targets in the peer network were asked to nominate friends and describe their own cigarette smoking at two time points one year apart. Network analyses revealed similarity arising from selection and deselection on the basis of smoking. Selection effects (i.e., selecting new friends based on similarity) were stronger for adolescents in low-smoking groups. Deselection effects (i.e., dropping frien…