Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

On the analysis of notched concrete beams: From measurement with digital image correlation to identification with boundary element method of a cohesive model

A way of coupling digital image correlation (to measure displacement fields) and boundary element method (to compute displacements and tractions along a crack surface) is presented herein. It allows for the identification of Young`s modulus and fracture parameters associated with a cohesive model. This procedure is illustrated to analyze the latter for an ordinary concrete in a three-point bend test on a notched beam. In view of measurement uncertainties, the results are deemed trustworthy thanks to the fact that numerous measurement points are accessible and used as entries to the identification procedure. (C) 2010 Elsevier Ltd. All rights reserved.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Genetic Polymorphisms of Matrix Metalloproteinases: Susceptibility and Prognostic Implications for Prostate Cancer

Purpose: Prostate cancer is the most common tumor in males in Brazil. Single nucleotide polymorphisms have been demonstrated to exist in the promoter regions of matrix metalloproteinase genes and they are associated with the development and progression of some cancers. We investigated the correlation between MMP1, 2, 7 and 9 polymorphisms with susceptibility to prostate cancer, and classic prognostic parameters of prostate cancer. Materials and Methods: Genomic DNA was extracted using conventional protocols. The DNA sequence containing the polymorphic site was amplified by realtime polymerase chain reaction using TaqMan (R) fluorescent probes. Results: For the MMP1 gene the polymorphic allele was more common in the control group than in the prostate cancer group (p <0.001). For the MMP9 gene the incidence of the polymorphic homozygote genotype was higher in the prostate cancer group (p <0.001). For higher stage tumors (pT3) a polymorphic allele in the MMP2 gene was more common (p = 0.026). When considering Gleason score, the polymorphic homozygote genotype of MMP9 was more common in Gleason 6 or less tumors (p = 0.003), while a polymorphic allele in the MMP2 gene was more common in Gleason 7 or greater tumors (p = 0.042). Conclusions: MMP1 and MMP2 may protect against prostate cancer development and MMP9 may be related to higher risk. In contrast, MMP9 polymorphism was associated with a lower Gleason score and MMP2 polymorphism was associated with nonorgan confined disease.

Efficiency issues of evolutionary k-means

One of the top ten most influential data mining algorithms, k-means, is known for being simple and scalable. However, it is sensitive to initialization of prototypes and requires that the number of clusters be specified in advance. This paper shows that evolutionary techniques conceived to guide the application of k-means can be more computationally efficient than systematic (i.e., repetitive) approaches that try to get around the above-mentioned drawbacks by repeatedly running the algorithm from different configurations for the number of clusters and initial positions of prototypes. To do so, a modified version of a (k-means based) fast evolutionary algorithm for clustering is employed. Theoretical complexity analyses for the systematic and evolutionary algorithms under interest are provided. Computational experiments and statistical analyses of the results are presented for artificial and text mining data sets. (C) 2010 Elsevier B.V. All rights reserved.

Evolutionary fuzzy clustering of relational data

This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the data set to be clustered is described by a proximity matrix only (relational data) and the number of clusters must be automatically estimated from such data. A fuzzy variant of an evolutionary algorithm for relational clustering is derived and compared against two systematic (pseudo-exhaustive) approaches that can also be used to automatically estimate the number of fuzzy clusters in relational data. An extensive collection of experiments involving 18 artificial and two real data sets is reported and analyzed. (C) 2011 Elsevier B.V. All rights reserved.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

Inclusão da epistasia em modelo de avaliação genética de bovinos de corte compostos

Dados de bovinos compostos foram analisados para avaliar o efeito da epistasia nos modelos de avaliação genética. As características analisadas foram os pesos aos 205 (P205) e 390 dias (P390) e perímetro escrotal aos 390 dias (PE390). As análises foram realizadas pela metodologia de máxima verossimilhança considerando-se dois modelos: o modelo 1 incluiu como covariáveis os efeitos aditivos diretos e maternos, e os não aditivos das heterozigoses para os efeitos diretos e para o materno total, e o modelo 2 considerou também o efeito direto de epistasia. Para comparação dos modelos, foram utilizados o critério de informação de Akaike (AIC) e o critério de informação Bayesiano de Schwartz (BIC), e o teste de razão de verossimilhança. A inclusão da epistasia no modelo de avaliação genética pouco alterou as estimativas de componentes de (co)variâncias genéticas aditivas e, consequentemente, as herdabilidades. O teste de verossimilhança e o critério de Akaike sugeriram que o modelo 2, que inclui a epistasia, apresentou maior aderência aos dados para todas as características analisadas. O critério BIC indicou este modelo como o melhor apenas para P205. Para análise genética dessa população, o modelo que considerou o efeito de epistasia foi o mais adequado.

Genotype-phenotype correlation in Brazillian Rett syndrome patients

BACKGROUND: Rett syndrome (RS) is a severe neurodevelopmental X-linked dominant disorder caused by mutations in the MECP2 gene. PURPOSE: To search for point mutations on the MECP2 gene and to establish a correlation between the main point mutations found and the phenotype. METHOD: Clinical evaluation of 105 patients, following a standard protocol. Detection of point mutations on the MECP2 gene was performed on peripheral blood DNA by sequencing the coding region of the gene. RESULTS: Classical RS was seen in 68% of the patients. Pathogenic point mutations were found in 64.1% of all patients and in 70.42% of those with the classical phenotype. Four new sequence variations were found, and their nature suggests patogenicity. Genotype-phenotype correlations were performed. CONCLUSION: Detailed clinical descriptions and identification of the underlying genetic alterations of this Brazilian RS population add to our knowledge of genotype/phenotype correlations, guiding the implementation of mutation searching programs.

An approach based on neural networks for estimation and generalization of crossflow filtration processes

The crossflow filtration process differs of the conventional filtration by presenting the circulation flow tangentially to the filtration surface. The conventional mathematical models used to represent the process have some limitations in relation to the identification and generalization of the system behaviour. In this paper, a system based on artificial neural networks is developed to overcome the problems usually found in the conventional mathematical models. More specifically, the developed system uses an artificial neural network that simulates the behaviour of the crossflow filtration process in a robust way. Imprecisions and uncertainties associated with the measurements made on the system are automatically incorporated in the neural approach. Simulation results are presented to justify the validity of the proposed approach. (C) 2007 Elsevier B.V. All rights reserved.

The effect of flow arrangement on the pressure drop of plate heat exchangers

For the optimal design of plate heat exchangers (PHEs), an accurate thermal-hydraulic model that takes into account the effect of the flow arrangement on the heat load and pressure drop is necessary. In the present study, the effect of the flow arrangement on the pressure drop of a PHE is investigated. Thirty two different arrangements were experimentally tested using a laboratory scale PHE with flat plates. The experimental data was used for (a) determination of an empirical correlation for the effect of the number of passes and number of flow channels per pass on the pressure drop; (b) validation of a friction factor model through parameter estimation; and (c) comparison with the simulation results obtained with a CFD (computational fluid dynamics) model of the PHE. All three approaches resulted in a good agreement between experimental and predicted values of pressure drop. Moreover, the CFD model is used for evaluating the flow maldistribution in a PHE with two channels Per Pass. (c) 2008 Elsevier Ltd. All rights reserved.

Population structure of the migratory fish Prochilodus lineatus (Characiformes) from rio Grande basin (Brazil), an area fragmented by dams

1. Prochilodus lineatus (Prochilodontidae, Characiformes) is a migratory species of great economic importance both in fisheries and aquaculture that is found throughout the Jacui, Paraiba do Sul, Parana, Paraguay and Uruguay river basins in South America. Earlier population studies of P. lineatus in the rio Grande basin (Parana basin) indicated the existence of a single population; however, the range of this species has been fragmented by the construction of several dams. Such dams modified the environmental conditions and could have constrained the reproductive migration of P. lineatus, possibly leading to changes in the population genetic structure. 2. In order to evaluate how genetic diversity is allocated in the rio Grande basin, 141 specimens of P. lineatus from eight collection sites were analysed using polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) with 15 restriction enzymes. 3. Forty-six haplotypes were detected, and 70% of them are restricted. The mean genetic variability indexes (h = 0.7721 and pi = 1.6%) were similar to those found in natural populations with a large effective size. Fst and Exact Test values indicated a lack of structuring among the samples, and the model of isolation by distance was tested and rejected. 4. The haplotype network indicated that this population of P. lineatus has been maintained as a single variable stock with some differences in the genetic composition (haplotypes) between samples. Indications of population expansion were detected, and this finding was supported by neutrality tests and mismatch distribution analyses. 5. The present study focused on regions between dams to serve as a parameter for further evaluations of genetic variability and the putative impact of dams and repopulation programmes in natural populations of P. lineatus. Copyright (C) 2011 John Wiley & Sons, Ltd.

Genetic Algorithm for the Determination of Linear Viscoelastic Relaxation Spectrum from Experimental Data

Conventional procedures employed in the modeling of viscoelastic properties of polymer rely on the determination of the polymer`s discrete relaxation spectrum from experimentally obtained data. In the past decades, several analytical regression techniques have been proposed to determine an explicit equation which describes the measured spectra. With a diverse approach, the procedure herein introduced constitutes a simulation-based computational optimization technique based on non-deterministic search method arisen from the field of evolutionary computation. Instead of comparing numerical results, this purpose of this paper is to highlight some Subtle differences between both strategies and focus on what properties of the exploited technique emerge as new possibilities for the field, In oder to illustrate this, essayed cases show how the employed technique can outperform conventional approaches in terms of fitting quality. Moreover, in some instances, it produces equivalent results With much fewer fitting parameters, which is convenient for computational simulation applications. I-lie problem formulation and the rationale of the highlighted method are herein discussed and constitute the main intended contribution. (C) 2009 Wiley Periodicals, Inc. J Appl Polym Sci 113: 122-135, 2009

Identification of Elastic, Dielectric, and Piezoelectric Constants in Piezoceramic Disks

Three-dimensional modeling of piezoelectric devices requires a precise knowledge of piezoelectric material parameters. The commonly used piezoelectric materials belong to the 6mm symmetry class, which have ten independent constants. In this work, a methodology to obtain precise material constants over a wide frequency band through finite element analysis of a piezoceramic disk is presented. Given an experimental electrical impedance curve and a first estimate for the piezoelectric material properties, the objective is to find the material properties that minimize the difference between the electrical impedance calculated by the finite element method and that obtained experimentally by an electrical impedance analyzer. The methodology consists of four basic steps: experimental measurement, identification of vibration modes and their sensitivity to material constants, a preliminary identification algorithm, and final refinement of the material constants using an optimization algorithm. The application of the methodology is exemplified using a hard lead zirconate titanate piezoceramic. The same methodology is applied to a soft piezoceramic. The errors in the identification of each parameter are statistically estimated in both cases, and are less than 0.6% for elastic constants, and less than 6.3% for dielectric and piezoelectric constants.

Jointly multi-user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.