检索结果-内蒙古大学图书馆

A dynamic time delay neural network for ultrasonic motor identification and control

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Liang, Yanchun Zhang, Jie Xu, Xu Yang, Xiaowei Hao, Zhifeng Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics Jilin University Changchun 130012 China School of Mathematical Science South China University of Technology Guangzhou 510640 China

ISBN: (纸本)3540344373

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 motors are constructed. Both of them are trained online by using an improved back-propagation algorithm. The usefulness and validity of the presented algorithm is examined by the experiments. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

ASYNCHRONOUS UPDATING ALGORITHM FOR CONTINUOUS MOVING OBJECTS QUERIES

ASYNCHRONOUS UPDATING ALGORITHM FOR CONTINUOUS MOVING OBJECT...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： XIN-YING WANG SHENG-SHENG WANG ZHENG-XUAN WANG College of computer science and technology Key laboratory of symbolic computing and knowledge engineering of ministry of education Jilin University Changchun 130012China

Continuous queries for moving objects are becoming more and more important due to the increasing number of application domains that deal with moving entities. The asynchronous updating algorithm for continuous queries of moving objects is superior to synchronous updating algorithms in communication cost. By improving Haibo Hu's rectangle safe region strategy we proposed a new continuous queries algorithm. Circle safe region and dynamic interval are adopted in our algorithm. Theory proof and experiment results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangle safe region algorithms in terms of monitoring accuracy, communication cost and CPU time. Furthermore, the mobile terminals need not have any computation ability in our algorithm.

关键词： Moving objects database continuous spatial query spatio-temporal reasoning

来源：评论

学校读者我要写书评

暂无评论

Improved Algorithm for Continuous Moving Objects Queries

Improved Algorithm for Continuous Moving Objects Queries

引用

Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)

作者： Shengsheng Wang Xinying Wang Da-you Liu Qiangyuan Yu College of computer science and technology Key laboratory of symbolic computing and knowledge engineering of ministry of education Jilin University Changchun 130012China

ISBN: (纸本)1424404754

Moving objects databases are becoming more and more popular due to the increasing number of application domains that deal with moving entities. Continuous queries are important in moving objects databases. We summarize three types of continuous queries, but only two of them have been studied before. We proposed new algorithms to process the other two types of queries. Experiment results all show that our algorithms is excellent in monitoring accuracy, communication cost and CPU load balance.

关键词： Moving Database algorithms

来源：评论

学校读者我要写书评

暂无评论

An Improved Artificial Immune Algorithm with a Dynamic Threshold

引用

Journal of Bionic engineering 2006年第2期3卷 93-97页

作者： Zhang Qiao Xu Xu Liang Yan-chun Key Laboratory of Symbol Computation and Knowledge Engineering （Ministry of Education P. R. China） Qianwei Campus Jilin University Changchun 130012 P. R. China College of Mathematics Qianwei Campus Jilin University Changchun 130012 P. R. China

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.

关键词： dynamic threshold artificial immune algorithm genetic algorithm antibody

来源：评论

学校读者我要写书评

暂无评论

Approach to automated software design improvement

引用

Ruan Jian Xue Bao/Journal of Software 2006年第4期17卷 703-712页

作者： Feng, Tie Zhang, Jia-Chen Wang, Hong-Yuan Jin, Chun-Zhao Key Laboratory Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

Object-Oriented software design improving technology is an effective means to increase system flexibility for adapting to future requirement variation and expansion. In this paper, a software design improving approach, based on micro-architecture anti-pattern and case based reasoning, is presented to improve software quality and maintainability. In this approach, problematic, inflexible structures and corresponding refactoring alternatives at micro-architecture level are formally defined and described as cases. Their organization and index mechanism in the case base are studied. Following the 4R procedures of CBR, similarity measurement methods on class diagrams, sequence diagrams, OO quality metric factors, and semantic constraints are discussed. Based on the measurement results, some algorithms on identifying anti-patterns instances in a given original design and replacing them by designs with high quality are presented. Furthermore, a supporting system CBDIT is developed to aid this approach.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Identification of Transcription Factor Binding Sites Using GA and PSO

Identification of Transcription Factor Binding Sites Using G...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Xiao-yu Chang Chun-guang Zhou Yan-wen Li Ping Hu College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University China College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education department of computer science Northeast Normal University Changchun China

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

关键词： Evolutionary computation Pulse width modulation Genomics Bioinformatics Genetic algorithms Particle swarm optimization Biology computing Evolution (biology) Educational institutions Computer science

来源：评论

学校读者我要写书评

暂无评论

Combining Greedy Method and Genetic Algorithm to Identify Transcription Factor Binding Sites

Combining Greedy Method and Genetic Algorithm to Identify Tr...

引用

International Conference on Hybrid Intelligent Systems (HIS)

作者： Wanyu Wang Xiaoyu Chang Chunguang Zhou College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ADVANCES IN MULTI-AGENT COORDINATION

ADVANCES IN MULTI-AGENT COORDINATION

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： LI JIANG DA-YOU LIU College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Dnowledge Engineering of Ministry of Education Jilin Univ

Coordination is essential for five reasons: preventing anarchy or chaos;efficiency;meeting global constraints;distributed information, expertise or resources;and dependencies between the agents' actions. Coordination is also an important method for cooperation. Due to this significance,coordination have been paid great attention in recent years, from coordination models, mechanisms, methods, etc. to resource management. In this paper, we will survey these advances and give our view of future research direction.

关键词： Multi-agent coordination coordination mechanisms coordination methodologies coordination models resource management

来源：评论

学校读者我要写书评

暂无评论

Mutual conversion of regression and classification based on least squares support vector machines

Mutual conversion of regression and classification based on ...

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Jiang, Jing-Qing Song, Chu-Yi Wu, Chun-Guo Liang, Yang-Chun Yang, Xiao-Wei Hao, Zhi-Feng Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tongliao 028043 China Key Laboratory of Information Science and Engineering Beijing Jiaotong University Railway Ministry Beijing 100044 China School of Mathematical Science South China University of Technology Guangzhou 510640 China

ISBN: (纸本)354034439X

Classification and regression are most interesting problems in the fields of pattern recognition. The regression problem can be changed into binary classification problem and least squares support vector machine can be used to solve the classification problem. The optimal hyperplane is the regression function. In this paper, a one-step method is presented to deal with the multi-category problem. The proposed method converts the problem of classification into the function regression problem and is applied to solve the converted problem by least squares support vector machines. The novel method classifies the samples in all categories simultaneously only by solving a set of linear equations. Demonstrations of numerical experiments are performed and good performances are obtained. Simulation results show that the regression and classification can be converted each other based on least squares support vector machines. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

WDM: A New Efficient Visualization Method of Classifying Web Documents Based on SOM

WDM: A New Efficient Visualization Method of Classifying Web...

引用

International Conference on computational Intelligence and Security

作者： Xi Bai Jigui Sun Hong Luo College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Information Science and Technology of Technology Beijing Institute of Technology Beijing China

ISBN: (纸本)1424406048

We propose a new visualization method WDM to classify documents by adding in the position-factors of words such as the title-factor and the first-sentence-factor based on a SOM neural network. We also discuss the selection of the function which is used to calculate the belong-to-probability in neurons' reflecting process. The experimental results indicate that WDM makes the boundaries of different documents greatly more clear, and thus it can produce more accurate and intuitive classification compared to the visualization methods which do not have position-factors considered

关键词： Wavelength division multiplexing Visualization Neurons Neural networks Educational technology Educational institutions Computer science Sun Laboratories Computer networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：