{"title":"Modeling Executable Specifications with X-Spec and Water","authors":"M. Plusch, C. Fry, K. Haase, T. Farrell","doi":"10.1109/KIMAS.2007.369787","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369787","url":null,"abstract":"X-Spectrade is a business modeling tool and executable specification language that enables business people to describing requirements in their domain language. The specification, or model, can be shown in multiple editable views that use English and pictures. The specification is directly executed to deliver a fully-functional user interface for rich Internet applications. The model is available at run-time, since no code is generated. The model enforces the clean separation of user interface, controller logic, and services. X-Spec is built on the Water language. Watertrade is an open dynamic, object-based language that uses ConciseXMLtrade syntax. It is a multi-paradigm language that can represent many different modeling styles and forms of knowledge representation. Water can treat code as data, and is a meta-language for creating domain specific models. Water integrates many features of RDF and OWL. The Water language may be expressed in graphical views as well as ConciseXML.","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128129196","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":"Statistical Fusion of Unmanned Aerial Vehicle Observations for Aided Target Recognition","authors":"M. Simon, S. O'Hara, P. Petrov","doi":"10.1109/KIMAS.2007.369806","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369806","url":null,"abstract":"The use of computers and sensors to detect and classify targets, often called aided target recognition (ATR), is an important component of military and civilian surveillance. Carrying it out from unmanned aerial vehicles is expensive in terms of both manpower and hardware. In this paper, we discuss the creation of a distributed ATR (DATR) method which replaces a single monolithic approach to ATR with a more robust multi-agent method. We present software and algorithms which have been developed for the purpose of testing and proving the validity of DATR, as well as some of the implementation possibilities and steps which we have taken to further prove the validity of the approach. Our examples and experiments with the normal light-weight ATR algorithms for our agents, combined with a fusion method based on belief calculus to demonstrate what DATR would perform like, show the validity of the approach","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131079480","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. Paraense, Ricardo Ribeiro Gudwin, R. de Almeida Goncalves
{"title":"Brainmerge: a Semiotic-Oriented Software Development Process for Intelligence Augmentation Systems","authors":"A. Paraense, Ricardo Ribeiro Gudwin, R. de Almeida Goncalves","doi":"10.1109/KIMAS.2007.369819","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369819","url":null,"abstract":"In this paper we present \"Brainmerge\", a software development process designed according to semiotic principles in order to coordinate the steps required for the requirements specification, analysis and design of a special kind of intelligent system, which is usually described as intelligence augmentation systems (IAS). IAS represent an extension of decision support systems (DSS) with the use of AI techniques and usually dynamic decision making processes. Traditional software methodologies are usually inefficient when dealing with IAS, and our methodology aim at fulfilling these shortcomings. To illustrate the methodology we describe a real application in planning the circulation of trains in a single track railroad","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129326830","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 Computational Model for the Emergence of Lexicon and Evolution of Parsing","authors":"A. Toulkeridis, V. Petridis","doi":"10.1109/KIMAS.2007.369800","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369800","url":null,"abstract":"We present an evolutionary computational model for the emergence of binary words that denote shapes, positions and directions of camera-captured drawings. The emergence takes places in separate stages for each category. An additional evolutionary stage allows the evolution of a signal-ordering (parsing) convention among the agents","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129145121","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 Deliberative Planning with Partial Observability: Heuristic Approaches","authors":"D. Perugini, D. Jarvis, S. Reschke, S. Gossink","doi":"10.1109/KIMAS.2007.369844","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369844","url":null,"abstract":"Military operations typically involve cooperation of various military, government and commercial organizations from various nations. In order to coordinate these autonomous organizations, a social mechanism is required that facilitates deliberative planning and task allocation in decentralized, open and dynamic environments, and enables agreements via a legal contracting process. In this paper, we present (a component of) such a mechanism, called the legal agreement protocol (LAP). Agents that plan using LAP must plan with partial observability that is the customer is only aware of proposals (capabilities) that suppliers choose to send. This makes it difficult for the customer to determine the (minimum/average) expected cost of any unallocated sub-tasks in its search. In this paper, we present and compare various heuristics that allow the customer to dynamically determine the expected cost for sub-tasks as proposals are received during planning. We show that different heuristics have tradeoffs in terms of quality of solution and search effort (efficiency of search and quantity of communication). The number of distributed agents involved in planning also influences the effort required to search. More agents increase communication, but provide more information (observability) about agents' capabilities to be utilized by the heuristics","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130610689","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":"Holistan: A Futuristic Scenario for International Coalition Operations","authors":"D. Roberts, G. Lock, D. Verma","doi":"10.1109/KIMAS.2007.369847","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369847","url":null,"abstract":"Scenarios play an important role in driving the research agenda for programs focused on improving effectiveness in network centric operations. Several excellent scenarios such as Binni (www.binni.org) have played a key role in motivating research projects. However, as the geopolitical situation in the world has evolved, several new factors have become prominent that require the creation of a new scenario. This paper presents a new scenario for coalition operations that was developed to drive the research in the International Technology Alliance program, a multi-disciplinary multi-year program between the US and UK","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123386407","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":"Optimal Estimation of Parameters of Transient Mixture Processes Using Dynamic Logic Approach","authors":"R. Kozma, L. Perlovsky, R. Deming","doi":"10.1109/KIMAS.2007.369775","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369775","url":null,"abstract":"In this work we generalize dynamic logic approach for the case of time transient processes with time-dependent energy function. Earlier studies have laid down the firm foundations of DL to pattern recognition in the presence of very high noise and clutter. We derive DL equations with time-dependent energy function and apply it to the detection of transient processes in 2-dimensional images. The developed method has been tested on simulated data. The results show good accuracy of the estimation of transient parameters, including the gradient of spatial propagation, and rate of the energy increase/decrease in the case of processes with explosive/implosive processes, respectively","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125210600","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}
V. Tikhanoff, A. Cangelosi, J. Fontanari, L. Perlovsky
{"title":"Scaling Up of Action Repertoire in Linguistic Cognitive Agents","authors":"V. Tikhanoff, A. Cangelosi, J. Fontanari, L. Perlovsky","doi":"10.1109/KIMAS.2007.369803","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369803","url":null,"abstract":"We suggest the utilization of the modeling field theory (MFT) to deal with the combinatorial complexity problem of language modeling in cognitive robotics. In new simulations we extend our previous MFT model of language to deal with the scaling up of the robotic agent's action repertoire. Simulations are divided into two stages. First agents learn to classify 112 different actions inspired by an alphabet system (the semaphore flag signaling system). In the second stage, agents also learn a lexical item to name each action. At this stage the agents will start to describe the action as a \"word\" comprised of three letters (consonant - vowel - consonant). The results of the simulations demonstrate that: (i) agents are able to acquire a complex set of actions by building sensorimotor concept-models; (ii) agents are able to learn a lexicon to describe these objects/actions through a process of cultural learning; and (iii) agents learn actions as basic gestures in order to generate composite actions","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127835755","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}
T. Kawamura, K. Sugahara, S. Kinoshita, R. Nakatani, S. Motomura
{"title":"Backup and Recovery Scheme for Multi-Agent-based e-Learning System","authors":"T. Kawamura, K. Sugahara, S. Kinoshita, R. Nakatani, S. Motomura","doi":"10.1109/KIMAS.2007.369788","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369788","url":null,"abstract":"We have developed a distributed asynchronous Web based training system. In order to improve the scalability and robustness of this system, all contents and a function that scores user's answers are realized on mobile agents. These agents are distributed to computers, and they can obtain using a P2P network that modified content-addressable network. In this system, although entire services do not become impossible even if some computers break down, the problem that contents disappear occurs with an agent's disappearance. In this study, as a solution for this problem, backups of agents are distributed to computers. If a failure of a computer is detected, other computer will continue service using backups of the agents belonged to the computer. The developed algorithms are examined by experiments.","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115352585","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":"Generalisation towards Combinatorial Productivity in Language Acquisition by Simple Recurrent Networks","authors":"F.C.K. Wong, W. Wang","doi":"10.1109/KIMAS.2007.369799","DOIUrl":"https://doi.org/10.1109/KIMAS.2007.369799","url":null,"abstract":"Language exhibits combinatorial productivity as complex constructions are composed of simple elements in a linear or hierarchical fashion. Complexity arises as one cannot be exposed to all possible combinations during ontogeny and yet to master a language one need to be, and very often is, able to generalise to process and comprehend constructions that are of novel combinations. Accounting for such an ability is a current challenge being tackled in connectionist research. In this study, we will first demonstrate that connectionist networks do generalise towards combinatorial productivity followed by an investigation of how the networks could achieve that","PeriodicalId":193808,"journal":{"name":"2007 International Conference on Integration of Knowledge Intensive Multi-Agent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114067934","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}