A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm

Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.

Protein content and amino acid composition of some varieties of grain sorghum

Determination of the protein content and lysine levels of a number of nonhybrid varieties of grain sorghum indicates large variations in the protein content. Statistical analysis of data on amounts of lysine shows that a negative correlation exists between per cent lysine in the protein and per cent protein in the seed. The proportion of various protein fractions in endosperm of five varieties of grain sorghum of both low- and high-protein type has been determined. Results show that prolamine and glutelin are the principal protein fractions, and increased protein levels in sorghum varieties are correlated with an increase mainly in the prolamine fraction. Nine high- and low-protein varieties of grain sorghum have been analyzed for their amino acid composition by ion exchange procedures. One of the high-protein genetic varieties of sorghum has a high concentration of lysine in the seed. Amino acid composition of the protein fractions of two varieties is also reported. These data permit an evaluation of the nutritional quality of sorghum protein and factors that influence the quality of the protein.

A Dynamic Migration Model for self-adaptive Genetic Algorithms

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).

An automated framework for understanding structural variations in the binding grooves of MHC class II molecules

Background: MHC/HLA class II molecules are important components of the immune system and play a critical role in processes such as phagocytosis. Understanding peptide recognition properties of the hundreds of MHC class II alleles is essential to appreciate determinants of antigenicity and ultimately to predict epitopes. While there are several methods for epitope prediction, each differing in their success rates, there are no reports so far in the literature to systematically characterize the binding sites at the structural level and infer recognition profiles from them. Results: Here we report a new approach to compare the binding sites of MHC class II molecules using their three dimensional structures. We use a specifically tuned version of our recent algorithm, PocketMatch. We show that our methodology is useful for classification of MHC class II molecules based on similarities or differences among their binding sites. A new module has been used to define binding sites in MHC molecules. Comparison of binding sites of 103 MHC molecules, both at the whole groove and individual sub-pocket levels has been carried out, and their clustering patterns analyzed. While clusters largely agree with serotypic classification, deviations from it and several new insights are obtained from our study. We also present how differences in sub-pockets of molecules associated with a pair of autoimmune diseases, narcolepsy and rheumatoid arthritis, were captured by PocketMatch(13). Conclusion: The systematic framework for understanding structuralvariations in MHC class II molecules enables large scale comparison of binding grooves and sub-pockets, which is likely to have direct implications towards predicting epitopes and understanding peptide binding preferences.

An automated framework for understanding structural variations in the binding grooves of MHC class II molecules

Background: MHC/HLA class II molecules are important components of the immune system and play a critical role in processes such as phagocytosis. Understanding peptide recognition properties of the hundreds of MHC class II alleles is essential to appreciate determinants of antigenicity and ultimately to predict epitopes. While there are several methods for epitope prediction, each differing in their success rates, there are no reports so far in the literature to systematically characterize the binding sites at the structural level and infer recognition profiles from them. Results: Here we report a new approach to compare the binding sites of MHC class II molecules using their three dimensional structures. We use a specifically tuned version of our recent algorithm, PocketMatch. We show that our methodology is useful for classification of MHC class II molecules based on similarities or differences among their binding sites. A new module has been used to define binding sites in MHC molecules. Comparison of binding sites of 103 MHC molecules, both at the whole groove and individual sub-pocket levels has been carried out, and their clustering patterns analyzed. While clusters largely agree with serotypic classification, deviations from it and several new insights are obtained from our study. We also present how differences in sub-pockets of molecules associated with a pair of autoimmune diseases, narcolepsy and rheumatoid arthritis, were captured by PocketMatch(13). Conclusion: The systematic framework for understanding structural variations in MHC class II molecules enables large scale comparison of binding grooves and sub-pockets, which is likely to have direct implications towards predicting epitopes and understanding peptide binding preferences.

Variations in the satellited chromosomes ofCicer arietinum Linn.

The diversity in the morphology of the SAT-chromosomes of C. arietinum in different roots are analysed in the context of similar variations observed in the different cells of one of the roots. Intergrades between the two pairs of chromosomes with normal satellites and those with tandem ones were observed in anaphases. The differences in the number as well as the size of the SAT-grains of replicated chromosomes indicate that non-reciprocal translocations between sister chromosomes may be of parts of SAT-grains and not of entire ones.

Genetic characterization of Indian type O FMD virus 3A region in context with host cell preference

The 3A region of foot-and-mouth disease virus has been implicated in host range and virulence. For example, amino acid deletions in the porcinophilic strain (O/TAW/97) at 93-102 aa of the 153 codons long 3A protein have been recognized as the determinant of species specificity. In the present study, 18 type 0 FMDV isolates from India were adapted in different cell culture systems and the 3A sequence was analyzed. These isolates had complete 3A coding sequence (153 aa) and did not exhibit growth restriction in cells based on species of origin. The 3A region was found to be highly conserved at N-terminal half (1-75 aa) but exhibited variability or substitutions towards C-terminal region (80-153). Moreover the amino acid substitutions were more frequent in recent Indian buffalo isolates but none of the Indian isolates showed deletion in 3A protein, which may be the reason for the absence of host specificity in vitro. Further inclusive analysis of 3A region will reveal interesting facts about the variability of FMD virus 3A region in an endemic environment. (C) 2010 Elsevier B.V. All rights reserved.

Genetic algorithm for satellite customer assignment

The problem of assigning customers to satellite channels is considered. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of this approach with the standard optimization method is presented to show the advantages of this approach in terms of computation time

A multi-station satellite radio beacon study of ionospheric variations during total solar eclipses

Faraday rotation data obtained at Delhi, Kurukshetra, Hyderabad, Bangalore, Waltair, Nagpur and Calcutta during the total solar eclipse of 16 February 1980 and at Delhi during the total solar eclipse of 31 July 1981 have been analysed to detect the gravity waves generated by a total solar eclipse as hypothesized by Chimonas and Hines (1970, J. geophys. Res. 75, 875). It has been found that gravity waves can be generated by a total solar eclipse but their detection at ionospheric heights is critically dependent on the location of the observing station in relation to the eclipse path geometry. The distance of the observing station from the eclipse path should be more than 500 km in order to detect such gravity waves.

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.

Interannual Variations of Sea Surface Temperature over the Arabian Sea and the Indian Monsoon: A New Perspective

The interannual variation of surface fields over the Arabian Sea and Bay of Bengal are studied using data between 1900 and 1979. It is emphasized that the monthly mean sea surface temperature (SST) over the north Indian Ocean and monsoon rainfall are significantly affected by synoptic systems and other intraseasonal variations. To highlight the interannual signals it is important to remove the large-amplitude high-frequency noise and very low frequency long-term trends, if any. By suitable spatial and temporal averaging of the SST and the rainfall data and by removing the long-term trend from the SST data, we have been able to show that there exists a homogeneous region in the southeastern Arabian Sea over which the March�April (MA) SST anomalies are significantly correlated with the seasonal (June�September) rainfall over India. A potential of this premonsoon signal for predicting the seasonal rainfall over India is indicated. It is shown that the correlation between the SST and the seasonal monsoon rainfall goes through a change of sign from significantly positive with premonsoon SST to very small values with SST during the monsoon season and to significantly negative with SST during the post-monsoon months. For the first time, we have demonstrated that heavy or deficient rainfall years are associated with large-scale coherent changes in the SST (although perhaps of small amplitude) over the north Indian 0cean. We also indicate possible reasons for the apparent lack of persistence of the premonsoon SST anomalies.

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.