Search results for " algorithms"
showing 10 items of 612 documents
The use of genetic algorithms to solve the allocation problems in the life cycle inventory
2013
One of the most controversial issues in the development of Life Cycle Inventory (LCI) is the allocation procedure, which consists in the partition and distribution of economic flows and environmental burdens among to each of the products of a multi-output system. Because of the use of the allocation represents a source of uncertainty in the LCI results, the authors present a new approach based on genetic algorithms (GAs) to solve the multi-output systems characterized by a rectangular matrix of technological coefficients, without using computational methods such as the allocation procedure. In this Chapter, the GAs' approach is applied to an ancillary case study related to a cogeneration pr…
Online Metric Learning Methods Using Soft Margins and Least Squares Formulations
2012
Online metric learning using margin maximization has been introduced as a way to learn appropriate dissimilarity measures in an efficient way when information as pairs of examples is given to the learning system in a progressive way. These schemes have several practical advantages with regard to global ones in which a training set needs to be processed. On the other hand, they may suffer from a poor performance depending on the quality of the examples and the particular tuning or other implementation details. This paper formulates several online metric learning alternatives using a passive-aggressive schema. A new formulation of the online problem using least squares is also introduced. The…
The Rural Postman Problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…
Analysis of human skin hyper-spectral images by non-negative matrix factorization
2011
International audience; This article presents the use of Non-negative Matrix Factorization, a blind source separation algorithm, for the decomposition of human skin absorption spectra in its main pigments: melanin and hemoglobin. The evaluated spectra come from a Hyper-Spectral Image, which is the result of the processing of a Multi-Spectral Image by a neural network-based algorithm. The implemented source separation algorithm is based on a multiplicative coeffi cient upload. The goal is to represent a given spectrum as the weighted sum of two spectral components. The resulting weighted coefficients are used to quantify melanin and hemoglobin content in the given spectra. Results present a …
Combinatorial Gray codes for classes of pattern avoiding permutations
2007
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints or imposing a particular generating order. In this paper we present generating algorithms and combinatorial Gray codes for several families of pattern avoiding permutations. Among the families under consideration are those counted by Catalan, Schr\"oder, Pell, even index Fibonacci numbers and the central binomial coefficients. Consequently, this provides Gray codes for $\s_n(\tau)$ for all $\tau\in \s_3$ and the obtained Gray codes have distances 4 and 5.
Mappings of finite distortion: The sharp modulus of continuity
2003
We establish an essentially sharp modulus of continuity for mappings of subexponentially integrable distortion.
Fingerprint image enhancement using directional morphological filter
2005
Fingerprint images quality enhancement is a topic phase to ensure good performance in an automatic fingerprint identification system (AFIS) based on minutiae matching. In this paper a new fingerprint enhancement algorithm based on morphological filter is introduced. The algorithm is based on three steps: directional decomposition, morphological filter and composition. The performance of the proposed approach has been evaluated on two sets of images: the first one is DB3 database from Fingerprint Verification Competition (FVC) and the second one is self collected using an optical scanner
A Probabilistic Analysis About the Concepts of Difficulty and Usefulness of a Molecular Ranking Classification
2013
Discerning between the concepts of difficulty and usefulness of a molecular ranking classification is of significant importance in virtual design chemistry. Here, both concepts are viewed from the statistical and practical point of view according to the standard definitions of enrichment and statistical significance p-values. These parameters are useful not only to compare distinct rankings obtained for the same molecular database, but also in order to compare the ones established in distinct molecular sets from an objective point of view.
Clustering ball possession duration according to players’ role in football small-sided games
2022
This study aimed to explore which offensive variables best discriminate the ball possession duration according to players specific role (defenders, midfielders, attackers) during a Gk+3vs3+Gk football small-sided games. Fifteen under-15 players (age 13.2±1.0 years, playing experience 4.2±1.0 years) were grouped according to their positions (team of defenders, n = 5; team of midfielders, n = 7; team of attackers, n = 3). On each testing day (n = 3), each team performed one bout of 5-min against each team in a random order, accounting for a total of nine bouts in the following scenarios: i) defenders vs midfielders; ii) defenders vs attackers; iii) midfielders vs attackers. Based on video, a …
A Grid Enabled Parallel Hybrid Genetic Algorithm for SPN
2004
This paper presents a combination of a parallel Genetic Algorithm (GA) and a local search methodology for the Steiner Problem in Networks (SPN). Several previous papers have proposed the adoption of GAs and others metaheuristics to solve the SPN demonstrating the validity of their approaches. This work differs from them for two main reasons: the dimension and the features of the networks adopted in the experiments and the aim from which it has been originated. The reason that aimed this work was namely to assess deterministic and computationally inexpensive algorithms which can be used in practical engineering applications, such as the multicast transmission in the Internet. The large dimen…