Filter design using radial basis function neural network and genetic algorithm for improved operational health monitoring

The problem of denoising damage indicator signals for improved operational health monitoring of systems is addressed by applying soft computing methods to design filters. Since measured data in operational settings is contaminated with noise and outliers, pattern recognition algorithms for fault detection and isolation can give false alarms. A direct approach to improving the fault detection and isolation is to remove noise and outliers from time series of measured data or damage indicators before performing fault detection and isolation. Many popular signal-processing approaches do not work well with damage indicator signals, which can contain sudden changes due to abrupt faults and non-Gaussian outliers. Signal-processing algorithms based on radial basis function (RBF) neural network and weighted recursive median (WRM) filters are explored for denoising simulated time series. The RBF neural network filter is developed using a K-means clustering algorithm and is much less computationally expensive to develop than feedforward neural networks trained using backpropagation. The nonlinear multimodal integer-programming problem of selecting optimal integer weights of the WRM filter is solved using genetic algorithm. Numerical results are obtained for helicopter rotor structural damage indicators based on simulated frequencies. Test signals consider low order polynomial growth of damage indicators with time to simulate gradual or incipient faults and step changes in the signal to simulate abrupt faults. Noise and outliers are added to the test signals. The WRM and RBF filters result in a noise reduction of 54 - 71 and 59 - 73% for the test signals considered in this study, respectively. Their performance is much better than the moving average FIR filter, which causes significant feature distortion and has poor outlier removal capabilities and shows the potential of soft computing methods for specific signal-processing applications.

Genetic Heterogeneity in Wild Isolates of Cellular Slime Mold Social Groups

This study addresses the issues of spatial distribution, dispersal, and genetic heterogeneity in social groups of the cellular slime molds (CSMs). The CSMs are soil amoebae with an unusual life cycle that consists of alternating solitary and social phases. Because the social phase involves division of labor with what appears to be an extreme form of "altruism", the CSMs raise interesting evolutionary questions regarding the origin and maintenance of sociality. Knowledge of the genetic structure of social groups in the wild is necessary for answering these questions. We confirm that CSMs are widespread in undisturbed forest soil from South India. They are dispersed over long distances via the dung of a variety of large mammals. Consistent with this mode of dispersal, most social groups in the two species examined for detailed study, Dictyostelium giganteum and Dictyostelium purpureum, are multi-clonal.

Optimal reservoir operation for irrigation of multiple crops using genetic algorithms

This paper presents a genetic algorithm (GA) model for obtaining an optimal operating policy and optimal crop water allocations from an irrigation reservoir. The objective is to maximize the sum of the relative yields from all crops in the irrigated area. The model takes into account reservoir inflow, rainfall on the irrigated area, intraseasonal competition for water among multiple crops, the soil moisture dynamics in each cropped area, the heterogeneous nature of soils. and crop response to the level of irrigation applied. The model is applied to the Malaprabha single-purpose irrigation reservoir in Karnataka State, India. The optimal operating policy obtained using the GA is similar to that obtained by linear programming. This model can be used for optimal utilization of the available water resources of any reservoir system to obtain maximum benefits.

Filter design using radial basis function neural network and genetic algorithm for improved operational health monitoring

The problem of denoising damage indicator signals for improved operational health monitoring of systems is addressed by applying soft computing methods to design filters. Since measured data in operational settings is contaminated with noise and outliers, pattern recognition algorithms for fault detection and isolation can give false alarms. A direct approach to improving the fault detection and isolation is to remove noise and outliers from time series of measured data or damage indicators before performing fault detection and isolation. Many popular signal-processing approaches do not work well with damage indicator signals, which can contain sudden changes due to abrupt faults and non-Gaussian outliers. Signal-processing algorithms based on radial basis function (RBF) neural network and weighted recursive median (WRM) filters are explored for denoising simulated time series. The RBF neural network filter is developed using a K-means clustering algorithm and is much less computationally expensive to develop than feedforward neural networks trained using backpropagation. The nonlinear multimodal integer-programming problem of selecting optimal integer weights of the WRM filter is solved using genetic algorithm. Numerical results are obtained for helicopter rotor structural damage indicators based on simulated frequencies. Test signals consider low order polynomial growth of damage indicators with time to simulate gradual or incipient faults and step changes in the signal to simulate abrupt faults. Noise and outliers are added to the test signals. The WRM and RBF filters result in a noise reduction of 54 - 71 and 59 - 73% for the test signals considered in this study, respectively. Their performance is much better than the moving average FIR filter, which causes significant feature distortion and has poor outlier removal capabilities and shows the potential of soft computing methods for specific signal-processing applications. (C) 2005 Elsevier B. V. All rights reserved.

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the ``evaporation concept'' applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The ``evaporation concept'' is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.

