891 resultados para Algorithms genetics
Resumo:
The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.
Resumo:
It has been years since the introduction of the Dynamic Network Optimization (DNO) concept, yet the DNO development is still at its infant stage, largely due to a lack of breakthrough in minimizing the lengthy optimization runtime. Our previous work, a distributed parallel solution, has achieved a significant speed gain. To cater for the increased optimization complexity pressed by the uptake of smartphones and tablets, however, this paper examines the potential areas for further improvement and presents a novel asynchronous distributed parallel design that minimizes the inter-process communications. The new approach is implemented and applied to real-life projects whose results demonstrate an augmented acceleration of 7.5 times on a 16-core distributed system compared to 6.1 of our previous solution. Moreover, there is no degradation in the optimization outcome. This is a solid sprint towards the realization of DNO.
Resumo:
This study investigated the effect of, and interactions between, contrasting crossbreed genetics (US Brown Swiss [BS] × Improved Braunvieh [BV] × Original Braunvieh [OB]) and feeding regimes (especially grazing intake and pasture type) on milk fatty acid (FA) profiles. Concentrations of total polyunsaturated FAs, total omega-3 FAs and trans palmitoleic, vaccenic, α-linolenic, eicosapentaenoic and docosapentaenoic acids were higher in cows with a low proportion of BS genetics. Highest concentrations of the nutritionally desirable FAs, trans palmitoleic, vaccenic and eicosapentaenoic acids were found for cows with a low proportion of BS genetics (0-24% and/or 25-49%) on high grazing intake (75-100% of dry matter intake) diets. Multivariate analysis indicated that the proportion of OB genetics is a positive driver for nutritionally desirable monounsaturated and polyunsaturated FAs while BS genetics proportion was positive driver for total and undesirable individual saturated FAs. Significant genetics × feeding regime interactions were also detected for a range of FAs.
Resumo:
Background Hypothalamic–pituitary–adrenal (HPA) axis functioning has been implicated in the development of stress-related psychiatric diagnoses and response to adverse life experiences. This study aimed to investigate the association between genetic and epigenetics in HPA axis and response to cognitive behavior therapy (CBT). Methods Children with anxiety disorders were recruited into the Genes for Treatment project (GxT, N = 1,152). Polymorphisms of FKBP5 and GR were analyzed for association with response to CBT. Percentage DNA methylation at the FKBP5 and GR promoter regions was measured before and after CBT in a subset (n = 98). Linear mixed effect models were used to investigate the relationship between genotype, DNA methylation, and change in primary anxiety disorder severity (treatment response). Results Treatment response was not associated with FKBP5 and GR polymorphisms, or pretreatment percentage DNA methylation. However, change in FKBP5 DNA methylation was nominally significantly associated with treatment response. Participants who demonstrated the greatest reduction in severity decreased in percentage DNA methylation during treatment, whereas those with little/no reduction in severity increased in percentage DNA methylation. This effect was driven by those with one or more FKBP5 risk alleles, with no association seen in those with no FKBP5 risk alleles. No significant association was found between GR methylation and response. Conclusions Allele-specific change in FKBP5 methylation was associated with treatment response. This is the largest study to date investigating the role of HPA axis related genes in response to a psychological therapy. Furthermore, this is the first study to demonstrate that DNA methylation changes may be associated with response to psychological therapies in a genotype-dependent manner.
Resumo:
The pipe sizing of water networks via evolutionary algorithms is of great interest because it allows the selection of alternative economical solutions that meet a set of design requirements. However, available evolutionary methods are numerous, and methodologies to compare the performance of these methods beyond obtaining a minimal solution for a given problem are currently lacking. A methodology to compare algorithms based on an efficiency rate (E) is presented here and applied to the pipe-sizing problem of four medium-sized benchmark networks (Hanoi, New York Tunnel, GoYang and R-9 Joao Pessoa). E numerically determines the performance of a given algorithm while also considering the quality of the obtained solution and the required computational effort. From the wide range of available evolutionary algorithms, four algorithms were selected to implement the methodology: a PseudoGenetic Algorithm (PGA), Particle Swarm Optimization (PSO), a Harmony Search and a modified Shuffled Frog Leaping Algorithm (SFLA). After more than 500,000 simulations, a statistical analysis was performed based on the specific parameters each algorithm requires to operate, and finally, E was analyzed for each network and algorithm. The efficiency measure indicated that PGA is the most efficient algorithm for problems of greater complexity and that HS is the most efficient algorithm for less complex problems. However, the main contribution of this work is that the proposed efficiency ratio provides a neutral strategy to compare optimization algorithms and may be useful in the future to select the most appropriate algorithm for different types of optimization problems.
Resumo:
This special issue is focused on the assessment of algorithms for the observation of Earth’s climate from environ- mental satellites. Climate data records derived by remote sensing are increasingly a key source of insight into the workings of and changes in Earth’s climate system. Producers of data sets must devote considerable effort and expertise to maximise the true climate signals in their products and minimise effects of data processing choices and changing sensors. A key choice is the selection of algorithm(s) for classification and/or retrieval of the climate variable. Within the European Space Agency Climate Change Initiative, science teams undertook systematic assessment of algorithms for a range of essential climate variables. The papers in the special issue report some of these exercises (for ocean colour, aerosol, ozone, greenhouse gases, clouds, soil moisture, sea surface temper- ature and glaciers). The contributions show that assessment exercises must be designed with care, considering issues such as the relative importance of different aspects of data quality (accuracy, precision, stability, sensitivity, coverage, etc.), the availability and degree of independence of validation data and the limitations of validation in characterising some important aspects of data (such as long-term stability or spatial coherence). As well as re- quiring a significant investment of expertise and effort, systematic comparisons are found to be highly valuable. They reveal the relative strengths and weaknesses of different algorithmic approaches under different observa- tional contexts, and help ensure that scientific conclusions drawn from climate data records are not influenced by observational artifacts, but are robust.
Resumo:
Hannah is a 30 year old single mother with two young children. She is of Chinese descent and moved to the UK six years ago; she has a good level of English. Recently her mother suffered a heart attack, which prompted Hannah’s first visit to the general practitioner (GP). Meanwhile Hannah performed a predictive genetic test independently through an online company, which showed an increased risk of developing cardiovascular disease (CVD); she has the ɛ4 variant of the APOE gene. The company has recommended a daily supplement and dietary changes. Blood tests showed raised blood lipids and her GP referred Hannah to a dietitian for lifestyle management. Hannah is very concerned and anxious about her health.
Resumo:
The l1-norm sparsity constraint is a widely used technique for constructing sparse models. In this contribution, two zero-attracting recursive least squares algorithms, referred to as ZA-RLS-I and ZA-RLS-II, are derived by employing the l1-norm of parameter vector constraint to facilitate the model sparsity. In order to achieve a closed-form solution, the l1-norm of the parameter vector is approximated by an adaptively weighted l2-norm, in which the weighting factors are set as the inversion of the associated l1-norm of parameter estimates that are readily available in the adaptive learning environment. ZA-RLS-II is computationally more efficient than ZA-RLS-I by exploiting the known results from linear algebra as well as the sparsity of the system. The proposed algorithms are proven to converge, and adaptive sparse channel estimation is used to demonstrate the effectiveness of the proposed approach.
Resumo:
Neotropical forests have brought forth a large proportion of the world`s terrestrial biodiversity, but the underlying evolutionary mechanisms and their timing require further elucidation. Despite insights gained from phylogenetic studies, uncertainties about molecular clock rates have hindered efforts to determine the timing of diversification processes. Moreover, most molecular research has been detached from the extensive body of data on Neotropical geology and paleogeography. We here examine phylogenetic relationships and the timing of speciation events in a Neotropical flycatcher genus (Myiopagis) by using calibrations from modern geologic data in conjunction with a number of recently developed DNA sequence dating algorithms and by comparing these estimates with those based on a range of previously proposed molecular clock rates. We present a well-supported hypothesis of systematic relationships within the genus. Our age estimates of Myiopagis speciation events based on paleogeographic data are in close agreement with nodal ages derived from a ""traditional"" avian mitochondrial 2%/My clock, while contradicting other clock rates. Our comparative approach corroborates the consistency of the traditional avian mitochondrial clock rate of 2%/My for tyrant-flycatchers. Nevertheless, our results argue against the indiscriminate use of molecular clock rates in evolutionary research and advocate the verification of the appropriateness of the traditional clock rate by means of independent calibrations in individual studies. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
Alzheimer`s Disease (AD) is the most common type of dementia among the elderly, with devastating consequences for the patient, their relatives, and caregivers. More than 300 genetic polymorphisms have been involved with AD, demonstrating that this condition is polygenic and with a complex pattern of inheritance. This paper aims to report and compare the results of AD genetics studies in case-control and familial analysis performed in Brazil since our first publication, 10 years ago. They include the following genes/markers: Apolipoprotein E (APOE), 5-hidroxytryptamine transporter length polymorphic region (5-HTTLPR), brain-derived neurotrophin factor (BDNF), monoamine oxidase A (MAO-A), and two simple-sequence tandem repeat polymorphisms (DXS1047 and D10S1423). Previously unpublished data of the interleukin-1 alpha (IL-1 alpha) and interleukin-1 beta (IL-1 beta) genes are reported here briefly. Results from others Brazilian studies with AD patients are also reported at this short review. Four local families studied with various markers at the chromosome 21, 19, 14, and 1 are briefly reported for the first time. The importance of studying DNA samples from Brazil is highlighted because of the uniqueness of its population, which presents both intense ethnical miscegenation, mainly at the east coast, but also clusters with high inbreeding rates in rural areas at the countryside. We discuss the current stage of extending these studies using high-throughput methods of large-scale genotyping, such as single nucleotide polymorphism microarrays, associated with bioinformatics tools that allow the analysis of such extensive number of genetics variables, with different levels of penetrance. There is still a long way between the huge amount of data gathered so far and the actual application toward the full understanding of AD, but the final goal is to develop precise tools for diagnosis and prognosis, creating new strategies for better treatments based on genetic profile.
Resumo:
There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.
Resumo:
J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.
Resumo:
We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.