891 resultados para Algorithms genetics
Resumo:
In this paper we investigate various algorithms for performing Fast Fourier Transformation (FFT)/Inverse Fast Fourier Transformation (IFFT), and proper techniquesfor maximizing the FFT/IFFT execution speed, such as pipelining or parallel processing, and use of memory structures with pre-computed values (look up tables -LUT) or other dedicated hardware components (usually multipliers). Furthermore, we discuss the optimal hardware architectures that best apply to various FFT/IFFT algorithms, along with their abilities to exploit parallel processing with minimal data dependences of the FFT/IFFT calculations. An interesting approach that is also considered in this paper is the application of the integrated processing-in-memory Intelligent RAM (IRAM) chip to high speed FFT/IFFT computing. The results of the assessment study emphasize that the execution speed of the FFT/IFFT algorithms is tightly connected to the capabilities of the FFT/IFFT hardware to support the provided parallelism of the given algorithm. Therefore, we suggest that the basic Discrete Fourier Transform (DFT)/Inverse Discrete Fourier Transform (IDFT) can also provide high performances, by utilizing a specialized FFT/IFFT hardware architecture that can exploit the provided parallelism of the DFT/IDF operations. The proposed improvements include simplified multiplications over symbols given in polar coordinate system, using sinе and cosine look up tables,and an approach for performing parallel addition of N input symbols.
Resumo:
Some practical aspects of Genetic algorithms’ implementation regarding to life cycle management of electrotechnical equipment are considered.
Resumo:
It is common to find in experimental data persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm, where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.
Resumo:
"Vegeu el resum a l'inici del fitxer adjunt."
Resumo:
We study the properties of the well known Replicator Dynamics when applied to a finitely repeated version of the Prisoners' Dilemma game. We characterize the behavior of such dynamics under strongly simplifying assumptions (i.e. only 3 strategies are available) and show that the basin of attraction of defection shrinks as the number of repetitions increases. After discussing the difficulties involved in trying to relax the 'strongly simplifying assumptions' above, we approach the same model by means of simulations based on genetic algorithms. The resulting simulations describe a behavior of the system very close to the one predicted by the replicator dynamics without imposing any of the assumptions of the analytical model. Our main conclusion is that analytical and computational models are good complements for research in social sciences. Indeed, while on the one hand computational models are extremely useful to extend the scope of the analysis to complex scenar
Resumo:
The dispersal process, by which individuals or other dispersing agents such as gametes or seeds move from birthplace to a new settlement locality, has important consequences for the dynamics of genes, individuals, and species. Many of the questions addressed by ecology and evolutionary biology require a good understanding of species' dispersal patterns. Much effort has thus been devoted to overcoming the difficulties associated with dispersal measurement. In this context, genetic tools have long been the focus of intensive research, providing a great variety of potential solutions to measuring dispersal. This methodological diversity is reviewed here to help (molecular) ecologists find their way toward dispersal inference and interpretation and to stimulate further developments.
Resumo:
The algorithmic approach to data modelling has developed rapidly these last years, in particular methods based on data mining and machine learning have been used in a growing number of applications. These methods follow a data-driven methodology, aiming at providing the best possible generalization and predictive abilities instead of concentrating on the properties of the data model. One of the most successful groups of such methods is known as Support Vector algorithms. Following the fruitful developments in applying Support Vector algorithms to spatial data, this paper introduces a new extension of the traditional support vector regression (SVR) algorithm. This extension allows for the simultaneous modelling of environmental data at several spatial scales. The joint influence of environmental processes presenting different patterns at different scales is here learned automatically from data, providing the optimum mixture of short and large-scale models. The method is adaptive to the spatial scale of the data. With this advantage, it can provide efficient means to model local anomalies that may typically arise in situations at an early phase of an environmental emergency. However, the proposed approach still requires some prior knowledge on the possible existence of such short-scale patterns. This is a possible limitation of the method for its implementation in early warning systems. The purpose of this paper is to present the multi-scale SVR model and to illustrate its use with an application to the mapping of Cs137 activity given the measurements taken in the region of Briansk following the Chernobyl accident.
Resumo:
A new study shows that wood ant queens selectively pass the maternally-inherited half of their genome to their daughters and the paternally-inherited half to their sons. This system, which most likely evolved from ancestral hybridization, creates distinct genetic lineages.
Resumo:
Hypertension is a common, modifiable and heritable cardiovascular risk factor. Some rare monogenic forms of hypertension have been described, but the majority of patients suffer from "essential" hypertension, for whom the underlying pathophysiological mechanism is not clear. Essential hypertension is a complex trait, involving multiple genes and environmental factors. Recently, progress in the identification of common genetic variants associated with blood pressure and hypertension has been made thanks to large-scale international collaborative projects involving geneticists, epidemiologists, statisticians and clinicians. In this article, we review some basic genetic concepts and the main research methods used to study the genetics of hypertension, as well as selected recent findings in this field.
Resumo:
The classic organization of a gene structure has followed the Jacob and Monod bacterial gene model proposed more than 50 years ago. Since then, empirical determinations of the complexity of the transcriptomes found in yeast to human has blurred the definition and physical boundaries of genes. Using multiple analysis approaches we have characterized individual gene boundaries mapping on human chromosomes 21 and 22. Analyses of the locations of the 5' and 3' transcriptional termini of 492 protein coding genes revealed that for 85% of these genes the boundaries extend beyond the current annotated termini, most often connecting with exons of transcripts from other well annotated genes. The biological and evolutionary importance of these chimeric transcripts is underscored by (1) the non-random interconnections of genes involved, (2) the greater phylogenetic depth of the genes involved in many chimeric interactions, (3) the coordination of the expression of connected genes and (4) the close in vivo and three dimensional proximity of the genomic regions being transcribed and contributing to parts of the chimeric RNAs. The non-random nature of the connection of the genes involved suggest that chimeric transcripts should not be studied in isolation, but together, as an RNA network.
Resumo:
Spolaore and Wacziarg (2009) have presented evidence supporting a role of genetic distance to the United States as a barrier to economic development. We extend their empirical work by controlling for the share of Europeans and European descendants in the population. We fi nd that the role of genetic distance disappears and o¤er two alternative interpretations of the patterns in the data.
Resumo:
Purpose of review: Elucidating the genetic background of Parkinson disease and essential tremor is crucial to understand the pathogenesis and improve diagnostic and therapeutic strategies. Recent findings: A number of approaches have been applied including familial and association studies, and studies of gene expression profiles to identify genes involved in susceptibility to Parkinson disease. These studies have nominated a number of candidate Parkinson disease genes and novel loci including Omi/HtrA2, GIGYF2, FGF20, PDXK, EIF4G1 and PARK16. A recent notable finding has been the confirmation for the role of heterozygous mutations in glucocerebrosidase (GBA) as risk factors for Parkinson disease. Finally, association studies have nominated genetic variation in the leucine-rich repeat and Ig containing 1 gene (LINGO1) as a risk for both Parkinson disease and essential tremor, providing the first genetic evidence of a link between the two conditions. Summary: Although undoubtedly genes remain to be identified, considerable progress has been achieved in the understanding of the genetic basis of Parkinson disease. This same effort is now required for essential tremor. The use of next-generation high-throughput sequencing and genotyping technologies will help pave the way for future insight leading to advances in diagnosis, prevention and cure.
Resumo:
Trait decay may occur when selective pressures shift, owing to changes in environment or life style, rendering formerly adaptive traits non-functional or even maladaptive. It remains largely unknown if such decay would stem from multiple mutations with small effects or rather involve few loci with major phenotypic effects. Here, we investigate the decay of female sexual traits, and the genetic causes thereof, in a transition from haplodiploid sexual reproduction to endosymbiont-induced asexual reproduction in the parasitoid wasp Asobara japonica. We take advantage of the fact that asexual females cured of their endosymbionts produce sons instead of daughters, and that these sons can be crossed with sexual females. By combining behavioral experiments with crosses designed to introgress alleles from the asexual into the sexual genome, we found that sexual attractiveness, mating, egg fertilization and plastic adjustment of offspring sex ratio (in response to variation in local mate competition) are decayed in asexual A. japonica females. Furthermore, introgression experiments revealed that the propensity for cured asexual females to produce only sons (because of decayed sexual attractiveness, mating behavior and/or egg fertilization) is likely caused by recessive genetic effects at a single locus. Recessive effects were also found to cause decay of plastic sex-ratio adjustment under variable levels of local mate competition. Our results suggest that few recessive mutations drive decay of female sexual traits, at least in asexual species deriving from haplodiploid sexual ancestors.
Resumo:
In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.