Search results for "A* algorithm"
showing 10 items of 2538 documents
A chirp-z transform-based synchronizer for power system measurements
2005
In the last few years, increased interest in power and voltage quality has forced international working groups to standardize testing and measurement techniques. IEC 61000-4-30, which defines the characteristics of instrumentation for the measurement of power quality, refers to IEC 61000-4-7 for the evaluation of harmonics and interharmonics. This standard, revised in 2002, requires a synchronous sampling of voltage or current signal, in order to limit errors and to ensure reproducible results even in the presence of nonstationary signals. Therefore, an accurate estimation of the fundamental frequency is required, even in the presence of disturbances. In this paper, an algorithm to detect t…
High Precision Conservative Surface Mesh Generation for Swept Volumes
2015
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
The integral‐direct coupled cluster singles and doubles model
1996
An efficient and highly vectorized implementation of the coupled cluster singles and doubles (CCSD) model using a direct atomic integral technique is presented. The minimal number of n6processes has been implemented for the most time consuming terms and point group symmetry is used to further reduce operation counts and memory requirements. The significantly increased application range of the CCSD method is illustrated with sample calculations on several systems with more than 500 basis functions. Furthermore, we present the basic trends of an open ended algorithm and discuss the use of integral prescreening. © 1996 American Institute of Physics.
Two Parallel Algorithms for the Analysis of Random Images
1988
Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.
Imperialist competitive algorithm for determining the parameters of a Sugeno fuzzy controller
2020
Abstract We used an imperialist competitive algorithm to determine the parameters of a fuzzy controller of type Sugeno that would ensure a good unit step response of a second-order single-input and single-output automatic system.
Tuning a Mamdani Fuzzy Controller with an Imperialist Competitive Algorithm
2021
We have implemented a fuzzy controller with a view to regulating a single-input and single-output second-order linear system. The fuzzy controller was a Mamdami proportional-derivative controller. To determine the parameters of the fuzzy controller we have used an imperialist competitive algorithm. This type of algorithm has a long running time so we implemented also a parallel version of the algorithm that we run on HPC Zamolxes located at the Engineering Faculty of “Lucian Blaga” University from Sibiu. Because we did not have on this computer a version of MATLAB allowing to write parallel algorithms, we implemented the entire application in the C language using the MPI library.
Efficient and Accurate OTU Clustering with GPU-Based Sequence Alignment and Dynamic Dendrogram Cutting.
2015
De novo clustering is a popular technique to perform taxonomic profiling of a microbial community by grouping 16S rRNA amplicon reads into operational taxonomic units (OTUs). In this work, we introduce a new dendrogram-based OTU clustering pipeline called CRiSPy. The key idea used in CRiSPy to improve clustering accuracy is the application of an anomaly detection technique to obtain a dynamic distance cutoff instead of using the de facto value of 97 percent sequence similarity as in most existing OTU clustering pipelines. This technique works by detecting an abrupt change in the merging heights of a dendrogram. To produce the output dendrograms, CRiSPy employs the OTU hierarchical clusterin…
Tuning of Extended Kalman Filters for Sensorless Motion Control with Induction Motor
2019
This work deals with the tuning of an Extended Kalman Filter for sensorless control of induction motors for electrical traction in automotive. Assuming that the parameters of the induction motor-load model are known, Genetic Algorithms are used for obtaining the system noise covariance matrix, considering the measurement noise covariance matrix equal to the identity matrix. It is shown that only stator currents have to be acquired for reaching this objective, which is easy to accomplish using Hall-effect transducers. In fact, the Genetic Algorithm minimizes, with respect to the system covariance matrix, a suitable measure of the displacement between the stator currents experimentally acquir…
Editing prototypes in the finite sample size case using alternative neighborhoods
1998
The recently introduced concept of Nearest Centroid Neighborhood is applied to discard outliers and prototypes 111 class overlapping regions in order to improve the performance of the Nearest Neighbor rule through an editing procedure, This approach is related to graph based editing algorithms which also define alternative neighborhoods in terms of geornetric relations, Classical editing algorithms are compared to these alternative editing schemes using several synthetic and real data problems. The empirical results show that, the proposed editing algorithm constitutes a good trade-off among performance and computational burden.
Design optimization of mooring system: An application to a vessel-shaped offshore fish farm
2019
Abstract Design optimization of mooring systems of offshore floating structures is a challenging task, partly because of the large number of design variables, complicated design constraints, nonlinear system behavior, and time-consuming numerical simulations. For engineering designs, efficient yet accurate approaches are needed. This paper proposes an integrated optimization methodology for design of mooring systems. The methodology integrates the design of experiments, screening analysis, time-domain simulations, and a metamodel-based optimization procedure. To demonstrate the methodology, the mooring system of a vessel-shaped offshore fish farm was designed considering the ultimate limit …