This paper describes the initial PhD research work for developing an innovative process for agent coordination in unstructured distributed environments. In this proposal, an agent that receives a request will use an AI-based planning algorithm to decompose the received request into several subtasks; it will handle those for which it has know-how and available resources; and it will use decentralized networks computing methods to delegate the rest of the request to other agents that can possibly handle it. These, in turn, will recursively apply the same process until the initial request is completely solved or until some specified termination condition holds. The work contributions to the state-of-the-art are: the creation of an AI-based planning algorithm capable of partial task decomposition with only partial knowledge of available planning operators; and the creation of a coordination infrastructure that enables agents to delegate subtasks to other agents in totally unstructured decentralized environments
{"title":"Task Decomposition and Delegation Algorithms for Coordinating Unstructured Multi Agent Systems","authors":"A. Lopes, L. Botelho","doi":"10.1109/CISIS.2007.52","DOIUrl":"https://doi.org/10.1109/CISIS.2007.52","url":null,"abstract":"This paper describes the initial PhD research work for developing an innovative process for agent coordination in unstructured distributed environments. In this proposal, an agent that receives a request will use an AI-based planning algorithm to decompose the received request into several subtasks; it will handle those for which it has know-how and available resources; and it will use decentralized networks computing methods to delegate the rest of the request to other agents that can possibly handle it. These, in turn, will recursively apply the same process until the initial request is completely solved or until some specified termination condition holds. The work contributions to the state-of-the-art are: the creation of an AI-based planning algorithm capable of partial task decomposition with only partial knowledge of available planning operators; and the creation of a coordination infrastructure that enables agents to delegate subtasks to other agents in totally unstructured decentralized environments","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115235286","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}
In this paper we present the design of a system which allows service deployment in a small-sized group of computers distributed through the Internet. These groups are formed by users who share a common interest, and voluntarily yield their own resources for the achievement of the collaborative activities of the group. Having enough resources contributed by the members of the group, our system guarantees service availability and the fact that the deployment and execution of the services is carried out using only the resources of the group. This management is done in a completely decentralized manner, and the system is self-organized in the presence of component connections, disconnections and failures. We demonstrate its validity through the implementation of a prototype and the execution of some tests, which allow us to guarantee that the system is self-organized, always reaching a consistent state
{"title":"Decentralized Service Deployment for Collaborative Environments","authors":"D. Iglesias, J. Marquès, J. J. Esteve","doi":"10.1109/CISIS.2007.18","DOIUrl":"https://doi.org/10.1109/CISIS.2007.18","url":null,"abstract":"In this paper we present the design of a system which allows service deployment in a small-sized group of computers distributed through the Internet. These groups are formed by users who share a common interest, and voluntarily yield their own resources for the achievement of the collaborative activities of the group. Having enough resources contributed by the members of the group, our system guarantees service availability and the fact that the deployment and execution of the services is carried out using only the resources of the group. This management is done in a completely decentralized manner, and the system is self-organized in the presence of component connections, disconnections and failures. We demonstrate its validity through the implementation of a prototype and the execution of some tests, which allow us to guarantee that the system is self-organized, always reaching a consistent state","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129323821","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}
Congestion in wireless sensor networks leads to the degradation of communication links that result in decreased throughput and waste of energy which is one of the scarcest resources of a sensor node. Various techniques have been proposed to cope with data congestion, such as data aggregation techniques, multi hop routing techniques and flow control techniques. Although these techniques help to avoid or control congestion, they do not address the issue of data persistency effectively. This paper presents an adaptive self configuring in-network storage model for data persistency in wireless sensor networks. The model is built on a clustered sensor field where we have utilized dense node deployment in the vicinity of the routing nodes to act as data buffers during congestion periods in order to avoid data loss. We show that the in-network storage model can be used in combination with congestion avoidance/control techniques to develop data persistent congestion avoidance/control strategies
{"title":"In-Network Storage Model for Data Persistence under Congestion in Wireless Sensor Network","authors":"M. Khan, W. Gansterer, G. Haring","doi":"10.1109/CISIS.2007.33","DOIUrl":"https://doi.org/10.1109/CISIS.2007.33","url":null,"abstract":"Congestion in wireless sensor networks leads to the degradation of communication links that result in decreased throughput and waste of energy which is one of the scarcest resources of a sensor node. Various techniques have been proposed to cope with data congestion, such as data aggregation techniques, multi hop routing techniques and flow control techniques. Although these techniques help to avoid or control congestion, they do not address the issue of data persistency effectively. This paper presents an adaptive self configuring in-network storage model for data persistency in wireless sensor networks. The model is built on a clustered sensor field where we have utilized dense node deployment in the vicinity of the routing nodes to act as data buffers during congestion periods in order to avoid data loss. We show that the in-network storage model can be used in combination with congestion avoidance/control techniques to develop data persistent congestion avoidance/control strategies","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"6 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132236943","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}
P. Bertasi, Mauro Bianco, A. Pietracaprina, G. Pucci
We address the problem of developing a suite of microbenchmarking experiments aimed at providing the basic functionalities of a measurement tool for a P2P-based globally distributed computing platform, usually referred to as overlay computer. We argue that such a measuring system should take into account the communication patterns generated by the applications in order to provide useful performance insights
{"title":"Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer","authors":"P. Bertasi, Mauro Bianco, A. Pietracaprina, G. Pucci","doi":"10.1109/CISIS.2007.41","DOIUrl":"https://doi.org/10.1109/CISIS.2007.41","url":null,"abstract":"We address the problem of developing a suite of microbenchmarking experiments aimed at providing the basic functionalities of a measurement tool for a P2P-based globally distributed computing platform, usually referred to as overlay computer. We argue that such a measuring system should take into account the communication patterns generated by the applications in order to provide useful performance insights","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127045819","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}
Mechanisms for accessing and training the data repository using a binary matrix formalism are presented. The repository is designed for a data storage through corresponding instances of simple attribute functional dependencies, which can be seen as similar to the binary predicate formalism being used by the RDF semantic Web format. Two mechanisms for querying a repository, the generalisation and the specialisation, are given. Furthermore, the incremental repository training mechanism is described: The extensional functional dependency system is used as a generalised view on the stored data; the algorithm is inspired by the functional dependency discovery approach
{"title":"Data Structure Estimation for RDF Oriented Repository Building","authors":"Martin Rimnac","doi":"10.1109/CISIS.2007.17","DOIUrl":"https://doi.org/10.1109/CISIS.2007.17","url":null,"abstract":"Mechanisms for accessing and training the data repository using a binary matrix formalism are presented. The repository is designed for a data storage through corresponding instances of simple attribute functional dependencies, which can be seen as similar to the binary predicate formalism being used by the RDF semantic Web format. Two mechanisms for querying a repository, the generalisation and the specialisation, are given. Furthermore, the incremental repository training mechanism is described: The extensional functional dependency system is used as a generalised view on the stored data; the algorithm is inspired by the functional dependency discovery approach","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130715777","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}
The distributed queue dual bus network is a LAN/MAN protocol proposed by the IEEE 802.6 committee. It can integrate isochronous and nonisochronous services. Due to its medium access control protocol, the network has the unfairness of access for bursty traffic. This paper explores the effect of bursty lengths on the unfairness. In the simulations of the paper, the average delays of distributed and local queues of nodes are calculated for exhibiting the variation of unfairness corresponding to the alteration in the number of cells of bursty messages. The simulation shows that the unfairness is obviously affected by bursty lengths. As the number of cells increases, the unfairness of the delay of distributed queues will be more moderate. But the unfairness of the delay of local queues will become more severe. On the other hand, the throughput of the network is irrelevant to the bursty length
{"title":"The Effect of Bursty Lengths on DQDB Networks","authors":"R. Chiou, Jinn-Kwei Guo","doi":"10.1109/CISIS.2007.53","DOIUrl":"https://doi.org/10.1109/CISIS.2007.53","url":null,"abstract":"The distributed queue dual bus network is a LAN/MAN protocol proposed by the IEEE 802.6 committee. It can integrate isochronous and nonisochronous services. Due to its medium access control protocol, the network has the unfairness of access for bursty traffic. This paper explores the effect of bursty lengths on the unfairness. In the simulations of the paper, the average delays of distributed and local queues of nodes are calculated for exhibiting the variation of unfairness corresponding to the alteration in the number of cells of bursty messages. The simulation shows that the unfairness is obviously affected by bursty lengths. As the number of cells increases, the unfairness of the delay of distributed queues will be more moderate. But the unfairness of the delay of local queues will become more severe. On the other hand, the throughput of the network is irrelevant to the bursty length","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122991060","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}
In the last few years we have observed an explosive growth of multimedia computing, communication and applications. Information technology (IT) has a great effect in our everyday life and is transforming the way people live, work, and interact with each other, and is impacting the way businesses, government services, education, entertainment, and medical-care are operating. In this research, we propose and develop a remote medical-care system for supporting nurses, care managers and care helpers during their work. The proposed system has three functions: a multi-point communication function using video images and voice, vital signs data auto-uploading and referring function, and a drip infusion monitoring function. In this paper, we present the proposed remote medical-care support system
{"title":"Design and Implementation of a Remote Medical-Care Supporting System","authors":"A. Koyama, J. Arai, Satoshi Sasaki, L. Barolli","doi":"10.1109/CISIS.2007.19","DOIUrl":"https://doi.org/10.1109/CISIS.2007.19","url":null,"abstract":"In the last few years we have observed an explosive growth of multimedia computing, communication and applications. Information technology (IT) has a great effect in our everyday life and is transforming the way people live, work, and interact with each other, and is impacting the way businesses, government services, education, entertainment, and medical-care are operating. In this research, we propose and develop a remote medical-care system for supporting nurses, care managers and care helpers during their work. The proposed system has three functions: a multi-point communication function using video images and voice, vital signs data auto-uploading and referring function, and a drip infusion monitoring function. In this paper, we present the proposed remote medical-care support system","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114850090","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}
This paper presents a middleware for multi-agents on a distributed system as a general test-bed for bio-inspired approaches. It is unique to other approaches, including distributed object systems, because it can maintain and migrate a dynamic federation of multiple agents on different computers. It enables each agent to explicitly define its own deployment policy as a relocation between itself and another agent. This paper describes a prototype implementation of the middleware and its practical applications to illustrate its utility and effectiveness in real distributed systems instead of using simulation-based evaluations
{"title":"Cell-Locomotion-Based Agent Migration over Distributed Systems","authors":"I. Satoh","doi":"10.1109/CISIS.2007.13","DOIUrl":"https://doi.org/10.1109/CISIS.2007.13","url":null,"abstract":"This paper presents a middleware for multi-agents on a distributed system as a general test-bed for bio-inspired approaches. It is unique to other approaches, including distributed object systems, because it can maintain and migrate a dynamic federation of multiple agents on different computers. It enables each agent to explicitly define its own deployment policy as a relocation between itself and another agent. This paper describes a prototype implementation of the middleware and its practical applications to illustrate its utility and effectiveness in real distributed systems instead of using simulation-based evaluations","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131204797","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}
J. Barbarán, M. Díaz, I. Esteve, Daniel Garrido, L. Llopis, B. Rubio
Wireless sensor and actor networks (WSANs) constitute an emerging and pervasive technology that is attracting increased interest for a wide range of applications. The increasing functionality of this kind of network makes it necessary to propose tools and methodologies to facilitate software development. This paper proposes a middleware called MWSAN to provide a set of high level services for sensor and actor networks. The middleware meets the component-oriented paradigm and developers can configure it depending on the actor and sensor resources. It takes into account issues such as the network configuration, the quality of service (QoS) and the coordination among actors. MWSAN is specified in UM-RTCOM, a component model oriented to real time systems adapted to WSANs that allows us to take into account real time requirements in the applications. Additionally, we present an implementation model based on RT Java for actors. In order to apply the proposed middleware we describe an example specified in UM-RTCOM and its RT Java implementation
{"title":"A Real-Time Component-Oriented Middleware for Wireless Sensor and Actor Networks","authors":"J. Barbarán, M. Díaz, I. Esteve, Daniel Garrido, L. Llopis, B. Rubio","doi":"10.1109/CISIS.2007.7","DOIUrl":"https://doi.org/10.1109/CISIS.2007.7","url":null,"abstract":"Wireless sensor and actor networks (WSANs) constitute an emerging and pervasive technology that is attracting increased interest for a wide range of applications. The increasing functionality of this kind of network makes it necessary to propose tools and methodologies to facilitate software development. This paper proposes a middleware called MWSAN to provide a set of high level services for sensor and actor networks. The middleware meets the component-oriented paradigm and developers can configure it depending on the actor and sensor resources. It takes into account issues such as the network configuration, the quality of service (QoS) and the coordination among actors. MWSAN is specified in UM-RTCOM, a component model oriented to real time systems adapted to WSANs that allows us to take into account real time requirements in the applications. Additionally, we present an implementation model based on RT Java for actors. In order to apply the proposed middleware we describe an example specified in UM-RTCOM and its RT Java implementation","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132023062","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}
Recently, many applications of VR called collaborative virtual environment (CVE) have been proposed and their cooperation methods by users and scalability issues to support a number of users have been investigated. However, by using conventional client/server model, the usability of co-operative works by users degreases and scalability in CVE cannot be attained as the number of the user increases. Also, in conventional CVE system, the presentation and interaction of 3D objects in CVE to users were simple, limited and did not consider the users background such as users interest and generation. Eventually the user satisfaction for CVE application was not necessarily enough. In order to overcome those difficulties, we introduce a new method which uses P2P overlay network to realize scalable CVE and recommendation system which uses user's interest to present and offer the proper objects in CVE. Using our suggested method, the 3D objects are distributed on the P2P overlay networks and their computing loads can be reduced, eventually the scalability of the CVE can be improved. Furthermore, by reflecting user interest information to the application system, user can access and communicate to 3D objects and contents in which he or she is more interested with higher priority. Thus, the total usability of the CVE system can be improved. In this paper, we propose a new CVE system using P2P overlay network and user recommendation system to reflect user s interest
{"title":"Sclable Collaborative Virtual Environment Considering User's Interests Based on P2P Overlay Network","authors":"Y. Nakai, Y. Shibata","doi":"10.1109/CISIS.2007.50","DOIUrl":"https://doi.org/10.1109/CISIS.2007.50","url":null,"abstract":"Recently, many applications of VR called collaborative virtual environment (CVE) have been proposed and their cooperation methods by users and scalability issues to support a number of users have been investigated. However, by using conventional client/server model, the usability of co-operative works by users degreases and scalability in CVE cannot be attained as the number of the user increases. Also, in conventional CVE system, the presentation and interaction of 3D objects in CVE to users were simple, limited and did not consider the users background such as users interest and generation. Eventually the user satisfaction for CVE application was not necessarily enough. In order to overcome those difficulties, we introduce a new method which uses P2P overlay network to realize scalable CVE and recommendation system which uses user's interest to present and offer the proper objects in CVE. Using our suggested method, the 3D objects are distributed on the P2P overlay networks and their computing loads can be reduced, eventually the scalability of the CVE can be improved. Furthermore, by reflecting user interest information to the application system, user can access and communicate to 3D objects and contents in which he or she is more interested with higher priority. Thus, the total usability of the CVE system can be improved. In this paper, we propose a new CVE system using P2P overlay network and user recommendation system to reflect user s interest","PeriodicalId":328547,"journal":{"name":"First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130855387","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：