Microcycle conidiation and its genetic basis in Neurospora crassa

Some wild isolates of Neurospora show microcycle conidiation in liquid culture under continuous agitation. Macroconidia from agar-grown mycelial cultures germinated in liquid and the germlings spontaneously produced conidia with no intervening mycelial phase. Three types of microcycle conidiation were seen among progeny of N. crassa Vickramam A x N. crassa a wild-type: (1) multinucleate blastoconidia produced by apical budding and septation, (2) multinucleate arthroconidia produced by holothallic septation and disarticulation of cells, and (3) uninucleate microconidia produced directly from conidiogenous cells of the germlings. Two genes were identified which control specific patterns of microcycle conidiogenesis. A single gene mcb in linkage group VR near al-3 (3.2% recombination) controls blastoconidiation. This gene is epistatic to gene mcm located in linkage group IIL, very near ro-7 (1.4%). mcm controls both microconidiation and arthroconidiation depending on temperature. Strains of genotype mcm produce microconidia almost exclusively at 18-22 degrees C, but arthroconidia with few or no microconidia at 30 degrees C. Because they result in rapid and synchronized conidiation in liquid culture, the two genes should be useful for studies of developmental gene regulation. mcm makes it possible to obtain large quantities of pure microconidia rapidly for experimentation.

A Genetic Study of Immunoglobulin E and Atopic Disease Based on Families Ascertained through Asthmatic Children

In order to investigate the modes of inheritance of serum immunoglobulin E (IgE) levels and atopic disease, serum IgE levels and data on allergic disease were obtained from 42 families ascertained through asthmatic children visiting an allergy clinic. Although the mean IgE levels were elevated (mean 637 U/ml), the prevalence of atopic disease in this population was surprisingly low. When the data were analyzed using complex segregation analysis, no major locus could be detected. Moreover, the polygenic heritability was unexpectedly small even though the correlation between serum IgE levels and the liability to atopic disease was around 0.4. Given this unusual set of findings, it is postulated that parasitic infections in this population have (in accordance with well-established results of parasitic disease) caused both elevated levels of serum IgE and a decreased prevalence of allergic disease with the possible masking of the various genetic components of serum IgE levels and atopic disease.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

Transposable element-medicated evolution of sex: A population genetic model

For a population made up of individuals capable of sexual as well as asexual modes of reproduction, conditions for the spread of a transposable element are explored using a one-locus, two-haplotype model. The analysis is then extended to include the possibility that the transposable element can modulate the probability of sexual reproduction, thus casting Hickey’s (1982,Genetics 101: 519–531) suggestion in a population genetics framework. The model explicitly includes the cost of sexual reproduction, fitness disadvantage to the transposable element, probability of transposition, and the predisposition for sexual reproduction in the presence and absence of the transposable element. The model predicts several kinds of outcome, including initial frequency dependence and stable polymorphism. More importantly, it is seen that for a wide range of parameter values, the transposable element can go to fixation. Therefore it is able to convert the population from a predominantly asexual to a predominantly sexual mode of reproduction. Viewed in conjunction with recent results implicating short stretches of apparently non-coding DNA in sex determination (McCoubreyet al. 1988,Science 242: 1146–1151), the model hints at the important role this mechanism could have played in the evolution of sexuality.

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

