O. Morandin, E. Kato, D. Sanches, Bruno Drugowick Muniz
{"title":"Modeling Strategy by Adaptive Genetic Algorithm for Production Reactive Scheduling with Simultaneous Use of Machines and AGVs","authors":"O. Morandin, E. Kato, D. Sanches, Bruno Drugowick Muniz","doi":"10.1109/ICSMC.2009.5346695","DOIUrl":"https://doi.org/10.1109/ICSMC.2009.5346695","url":null,"abstract":"The problem of production scheduling of manufacturing systems is a typical NP-hard optimization problem and several researchers have been using the genetic algorithms (GAs) as a search method, since these algorithms have the capacity of globally exploring the search space. However, it is reported that traditional GAs often suffers from the weaknesses of premature convergence as well as parameter and operator dependence. For this, in this paper it is proposed a modeling strategy by adaptive GA (AGA) for production reactive scheduling of manufacturing systems with shared resources and simultaneous use of machines and AGVs. The aim of this paper is to get a good production reactive schedule in order to achieve a good makespan values in a low response obtaining time. The results of this paper were validated in large scenarios and compared with the results of two other approaches. These results are presented and discussed in this paper.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132488621","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}
M. Kajko-Mattsson, Ralf Fredriksson, Anna Hauzenberger
{"title":"Eliciting a Retirement Process Model: Case Study 2","authors":"M. Kajko-Mattsson, Ralf Fredriksson, Anna Hauzenberger","doi":"10.1109/CSSE.2008.1364","DOIUrl":"https://doi.org/10.1109/CSSE.2008.1364","url":null,"abstract":"Although software engineering has been quite successful in creating various development models, it has failed in defining later lifecycle process models. One of such process models concerns retirement. In this paper, we elicit a retirement process model and compare it to the standard models. Our goal is to evaluate current retirement process standards and provide feedback for their extension.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"23 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942826","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":"Localization by Co-observing Robots","authors":"Yoshiteru Nishimura, T. Ishikawa, K. Hori","doi":"10.1109/CIMCA.2008.167","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.167","url":null,"abstract":"This paper proposes three methods to improve the accuracy of the estimation of robot's self-state by observing other robots mutually. Many methods have been proposed to enable the autonomous robots estimate their states, such as the methods of SLAM (simultaneous localization and mapping). But those methods usually need high precision sensors (e.g. laser range finder) or high computing power. Robots that use low precision sensor and actuator can cover their low performance by using mutual observation of other robots. In this paper we propose to combine three methods for accurate robot's estimation of their states by using mutual observation of other robots. Each of three methods has advantages and drawbacks. We propose to switch the methods depending on situations.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047438","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":"Comparison, Segmentation and Analysis of Images by Use of Information Compression Algorithms","authors":"G. Vachkov","doi":"10.1109/CIMCA.2008.205","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.205","url":null,"abstract":"Computational scheme for comparison, color analysis and segmentation of images is proposed in this paper. First of all, two growing unsupervised learning algorithms are introduced. They create the so called compressed information model (CIM) of the image that replaces the original ldquoraw datardquo (the RGB pixels) with a smaller number of neurons. Then two main features are extracted from the CIM, namely the center-of-gravity of the model and the weighted average size. They could be used separately or in a two-dimensional fuzzy decision block for similarity analysis of pairs of images. Another type of image analysis is the image segmentation. A simple method for segmentation is described in the paper. It uses the unsupervised learning algorithms to generate small predetermined number of neurons (key-points of the image). Each key-point is considered as a center of the respective image segment and the area of pixels around this center corresponds to the color details of this segment. The proposed computational scheme and its application are demonstrated in the paper on test image examples.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116773539","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":"MAMIE: A Methodology to Elicit Requirements in Inter-company Co-operative Information Systems","authors":"H. Bendjenna, N. Zarour, Pierre-Jean Charrel","doi":"10.1109/CIMCA.2008.101","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.101","url":null,"abstract":"In this paper, we propose a methodology, namely MAMIE (from MAcro to MIcro level requirements Elictation) in order to elicit requirements for an Inter-company Co-operative Information Systems development. It is based on UML use cases and sequence diagrams: they represent understandable notations by all stakeholders and they are useful for acquiring, analyzing and modeling requirements. The sequence diagram allows also to model interaction between companies and constraints of co-operation. MAMIE methodology is also based on viewpoints which have advocated as a means of partitioning requirements as a set of partial specifications that are helpful for traceability and consistency management. Preliminary results suggest that MAMIE methodology is of valuable help to requirements engineers during elicitation process.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120967562","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 Pistachio Nuts Classification Technique: An ANN Based Signal Processing Scheme","authors":"Somaieh Mahdavi-Jafari, H. Salehinejad, S. Talebi","doi":"10.1109/CIMCA.2008.150","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.150","url":null,"abstract":"This paper introduces an intelligent system for pistachio nuts classification using artificial neural networks (ANNs). The employed ANN is trained based on analyzing of acoustic signals, generated from pistachios impacts with a steel plate. The fast Fourier transform (FFT), discrete cosine transform (DCT), and discrete wavelet transform (DWT) are employed and compared for processing the signals. In order to restrict the signals dimensions, principle component analysis (PCA) algorithm is used. The experimental results are demonstrated for various types of ANNs with different number of hidden layers and neurons to establish optimum result. The results demonstrate feasibility and performance of the proposed method with an accuracy of more than 99.89%.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117180","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":"Utility of Virtual Games and Time Allocation Behavior of Game Players: A Multi-extended Utility Framework","authors":"Hui Peng, Lei Zhang","doi":"10.1109/CIMCA.2008.49","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.49","url":null,"abstract":"On-line games have become a new way of entertainment. In order to analyze why people choose to enter an online game which might harm their real life and job, and how they allocate time between real world and virtual world, this paper proposed a Multi-Extended Meta-Utility Function where people get physiological, psychological and monetary satisfaction from the real world (main utility function) and the virtual world (auxiliary utility function). People will balance their time allocation between the two worlds to maximize their meta-utility. We also proposed a method of survey on the lowest monetary compensation for people cutting online game-play time, to indirectly measure the relative psychological satisfaction and utility value from virtual games compared with that from the real world. Results from survey show that pure psychological utility from virtual activities is much higher than that from the real world, which drives people into the virtual games.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121374122","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":"Collision-Free Composite ?3–Splines Generation for Nonholonomic Mobile Robots by Parallel Variable-Length Genetic Algorithm","authors":"Jiun-Hau Wei, Jing-Sin Liu","doi":"10.1109/CIMCA.2008.200","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.200","url":null,"abstract":"A G3-continuous path planner for wheeled non-holonomic mobile robots is presented, where the path is a composite curve composed of a number of eta3-splines segments. Based on the variable-length genetic algorithm implemented in the architecture of island parallel genetic algorithm (IPGA), the path planner automatically selects the number and locations of an ordered sequence of intermediate nodes aiming for collision-free shorter composite eta3-spline path generation. The experimental result demonstrates the capability of the proposed evolutionary path planner.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127347292","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}
Thyagaraju G S, S. M. Joshi, U. Kulkarni, Narasimhamurthy S K, A. Yardi
{"title":"Conflict Resolution in Multiuser Context-Aware Environments","authors":"Thyagaraju G S, S. M. Joshi, U. Kulkarni, Narasimhamurthy S K, A. Yardi","doi":"10.1109/CIMCA.2008.87","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.87","url":null,"abstract":"Conflict management in context-aware computing is getting more significant attention from researchers as ubiquitous computing environments take into account multiple users. For multi-user ubiquitous computing environments, conflicts among userspsila contexts need to be detected and resolved. For this, application developers or end-users specify conflicts situations, and the underlying ubiquitous computing middleware detects and resolve conflicts between applications when one of the conflict situations arises. In this paper, we propose conflict manager to resolve conflicts in context-aware applications. Conflicts arise when multiple users try to access an application. In order to resolve conflicts among users, the conflict resolver sums up preferences of users which collide with each other and recommends specific contents depending on different criteriapsilas such as role of the user or the priority assigned with the user. This paper proposes various algorithms where in each algorithm tries to resolve the conflicts among the users considering issues such as starvation. To show the usefulness of the proposed conflict resolution method, we apply the proposed conflict resolution method to context aware TV, a smart testbed.The conflict manager is built using an array of algorithms which work on the principles of preemption, non preemption, and uses methodologies like role, priority , time slice based approaches. Thereby making the system to provide comprehensible and well suited solutions to cater the versatile needs of the family .The algorithms utilize various factors like priority, credits, age, and time in the above mentioned approaches. The motto of this paper is to enable context? Aware applications to offer personalized services to multiple users by resolving service conflicts among users.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127543158","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}
Yu-Chen Song, M. O'Grady, Gregory M. P. O'Hare, Wei Wang
{"title":"A Clustering Algorithm Incorporating Density and Direction","authors":"Yu-Chen Song, M. O'Grady, Gregory M. P. O'Hare, Wei Wang","doi":"10.1109/CIMCA.2008.34","DOIUrl":"https://doi.org/10.1109/CIMCA.2008.34","url":null,"abstract":"This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate human factors, both partitioning and density-based methods were adopted, resulting in a new algorithm - Clustering Algorithm based on object Density and Direction (CADD). This paper discusses the theory and algorithm design of the CADD algorithm. As an illustration of its applicability, CADD was used to cluster real world data from the geochemistry domain.","PeriodicalId":110404,"journal":{"name":"2008 International Conference on Computational Intelligence for Modelling Control & Automation","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115996374","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}