886 resultados para Constructive Genetic Algorithm
Resumo:
Background: Plasmodium vivax malaria is a major public health challenge in Latin America, Asia and Oceania, with 130-435 million clinical cases per year worldwide. Invasion of host blood cells by P. vivax mainly depends on a type I membrane protein called Duffy binding protein (PvDBP). The erythrocyte-binding motif of PvDBP is a 170 amino-acid stretch located in its cysteine-rich region II (PvDBP(II)), which is the most variable segment of the protein. Methods: To test whether diversifying natural selection has shaped the nucleotide diversity of PvDBP(II) in Brazilian populations, this region was sequenced in 122 isolates from six different geographic areas. A Bayesian method was applied to test for the action of natural selection under a population genetic model that incorporates recombination. The analysis was integrated with a structural model of PvDBP(II), and T-and B-cell epitopes were localized on the 3-D structure. Results: The results suggest that: (i) recombination plays an important role in determining the haplotype structure of PvDBP(II), and (ii) PvDBP(II) appears to contain neutrally evolving codons as well as codons evolving under natural selection. Diversifying selection preferentially acts on sites identified as epitopes, particularly on amino acid residues 417, 419, and 424, which show strong linkage disequilibrium. Conclusions: This study shows that some polymorphisms of PvDBP(II) are present near the erythrocyte-binding domain and might serve to elude antibodies that inhibit cell invasion. Therefore, these polymorphisms should be taken into account when designing vaccines aimed at eliciting antibodies to inhibit erythrocyte invasion.
Resumo:
An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).
Resumo:
Various molecular systems are available for epidemiological, genetic, evolutionary, taxonomic and systematic studies of innumerable fungal infections, especially those caused by the opportunistic pathogen C. albicans. A total of 75 independent oral isolates were selected in order to compare Multilocus Enzyme Electrophoresis (MLEE), Electrophoretic Karyotyping (EK) and Microsatellite Markers (Simple Sequence Repeats - SSRs), in their abilities to differentiate and group C. albicans isolates (discriminatory power), and also, to evaluate the concordance and similarity of the groups of strains determined by cluster analysis for each fingerprinting method. Isoenzyme typing was performed using eleven enzyme systems: Adh, Sdh, M1p, Mdh, Idh, Gdh, G6pdh, Asd, Cat, Po, and Lap (data previously published). The EK method consisted of chromosomal DNA separation by pulsed-field gel electrophoresis using a CHEF system. The microsatellite markers were investigated by PCR using three polymorphic loci: EF3, CDC3, and HIS3. Dendrograms were generated by the SAHN method and UPGMA algorithm based on similarity matrices (S(SM)). The discriminatory power of the three methods was over 95%, however a paired analysis among them showed a parity of 19.7-22.4% in the identification of strains. Weak correlation was also observed among the genetic similarity matrices (S(SM)(MLEE) x S(SM)(EK) x S(SM)(SSRs)). Clustering analyses showed a mean of 9 +/- 12.4 isolates per cluster (3.8 +/- 8 isolates/taxon) for MLEE, 6.2 +/- 4.9 isolates per cluster (4 +/- 4.5 isolates/taxon) for SSRs, and 4.1 +/- 2.3 isolates per cluster (2.6 +/- 2.3 isolates/taxon) for EK. A total of 45 (13%), 39(11.2%), 5 (1.4%) and 3 (0.9%) clusters pairs from 347 showed similarity (Si) of 0.1-10%, 10.1-20%, 20.1-30% and 30.1-40%, respectively. Clinical and molecular epidemiological correlation involving the opportunistic pathogen C. albicans may be attributed dependently of each method of genotyping (i.e., MLEE, EK, and SSRs) supplemented with similarity and grouping analysis. Therefore, the use of genotyping systems that give results which offer minimum disparity, or the combination of the results of these systems, can provide greater security and consistency in the determination of strains and their genetic relationships. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Stingless bees play an important ecological role as pollinators of many wild plant species in the tropics and have significant potential for the pollination of agricultural crops. Nevertheless, conservation efforts as well as commercial breeding programmes require better guidelines on the amount of genetic variation that is needed to maintain viable populations. In this context, we carried out a long-term genetic study on the stingless bee Melipona scutellaris to evaluate the population viability consequences of prolonged breeding from a small number of founder colonies. In particular, it was artificially imposed a genetic bottleneck by setting up a population starting from only two founder colonies, and continued breeding from it for a period of over 10 years in a location outside its natural area of occurrence. We show that despite a great reduction in the number of alleles present at both neutral microsatellite loci and the sex-determining locus relative to its natural source population, and an increased frequency in the production of sterile diploid males, the genetically impoverished population could be successfully bred and maintained for at least 10 years. This shows that in stingless bees, breeding from a small stock of colonies may have less severe consequences than previously suspected. In addition, we provide a simulation model to determine the number of colonies that are needed to maintain a certain number of sex alleles in a population, thereby providing useful guidelines for stingless bee breeding and conservation efforts.
Resumo:
The role of exercise training (ET) on cardiac renin-angiotensin system (RAS) was investigated in 3-5 month-old mice lacking alpha(2A-) and alpha(2C-)adrenoceptors (alpha(2A)/alpha(2C)ARKO) that present heart failure (HF) and wild type control (WT). ET consisted of 8-week running sessions of 60 min, 5 days/week. In addition, exercise tolerance, cardiac structural and function analysis were made. At 3 months, fractional shortening and exercise tolerance were similar between groups. At 5 months, alpha(2A)/alpha(2C)ARKO mice displayed ventricular dysfunction and fibrosis associated with increased cardiac angiotensin (Ang) II levels (2.9-fold) and increased local angiotensin-converting enzyme activity (ACE 18%). ET decreased alpha(2A)/alpha(2C)ARKO cardiac Ang II levels and ACE activity to age-matched untrained WT mice levels while increased ACE2 expression and prevented exercise intolerance and ventricular dysfunction with little impact on cardiac remodeling. Altogether, these data provide evidence that reduced cardiac RAS explains, at least in part, the beneficial effects of ET on cardiac function in a genetic model of HF.
Resumo:
beta-blockers, as class, improve cardiac function and survival in heart failure (HF). However, the molecular mechanisms underlying these beneficial effects remain elusive. In the present study, metoprolol and carvedilol were used in doses that display comparable heart rate reduction to assess their beneficial effects in a genetic model of sympathetic hyperactivity-induced HF (alpha(2A)/alpha(2C)-ARKO mice). Five month-old HF mice were randomly assigned to receive either saline, metoprolol or carvedilol for 8 weeks and age-matched wild-type mice (WT) were used as controls. HF mice displayed baseline tachycardia, systolic dysfunction evaluated by echocardiography, 50% mortality rate, increased cardiac myocyte width (50%) and ventricular fibrosis (3-fold) compared with WT. All these responses were significantly improved by both treatments. Cardiomyocytes from HF mice showed reduced peak [Ca(2+)](i) transient (13%) using confocal microscopy imaging. Interestingly, while metoprolol improved [Ca(2+)](i) transient, carvedilol had no effect on peak [Ca(2+)](i) transient but also increased [Ca(2+)] transient decay dynamics. We then examined the influence of carvedilol in cardiac oxidative stress as an alternative target to explain its beneficial effects. Indeed, HF mice showed 10-fold decrease in cardiac reduced/oxidized glutathione ratio compared with WT, which was significantly improved only by carvedilol treatment. Taken together, we provide direct evidence that the beneficial effects of metoprolol were mainly associated with improved cardiac Ca(2+) transients and the net balance of cardiac Ca(2+) handling proteins while carvedilol preferentially improved cardiac redox state. (C) 2008 Elsevier Inc. All rights reserved.
Resumo:
Sympathetic hyperactivity (SH) and renin angiotensin system (RAS) activation are commonly associated with heart failure (HF), even though the relative contribution of these factors to the cardiac derangement is less understood. The role of SH on RAS components and its consequences for the HF were investigated in mice lacking alpha(2A) and alpha(2C) adrenoceptor knockout (alpha(2A)/alpha(2C) ARKO) that present SH with evidence of HF by 7 mo of age. Cardiac and systemic RAS components and plasma norepinephrine (PN) levels were evaluated in male adult mice at 3 and 7 mo of age. In addition, cardiac morphometric analysis, collagen content, exercise tolerance, and hemodynamic assessments were made. At 3 mo, alpha(2A)/alpha(2C)ARKO mice showed no signs of HF, while displaying elevated PN, activation of local and systemic RAS components, and increased cardiomyocyte width (16%) compared with wild-type mice (WT). In contrast, at 7 mo, alpha(2A)/alpha(2C)ARKO mice presented clear signs of HF accompanied only by cardiac activation of angiotensinogen and ANG II levels and increased collagen content (twofold). Consistent with this local activation of RAS, 8 wk of ANG II AT(1) receptor blocker treatment restored cardiac structure and function comparable to the WT. Collectively, these data provide direct evidence that cardiac RAS activation plays a major role underlying the structural and functional abnormalities associated with a genetic SH-induced HF in mice.
Resumo:
A heuristic algorithm that employs fuzzy logic is proposed to the power system transmission expansion planning problem. The algorithm is based on the divide to conquer strategy, which is controlled by the fuzzy system. The algorithm provides high quality solutions with the use of fuzzy decision making, which is based on nondeterministic criteria to guide the search. The fuzzy system provides a self-adjusting mechanism that eliminates the manual adjustment of parameters to each system being solved. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Motivation: Understanding the patterns of association between polymorphisms at different loci in a population ( linkage disequilibrium, LD) is of fundamental importance in various genetic studies. Many coefficients were proposed for measuring the degree of LD, but they provide only a static view of the current LD structure. Generative models (GMs) were proposed to go beyond these measures, giving not only a description of the actual LD structure but also a tool to help understanding the process that generated such structure. GMs based in coalescent theory have been the most appealing because they link LD to evolutionary factors. Nevertheless, the inference and parameter estimation of such models is still computationally challenging. Results: We present a more practical method to build GM that describe LD. The method is based on learning weighted Bayesian network structures from haplotype data, extracting equivalence structure classes and using them to model LD. The results obtained in public data from the HapMap database showed that the method is a promising tool for modeling LD. The associations represented by the learned models are correlated with the traditional measure of LD D`. The method was able to represent LD blocks found by standard tools. The granularity of the association blocks and the readability of the models can be controlled in the method. The results suggest that the causality information gained by our method can be useful to tell about the conservability of the genetic markers and to guide the selection of subset of representative markers.
Resumo:
The main objective of this paper is to relieve the power system engineers from the burden of the complex and time-consuming process of power system stabilizer (PSS) tuning. To achieve this goal, the paper proposes an automatic process for computerized tuning of PSSs, which is based on an iterative process that uses a linear matrix inequality (LMI) solver to find the PSS parameters. It is shown in the paper that PSS tuning can be written as a search problem over a non-convex feasible set. The proposed algorithm solves this feasibility problem using an iterative LMI approach and a suitable initial condition, corresponding to a PSS designed for nominal operating conditions only (which is a quite simple task, since the required phase compensation is uniquely defined). Some knowledge about the PSS tuning is also incorporated in the algorithm through the specification of bounds defining the allowable PSS parameters. The application of the proposed algorithm to a benchmark test system and the nonlinear simulation of the resulting closed-loop models demonstrate the efficiency of this algorithm. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of minimising the total completion time. This problem is well-known for being nondeterministic polynomial-time hard, and therefore, most contributions to the topic focus on developing algorithms able to obtain good approximate solutions for the problem in a short CPU time. More specifically, there are various constructive heuristics available for the problem [such as the ones by Rajendran and Chaudhuri (Nav Res Logist 37: 695-705, 1990); Bertolissi (J Mater Process Technol 107: 459-465, 2000), Aldowaisan and Allahverdi (Omega 32: 345-352, 2004) and the Chins heuristic by Fink and Voa (Eur J Operat Res 151: 400-414, 2003)], as well as a successful local search procedure (Pilot-1-Chins). We propose a new constructive heuristic based on an analogy with the two-machine problem in order to select the candidate to be appended in the partial schedule. The myopic behaviour of the heuristic is tempered by exploring the neighbourhood of the so-obtained partial schedules. The computational results indicate that the proposed heuristic outperforms existing ones in terms of quality of the solution obtained and equals the performance of the time-consuming Pilot-1-Chins.
A hybrid Particle Swarm Optimization - Simplex algorithm (PSOS) for structural damage identification
Resumo:
This study proposes a new PSOS-model based damage identification procedure using frequency domain data. The formulation of the objective function for the minimization problem is based on the Frequency Response Functions (FRFs) of the system. A novel strategy for the control of the Particle Swarm Optimization (PSO) parameters based on the Nelder-Mead algorithm (Simplex method) is presented; consequently, the convergence of the PSOS becomes independent of the heuristic constants and its stability and confidence are enhanced. The formulated hybrid method performs better in different benchmark functions than the Simulated Annealing (SA) and the basic PSO (PSO(b)). Two damage identification problems, taking into consideration the effects of noisy and incomplete data, were studied: first, a 10-bar truss and second, a cracked free-free beam, both modeled with finite elements. In these cases, the damage location and extent were successfully determined. Finally, a non-linear oscillator (Duffing oscillator) was identified by PSOS providing good results. (C) 2009 Elsevier Ltd. All rights reserved
Resumo:
This paper presents a new methodology to estimate unbalanced harmonic distortions in a power system, based on measurements of a limited number of given sites. The algorithm utilizes evolutionary strategies (ES), a development branch of evolutionary algorithms. The problem solving algorithm herein proposed makes use of data from various power quality meters, which can either be synchronized by high technology GPS devices or by using information from a fundamental frequency load flow, what makes the overall power quality monitoring system much less costly. The ES based harmonic estimation model is applied to a 14 bus network to compare its performance to a conventional Monte Carlo approach. It is also applied to a 50 bus subtransmission network in order to compare the three-phase and single-phase approaches as well as the robustness of the proposed method. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
An improvement to the quality bidimensional Delaunay mesh generation algorithm, which combines the mesh refinement algorithms strategy of Ruppert and Shewchuk is proposed in this research. The developed technique uses diametral lenses criterion, introduced by L. P. Chew, with the purpose of eliminating the extremely obtuse triangles in the boundary mesh. This method splits the boundary segment and obtains an initial prerefinement, and thus reducing the number of necessary iterations to generate a high quality sequential triangulation. Moreover, it decreases the intensity of the communication and synchronization between subdomains in parallel mesh refinement.