The K-means algorithm for clustering is very much dependent on the initial seed values. We use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting proper initial seed values in the K-means algorithm. Results obtained are very encouraging and in most of the cases, on data sets having well separated clusters, the proposed scheme reached a global minimum.

Genetic transformation of Brassica nigra by agrobacterium based vector and direct plasmid uptake

Genetic transformation systems have been established for Brassica nigra (cv. IC 257) by using an Agrobacterium binary vector as well as by direct DNA uptake of a plasmid vector. Both the type of vectors carried nptII gene and gus gene. For Agrobacterium mediated transformation, hypocotyl tissue explants were used, and up to 33% of the explants produced calli on selection medium. All of these expressed B-glucuronidase gene on histochemical staining. Protoplasts isolated from hypocotyl tissues of seedlings could be transformed with a plasmid vector by FEG mediated uptake of vector DNA. A number of fertile kanamycin resistant plants were obtained using both the methods, and their transformed nature was confirmed by Southern blot analysis and histochemical staining for GUS. Backcrossed and selfed progenies of these transformed plants showed the presence of npt and gus genes.

Permanent Genetic Resources added to Molecular Ecology Resources Database 1 August 2010-30 September 2010

This article documents the addition of 229 microsatellite marker loci to the Molecular Ecology Resources Database. Loci were developed for the following species: Acacia auriculiformis x Acacia mangium hybrid, Alabama argillacea, Anoplopoma fimbria, Aplochiton zebra, Brevicoryne brassicae, Bruguiera gymnorhiza, Bucorvus leadbeateri, Delphacodes detecta, Tumidagena minuta, Dictyostelium giganteum, Echinogammarus berilloni, Epimedium sagittatum, Fraxinus excelsior, Labeo chrysophekadion, Oncorhynchus clarki lewisi, Paratrechina longicornis, Phaeocystis antarctica, Pinus roxburghii and Potamilus capax. These loci were cross-tested on the following species: Acacia peregrinalis, Acacia crassicarpa, Bruguiera cylindrica, Delphacodes detecta, Tumidagena minuta, Dictyostelium macrocephalum, Dictyostelium discoideum, Dictyostelium purpureum, Dictyostelium mucoroides, Dictyostelium rosarium, Polysphondylium pallidum, Epimedium brevicornum, Epimedium koreanum, Epimedium pubescens, Epimedium wushanese and Fraxinus angustifolia.

DNA Binding, Coprotease, and Strand Exchange Activities of Mycobacterial RecA Proteins: Implications for Functional Diversity among RecA Nucleoprotein Filaments

One of the fundamental questions concerning homologous recombination is how RecA or its homologues recognize several DNA sequences with high affinity and catalyze all the diverse biological activities. In this study, we show that the extent of single-stranded DNA binding and strand exchange (SE) promoted by mycobacterial RecA proteins with DNA substrates having various degrees of GC content was comparable with that observed for Escherichia coli RecA. However, the rate and extent of SE promoted by these recombinases showed a strong negative correlation with increasing amounts of sequence divergence embedded at random across the length of the donor strand. Conversely, a positive correlation was seen between SE efficiency and the degree of sequence divergence in the recipient duplex DNA. The extent of heteroduplex formation was not significantly affected when both the pairing partners contained various degrees of sequence divergence, although there was a moderate decrease in the case of mycobacterial RecA proteins with substrates containing larger amounts of sequence divergence. Whereas a high GC content had no discernible effect on E. coli RecA coprotease activity, a negative correlation was apparent between mycobacterial RecA proteins and GC content. We further show clear differences in the extent of SE promoted by E. coli and mycobacterial RecA proteins in the presence of a wide range of ATP:ADP ratios. Taken together, our findings disclose the existence of functional diversity among E. coli and mycobacterial RecA nucleoprotein filaments, and the milieu of sequence divergence (i.e., in the donor or recipient) exerts differential effects on heteroduplex formation, which has implications for the emergence of new genetic variants.

Genetic algorithms: a survey

Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception