{"title":"Equal-Width Partitioning Roulette Wheel Selection in Genetic Algorithm","authors":"Liming Zhang, Huiyou Chang, Rui-tian Xu","doi":"10.1109/TAAI.2012.21","DOIUrl":"https://doi.org/10.1109/TAAI.2012.21","url":null,"abstract":"Selection operator is one important operator in genetic algorithm (termed GA). It has significant influences on the performance of algorithm. Roulette wheel selection is a frequently used selection operator in implementation of GA. However it does not perform sufficiently well in balancing the convergence speed and population diversity of the algorithm. This paper proposes a novel roulette wheel selection based on fitness equal-width partitioning. The proposed selection operator groups the individuals by equal-width partitioning of the fitness interval of the whole population. And then in each time of selecting an individual to generate the new population, a group of individuals is selected with the method of roulette wheel selection, where an individual will be then chosen for survival in the new population. By restricting the fast reproduction of the majority of individuals sharing similar fitness, the proposed selection operator can sustain the population diversity to avoid premature. Encouraging experimental results demonstrate that the proposed selection operator is able to achieve better solution and has a faster convergence speed, compared to the traditional roulette wheel selection.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177414","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}
{"title":"Design of Knowledge-Based Opening Database for MiniShogi","authors":"Kuang-Yu Wu, Jr-Chang Chen, Shi-Jim Yen, Shun-chin Hsu","doi":"10.1109/TAAI.2012.22","DOIUrl":"https://doi.org/10.1109/TAAI.2012.22","url":null,"abstract":"With the rapid advancement of hardware efficiency in recent years, computation power has significantly improved, increasing the speed and depths of the game tree search in computer chess programs. However, to satisfy the need of increasing search depth, the investment in hardware is no longer personally affordable. Thus, another method must be found in addition to improving the efficiency of hardware and heuristic algorithms. In this paper, knowledge-based technologies are applied to design a database for the opening phase of MiniShogi. By analyzing game records and ranking the moves in advance, the program can increase search depths and reduce search time spent in the opening phase.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115509169","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}
{"title":"Estimation of the Influence for Different Population Sizes in MA-Based Natural SNP-RFLP Primer Design","authors":"Yu-Huei Cheng, Li-Yeh Chuang, Cheng-Hong Yang","doi":"10.1109/TAAI.2012.59","DOIUrl":"https://doi.org/10.1109/TAAI.2012.59","url":null,"abstract":"Single nucleotide polymorphisms (SNPs) are the most common genetic variations that can be genotyped effectively by polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP). Although PCR-RFLP has become the popular technique, search for available restriction enzymes and design of feasible primers for SNP genotyping is still a challenging task. An available restriction enzyme at least must be provided to discriminate a target SNP, and simultaneously a feasible primer pair observes numerous constraints must be given before performing SNP-based PCR-RFLP experiments. Here, we called it \"natural SNP-RFLP primer design\". In the past, a memetic algorithm (MA) was introduced to design natural SNP-RFLP primers, however, the influence of the used population size was not considered. Here, we use different population size to estimate the result of MA-based natural SNP-RFLP primer design. From the test result, we suggested the population size used between 200 and 300 is preferred to provide the natural SNP-RFLP primers.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115752459","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}
Wen-Yang Lin, T. Hong, Shu-Min Liu, Jiann-Horng Lin
{"title":"Revisiting the Design of Adaptive Migration Schemes for Multipopulation Genetic Algorithms","authors":"Wen-Yang Lin, T. Hong, Shu-Min Liu, Jiann-Horng Lin","doi":"10.1109/TAAI.2012.41","DOIUrl":"https://doi.org/10.1109/TAAI.2012.41","url":null,"abstract":"Multipopulation Genetic Algorithms (MGAs) are island model genetic algorithms composed of spatially semi-isolated sub-populations, each evolving in parallel by its own pace and occasionally interacting with its neighborhoods by interchanging (usually good) individuals, called migration. Since the migration process is the kernel mechanism of MGAs for preventing premature convergence, many previous works have been devoted to the design of good migration schemes, including migration policy, migration interval, and migration rate, but very few work focusing on adaptive aspect of the migration schemes. In this study, we revisit this problem by inspecting the design of adaptive migration schemes from two perspectives, fitness-based, i.e., favoring the solution quality, or diversity-based, i.e., sustaining population diversity, and thereby we propose two new adaptive migration schemes, one is fitness-based and the other is diversity-based. A preliminary experiment on 0/1 knapsack problem shows that both of the new approaches are better than our previous methods, and the diversity-based approach is more effective than the fitness-based approach.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130539859","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}
{"title":"Real Random Mutation Strategy for Differential Evolution","authors":"Sheng-Ta Hsieh, Shih-Yuan Chiu, Shi-Jim Yen","doi":"10.1109/TAAI.2012.33","DOIUrl":"https://doi.org/10.1109/TAAI.2012.33","url":null,"abstract":"In this paper, an improved DE is proposed to improve optimization performance by implementing three new schemes: sharing mutation, current-to-better mutation and real-random-mutation. When evolution speed is standstill, sharing mutation can increase the search depth, in addition, real-random mutation can disturb individuals and can help individuals diverge to local optimum. When the evolution progresses well, current-to-better mutation will drive individuals to the correct evolution direction. Experiments were conducted on 15 of CEC 2005 test functions, include unimodal, multimodal and hybrid composition functions, to present performance of the proposed method and to compare with 5 variants of DE includes JADE, jDE, SaDE, DEGL and MDE_pBX. The proposed method exhibits better performance than other five related works in solving all the test functions.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125531610","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}
{"title":"Efficient Active Learning Based on Uncertain Clusters","authors":"Juihsi Fu, Singling Lee, Wangping Wu","doi":"10.1109/TAAI.2012.70","DOIUrl":"https://doi.org/10.1109/TAAI.2012.70","url":null,"abstract":"In active learning, raw samples are queried as few as possible to learn an accurate classifier. However, queried samples may encounter the problem of low diversity if they are selected without considering sample content. Then the classifier would be inefficiently resulted by the similar queried samples. In this paper, the approach, ALUC, is proposed to increase the diversity of queried uncertain samples. Raw samples are clustered based on the prior data distribution and sample uncertainty before they are queried. At first, the cluster seeds are found according to the underlying data distribution, without defining the number of clusters in advance. And the distance metric is designed to generate small clusters if they contain uncertain samples. Consequently representative samples of clusters are diverse in content and also informative to be queried. Through experimental results on a synthetic dataset and real-word datasets, it is shown that our distance metric for clustering is effective to find raw samples that are similar in content and uncertainty. And ALUC is able to query informative and diverse samples to result an accurate classifier.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121391401","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}
Wen-Chih Hsiao, M. Horng, Yun-Je Tsai, Tsong-Yi Chen, Bin-Yih Liao
{"title":"A Driving Behavior Detection Based on a Zigbee Network for Moving Vehicles","authors":"Wen-Chih Hsiao, M. Horng, Yun-Je Tsai, Tsong-Yi Chen, Bin-Yih Liao","doi":"10.1109/TAAI.2012.65","DOIUrl":"https://doi.org/10.1109/TAAI.2012.65","url":null,"abstract":"In this paper, a scheme of moving-vehicles behavior detection based on a Zigbee network is proposed. Three-axis accelerometers are installed on vehicles to capture the moving vehicle postures. A fuzzy inference system is developed to infer the six basic states of vehicle posture, such as normal driving, left/right turning, departure, accelerate, braking and bumping. Based on the recognition of vehicle postures, the dangerous driving behaviors of vehicle such as serpentuate will be detected. In this paper, the design and development of hardware, vehicle posture measurement and dangerous driving behavior inferences are presented and realized. Additionally, an Android APP is developed to offer human-machine interface. The detection results and GPS information are showed in this developed system. The system sends message to related user if dangerous driving behavior is detected. The detected data is stored to cloud for further application.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585962","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}
{"title":"Lead-Lag Compensator Design Based on Genetic Algorithms","authors":"Huey-Yang Horng","doi":"10.1109/TAAI.2012.66","DOIUrl":"https://doi.org/10.1109/TAAI.2012.66","url":null,"abstract":"The PID controllers are the most commonly used controllers in industrial applications. As is well known, the PID controllers are susceptible to noise interference and windup effect. More practical alternatives are lead-lag controllers. Traditionally, time-domain or frequency-domain methods are used to design a lead-lag controller to meet the design specifications. The main task of this article is to design a required lead-lag controller using genetic algorithms (GAs). A main feature of our approach is to include the design specifications directly into the cost function or fitness function in GA iterations. Computer simulations show that the performances of our proposed controllers are quite good.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132018436","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}
{"title":"Enhance Performance of Particle Swarm Optimization by Altering the Worst Personal Best Particle","authors":"Chang-Huang Chen, Chih-Ming Lin","doi":"10.1109/TAAI.2012.62","DOIUrl":"https://doi.org/10.1109/TAAI.2012.62","url":null,"abstract":"In this paper, a strategy to increase the performance of particle swarm optimization is proposed. The idea is to altering the content of the worst particle of the personal best particles after each iteration. The behavior of the worst personal best particle is then forced to move out its regular path and then affects other particles' behavior. This approach prevents the particles getting stuck on local minimum. To altering the worst personal particle, some of its elements are replaced by its opposition values, inspired by the concept of opposition-based learning, and some elements are taken from the global best ever found or other personal best particle. Depending on which personal best particles are used, two variants are developed. The strategy enhances the exploration and exploitation capability of particle swarm optimization, since both approaches achieve better solution quality and convergent speed when tested on a suite of benchmark function, especially for multimodal functions, as demonstrated in the paper.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"515 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131916914","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}
{"title":"A Data-Flow Network That Represents First-Order Logic for Inference","authors":"Hideaki Suzuki, Mikio Yoshida, H. Sawai","doi":"10.1109/TAAI.2012.44","DOIUrl":"https://doi.org/10.1109/TAAI.2012.44","url":null,"abstract":"A method to represent first-order predicate logic (Horn clause logic) by a data-flow network is presented. Like a data-flow computer for a von Neumann program, the proposed network explicitly represents the logical structure of a declarative program by unlabeled edges and operation nodes. In the deduction, the network first propagates symbolic tokens to create an expanded AND/OR network by the backward deduction, and then executes unification by a newly developed method to solve simultaneous equations buried in the network. The paper argues the soundness and completeness of the network in a conventional way, then explains how a kind of ambiguous solution is obtained by the new developed method. To examine the method's convergence property, numerical experiments are also conducted with some simple data-flow networks.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683677","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}