891 resultados para Algorithms genetics
Resumo:
This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.
Resumo:
A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differential equations (PDEs) is described. This can be used for calculating correlation functions of systems of interacting stochastic fields. Such field equations can arise in the description of Hamiltonian and open systems in the physics of nonlinear processes, and may include multiplicative noise sources. The algorithm can be used for studying the properties of nonlinear quantum or classical field theories. The general approach is outlined and applied to a specific example, namely the quantum statistical fluctuations of ultra-short optical pulses in chi((2)) parametric waveguides. This example uses a non-diagonal coherent state representation, and correctly predicts the sub-shot noise level spectral fluctuations observed in homodyne detection measurements. It is expected that the methods used wilt be applicable for higher-order correlation functions and other physical problems as well. A stochastic differencing technique for reducing sampling errors is also introduced. This involves solving nonlinear stochastic parabolic PDEs in combination with a reference process, which uses the Wigner representation in the example presented here. A computer implementation on MIMD parallel architectures is discussed. (C) 1997 Academic Press.
Resumo:
Objective: The study we assessed how often patients who are manifesting a myocardial infarction (MI) would not be considered candidates for intensive lipid-lowering therapy based on the current guidelines. Methods: In 355 consecutive patients manifesting ST elevation MI (STEMI), admission plasma C-reactive protein (CRP) was measured and Framingham risk score (FRS), PROCAM risk score, Reynolds risk score, ASSIGN risk score, QRISK, and SCORE algorithms were applied. Cardiac computed tomography and carotid ultrasound were performed to assess the coronary artery calcium score (CAC), carotid intima-media thickness (cIMT) and the presence of carotid plaques. Results: Less than 50% of STEMI patients would be identified as having high risk before the event by any of these algorithms. With the exception of FRS (9%), all other algorithms would assign low risk to about half of the enrolled patients. Plasma CRP was <1.0 mg/L in 70% and >2 mg/L in 14% of the patients. The average cIMT was 0.8 +/- 0.2 mm and only in 24% of patients was >= 1.0 mm. Carotid plaques were found in 74% of patients. CAC > 100 was found in 66% of patients. Adding CAC >100 plus the presence of carotid plaque, a high-risk condition would be identified in 100% of the patients using any of the above mentioned algorithms. Conclusion: More than half of patients manifesting STEMI would not be considered as candidates for intensive preventive therapy by the current clinical algorithms. The addition of anatomical parameters such as CAC and the presence of carotid plaques can substantially reduce the CVD risk underestimation. (C) 2010 Elsevier Ireland Ltd. All rights reserved.
Resumo:
Microsatellites or simple sequence repeats (SSRs) are ubiquitous in eukaryotic genomes. Single-locus SSR markers have been developed for a number of species, although there is a major bottleneck in developing SSR markers whereby flanking sequences must be known to design 5'-anchors for polymerase chain reaction (PCR) primers. Inter SSR (ISSR) fingerprinting was developed such that no sequence knowledge was required. Primers based on a repeat sequence, such as (CA)(n), can be made with a degenerate 3'-anchor, such as (CA)(8)RG or (AGC)(6)TY. The resultant PCR reaction amplifies the sequence between two SSRs, yielding a multilocus marker system useful for fingerprinting, diversity analysis and genome mapping. PCR products are radiolabelled with P-32 or P-33 via end-labelling or PCR incorporation, and separated on a polyacrylamide sequencing gel prior to autoradiographic visualisation. A typical reaction yields 20-100 bands per lane depending on the species and primer. We have used ISSR fingerprinting in a number of plant species, and report here some results on two important tropical species, sorghum and banana. Previous investigators have demonstrated that ISSR analysis usually detects a higher level of polymorphism than that detected with restriction fragment length polymorphism (RFLP) or random amplified polymorphic DNA (RAPD) analyses. Our data indicate that this is not a result of greater polymorphism genetically, but rather technical reasons related to the detection methodology used for ISSR analysis.
Resumo:
The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.
Resumo:
Background Primary Immunodeficiencies (PIDs) represent unique opportunities to understand the operation of the human immune system. Accordingly, PIDs associated with autoimmune manifestations provide insights into the pathophysiology of autoimmunity as well as into the genetics of autoimmune diseases (AID). Epidemiological data show that there are PIDs systematically associated with AID, such as immune dysregulation, polyendocrinopathy, enteropathy, X-linked syndrome (IPEX), Omenn syndrome, autoinunune polyendocrinopathy-candidiasis-ectodertnal dystrophy (APECED), autoinumine lymphoproliferative syndrome (ALPS), and C1q deficiency, while strong associations are seen with a handful of other deficits. Conclusion We interpret such stringent disease associations, together with a wealth of observations in experimental systems, as indicating first of all that natural tolerance to body components is an active, dominant process involving many of the components that ensure responsiveness, rather than, as previously believed, the result of the mere purge of autoreactivities. More precisely, it seems that deficits of Treg cell development, functions, numbers, and T cell receptor repertoire are among the main factors for autoimmunity pathogenesis in many (if not all) PIDs most frequently presenting with autoimmune features. Clearly, other pathophysiological mechanisms are also involved in autoimmunity, but these seem less critical in the process of self-tolerance. Comparing the clinical picture of IPEX cases with those, much less severe, of ALPS or APECED, provides some assessment of the relative importance of each set of mechanisms.
Resumo:
We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.
Resumo:
The aim of the present study was to evaluate the clinicopathological, immunohistochemical, and molecular genetic features of gastrointestinal stromal tumors in Brazil and compare them with cases from other countries. Five hundred and thirteen cases were retrospectively analyzed. HE-stained sections and clinical information were reviewed and the immunohistochemical expression of CD117, CD34, smooth-muscle actin, S-100 protein, desmin, CD44v3 adhesion molecule, p53 protein, epidermal growth factor receptor, and Ki-67 antigen was studied using tissue microarrays. Mutation analysis of KIT and platelet-derived growth factor receptor-alpha genes was also performed. There was a slight female predominance (50.3%) and the median age at diagnosis was 59 years. The tumors were mainly located in the stomach (38.4%). Immunohistochemistry showed that CD117 was expressed in 95.7% of cases. Epidermal growth factor receptor expression was observed in 84.4% of tumors. p53 protein expression was found only in 2.6% of cases but all belonged to the high-risk group for aggressive behavior according to the National Institutes of Health consensus approach. No CD44v3 adhesion molecule expression was detected. KIT exon 11 mutations were the most frequent (62.2%). The present data confirm that gastrointestinal stromal tumors in Brazilian patients do not differ from tumors occurring in other countries.
Resumo:
Numerical optimisation methods are being more commonly applied to agricultural systems models, to identify the most profitable management strategies. The available optimisation algorithms are reviewed and compared, with literature and our studies identifying evolutionary algorithms (including genetic algorithms) as superior in this regard to simulated annealing, tabu search, hill-climbing, and direct-search methods. Results of a complex beef property optimisation, using a real-value genetic algorithm, are presented. The relative contributions of the range of operational options and parameters of this method are discussed, and general recommendations listed to assist practitioners applying evolutionary algorithms to the solution of agricultural systems. (C) 2001 Elsevier Science Ltd. All rights reserved.