111 resultados para Algorithms genetics
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.