Search results for "Algorithm"
showing 10 items of 4887 documents
Complexity of probabilistic versus deterministic automata
2005
Hybrid chaotic firefly decision making model for Parkinson’s disease diagnosis
2020
Parkinson’s disease is found as a progressive neurodegenerative condition which affects motor circuit by the loss of up to 70% of dopaminergic neurons. Thus, diagnosing the early stages of incidence is of great importance. In this article, a novel chaos-based stochastic model is proposed by combining the characteristics of chaotic firefly algorithm with Kernel-based Naïve Bayes (KNB) algorithm for diagnosis of Parkinson’s disease at an early stage. The efficiency of the model is tested on a voice measurement dataset that is collected from “UC Irvine Machine Learning Repository.” The dynamics of chaos optimization algorithm will enhance the firefly algorithm by introducing six types of chao…
Mind the depth: The vertical dimension of a small-scale coastal fishery shapes selection on species, size, and sex in wrasses
2020
Small‐scale fisheries (SSFs) tend to target shallow waters, but the depth distributions of coastal fish can vary depending on species, size, and sex. This creates a scope for a form of fishing selectivity that has received limited attention but can have considerable implications for monitoring and management of these fisheries. We conducted a case study on the Norwegian wrasse fishery, a developing SSF in which multiple species are caught in shallow waters (mean depth = 4.5 m) to be used as cleaner fish in aquaculture. Several of these wrasses have life histories and behaviors that are sensitive to selective fishing mortality, such as sexual size dimorphism, paternal care, and sex change. A…
Hybrid Genetic Algorithms in Data Mining Applications
2009
Genetic algorithms (GAs) are a class of problem solving techniques which have been successfully applied to a wide variety of hard problems (Goldberg, 1989). In spite of conventional GAs are interesting approaches to several problems, in which they are able to obtain very good solutions, there exist cases in which the application of a conventional GA has shown poor results. Poor performance of GAs completely depends on the problem. In general, problems severely constrained or problems with difficult objective functions are hard to be optimized using GAs. Regarding the difficulty of a problem for a GA there is a well established theory. Traditionally, this has been studied for binary encoded …
A genetic algorithm for image segmentation
2002
The paper describes a new algorithm for image segmentation. It is based on a genetic approach that allow us to consider the segmentation problem as a global optimization problem (GOP). For this purpose, a fitness function, based on the similarity between images, has been defined. The similarity is a function of both the intensity and the spatial position of pixels. Preliminary results, obtained using real images, show a good performance of the segmentation algorithm.
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
2003
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers a rule supporting gliders and the second one modifies this rule in such a way that some components appear allowing it to simulate logic gates. The results show that the genetic programming is a promising tool for the search of cellular automata with specific behaviors, and thus can prove to be decisive for discovering new automata supporting universal computation.
Real class sizes and real character degrees
2010
Perhaps unexpectedly, there is a rich and deep connection between field of values of characters, their degrees and the structure of a finite group. Some of the fundamental results on the degrees of characters of finite groups, as the Ito–Michler and Thompson's theorems, admit a version involving only characters with certain fixed field of values ([DNT, NS, NST2, NT1, NT3]).
Approaches to model the retention and peak profile in linear gradient reversed-phase liquid chromatography.
2012
Abstract The optimisation of the experimental conditions in gradient reversed-phase liquid chromatography requires reliable algorithms for the description of the retention and peak profile. As in isocratic elution, the linear relationship between the logarithm of the retention factor and the solvent contents is only acceptable in relatively small concentration ranges of modifier. However, more complex models may not allow an analytical integration of the general equation for gradient elution. Alternative approaches for modelling the retention in linear gradient elution are here proposed. Those based on the quadratic logarithmic model and a model proposed for normal liquid chromatography yie…
DEMAND Project: An algorithm for the assessment of the prosumers’ flexibility
2020
Demand side aggregation represents an important opportunity for ancillary services provision due to the potential that the coordinated management of distributed resources has on affecting power systems' operation. In this framework, the Aggregator has a main role and takes on different relationships with the other actors of the power system, usually becoming a mediator between the prosumers and the distribution system operator. The DEMAND project introduces a new point of view in demand side aggregation by proposing a new framework where the Aggregator is no more needed and prosumers can share and combine their flexibility in a new aggregation platform called Virtual Aggregation Environment…
Using the Hermite Regression Formula to Design a Neural Architecture with Automatic Learning of the “Hidden” Activation Functions
2000
The value of the output function gradient of a neural network, calculated in the training points, plays an essential role for its generalization capability. In this paper a feed forward neural architecture (αNet) that can learn the activation function of its hidden units during the training phase is presented. The automatic learning is obtained through the joint use of the Hermite regression formula and the CGD optimization algorithm with the Powell restart conditions. This technique leads to a smooth output function of αNet in the nearby of the training points, achieving an improvement of the generalization capability and the flexibility of the neural architecture. Experimental results, ob…