Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798955
J. Sauer, L. Coelho
Traveling salesman problem (TSP) is one of the most difficult problems in the combinatorial optimization area. The goal of TSP is to find one path that can travel between all the nodes (instances) of the graph just once (Hamiltonian tour) in the smallest tour, that is, smallest Euclidian distance. In this context, many other meta-heuristics techniques based on evolutionary algorithms have been propose in literature to solve TSP problems. Differential evolution (DE) is a relatively new simple evolutionary algorithm, which is an effective adaptive approach to global optimization over continuous search spaces. The design principles of DE are simplicity and efficiency. The most distinct feature of DE is that it mutates vectors by adding weighted, random vector differentials to them. Since its invention, DE has been applied with high success on many numerical optimization problems outperforming other more popular meta-heuristics such as the genetic algorithms. Recently, some researchers extended with success the application of DE to complex combinatorial optimization problems with discrete decision variables such as the traveling salesman problem, the machine layout problem, the flow-shop scheduling problem. In this paper, the following discrete DE approaches for the TSP are proposed and evaluated: i) DE approach without local search, ii) DE with local search based on Lin-Kernighan-Heulsgaun (LKH) method, and iii) DE with local search based on variable neighborhood search (VNS) and together with LKH method. Numerical study is carried out using the TSPLIB of test TSP problems. In this context, the computational results are compared with the other results in the recent TSP literature. The obtained results show that LKH method is the best method to reach optimal results for TSPLIB benchmarks, but for largest problems, the ED+VNS improve the quality of obtained results.
{"title":"Discrete Differential Evolution with local search to solve the Traveling Salesman Problem: Fundamentals and case studies","authors":"J. Sauer, L. Coelho","doi":"10.1109/UKRICIS.2008.4798955","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798955","url":null,"abstract":"Traveling salesman problem (TSP) is one of the most difficult problems in the combinatorial optimization area. The goal of TSP is to find one path that can travel between all the nodes (instances) of the graph just once (Hamiltonian tour) in the smallest tour, that is, smallest Euclidian distance. In this context, many other meta-heuristics techniques based on evolutionary algorithms have been propose in literature to solve TSP problems. Differential evolution (DE) is a relatively new simple evolutionary algorithm, which is an effective adaptive approach to global optimization over continuous search spaces. The design principles of DE are simplicity and efficiency. The most distinct feature of DE is that it mutates vectors by adding weighted, random vector differentials to them. Since its invention, DE has been applied with high success on many numerical optimization problems outperforming other more popular meta-heuristics such as the genetic algorithms. Recently, some researchers extended with success the application of DE to complex combinatorial optimization problems with discrete decision variables such as the traveling salesman problem, the machine layout problem, the flow-shop scheduling problem. In this paper, the following discrete DE approaches for the TSP are proposed and evaluated: i) DE approach without local search, ii) DE with local search based on Lin-Kernighan-Heulsgaun (LKH) method, and iii) DE with local search based on variable neighborhood search (VNS) and together with LKH method. Numerical study is carried out using the TSPLIB of test TSP problems. In this context, the computational results are compared with the other results in the recent TSP literature. The obtained results show that LKH method is the best method to reach optimal results for TSPLIB benchmarks, but for largest problems, the ED+VNS improve the quality of obtained results.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128522998","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798939
Yuan Miao
This paper presents a goal oriented interest based negotiation automation approach. In this approach, negotiation parties exchange justifications (higher level goals) of their positions to seek agreements without compromise. The philosophy behind is that people normally hold different and incomplete knowledge set. Through exchanging knowledge and revise their knowledge base, negotiation parties could accept different positions yet still reach the same goal, reaching a win-win agreement.
{"title":"Goal oriented interest based negotiation","authors":"Yuan Miao","doi":"10.1109/UKRICIS.2008.4798939","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798939","url":null,"abstract":"This paper presents a goal oriented interest based negotiation automation approach. In this approach, negotiation parties exchange justifications (higher level goals) of their positions to seek agreements without compromise. The philosophy behind is that people normally hold different and incomplete knowledge set. Through exchanging knowledge and revise their knowledge base, negotiation parties could accept different positions yet still reach the same goal, reaching a win-win agreement.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130276498","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798953
H. Sahoolizadeh, Y. A. Ghassabeh
In this paper, a new face recognition method based on PCA (principal component analysis), LDA (linear discriminant analysis) and neural networks is proposed. This method consists of four steps: i) preprocessing, ii) dimension reduction using PCA, iii) feature extraction using LDA and iv) classification using neural network. Combination of PCA and LDA is used for improving the capability of LDA when a few samples of images are available and neural network classifier is used to reduce number misclassification caused by not-linearly separable classes. The proposed method was tested on Yale face database. Experimental results on this database demonstrated the effectiveness of the proposed method for face recognition with less misclassification in comparison with previous methods.
{"title":"Face recognition using eigen-faces, fisher-faces and neural networks","authors":"H. Sahoolizadeh, Y. A. Ghassabeh","doi":"10.1109/UKRICIS.2008.4798953","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798953","url":null,"abstract":"In this paper, a new face recognition method based on PCA (principal component analysis), LDA (linear discriminant analysis) and neural networks is proposed. This method consists of four steps: i) preprocessing, ii) dimension reduction using PCA, iii) feature extraction using LDA and iv) classification using neural network. Combination of PCA and LDA is used for improving the capability of LDA when a few samples of images are available and neural network classifier is used to reduce number misclassification caused by not-linearly separable classes. The proposed method was tested on Yale face database. Experimental results on this database demonstrated the effectiveness of the proposed method for face recognition with less misclassification in comparison with previous methods.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"31 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125704155","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798919
V. Filippov, L. Mukhanov, B. Shchukin
The use of credit cards is prevalent in modern day society. But it is obvious that the number of credit card fraud cases is constantly increasing in spite of the chip cards worldwide integration and existing protection systems. This is why the problem of fraud detection is very important now. In this paper the general description of the developed fraud detection system and comparisons between models based on using of artificial intelligence are given. In the last section of this paper the results of evaluative testing and corresponding conclusions are considered.
{"title":"Credit card fraud detection system","authors":"V. Filippov, L. Mukhanov, B. Shchukin","doi":"10.1109/UKRICIS.2008.4798919","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798919","url":null,"abstract":"The use of credit cards is prevalent in modern day society. But it is obvious that the number of credit card fraud cases is constantly increasing in spite of the chip cards worldwide integration and existing protection systems. This is why the problem of fraud detection is very important now. In this paper the general description of the developed fraud detection system and comparisons between models based on using of artificial intelligence are given. In the last section of this paper the results of evaluative testing and corresponding conclusions are considered.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980458","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798917
A. Eltaher, T. Form, M. Ayeb, M. Maurer
The last decade has obviously witnessed an emerging interest in studying human intelligence aiming to solve complex problems in many industrial fields, e.g. the process of verification and validation. Therefore, in an effort to alleviate the challenges of this process, an idea to construct intelligent test systems from the viewpoints of learning, reasoning, and optimization paradigms is presented. The adopted approach is based on the ability of the test system to observe, model, and store the behavior of skilled human testers aiming to imitate their intelligence. Hence, the developed test system should be able to partially substitute the absence of the human factor during an automated test cycle, which consequently leads to a substantial reduction in the development time and cost; yet the test efficiency is not sacrificed.
{"title":"A generic architecture for hybrid intelligent test systems","authors":"A. Eltaher, T. Form, M. Ayeb, M. Maurer","doi":"10.1109/UKRICIS.2008.4798917","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798917","url":null,"abstract":"The last decade has obviously witnessed an emerging interest in studying human intelligence aiming to solve complex problems in many industrial fields, e.g. the process of verification and validation. Therefore, in an effort to alleviate the challenges of this process, an idea to construct intelligent test systems from the viewpoints of learning, reasoning, and optimization paradigms is presented. The adopted approach is based on the ability of the test system to observe, model, and store the behavior of skilled human testers aiming to imitate their intelligence. Hence, the developed test system should be able to partially substitute the absence of the human factor during an automated test cycle, which consequently leads to a substantial reduction in the development time and cost; yet the test efficiency is not sacrificed.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116567943","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798950
L. Pinpin, D. Gamarra, C. Laschi, P. Dario
This paper describes how the clustering topology of an input space data distribution is utilized to properly initialize an adaptive neuro-fuzzy inference system (ANFIS). We used a new unsupervised clustering algorithm called topology based fuzzy clustering (TFC) that performs better than growing neural gas (GNG) in extracting the input-space topology. The topology information in the form of number of nodes, node positions and node connectivity is used for the initialization of the ANFIS. Using two robotic modeling tasks as benchmarks, we demonstrate the improved performance of TFC-derived ANFIS when compared to the subclustering method found in the fuzzy logic toolbox of Matlab.
{"title":"Topology based Fuzzy Clustering for robust ANFIS creation","authors":"L. Pinpin, D. Gamarra, C. Laschi, P. Dario","doi":"10.1109/UKRICIS.2008.4798950","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798950","url":null,"abstract":"This paper describes how the clustering topology of an input space data distribution is utilized to properly initialize an adaptive neuro-fuzzy inference system (ANFIS). We used a new unsupervised clustering algorithm called topology based fuzzy clustering (TFC) that performs better than growing neural gas (GNG) in extracting the input-space topology. The topology information in the form of number of nodes, node positions and node connectivity is used for the initialization of the ANFIS. Using two robotic modeling tasks as benchmarks, we demonstrate the improved performance of TFC-derived ANFIS when compared to the subclustering method found in the fuzzy logic toolbox of Matlab.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125157527","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798973
Chen-hua Xu, Min Wu, Jinhua She, R. Yokoyama
In order to deal with the time variance and strong nonlinearity of lead-zinc sintering process, an integrated method of predicting synthetic permeability based on neural networks (NNs) and a particle swarm algorithm has been developed. In this paper, the concept of the exponent of synthetic permeability, which reflects the state of the permeability of the process, is first explained. Next, NNs are used to establish time-sequence-based and technological-parameter-based models for predicting the permeability. Then, an integrated structure based on a fuzzy classifier is described and used to construct an intelligent integrated model for predicting the permeability that combines the two models just mentioned. Finally, the results of actual runs show the method to be both effective and practical.
{"title":"Integrated neural-network-based method for predicting synthetic permeability in lead-zinc sintering process","authors":"Chen-hua Xu, Min Wu, Jinhua She, R. Yokoyama","doi":"10.1109/UKRICIS.2008.4798973","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798973","url":null,"abstract":"In order to deal with the time variance and strong nonlinearity of lead-zinc sintering process, an integrated method of predicting synthetic permeability based on neural networks (NNs) and a particle swarm algorithm has been developed. In this paper, the concept of the exponent of synthetic permeability, which reflects the state of the permeability of the process, is first explained. Next, NNs are used to establish time-sequence-based and technological-parameter-based models for predicting the permeability. Then, an integrated structure based on a fuzzy classifier is described and used to construct an intelligent integrated model for predicting the permeability that combines the two models just mentioned. Finally, the results of actual runs show the method to be both effective and practical.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716851","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798970
Duo Wang, Wenhui Li, Rongqing Yi, X. Cheng
In this paper, a new optimization method, Organizational Evolutionary Algorithm (OEA), is proposed, in which a population is made of organizations and whose evolution is led by three organizational evolutionary operators, i.e. the splitting operator, the merging operator and the cooperating operator; the splitting operator controls the size of organizations and make part of organizations enter into next generation directly, which are benefit for keeping the diversity of populations; the merging operator acts as a local searching function with taking advantage of leaders information; the cooperating operator increases the adaptability degree through the interactions of organizations. OEA is successfully applied to solve the non-linear parameterization design problems. Experiments show that OEA performs better than original Generic algorithm (GA) in this application of parameterization design.
{"title":"Organizational evolutionary applied on geometric constraints solving","authors":"Duo Wang, Wenhui Li, Rongqing Yi, X. Cheng","doi":"10.1109/UKRICIS.2008.4798970","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798970","url":null,"abstract":"In this paper, a new optimization method, Organizational Evolutionary Algorithm (OEA), is proposed, in which a population is made of organizations and whose evolution is led by three organizational evolutionary operators, i.e. the splitting operator, the merging operator and the cooperating operator; the splitting operator controls the size of organizations and make part of organizations enter into next generation directly, which are benefit for keeping the diversity of populations; the merging operator acts as a local searching function with taking advantage of leaders information; the cooperating operator increases the adaptability degree through the interactions of organizations. OEA is successfully applied to solve the non-linear parameterization design problems. Experiments show that OEA performs better than original Generic algorithm (GA) in this application of parameterization design.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132831368","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798944
H. Omranpour, M. Ebadzadeh, S. Barzegar, M. Shojafar
In this article an algorithm is presented for edges coloring of the graph. In this algorithm the node that we discuss represented by an Agent and then all the nodes of a graph like multi-agent system. Each node independently colours its edges with respect to cellular automata using distributed and paralleling of the process. Innovation of this method is on distributing of the process for each node so that each node updates its edges color only with the use of its neighbors in some steps until all graphs are colored completely. At the end the results are being tested on some Standard graphs and the results are presented. In this method, each graph is colored using one rule repetition for each node with high speed on its edges.
{"title":"Distributed coloring of the graph edges","authors":"H. Omranpour, M. Ebadzadeh, S. Barzegar, M. Shojafar","doi":"10.1109/UKRICIS.2008.4798944","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798944","url":null,"abstract":"In this article an algorithm is presented for edges coloring of the graph. In this algorithm the node that we discuss represented by an Agent and then all the nodes of a graph like multi-agent system. Each node independently colours its edges with respect to cellular automata using distributed and paralleling of the process. Innovation of this method is on distributing of the process for each node so that each node updates its edges color only with the use of its neighbors in some steps until all graphs are colored completely. At the end the results are being tested on some Standard graphs and the results are presented. In this method, each graph is colored using one rule repetition for each node with high speed on its edges.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133052144","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}
Pub Date : 2008-09-01DOI: 10.1109/UKRICIS.2008.4798927
A. Hessami
The concepts of safety and security are used interchangeably and often inappropriately in defining the characteristics and emerging properties of general and cybernetic systems. This paper provides a clear distinction for the two concepts and further develops a systems framework for the attainment of these highly desirable properties in complex systems. The concepts of safety and security are examined across cybernetic systems and contexts from advanced control systems to information systems, robotics and nanotechnology. The proposed framework is extended to equitably address safety as well as security of such systems, employing a systemic suite of principles. The advanced framework comprises systems assurance concepts founded on faults, errors, failures, hazards and consequences. Likewise, advanced system security concepts comprising vulnerability and consequences are treated in the same framework, thus providing an integrated systemic foundation for the treatment of these increasingly regulated aspects to modern complex systems. The proposed framework additionally lends itself to the systematic and systemic treatment of environmental and sustainability facets.
{"title":"Cybernetic safety & security, a new paradigm","authors":"A. Hessami","doi":"10.1109/UKRICIS.2008.4798927","DOIUrl":"https://doi.org/10.1109/UKRICIS.2008.4798927","url":null,"abstract":"The concepts of safety and security are used interchangeably and often inappropriately in defining the characteristics and emerging properties of general and cybernetic systems. This paper provides a clear distinction for the two concepts and further develops a systems framework for the attainment of these highly desirable properties in complex systems. The concepts of safety and security are examined across cybernetic systems and contexts from advanced control systems to information systems, robotics and nanotechnology. The proposed framework is extended to equitably address safety as well as security of such systems, employing a systemic suite of principles. The advanced framework comprises systems assurance concepts founded on faults, errors, failures, hazards and consequences. Likewise, advanced system security concepts comprising vulnerability and consequences are treated in the same framework, thus providing an integrated systemic foundation for the treatment of these increasingly regulated aspects to modern complex systems. The proposed framework additionally lends itself to the systematic and systemic treatment of environmental and sustainability facets.","PeriodicalId":311925,"journal":{"name":"2008 7th IEEE International Conference on Cybernetic Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134301982","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：