Search results for "A* algorithm"
showing 10 items of 2538 documents
EXAFS study of hydrogen intercalation into ReO 3 using the evolutionary algorithm.
2014
In this study we have investigated the influence of hydrogen intercalation on the local atomic structure of rhenium trioxide using a new approach to EXAFS data analysis, based on the evolutionary algorithm (EA). The proposed EA-EXAFS method is an extension of the conventional reverse Monte Carlo approach but is computationally more efficient. It allows one to perform accurate analysis of EXAFS data from distant coordination shells, taking into account both multiple-scattering and disorder (thermal and static) effects. The power of the EA-EXAFS method is first demonstrated on an example of the model system, pure ReO3, and then it is applied to an in situ study of hydrogen bronze HxReO3 upon …
Layout algorithms of graph-like diagrams for GRADE windows graphic editors
1996
We propose a set of layout operations ensuring flexible and convenient interactive editing of communication diagrams and nested entity-relationship models having textual labels on connections. The set includes several procedures for incremental diagram layout. Tools for fully automatic layout and for direct manual painting of graphic primitives are also integrated in a single system. In this way we have filled to some extent the gap between both extremal levels of editing.
Leader election and local identifiers for three‐dimensional programmable matter
2020
International audience; In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all pos…
Evolution and Learning: Evolving Sensors in a Simple MDP Environment
2003
Natural intelligence and autonomous agents face difficulties when acting in information-dense environments. Assailed by a multitude of stimuli they have to make sense of the inflow of information, filtering and processing what is necessary, but discarding that which is unimportant. This paper aims at investigating the interactions between evolution of the sensorial channel extracting the information from the environment and the simultaneous individual adaptation of agent-control. Our particular goal is to study the influence of learning on the evolution of sensors, with learning duration being the tunable parameter. A genetic algorithm governs the evolution of sensors appropriate for the a…
Maximum Likelihood Estimation and non-linear least squares fitting with Levenberg-Marquardt Algorithm implementation in FPGA devices for high resolut…
2012
This work compares two possible solutions to achieve a higher resolution in a hodoscope based on Plastic Scintillating Fibers (PSF) by obtaining the point of maximum incidence of the radioactive beam. The two fitting algorithms proposed have been tested and implemented in Field Programmable Gate Array (FPGA) devices. On one hand, a probabilistic model based on the Maximum Likelihood Estimation (MLE) and on the other hand, non-linear least-squares fit with the Levenberg-Marquardt Algorithm (LMA).
Learning vector quantization with alternative distance criteria
2003
An adaptive algorithm for training of a nearest neighbour (NN) classifier is developed in this paper. This learning rule has some similarity to the well-known LVQ method, but uses the nearest centroid neighbourhood concept to estimate optimal locations of the codebook vectors. The aim of this approach is to improve the performance of the standard LVQ algorithms when using a very small codebook. The behaviour of the learning technique proposed here is experimentally compared to those of the plain k-NN decision rule and the LVQ algorithms.
Trunk Packing Revisited
2007
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.
Visualization of Jacques Lacan’s Registers of the Psychoanalytic Field, and Discovery of Metaphor and of Metonymy. Analytical Case Study of Edgar All…
2017
International audience; We start with a description of Lacan’s work that we then take into our analytics methodology. In a first investigation, a Lacan-motivated template of the Poe story is fitted to the data. A segmentation of the storyline is used in order to map out the diachrony. Based on this, it will be shown how synchronous aspects, potentially related to Lacanian registers, can be sought. This demonstrates the effectiveness of an approach based on a model template of the storyline narrative. In a second and more comprehensive investigation, we develop an approach for revealing, that is, uncovering, Lacanian register relationships. Objectives of this work include the wide and genera…
Evidence against linkage of schizophrenia to chromosome 5q11-q13 markers in systematically ascertained families.
1992
Ten pedigrees systematically ascertained in Germany were tested for linkage to chromosome 5q11-q13. In order to replicate the previous report by Sherrington et al (1988), families with a bipolar family member were omitted from the lod score calculations, all diagnoses were based upon Research Diagnostic Criteria, and four different models of the affection status were calculated, including the model for which Sherrington et al calculated the highest lod scores. None of the families investigated showed a positive lod score. Using multipoint linkage analyses, we were able to exclude the region for which a positive linkage has been reported.
Deterministic Linkage as a Preceding Filter for Other Record Linkage Methods
2015
Deterministic record linkage (RL) is frequently regarded as a rival to more sophisticated strategies like probabilistic RL. We investigate the effect of combining deterministic linkage with other linkage techniques. For this task, we use a simple deterministic linkage strategy as a preceding filter: a data pair is classified as ‘match' if all values of attributes considered agree exactly, otherwise as ‘nonmatch'. This strategy is separately combined with two probabilistic RL methods based on the Fellegi–Sunter model and with two classification tree methods (CART and Bagging). An empirical comparison was conducted on two real data sets. We used four different partitions into training data a…