Search results for "A* algorithm"
showing 10 items of 2538 documents
On the Locality of Standard Search Operators in Grammatical Evolution
2014
Offspring should be similar to their parents and inherit their relevant properties. This general design principle of search operators in evolutionary algorithms is either known as locality or geometry of search operators, respectively. It takes a geometric perspective on search operators and suggests that the distance between an offspring and its parents should be less than or equal to the distance between both parents. This paper examines the locality of standard search operators used in grammatical evolution (GE) and genetic programming (GP) for binary tree problems. Both standard GE and GP search operators suffer from low locality since a substantial number of search steps result in an o…
The Myriad Virtues of Wavelet Trees
2009
Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA '03] and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compressors. Although several papers have investigated the beauty and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a complete theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. We also show how to improve their asymptotic performance by introducing a novel framework, called Generalized Wavelet Trees, that aims for the best combination of binary compressors (like,…
Concentration and energy fluctuations in a critical polymer mixture
1995
A semi-grand-canonical Monte Carlo algorithm is employed in conjunction with the bond fluctuation model to investigate the critical properties of an asymmetric binary (AB) polymer mixture. By applying the equal peak-weight criterion to the concentration distribution, the coexistence curve separating the A-rich and B-rich phases is identified as a function of temperature and chemical potential. To locate the critical point of the model, the cumulant intersection method is used. The accuracy of this approach for determining the critical parameters of fluids is assessed. Attention is then focused on the joint distribution function of the critical concentration and energy, which is analysed usi…
Bio-inspired security analysis for IoT scenarios
2020
Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however, the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graph analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…
Bivariate nonlinear prediction to quantify the strength of complex dynamical interactions in short-term cardiovascular variability.
2005
A nonlinear prediction method for investigating the dynamic interdependence between short length time series is presented. The method is a generalization to bivariate prediction of the univariate approach based on nearest neighbor local linear approximation. Given the input and output series x and y, the relationship between a pattern of samples of x and a synchronous sample of y was approximated with a linear polynomial whose coefficients were estimated from an equation system including the nearest neighbor patterns in x and the corresponding samples in y. To avoid overfitting and waste of data, the training and testing stages of the prediction were designed through a specific out-of-sampl…
Deconvolution by Regularized Matching Pursuit
2014
In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …
Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems
2012
SUMMARY The block Wiedemann (BW) algorithm is frequently used to solve sparse linear systems over GF(2). Iterative sparse matrix–vector multiplication is the most time-consuming operation. The necessity to accelerate this step is motivated by the application of BW to very large matrices used in the linear algebra step of the number field sieve (NFS) for integer factorization. In this paper, we derive an efficient CUDA implementation of this operation by using a newly designed hybrid sparse matrix format. This leads to speedups between 4 and 8 on a single graphics processing unit (GPU) for a number of tested NFS matrices compared with an optimized multicore implementation. We further present…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
The influence of different generations of computer algorithms on diabetes control
1990
With all control schedules, the management of diabetes is possible using Skyler's algorithm. In general, those control algorithms which do not allow the individual adaptation to changing conditions lead to overinsulinisation. So-called meal-related algorithms do usually minimise the fluctuations in blood sugar. The introduction of self-adapting algorithms, detecting peripheral insulin resistance, may further improve metabolic diabetes control.
A Multiple Local Models Approach to Accuracy Improvement in Continuous Glucose Monitoring
2011
Continuous glucose monitoring (CGM) devices estimate plasma glucose (PG) from measurements in compartments alternative to blood. The accuracy of currently available CGM is yet unsatisfactory and may depend on the implemented calibration algorithms, which do not compensate adequately for the differences of glucose dynamics between the compartments. Here we propose and validate an innovative calibration algorithm for the improvement of CGM performance.CGM data from GlucoDay(®) (A. Menarini, Florence, Italy) and paired reference PG have been obtained from eight subjects without diabetes during eu-, hypo-, and hyperglycemic hyperinsulinemic clamps. A calibration algorithm based on a dynamic glo…