Search results for "Genetic algorithm"
showing 10 items of 834 documents
Metal speciation in solid matrices
1994
The literature on metal ion speciation in solid matrices is reviewed, taking into account its applications in the analysis of soil, sediment, biological materials, foodstuff and other solid samples. The pretreatment methods of various solid materials required for carrying out speciation studies have been highlighted. The basis of the methods of separation of different species from matrices, such as sequential extraction, selective extraction, etc. is discussed. The instrumental techniques used for the characterization of different chemical species in solid matrices have been mentioned. The literature survey reveals the analytical details of the developed methodologies, and these have been e…
The Effective Sample Size
2013
Model selection procedures often depend explicitly on the sample size n of the experiment. One example is the Bayesian information criterion (BIC) criterion and another is the use of Zellner–Siow priors in Bayesian model selection. Sample size is well-defined if one has i.i.d real observations, but is not well-defined for vector observations or in non-i.i.d. settings; extensions of critera such as BIC to such settings thus requires a definition of effective sample size that applies also in such cases. A definition of effective sample size that applies to fairly general linear models is proposed and illustrated in a variety of situations. The definition is also used to propose a suitable ‘sc…
32×32 winner-take-all matrix with single winner selection
2010
A 32 × 32 winner-take-all (WTA) matrix with single winner selection is introduced. A high-resolution gain-boosted regulated-cascode WTA circuit is used in a first competition stage. Because of the large number of competing cells the possibility of a multiple winners situation arises. A single winner is obtained by means of a digital inhibitory circuit following each WTA analogue amplifier. Simulations show that this mixed analogue-digital circuit achieves its objective with a current resolution of approximately 10 nA (0.8% of the maximum input current in the simulated case). A time response of ?s can be achieved.
An Heuristic Approach for the Training Dataset Selection in Fingerprint Classification Tasks
2015
Fingerprint classification is a key issue in automatic fingerprint identification systems. It aims to reduce the item search time within the fingerprint database without affecting the accuracy rate. In this paper an heuristic approach using only the directional image information for the training dataset selection in fingerprint classification tasks is described. The method combines a Fuzzy C-Means clustering method and a Naive Bayes Classifier and it is composed of three modules: the first module builds the working datasets, the second module extracts the training images dataset and, finally, the third module classifies fingerprint images in four classes. Unlike literature approaches using …
Universal Design of Information Sharing Tools for Disaster Risk Reduction
2019
International audience; Disaster information sharing tools are an important aspect of disaster resilience, and it is of utmost importance that these tools are accessible and usable for as many potential users as possible. In this paper, we evaluate the accessibility of a selection of tools for crowdsourcing disaster situation information. As our evaluation shows that the selected tools are not fully accessible, we provide recommendations for mitigation, as well as highlight the importance of further research in this area.
Analysis of properties of recombination operators proposed for the node-depth encoding
2011
The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list. The original formulation of the node-depth encoding has only mutation operators as the search mechanism. Although it is computationally efficient, the exclusive use of mutation restricts the exploration of the search space and the algorithm convergence. Then, this work proposes two specific recombination operators to improve the convergence of the algorithm using the node-depth encoding representation. These operators are based on recombination operators for permutation representations. Analysis of the proposed …
Efficient algorithm for learning simple regular expressions from noisy examples
1994
We present an efficient algorithm for finding approximate repetitions in a given sequence of characters. First, we define a class of simple regular expressions which are of star-height one and do not contain union operations, and a stochastic mutation process of a given length over a string of characters. Then, assuming that a given string of characters is obtained corrupted by the defined mutation process from some long enough word generated by a simple regular expression, we try to restore the expression. We prove that to within some reasonable accuracy it is always possible if the length of the mutation process is bounded comparing to the length of the example. We provide an algorithm by…
A genetic system based on simulated crossover of sequences of two-bit genes
2006
AbstractWe introduce a genetic model based on simulated crossover of fixed sequences of two-bit genes. Results are(1)a lower bound on population size is exhibited such that a transition takes the stochastic finite population genetic system near the next state of the deterministic infinite population genetic system (provided both begin in the same state);(2)states and dynamics of the deterministic infinite population genetic system are derived for arbitrary (finite) fitness functions (expressed in terms of multivariate polynomials);(3)in the case of quadratic fitness defined by weight matrices with m nonnull entries it is shown that each state transition can be implemented in time O(m+l), wh…
Criteria for Selecting Restructuring Strategies for Distressed or Declining Enterprises
2005
This paper seeks to determine the criteria for choosing restructuring strategies for declining or distressed enterprises. First, the paper differentiates between different stages of decline and different levels of distress, of which bankruptcy is an application. Second, it reviews the different forms of restructuring appearing in the academic literature. Third, it formalizes a descriptive model of determining restructuring applicable to distressed and declining enterprises. Specifically, the selection of a restructuring strategy is influenced not only be general restructuring criteria (firm-specific factors, the environment and characteristics of different restructuring) but also by the dec…
Mechanism-based selection of compounds for the development of innovative in vitro approaches to hepatotoxicity studies in the LIINTOP project.
2010
The 6th European Framework Programme project LIINTOP was specifically raised to optimise and provide established protocols and experimental in vitro models for testing intestinal and liver absorption, metabolism and toxicity of molecules of pharmacological interest. It has been focused on some of the most promising existing liver and intestine in vitro models with the aim of further improving their performance and thus taking them to a pre-normative research stage. Regarding the specific area of the liver, a first basic approach was the optimisation of in vitro hepatic models and the development and optimisation of in vitro approaches for toxicity screening. New advanced technologies have b…