{"title":"Context-Dependent Adaptability in Crowd Behavior Simulation","authors":"Xiaolin Hu","doi":"10.1109/IRI.2006.252415","DOIUrl":"https://doi.org/10.1109/IRI.2006.252415","url":null,"abstract":"This paper applies a context-dependent behavior selection architecture to agent-based simulation of crowd behavior. In order to generate realistic humanlike crowd behaviors, we consider adaptability of an autonomous agent at two different levels: a behavior level where the agent makes adaptive selections among multiple competitive behaviors, and a behavioral context level where the agent modulates its behavior patterns according to different psychological and/or social states. A case study example of emergency response simulation is provided. The behavior and behavioral context models are described and simulation results are presented","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131110318","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}
Seok-Han Lee, Yong-In Yoon, Jong-Ho Choi, Chil-Woo Lee, Jin Tae Kim, J. Choi
{"title":"AR Squash Game","authors":"Seok-Han Lee, Yong-In Yoon, Jong-Ho Choi, Chil-Woo Lee, Jin Tae Kim, J. Choi","doi":"10.1109/IRI.2006.252478","DOIUrl":"https://doi.org/10.1109/IRI.2006.252478","url":null,"abstract":"In this paper, we describe AR squash game, which is a squash-style game based on AR (augmented reality) technique. We made this game using AR technique to estimate geometric information of images taken from a CCD camera. A CCD camera takes real-time images of a room formed by some number of walls, and the geometric information of the image is estimated using markers attached on the walls. By the geometric information and motion data of a ball created internally, a realistic scene is generated, in which the ball moves like a real one. And a user watches the computer screen displaying the mixed image, and tosses the ball using a racket connected to motion tracker. The position and the motion data of the racket is received from a 3D motion tracker","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131025945","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":"An Active Peer-to-Peer System for Heterogeneous Service Provisioning","authors":"Chi-Hung Chi, Mu Su, Lin Liu, Hongguang Wang","doi":"10.1109/IRI.2006.252381","DOIUrl":"https://doi.org/10.1109/IRI.2006.252381","url":null,"abstract":"Nowadays, peer-to-peer systems witness increasing number of queries with heterogeneous presentation requirements from peers resided on diverse devices. Unfortunately, conventional peer-to-peer file sharing systems can not effectively address this problem because they share and deliver objects with mono-presentation. This paper proposes App.Net.P2P architecture that aims to implements effective content delivery on peer-to-peer networks for heterogeneous service requirements. App.Net.P2P allows the peer node deliver original or intermediate objects with the associated processing logic to other peers, since the intermediate objects normally have higher reusability than their final presentations. And the peer is able to generate the correct presentations by dynamically downloading mobile applications from remote peers. Our simulation shows that by choosing appropriate replication strategies, App.Net.P2P can achieve higher system performance than conventional peer-to-peer systems minor overhead","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122595144","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 New Model for the Itinerary Definition of Real-Time Imprecise Mobile Agents","authors":"Luciana Rech, C. Montez, R. S. Oliveira","doi":"10.1109/IRI.2006.252399","DOIUrl":"https://doi.org/10.1109/IRI.2006.252399","url":null,"abstract":"In information retrieving applications, mobile agents may have to finish their mission before a deadline. Also, there may be some flexibility for the itinerary definition due to optional precedence relations. In this paper, it is described an execution model where real-time imprecise mobile agents do not previously know their itineraries. The mobile agent route must be defined so as to meet a firm deadline while it maximizes the mission benefit","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134051609","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}
Yoshitaka Sakurai, T. Onoyama, S. Kubota, Yoshihiro Nakamura, S. Tsuruta
{"title":"Selfish-gene Tolerant Generic Algorithms to solve large-scale constraint TSPs","authors":"Yoshitaka Sakurai, T. Onoyama, S. Kubota, Yoshihiro Nakamura, S. Tsuruta","doi":"10.1109/IRI.2006.252405","DOIUrl":"https://doi.org/10.1109/IRI.2006.252405","url":null,"abstract":"Large-scale distribution network simulation applicable to supply-chain management requires to solve hundreds of time-constraint large-scale (max 2000 cities) traveling salesman problems (TSP) within interactive response time, with practicable optimality. To meet this requirement, a selfish-gene tolerant type GA is proposed. Here, each gene of an individual satisfies only its constraints selfishly, disregarding the constraints of other genes in the same individual Further, to some extent, even individuals that violate constraints can survive over generations and are given the chance of improvement. Our experiment proves that this method provides expert-level solutions for time constraint large-scale TSPs within a few seconds","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127207566","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":"Enhancing Search Engine Performance using Expert Systems","authors":"Stan Lovic, M. Lu, Du Zhang","doi":"10.1109/IRI.2006.252476","DOIUrl":"https://doi.org/10.1109/IRI.2006.252476","url":null,"abstract":"Search engines of today do a great job of sifting through billions of pages of Internet content and returning search results highly relevant to user queries. However, in localized implementations (a local university search or an Intranet search of a private company), the same search engine technology usually has less than satisfactory performance. The technology that works well on billions of pages of general content doesn't work well on a much smaller scale of closely related content. In this paper, we analyze the performance problem in localized search engine implementations and identify specific performance issues through examining search logs. Our proposed solutions to those issues are based on utilizing an expert system where the fixes to the search issues are defined as a set of rules. We conduct experiments with California State University, Sacramento Web site, and the preliminary results indicate that when applying those rules to search engine queries and search results, search engine performance and user satisfaction are improved","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114488388","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. Seriai, M. Oussalah, D. Tamzalit, Olivier Le Goaër
{"title":"A Reuse-driven approach to update Component-Based Software Architectures","authors":"A. Seriai, M. Oussalah, D. Tamzalit, Olivier Le Goaër","doi":"10.1109/IRI.2006.252432","DOIUrl":"https://doi.org/10.1109/IRI.2006.252432","url":null,"abstract":"As the maintenance of software architectures emerges as a discipline within software engineering, it becomes increasingly important to propose new approaches to manage and facilitate it. In this paper we propose and describe the updating style as a reusable unit filling the gap between full-reusable solution and full-usable ones. Our updating styles aims at capitalizing update expertise, or know-hows, within component-based architectures for use and re-use purposes. An updating style is a family of update procedures dedicated to a business domain, sharing common tasks that have to be performed in the quite same order, to update a software architecture in a proven and safe way. The primary ideas of this research are: (a) an updating style is a building block to create increasingly complex update procedures by reuse; (b) an updating style is expressed on an architectural family, whose specific update procedures can be derived through instantiations; and (c) some updating styles can be run, after ad-hoc projections on environments","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114708382","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":"Reasoning about Dynamics of Trust and Agent Beliefs","authors":"M. Orgun, Chuchang Liu","doi":"10.1109/IRI.2006.252396","DOIUrl":"https://doi.org/10.1109/IRI.2006.252396","url":null,"abstract":"Many formal frameworks have been proposed for specifying and reasoning about the notion of trust and trust mechanisms in agent-based systems. Typed modal logic (TML) is a logic of beliefs which is suitable for the description of, and reasoning about, trust for multi-agent systems by formalising trust policies of the system and agent meta-beliefs in its security mechanisms. In this paper, by adopting the methodology of Finger and Gabbay for temporalising a logic system, we combine TML with a temporal logic, so that the users can also model evolving theories of trust. In the resulting logic, denoted by TML+, temporal properties of trust and agent beliefs can be expressed in a natural way by combinations of temporal and modal belief operators","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125560323","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":"Developing an Effective Validation Strategy for Genetic Programming Models Based on Multiple Datasets","authors":"Yi Liu, T. Khoshgoftaar, Jenq-Foung J. F. Yao","doi":"10.1109/IRI.2006.252418","DOIUrl":"https://doi.org/10.1109/IRI.2006.252418","url":null,"abstract":"Genetic programming (GP) is a parallel searching technique where many solutions can be obtained simultaneously in the searching process. However, when applied to real-world classification tasks, some of the obtained solutions may have poor predictive performances. One of the reasons is that these solutions only match the shape of the training dataset, failing to learn and generalize the patterns hidden in the dataset. Therefore, unexpected poor results are obtained when the solutions are applied to the test dataset. This paper addresses how to remove the solutions which will have unacceptable performances on the test dataset. The proposed method in this paper applies a multi-dataset validation phase as a filter in GP-based classification tasks. By comparing our proposed method with a standard GP classifier based on the datasets from seven different NASA software projects, we demonstrate that the multi-dataset validation is effective, and can significantly improve the performance of GP-based software quality classification models","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953291","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":"The Impact of Firm Size on Knowledge Reuse and Exploration during Software Product Development: an Empirical Study","authors":"S. Ajila","doi":"10.1109/IRI.2006.252406","DOIUrl":"https://doi.org/10.1109/IRI.2006.252406","url":null,"abstract":"This paper presents the result of empirical study of the effects of firm size on knowledge reuse and exploration in software development organizations in Canada and the US. A study of 50 software intensive organizations was done through survey questionnaire. The findings from this study showed that there are fundamental differences between small and large, and between high performance and low performance software organizations. Among other results, high performance organizations reported statistical significantly high levels of organization goals and concern for knowledge reuse and exploration than low performance organizations","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115428712","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}