{"title":"Particle Swarm Optimization with Velocity Adaptation","authors":"S. Helwig, F. Neumann, R. Wanka","doi":"10.1109/ICAIS.2009.32","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.32","url":null,"abstract":"Particle swarm optimization (PSO) algorithms have gained increasing interest for dealing with continuous optimization problems in recent years. Often such problems involve boundary constraints. In this case, one has to cope with the situation that particles may leave the feasible search space. To deal with such situations different bound handling methods have been proposed in the literature and it has been observed that the success of PSO algorithms depends on a large degree on the used bound handling method. In this paper, we propose an alternative approach to cope with bounded search spaces. The idea is to introduce a velocity adaptation mechanism into PSO algorithms that is similar to step size adaptation used in evolution strategies. Using this approach we show that the bound handling method becomes less important for PSO algorithms and that using velocity adaptation leads to better results for a wide range of benchmark functions.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114783712","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":"Mining the Largest Quasi-clique in Human Protein Interactome","authors":"M. Bhattacharyya, S. Bandyopadhyay","doi":"10.1109/ICAIS.2009.39","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.39","url":null,"abstract":"A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost complete subgraphs of a graph. In sparse and very large scale-free networks, the problem of finding the largest quasi-clique becomes hard to manage with the existing approaches. Here, we propose a heuristic algorithm in this paper for locating the largest quasi-clique from the human protein-protein interaction networks. The results show promise in computational biology research by the exploration of significant protein modules.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123626485","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":"Perspectives on Robotic Embodiment from a Developmental Cognitive Architecture","authors":"Paul E. Baxter, Will N. Browne","doi":"10.1109/ICAIS.2009.11","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.11","url":null,"abstract":"Recent discussions in cognitive robotics have emphasised the role of embodiment and developmental learning. A novel developmental memory-based cognitive framework, and its associated computational architecture, is presented. This framework emphasises the low level sensory-motor aspects of developmental learning as a basis upon which higher-order cognitive functions can be bootstrapped autonomously and adaptively. Experiments are described which explore the interplay between development and embodiment. The results are discussed in the context of the cognitive framework, and demonstrate that embodiment is not merely an interface between an agent and its environment, but is fundamentally and inextricably linked to the developed cognitive capabilities of the agent, even at the low level examined here.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"41 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046580","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}
S. Masoumzadeh, G. Taghizadeh, Kourosh Meshgi, S. Shiry
{"title":"Deep Blue: A Fuzzy Q-Learning Enhanced Active Queue Management Scheme","authors":"S. Masoumzadeh, G. Taghizadeh, Kourosh Meshgi, S. Shiry","doi":"10.1109/ICAIS.2009.17","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.17","url":null,"abstract":"Although RED has been widely used with TCP, however it has several known drawbacks [1]. The BLUE algorithm that benefits from a different structure has tried to compensate some of them in a successful way [2]. A quick review on active queue management algorithms from the very beginning indicates that most of them tried to improve classic algorithms. Some of them use network traffic history to achieve more flexibility and prediction ability while others use algorithms such as fuzzy logic to address scalability problem and high input load. Our proposed approach benefits from both: Using fuzzy logic to deal with high input load and embedding expert knowledge into the algorithm while optimizing router decisions with reinforcement learning fed by network traffic history. We call this approach \"DEEP BLUE\" as is consist of an improved version of BLUE algorithm. Derived from BLUE, our algorithm uses packet drop rate and link idle events to manage congestion. Our experiments using OPNET simulator shows that this scheme works faster and more efficient than original BLUE.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270291","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":"Solving Over-constrained Problems Using Network Analysis","authors":"Monika Schubert, A. Felfernig, Monika Mandl","doi":"10.1109/ICAIS.2009.12","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.12","url":null,"abstract":"Requirements for which no recommendation can be calculated are unsatisfactory for the user. The detection and resolution of conflicts between those requirements and the product assortment is an important functionality to successfully guide the user to a solution. In this paper we introduce a new approach how to identify minimal conflict sets in over constrained problems through network analysis. Conflict sets offer the information which constraints (requirements) need to be changed to retrieve a solution. Random constrained problems are used to evaluate our approach and compare it to existing conflict detection algorithms. A major result of this evaluation is that our approach is superior in settings typical for knowledge-based recommendation problems.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"37 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445910","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":"Adapting to Increasing Data Availability Using Multi-layered Self-Organising Maps","authors":"Toby Smith","doi":"10.1109/ICAIS.2009.26","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.26","url":null,"abstract":"Often in clustering scenarios, the data analyst does not have access to a complete data set at the outset and new data dimensions might only become available at some later time. In this case it is useful to be able to cluster the available data and have some mechanism for incorporating new dimensions as they become available without having to recluster all the data from scratch (which may not be feasible for on-line learning scenarios). This paper utilises an established mechanism for interconnecting multiple Self-Organising Maps to achieve this aim and reveals a useful way of visualising the affect of individual dimensions on the structure of clusters.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127608263","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":"Using a Multiagent System to Perceive and to Manage Facts in a Dynamic Situation","authors":"F. Kebair, F. Serin","doi":"10.1109/ICAIS.2009.19","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.19","url":null,"abstract":"The most scientists agree that the adaptivity and the flexibility are crucial characteristics to build more robust and intelligent systems to resolve complex problems as the risk management. Intelligent agents represent an appropriate solution that may fulfill this requirement since they are able to operate autonomously and to adapt their behaviours according to the change of their environment. In this paper, we propose an architecture of an agent-based decision support system that intends to help emergency managers to detect and to manage risks and crisis situations. The system is designed to be adaptive and usable in different problems types. We focus here on a part of it, intending to perceive and to manage facts in a dynamic situation. An implementation and tests applied on the RoboCupRescue application are presented.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116965491","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":"Self-Adaptation of Semantic Services Based on a Component/Agent Approach: Application to e-Training","authors":"Jérôme Lacouture, P. Aniorté","doi":"10.1109/ICAIS.2009.14","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.14","url":null,"abstract":"In the context of distributed and open systems, the dynamic evolution of the distributed entities (or services) and their adaptation is one of the main prevailing challenges. In this paper, our aim is to show that is possible to automate (at least partially) the discovery, the selection and the adaptation of components, on the one hand associating a semantic description based on functional and non-functional properties to components and on the other hand, delegating to software agents the interpretation of components decriptions. We focus on the use of semantic, i.e. the use of ontologies, to provide a common interpretable support to share, to find, and to adapt relevant available services. The CompAA model is the result of our propositions and an experimentation in the area of training gives us a guideline to illustrate and validate our contributions.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130780345","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":"Distributed Anytime Clustering Using Biologically Inspired Systems","authors":"G. Folino, Agostino Forestiero, G. Spezzano","doi":"10.1109/ICAIS.2009.28","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.28","url":null,"abstract":"In this paper, we propose a biologically-inspired algorithm for clustering distributed data in a peer-to-peer network with a small world topology. The method proposed is based on a set of locally executable flocking algorithms that use a decentralized approach to discover clusters by an adaptive nearest-neighbor non-hierarchical approach and the execution, among the peers, of an iterative self-labeling strategy to generate global labels with which identify the clusters of all peers. We have measured the goodness of our flocking search strategy on performance in terms of accuracy and scalability. Furthermore, we evaluated the impact of small world topology in terms of reduction of iterations and messages exchanged to merge clusters.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"44 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132039962","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}
A. Marana, G. Chiachia, I. R. Guilherme, J. Papa, K. Miura, M. Ferreira, F. Torres
{"title":"An Intelligent System for Petroleum Well Drilling Cutting Analysis","authors":"A. Marana, G. Chiachia, I. R. Guilherme, J. Papa, K. Miura, M. Ferreira, F. Torres","doi":"10.1109/ICAIS.2009.16","DOIUrl":"https://doi.org/10.1109/ICAIS.2009.16","url":null,"abstract":"Cutting analysis is a important and crucial task task to detect and prevent problems during the petroleum well drilling process. Several studies have been developed for drilling inspection, but none of them takes care about analysing the generated cutting at the vibrating shale shakers. Here we proposed a system to analyse the cutting's concentration at the vibrating shale shakers, which can indicate problems during the petroleum well drilling process, such that the collapse of the well borehole walls. Cutting's images are acquired and sent to the data analysis module, which has as the main goal to extract features and to classify frames according to one of three previously classes of cutting's volume. A collection of supervised classifiers were applied in order to allow comparisons about their accuracy and efficiency. We used the Optimum-Path Forest (OPF), Artificial Neural Network using Multilayer Perceptrons (ANN-MLP), Support Vector Machines (SVM) and a Bayesian Classifier (BC) for this task. The first one outperformed all the remaining classifiers. Recall that we are also the first to introduce the OPF classifier in this field of knowledge. Very good results show the robustness of the proposed system, which can be also integrated with other commonly system (Mud-Logging) in order to improve the last one's efficiency.","PeriodicalId":161840,"journal":{"name":"2009 International Conference on Adaptive and Intelligent Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123949889","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}