A novel dynamic time delay neural network is proposed for ultrasonic motors identification and control in this paper. By introducing time delay neurons, the neural network identifier and controller of ultrasonic motor...
详细信息
In this paper an intrusion detection method based on Dynamic Growing Neural Network (DGNN) for wireless networking is presented. DGNN is based on the Hebbian learning rule and adds new neurons under certain conditions...
详细信息
An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antib...
详细信息
An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antibody＇s fitness and setting the dynamic threshold value. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance for preventing premature convergence.
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve...
详细信息
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: genetic algorithm (GA) and particle swarm optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast saccharomyces cerevisiae transcription factor binding sites and CRP binding sites. The results on saccharomyces cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs sampler
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with r...
详细信息
Modularity and rigor are two key elements for multi-agent technology. Hong Zhu's multi-agent system (MAS) development method provides proper language facilities supporting modularity. To enhance this method with rigor advocates a DL method to map the specification of MAS into a DL TBox. Thus, we can use the existing DL reasoners and systems to verify and validate some system's properties.
Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a nove...
Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a novel approach to identify transcription factor binding sites. This approach combines greedy method and genetic algorithm (CGGA) to search conserved segment in the given sequence set. A new greedy method which can efficiently search a local optimal result is proposed. In order to solve the high complexity of this algorithm, we also give an effective improvement for this method. Then, we describe how to combine genetic algorithm with this greedy method to find the more optimal results. Greedy method is combined to the fitness function of the genetic algorithm. We apply this approach on two different TFBS sets and the results show that it can find correct result both effective and efficient, and for CRP binding sites, it get a more accurate result than Gibbs Sampler, AlignACE and MDGA.
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classificat...
详细信息
ISBN:
(纸本)9781932415988
Coordination models can be classified into several classes, such as data-driven vs. control-driven coordination models, dependent vs. emergent coordination models, and hybrid coordination models. All these classifications are based upon implementation details. However, interaction is the kernel aspect of coordination, and coordination is the outcome of interactions between agents, so here, we give another kind of taxonomy based on interaction types, which are coordination models based on direct interactions and indirect interactions. Using this taxonomy, all coordination models are classified into two classes with no intersection, in addition, coordination models with indirect interactions and emergent behaviors are the direction of future work.
In Containing Order Rough Set Methodology (CORS), ordered attribute 'criterion' is introduced. Criterion is related semantically with decision attributes, which results in producing more rational and significa...
详细信息
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection...
详细信息
ISBN:
(纸本)9781932415988
Coordination is of great significance to multi-agent systems, and in recent years, there has been much fruitful achievement in this area, such as refinement of dependencies under some hypothesis, the dynamic selection of coordination mechanisms, new coordination models using swarm intelligence, new methods using varied techniques like case based reasoning, reinforcement learning, distributed logic programming, game theory, etc.. In this paper, we survey these achievement as a general study of coordination, including, the nature of coordination, coordination mechanisms, coordination approaches, relationship among coordination mechanisms and approaches, coordination methodologies, conversational aspects of coordination and software architectures. And along with this survey, we give our view of future research direction of coordination.
Identification of transcription factor binding sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new ...
详细信息
Identification of transcription factor binding sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new approach to predict TFBS. This approach uses position weight matrix (PWM) to represent binding sites and uses genetic algorithm (GA) to search the best matrix. A new coding method so called multiple-variable coding is proposed in GA. We apply it on two transcription factors rebl and mgl. The result shows that this approach can find most of the known sites, which indicates that this method is very effective
暂无评论