{"title":"Another Step toward Reusability in Agent-Based Simulation: Multi-behaviors & aMVC","authors":"Yassine Gangat, D. Payet, R. Courdier","doi":"10.1109/ICTAI.2012.158","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.158","url":null,"abstract":"The multi-agent systems are successfully used in modeling of dynamic complex systems, and simulations of these models reinforce the knowledge of experts and even allow them to explore new horizons or to cross boundaries. This is the reason why the models being tackled are increasingly varied, and as one goes along with experimentations, these models are completed, intercrossed. Consequently they become increasingly complex. In our previous work, we proposed a first modeling approach to support this complexity increase: the Dynamic-Oriented Modeling (DOM). The application of this approach can effectively support the increase of the model. This increase applies to both agents and environments. This DOM approach tackles the problem of the latter by splitting in multiple parts. But if DOM led to organize properly the multiple environments that come into play, little support is provided to organize and manage the increasing complexity of the agents themselves. Inevitably, when we reach a quite advanced stage of evolution of the model, the agents eventually reach a critical mass (either in formalization or code) that makes them more and more hard to comprehend. In this paper, we illustrate this phenomenon and show that it quickly takes the upper hand against the benefits of DOM, as it can eventually block the potential development, or even reuse, of the model. Then we explain that a solution to this \"side effect\" could structure the architecture of agents, a structure capable of maintaining readability and flexibility of the formalization of the agent throughout the growth process of the global model. We study a well known pattern in software engineering: the MVC pattern, which can be reused here to meet this objective. We will present in details how this pattern could be instantiated in the field of MAS architecture, and how, ultimately, it can be an effective new way to formalize agents in a method called Multi-Behaviors Modelization.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126877009","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":"Web Image Organization and Object Discovery by Actively Creating Visual Clusters through Crowdsourcing","authors":"Qi Chen, G. Wang, C. Tan","doi":"10.1109/ICTAI.2012.64","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.64","url":null,"abstract":"In this paper, we propose to organize web images by actively creating visual clusters via crowd sourcing. We develop a two-phase framework to efficiently and effectively combine computers and a large number of human workers to build high quality visual clusters. The first phase partitions an image collection into multiple clusters, the second phase refines each generated cluster independently. In both phases, informative images are selected by computers and manually labeled by the crowds to learn improved models. Our method can be naturally extended to discover object categories in a collection of image segments. Experimental results on several data sets demonstrate the promise of our developed approach on both web image organization and object discovery tasks.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"51 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116261795","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":"Modeling the Multihop Ridematching Problem with Time Windows and Solving It Using Genetic Algorithms","authors":"Wesam Herbawi, M. Weber","doi":"10.1109/ICTAI.2012.21","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.21","url":null,"abstract":"In ridesharing systems, drivers and riders decide to share their trips with each other for cost sharing, fun, reducing congenstion, etc. The ride matching problem with time windows consists of matching a set of drivers' offers and a set of riders' requests based on their sources, destinations and timing with detour willingness. If a request can be matched with only one offer, then the problem is called single hop ride matching. It is called multihop ride matching, if a request can be matched with two offers at different times. In this work, we model the multihop ride matching problem with time windows and provide a genetic algorithm to solve it. Experimentation results on a realistic dataset indicate that the multihop ride matching could increase the number of matched requests as compared with single hop ride matching.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"29 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121017794","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":"DERMA/Care: An Advanced image-Processing Mobile Application for Monitoring Skin Cancer","authors":"A. Karargyris, O. Karargyris, A. Pantelopoulos","doi":"10.1109/ICTAI.2012.180","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.180","url":null,"abstract":"This paper describes a mobile hardware/software system (DERMA/care) to help with screening of skin cancer (melanomas). Our system uses an inexpensive apparatus (microscope) and a smart phone (iPhone). These two components standalone are sufficient to capture highly detailed images for use by experts with medical background. However the novelty of our system lies in the fact that we further improved the efficiency of the system by implementing an advanced image-processing framework to detect suspicious areas and help with skin cancer prevention. Our main goal was to demonstrate how smart phones could turn into powerful and intelligent machines and help large populations without expertise in low-resource settings.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122894712","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":"Online Complex Action Learning and User State Estimation for Adaptive Dialogue Systems","authors":"A. Papangelis, V. Karkaletsis, F. Makedon","doi":"10.1109/ICTAI.2012.92","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.92","url":null,"abstract":"Dialogue Systems (DS) have been rapidly evolving during the last few years. In order for them to be able to adapt to their surroundings and to individual users, researchers have focused on adaptation techniques, giving rise to the field of Adaptive Dialogue Systems (ADS). One important sub field of ADS is learning what the system should say or do next. Most of the work done in this direction assumes the system performs simple actions, rather than behaviours described by sub-dialogues, i.e. complex actions. To this end we propose a novel online algorithm that ranks complex actions according to their performance and selects the top-k performing ones. To the best of our knowledge there is currently no work describing methods to learn policies for complex actions in an online fashion. We also propose an online algorithm able to estimate the effects of system actions on the user's state, in order to make more informed decisions about which action to take and guide the learning algorithm towards a desired final user state. Our results show that the proposed complex action learning algorithm outperforms simple Hierarchical Reinforcement Learning algorithms and that we are able to successfully estimate the effect an action will have on the user's state, using emotional states as a case study.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127733423","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":"Narrowing Extended Resolution","authors":"Nicolas Prcovic","doi":"10.1109/ICTAI.2012.81","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.81","url":null,"abstract":"Extended Resolution (i.e., Resolution incorporating the extension rule) is a more powerful proof system than Resolution because it can find polynomially bounded refutations of some SAT instances where Resolution alone cannot (and at the same time, every proof with resolution is still a valid proof with extended resolution). However it is very difficult to put it into practice because the extension rule is an additionnal source of combinatorial explosion, which tends to lengthen the time to discover a refutation. We call a restriction of Resolution forbiding the production of resolvents of size greater than 3 Narrow Resolution. We show that Narrow Extended Resolution p-simulates (unrestricted) Extended Resolution. We thus obtain a proof system whose combinatorics is highly reduced but which is still as powerful as before. However, the algorithms based on Resolution cannot be easily modified to accommodate this restriction on the resolution rule. This is why we define Splitting Resolution, a variant of Narrow Extended Resolution suitable for integrating into any resolution-based solver.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133844386","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 Cluster-Based Classifier Ensemble as an Alternative to the Nearest Neighbor Ensemble","authors":"A. Jurek, Y. Bi, Shengli Wu, C. Nugent","doi":"10.1109/ICTAI.2012.156","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.156","url":null,"abstract":"The combination of multiple classifiers, commonly referred to as an ensemble, has previously demonstrated the ability to improve overall classification accuracy in many application domains. Some ensemble techniques, however, cannot easily improve the performance of stable classification methods. One such example of a stable classification method is the k Nearest Neighbor (kNN) Classifier. In this paper we propose an alternative to the kNN ensemble method through the use of a clustering technique applied for the purpose of selecting the neighborhood of a new instance. In addition, a novel combination function based on exponential support (ExSupp) has been introduced. The proposed approach exhibited improved classification results in 16 out 20 data sets which were considered in comparison with a single kNN and a kNN ensemble based approach. Besides higher classification accuracy the proposed method exhibited higher levels of efficiency in terms of classification time.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115199792","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":"Local Search Based on Conflict Analysis for the Satisfiability Problem","authors":"Djamal Habet, Donia Toumi","doi":"10.1109/ICTAI.2012.124","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.124","url":null,"abstract":"In this paper, we propose a local search method that integrates conflict analysis, usually used as part of complete search, to solve the satisfiability problem (SAT). This integration provides to the local search the following improvements: use of unit propagation, consideration of the dependencies between variables, clause learning and finally the ability to prove the unsatisfiability.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116964658","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":"e-Care: Ontological Architecture for Telemonitoring and Alerts Detection","authors":"A. Benyahia, A. Hajjam, V. Hilaire, M. Hajjam","doi":"10.1109/ICTAI.2012.183","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.183","url":null,"abstract":"In most developed countries, life expectancy has been increasing steadily and burden of chronic disease continues to grow. The chronic diseases are responsible for increasingly growing health spending. Telemonitoring systems provide a way to monitor patients and their needs within the comfort of their own homes. In the first systems, the data were sent directly to the medical experts to be interpreted. With technological advancements, software and applications have been developed to process the data. In this paper, we will focus on e-Care platform that combines the semantic web and artificial intelligence, for telemonitoring. e-Care is based on generic ontologies to accommodate different conditions and types of sensors and data. A decision support is bases on an inference engine, this engine is used for following up the health of the patient and the detection of abnormal situations and react accordingly, by providing recommendations and informing his physician with alerts.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972605","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}
Konstantinos Avgerinakis, A. Briassouli, Y. Kompatsiaris
{"title":"Recognition of Activities of Daily Living","authors":"Konstantinos Avgerinakis, A. Briassouli, Y. Kompatsiaris","doi":"10.1109/ICTAI.2012.181","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.181","url":null,"abstract":"This paper presents a new method for human action recognition which exploits advantages of both trajectory and space-time based approaches in order to identify action patterns in given sequences. Videos with both a static and moving camera can be tackled, where camera motion effects are overcome via motion compensation. Only pixels undergoing changing motion, found by extracting motion boundary-based activity areas, are processed in order to introduce robustness to camera motion and reduce computational complexity. In these regions, densely sampled grid points on multiple scales are tracked using a KLT tracker, leading to dense multi-scale trajectories, on which HOGHOF descriptors are estimated. The length of each trajectory is determined by detecting changes in the tracked points' motion or appearance using sequential change detection techniques, namely the CUSUM approach. A vocabulary is created for each video's features using Hierarchical K-means, and the resulting fast search trees are used to describe the actions in the videos. SVMs are used for classification, using a kernel based on the similarity scores between training and testing videos. Experiments are carried out with new and challenging datasets for which the proposed method is shown to lead to recognition results that are comparable to or better than existing state of the art methods.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"-1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863779","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}