Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reasons: (1) thousands of genes are involv...
详细信息
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reasons: (1) thousands of genes are involved in one living cell;(2) complex dynamic and nonlinear relationships exist among genes;(3) a substantial amount of noise is involved in the data, and (4) the typical small sample size is very small compared to the number of genes. We hypothesize we can enhance our understanding of gene interactions in important biological processes (differentiation, cell cycle, and development, etc) and improve the inference accuracy of a GRN by (1) incorporating prior biological knowledge into the inference scheme, (2) integrating multiple biological data sources, and (3) decomposing the inference problem into smaller network modules. Results: This study presents a novel GRN inference method by integrating gene expression data and gene functional category information. The inference is based on module network model that consists of two parts: the module selection part and the network inference part. The former determines the optimal modules through fuzzy c-mean (FCM) clustering and by incorporating gene functional category information, while the latter uses a hybrid of particleswarmoptimization and recurrent neural network (PSO-RNN) methods to infer the underlying network between modules. Our method is tested on real data from two studies: the development of rat central nervous system (CNS) and the yeast cell cycle process. The results are evaluated by comparing them to previously published results and gene ontology annotation information. Conclusion: The reverse engineering of GRNs in time course gene expression data is a major obstacle in system biology due to the limited number of time points. Our experiments demonstrate that the proposed method can address this challenge by: (1) preprocessing gene expression data (e. g. normalization and missing value imputation)
DNA chips are used for experiments on genes and provide useful information that could be further analyzed. Instead of experimenting with real genes which are expensive, DNA chips are increasingly being used for biolog...
详细信息
ISBN:
(纸本)9781934272442
DNA chips are used for experiments on genes and provide useful information that could be further analyzed. Instead of experimenting with real genes which are expensive, DNA chips are increasingly being used for biological experiments. The data provided by the DNA chips could be represented as a two dimensional matrix, in which one axis represent genes and the other represent samples. Extracting data from the DNA chips with high accuracy and finding out the patterns or useful information from such data has become a very important issue. Some commonly used methods to find meaningful information from the data are clustering and classification. In this paper, we propose clustering and classification mechanisms that are based on the particle swarm optimization algorithm. Considering that DNA chip data is extremely large and has a fuzzy characteristic, an algorithm that imitates the ecosystem such as the particle swarm optimization algorithm is suitable to be used for analyzing such data. Experiments show that the algorithms can efficiently cluster and classify DNA chip data.
This paper presents an approach based on idle time windows(ITWs) and particleswarmoptimization(PSO) algorithm to solve dynamic scheduling of multi-task for hybrid *** idea of ITW is introduced,then the dynamic updat...
详细信息
This paper presents an approach based on idle time windows(ITWs) and particleswarmoptimization(PSO) algorithm to solve dynamic scheduling of multi-task for hybrid *** idea of ITW is introduced,then the dynamic updating rules of the sets of ITWs are explained in *** the sets of ITWs of machines as constraints, the mathematical model is presented for dynamic scheduling of multi-task for hybrid *** PSO algorithm is proposed in order to solve this *** results of simulation indicate that this approach satisfies the demand of dynamic scheduling of multi-task.
To solve the multi-robot task allocation (MRTA) especially in unknown complex environment, a novel dynamic algorithm was put forward with the advantages of wireless sensor network (WSN). The architecture and sensor fu...
详细信息
ISBN:
(纸本)9781424421831
To solve the multi-robot task allocation (MRTA) especially in unknown complex environment, a novel dynamic algorithm was put forward with the advantages of wireless sensor network (WSN). The architecture and sensor fusion of WSN were discussed. particleswarmoptimization (PSO) algorithm based on bionic swarm intelligence was used for solution of the multi-objective optimization. A practical implementation with real WSN and real mobile robots were carried out. The successful implementation of tasks validates the efficiency, stability and accuracy of the proposed algorithm.
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become very slow. On the contrary, the gradient...
详细信息
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become very slow. On the contrary, the gradient descending method can achieve faster convergent speed around global optimum, and at the same time, the convergent accuracy can be higher. So in this paper, a hybrid algorithm combining particleswarmoptimization (PSO) algorithm with back-propagation (BP) algorithm, also referred to as PSO-BP algorithm, is proposed to train the weights of feedforward neural network (FNN), the hybrid algorithm can make use of not only strong global searching ability of the PSOA, but also strong local searching ability of the BP algorithm. In this paper, a novel selection strategy of the inertial weight is introduced to the PSO algorithm. In the proposed PSO-BP algorithm, we adopt a heuristic way to give a transition from particleswarm search to gradient descending search. In this paper, we also give three kind of encoding strategy of particles, and give the different problem area in which every encoding strategy is used. The experimental results show that the proposed hybrid PSO-BP algorithm is better than the Adaptive particle swarm optimization algorithm (APSOA) and BP algorithm in convergent speed and convergent accuracy. (c) 2006 Elsevier Inc. All rights reserved.
The present paper describes a fundamental study on structural bending design to reduce noise using a new evolutionary population-based heuristic algorithm called the particle swarm optimization algorithm (PSOA). The p...
详细信息
The present paper describes a fundamental study on structural bending design to reduce noise using a new evolutionary population-based heuristic algorithm called the particle swarm optimization algorithm (PSOA). The particle swarm optimization algorithm is a parallel evolutionary computation technique proposed by Kennedy and Eberhart in 1995. This algorithm is based on the social behavior models for bird flocking, fish schooling and other models investigated by zoologists. Optimal structural design problems to reduce noise are highly nonlinear, so that most conventional methods are difficult to apply. The present paper investigates the applicability of PSOA to such problems. Optimal bending design of a vibrating plate using PSOA is performed in order to minimize noise radiation. PSOA can be effectively applied to such nonlinear acoustic radiation optimization.
A reconfigurable manufacturing system (RMS) is designed for rapid adjustment of functionalities in response to market changes. A RMS consists of a number of reconfigurable machine tools (RMTs) for processing different...
详细信息
A reconfigurable manufacturing system (RMS) is designed for rapid adjustment of functionalities in response to market changes. A RMS consists of a number of reconfigurable machine tools (RMTs) for processing different jobs using different processing modules. The potential benefits of a RMS may not be materialized if not properly designed. This paper focuses on RMT design optimization considering three important yet conflicting factors: configurability, cost and process accuracy. The problem is formulated as a multi-objective model. A mechanism is developed to generate and evaluate alternative designs. A modified fuzzy-Chebyshev programming (MFCP) method is proposed to achieve a preferred compromise of the design objectives. Unlike the original fuzzy-Chebyshev programming (FCP) method which imposes an identical satisfaction level for all objectives regardless of their relative importance, the MFCP respects their priority order. This method also features an adaptive satisfaction-level-dependent process to dynamically adjust objective weights in the search process. A particle swarm optimization algorithm (PSOA) is developed to provide quick solutions. The application of the proposed approach is demonstrated using a reconfigurable boring machine. Our computational results have shown that the combined MFCP and PSOA algorithm is efficient and robust. The advantages of the MFCP over the original FCP are also illustrated based on the results.
Due to the existence of singular configurations within the workspace for a platform-type parallel manipulator (PPM), the actuating force demands increase drastically as the PPM approaches or crosses singular points. T...
详细信息
Due to the existence of singular configurations within the workspace for a platform-type parallel manipulator (PPM), the actuating force demands increase drastically as the PPM approaches or crosses singular points. Therefore, in this report, a numerical technique is presented to plan a singularity-free trajectory of the PPM for minimum actuating effort and reactions. By using the parametric trajectory representation, the singularity-free trajectory planning problem can be cast to the determination of undetermined control points, after which a particle swarm optimization algorithm is employed to find the optimal control points. This algorithm ensures that the obtained trajectories can avoid singular points within the workspace and that the PPM has the minimum actuating effort and reactions. Simulations and discussions are presented to demonstrate the effectiveness of the algorithm.
An optimum furnace charge plan model for steelmaking continuous casting planning and scheduling is presented. An improved particleswarmoptimization is presented to solve the optimum charge plan problem. Simulations ...
详细信息
ISBN:
(纸本)0780386620
An optimum furnace charge plan model for steelmaking continuous casting planning and scheduling is presented. An improved particleswarmoptimization is presented to solve the optimum charge plan problem. Simulations have been carried and the results show that the improved PSO has good performance than the standard PSO. This improved PSO has been used to solve the optimum charge plan problem. The computation with practical data shows that the model and the solving method are very effective.
Mechanical property prediction of hot rolled strip is one of the hotspots in material processing research. To avoid the local infinitesimal defect and slow constringency in pure BP algorithm, a kind of global optimiza...
详细信息
Mechanical property prediction of hot rolled strip is one of the hotspots in material processing research. To avoid the local infinitesimal defect and slow constringency in pure BP algorithm, a kind of global optimizationalgorithm-particleswarmoptimization (PSO) is adopted. The algorithm is combined with the BP rapid training algorithm, and then, a kind of new neural network (NN) called PSO-BP NN is established. With the advantages of global optimization ability and the rapid constringency of the BP rapid training algorithm, the new algorithm fully shows the ability of nonlinear approach of multilayer feedforward network, improves the performance of NN, and provides a favorable basis for further online application of a comprehensive model.
暂无评论