2011 11th International Conference on Intelligent Systems Design and Applications最新文献_第7页

The use of fuzzy decision trees for coffee rust warning in Brazilian crops 模糊决策树在巴西咖啡锈病预警中的应用

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121847

M. E. Cintra, C. A. A. Meira, M. C. Monard, H. Camargo, L. Rodrigues

引用次数: 39

Evolutionary computation, combined with support vector machines, for gene structure prediction 结合支持向量机进行基因结构预测的进化计算

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121849

Javier Pérez-Rodríguez, N. García-Pedrajas

{"title":"Evolutionary computation, combined with support vector machines, for gene structure prediction","authors":"Javier Pérez-Rodríguez, N. García-Pedrajas","doi":"10.1109/ISDA.2011.6121849","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121849","url":null,"abstract":"Gene structure prediction consists of determining which parts of a genomic sequence of the cell are coding, and constructing the whole gene from its start site to its stop codon. Gene recognition is one of the most important open problems in bioinformatics. The subtle sources of evidence and the many pitfalls of the problem make gene recognition in eukaryotes one of the most challenging tasks in this field. Gene recognition may be considered as a search problem, where many evidence sources are combined in a scoring function that must be maximized to obtain the structure of a probable gene. Using an intrinsic method, we propose a combination of evolutionary computation and support vector machines for gene structure prediction. Specifically, we use support vector machines (SVMs) to localize and score the functional sites along the genomic sequence, reducing the search space. Evolutionary computation is used to evolve a population where the individuals are correct gene structures. The flexibility of evolutionary computation can be used to account for the complexities of the problem, which are growing as our knowledge of the molecular processes of transcription and translation deepens. Our results show that with a very simple program we are able to achieve very good accuracies in the recognition of genes in human chromosome 19.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Network clustering by graph coloring: An application to astronomical images 图着色的网络聚类:天文图像的应用

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121754

E. Zarrazola, D. Gómez, J. Montero, J. Yáñez, A. I. G. D. Castro

引用次数: 2

Optimizing alphabet using genetic algorithms 使用遗传算法优化字母表

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121705

J. Platoš, P. Krömer

引用次数: 4

On a generalized name entity recognizer based on Hidden Markov Models 基于隐马尔可夫模型的广义名称实体识别器

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121781

J. Colmenar, M. Abánades, Fernando Poza, Diego Martín, Alfredo Cuesta-Infante, Alberto Herrán, J. Hidalgo

引用次数: 2

Evaluation of multiobjective swarm algorithms for grid scheduling 网格调度的多目标群算法评价

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121806

María Arsuaga-Ríos, M. A. Vega-Rodríguez, F. Castrillo

{"title":"Evaluation of multiobjective swarm algorithms for grid scheduling","authors":"María Arsuaga-Ríos, M. A. Vega-Rodríguez, F. Castrillo","doi":"10.1109/ISDA.2011.6121806","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121806","url":null,"abstract":"Often, solutions to complex problems are found in nature. Swarm algorithms are capable of solving such complex problems by implementing patterns from nature. This patterns are found in a variety of scientific fields. In this paper, we discuss two swarm algorithms extracted from Biology and Physics, namely: Multiobjective Artificial Bee Colony (MOABC) and Multiobjective Gravitational Search Algorithm (MOGSA). The first one is based on bees behavior and the other follows the gravity between masses. These algorithms are implemented to solve the grid scheduling problem. Optimization of job scheduling is one of the most challenging tasks in Grid environments because it severely affects the execution time of an experiment (set of jobs). Experiments often are tied up to fulfill deadlines and budgets. One of the main contributions of this work is adding multiobjective processes to these swarm algorithms to minimize those conflictive objectives. Results show that MOABC clearly improves the MOGSA approach when solving the problem. MOABC is also compared with real grid meta-schedulers as Deadline Budget Constraint (DBC) and Workload Management System (WMS) by using the simulator GridSim to prove the improvement that offers this new algorithm.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Probabilistic Bayesian network classifier for face recognition in video sequences 基于概率贝叶斯网络分类器的视频序列人脸识别

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121770

John See

引用次数: 3

A clustering-based decision tree induction algorithm 一种基于聚类的决策树归纳算法

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121712

Rodrigo C. Barros, A. Carvalho, M. Basgalupp, M. G. Quiles

{"title":"A clustering-based decision tree induction algorithm","authors":"Rodrigo C. Barros, A. Carvalho, M. Basgalupp, M. G. Quiles","doi":"10.1109/ISDA.2011.6121712","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121712","url":null,"abstract":"Decision tree induction algorithms are well known techniques for assigning objects to predefined categories in a transparent fashion. Most decision tree induction algorithms rely on a greedy top-down recursive strategy for growing the tree, and pruning techniques to avoid overfitting. Even though such a strategy has been quite successful in many problems, it falls short in several others. For instance, there are cases in which the hyper-rectangular surfaces generated by these algorithms can only map the problem description after several sub-sequential partitions, which results in a large and incomprehensible tree. Hence, we propose a new decision tree induction algorithm based on clustering which seeks to provide more accurate models and/or shorter descriptions more comprehensible for the end-user. We do not base our performance analysis solely on the straightforward comparison of our proposed algorithm to baseline methods. Instead, we propose a data-dependent analysis in order to look for evidences which may explain in which situations our algorithm outperforms a well-known decision tree induction algorithm.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116985205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Quasi-static object manipulation by mobile robot: Optimal motion planning using GA 移动机器人准静态目标操纵:基于遗传算法的最优运动规划

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121655

Hossein Barghijand, A. Akbarimajd, J. Keighobadi

{"title":"Quasi-static object manipulation by mobile robot: Optimal motion planning using GA","authors":"Hossein Barghijand, A. Akbarimajd, J. Keighobadi","doi":"10.1109/ISDA.2011.6121655","DOIUrl":"https://doi.org/10.1109/ISDA.2011.6121655","url":null,"abstract":"Quasi-static object manipulation using a wheeled mobile robot is studied. For a mobile robot, as a typical set-up for transportation of objects, dynamic grasp problem is defined. It is assumed that the robot moves along a straight path and carries an object on its upper surface and the object should not move relative to the robot (dynamic grasp problem). It is also assumed that the robot has limited wheel motors torque. It is shown that to preserve dynamic grasp between the object and the robot, acceleration of the robot has to remain in a specified range. A third order polynomial for position equation of the mobile robot is selected and dynamic grasp and torque conditions are sketched as a constraint on acceleration of the robot. An optimization problem is proposed to find the optimal motion of the robot. A genetic algorithm is proposed to solve the optimization problem. The solutions are validated by simulations in MSC-ADAMS and MATLAB in general case of the optimization problem and also in minimum time, maximum distance and minimum energy problems as special cases of the general problem.","PeriodicalId":433207,"journal":{"name":"2011 11th International Conference on Intelligent Systems Design and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128582483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

An evolutionary algorithm for the unequal area facility layout problem 等面积设施布局问题的一种进化算法

2011 11th International Conference on Intelligent Systems Design and Applications Pub Date : 2011-11-01 DOI: 10.1109/ISDA.2011.6121691

L. Salas-Morera, L. García-Hernández, A. Arauzo-Azofra

引用次数: 5