Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506542
C. Polychronopoulos
In this paper we outline our vision on utility computing and communications and give an overview of our research's baby steps toward virtualizing computing into a Internet-based service. Notwithstanding significant research problems that need to be solved, including latency and bandwidth guarantees for remote access and execution models, hardware resource visualization offers an attractive proposition from the technology and cost perspectives.
{"title":"Computational network federations: computing & communications as a utility","authors":"C. Polychronopoulos","doi":"10.1109/PERSER.2005.1506542","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506542","url":null,"abstract":"In this paper we outline our vision on utility computing and communications and give an overview of our research's baby steps toward virtualizing computing into a Internet-based service. Notwithstanding significant research problems that need to be solved, including latency and bandwidth guarantees for remote access and execution models, hardware resource visualization offers an attractive proposition from the technology and cost perspectives.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639401","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}
Web services is already an infrastructure for practical e-Business. At the same time, mobile devices such as smart phones and PDAs are widely used by end-users these days. In this paper, we focus on interactions between Web services and the mobile devices during execution of a service flow. Frequent interactions decrease the usability of the service flow for the mobile users, and increase the total processing time and data amount. Thus, we propose an user agent who executes the service flow instead of the users. We first illustrate how the agent is automatically created for the service flow, then evaluate it on the user interaction, the processing time and the data amount. Finally we discuss its applicability to a standard Web services flow language, BPEL.
{"title":"Web services user agent supporting interactions between mobile users and service flows","authors":"Takahiro Kawamura, Akihiko Ohsuga, Tatsuya Terasaki","doi":"10.1109/PERSER.2005.1506549","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506549","url":null,"abstract":"Web services is already an infrastructure for practical e-Business. At the same time, mobile devices such as smart phones and PDAs are widely used by end-users these days. In this paper, we focus on interactions between Web services and the mobile devices during execution of a service flow. Frequent interactions decrease the usability of the service flow for the mobile users, and increase the total processing time and data amount. Thus, we propose an user agent who executes the service flow instead of the users. We first illustrate how the agent is automatically created for the service flow, then evaluate it on the user interaction, the processing time and the data amount. Finally we discuss its applicability to a standard Web services flow language, BPEL.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122338734","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506416
F. Cabitza, M. Sarini, B. D. Seno
In this paper DJess is presented, a Java package that provides programmers with a lightweight middleware by which inference systems implemented in Jess and running on different nodes of a pervasive computing ensemble can transparently share both contextual knowledge (facts) and reactive behaviors (rules). Communication and coordination among inference systems (agents) is achieved through the ability of each agent to reason asynchronously on facts, i.e., propositional expressions representing the context, that might even be asserted by other agents on the basis of inference code (rules), which can be either local or transmitted by any node to any other node. Pervasive computing is the main reference domain that guided the design of the DJess architecture and still drives the API development.
{"title":"DJess - a context-sharing middleware to deploy distributed inference systems in pervasive computing domains","authors":"F. Cabitza, M. Sarini, B. D. Seno","doi":"10.1109/PERSER.2005.1506416","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506416","url":null,"abstract":"In this paper DJess is presented, a Java package that provides programmers with a lightweight middleware by which inference systems implemented in Jess and running on different nodes of a pervasive computing ensemble can transparently share both contextual knowledge (facts) and reactive behaviors (rules). Communication and coordination among inference systems (agents) is achieved through the ability of each agent to reason asynchronously on facts, i.e., propositional expressions representing the context, that might even be asserted by other agents on the basis of inference code (rules), which can be either local or transmitted by any node to any other node. Pervasive computing is the main reference domain that guided the design of the DJess architecture and still drives the API development.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126490464","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506426
Katerina Raptopoulou, A. Papadopoulos, Y. Manolopoulos
In databases of moving objects it is important to answer queries that concern the future positions of the objects. An important query type in such an environment is the nearest-neighbor query, which asks for the k closest objects of a query object during a time interval [t/sub s/, t/sub e/]. However, there are cases where the (k+1)-th nearest-neighbor is requested after the execution of the k-NN query. In such a case, either the query must be evaluated again, or we can exploit the previous result and use an incremental method to determine the new answer. We focus on the second alternative and present efficient incremental algorithms that outperform the trivial method which is based on complete re-execution of the query. In addition, we study the problem of keeping the query result consistent in the presence of object insertions, deletions and updates which are very common in a dynamic moving-object environment.
{"title":"Incremental nearest-neighbor search in moving objects","authors":"Katerina Raptopoulou, A. Papadopoulos, Y. Manolopoulos","doi":"10.1109/PERSER.2005.1506426","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506426","url":null,"abstract":"In databases of moving objects it is important to answer queries that concern the future positions of the objects. An important query type in such an environment is the nearest-neighbor query, which asks for the k closest objects of a query object during a time interval [t/sub s/, t/sub e/]. However, there are cases where the (k+1)-th nearest-neighbor is requested after the execution of the k-NN query. In such a case, either the query must be evaluated again, or we can exploit the previous result and use an incremental method to determine the new answer. We focus on the second alternative and present efficient incremental algorithms that outperform the trivial method which is based on complete re-execution of the query. In addition, we study the problem of keeping the query result consistent in the presence of object insertions, deletions and updates which are very common in a dynamic moving-object environment.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131344314","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506411
Y. Kishino, T. Terada, M. Tsukamoto, T. Yoshihisa, K. Hayakawa, A. Kashitani, S. Nishio
In this paper, we propose a new network topology discovery mechanism among ubiquitous chips, which are rule-based, event-driven input/output (I/O) control devices to compose ubiquitous computing environments. Since they achieve flexibility by describing behavior in a set of rules, we employ a rule-based approach to discover network topology. In ubiquitous computing environments, we use various communication methods and applications at the same time. Therefore, our flexible discovery mechanism works well in ubiquitous computing environments. Moreover, we verified our algorithm by implementing it on a topology discovery simulator and actual prototype devices of ubiquitous chips.
{"title":"A rule-based discovery mechanism of network topology among ubiquitous chips","authors":"Y. Kishino, T. Terada, M. Tsukamoto, T. Yoshihisa, K. Hayakawa, A. Kashitani, S. Nishio","doi":"10.1109/PERSER.2005.1506411","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506411","url":null,"abstract":"In this paper, we propose a new network topology discovery mechanism among ubiquitous chips, which are rule-based, event-driven input/output (I/O) control devices to compose ubiquitous computing environments. Since they achieve flexibility by describing behavior in a set of rules, we employ a rule-based approach to discover network topology. In ubiquitous computing environments, we use various communication methods and applications at the same time. Therefore, our flexible discovery mechanism works well in ubiquitous computing environments. Moreover, we verified our algorithm by implementing it on a topology discovery simulator and actual prototype devices of ubiquitous chips.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122587382","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}
Most simulation studies of context-aware systems have not involved the aspect of changes of the environment or users' context, notably changes triggered by the elapse of time or users' own action. We proposed an evaluation method to simulate user operations with a user model in which the user preference or the user context changes based on events such as sensor information or the user's actions. Through implementation of an evaluation system for a drive planner system, we confirmed a virtual user's action and acquired directions for evaluation of context-aware systems.
{"title":"User-model-based adaptability evaluation for context-aware systems","authors":"Masayuki Okamoto, Kenta Cho, Yuzo Okamoto, Tomohiro Yamasaki, Masanori Hattori","doi":"10.1109/PERSER.2005.1506570","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506570","url":null,"abstract":"Most simulation studies of context-aware systems have not involved the aspect of changes of the environment or users' context, notably changes triggered by the elapse of time or users' own action. We proposed an evaluation method to simulate user operations with a user model in which the user preference or the user context changes based on events such as sensor information or the user's actions. Through implementation of an evaluation system for a drive planner system, we confirmed a virtual user's action and acquired directions for evaluation of context-aware systems.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958195","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506417
A. Levas, G. Pingali, Mark Podlaseck, J. William Murdock
Strides made in semiconductor technology and pervasive devices are fueling the ability to amass ever-increasing volumes of rich multimedia data chronicling the activities and experiences of enterprise employees. Rich content analytics are crucial to exploit the potential of such electronic chronicles, which represent a vital untapped resource in today's enterprises. This paper describes a system called Picasso that adds a new dimension to enterprise search and mining, by capturing and structuring information surrounding employee activities and making available vital insights from such information through our unstructured information management architecture (UIMA).
{"title":"Exploiting pervasive enterprise chronicles using unstructured information management","authors":"A. Levas, G. Pingali, Mark Podlaseck, J. William Murdock","doi":"10.1109/PERSER.2005.1506417","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506417","url":null,"abstract":"Strides made in semiconductor technology and pervasive devices are fueling the ability to amass ever-increasing volumes of rich multimedia data chronicling the activities and experiences of enterprise employees. Rich content analytics are crucial to exploit the potential of such electronic chronicles, which represent a vital untapped resource in today's enterprises. This paper describes a system called Picasso that adds a new dimension to enterprise search and mining, by capturing and structuring information surrounding employee activities and making available vital insights from such information through our unstructured information management architecture (UIMA).","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114617155","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506380
I. Akyildiz
Summary form only given. Key technologies such as wireless sensor networks, sensor and actor networks, WiMAX, wireless mesh networks, hybrid networks, are presented and several research challenges are highlighted. Predictions about the wireless technology development for the next decade are listed.
{"title":"Key technologies for wireless networking in the next decade","authors":"I. Akyildiz","doi":"10.1109/PERSER.2005.1506380","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506380","url":null,"abstract":"Summary form only given. Key technologies such as wireless sensor networks, sensor and actor networks, WiMAX, wireless mesh networks, hybrid networks, are presented and several research challenges are highlighted. Predictions about the wireless technology development for the next decade are listed.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133259344","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506401
Katia Leal, Francisco J. Ballesteros, Enrique Soriano, Gorka Guardiola
Current approaches handling user's activity mobility address the problem by imposing system decisions instead of user's indications in an attempt to reduce user's distraction. At the same time, these traditional approaches introduce uniformity on the environment, thus preventing users to take full advantage of the computational resources found nearby. We describe an alternative architectural model that better solves the problem of supporting user's mobility, reducing user's distraction, and respecting user's preferences. One of the key features of our solution is that users can directly control their activities. Thus, the PlanB's ubiquitous terminal (UbiTerm) provides activity control commands to users. In addition, to take appropriate actions when adapting the environment to user needs, the UbiTerm uses a context information mechanism. Finally, by using a programmable service for the remote execution of applications, the architecture can exploit local capabilities, provide support in different platforms, and fit activities to user's preferences.
{"title":"UbiTerm: a hand-held control-center for user's activity mobility","authors":"Katia Leal, Francisco J. Ballesteros, Enrique Soriano, Gorka Guardiola","doi":"10.1109/PERSER.2005.1506401","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506401","url":null,"abstract":"Current approaches handling user's activity mobility address the problem by imposing system decisions instead of user's indications in an attempt to reduce user's distraction. At the same time, these traditional approaches introduce uniformity on the environment, thus preventing users to take full advantage of the computational resources found nearby. We describe an alternative architectural model that better solves the problem of supporting user's mobility, reducing user's distraction, and respecting user's preferences. One of the key features of our solution is that users can directly control their activities. Thus, the PlanB's ubiquitous terminal (UbiTerm) provides activity control commands to users. In addition, to take appropriate actions when adapting the environment to user needs, the UbiTerm uses a context information mechanism. Finally, by using a programmable service for the remote execution of applications, the architecture can exploit local capabilities, provide support in different platforms, and fit activities to user's preferences.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117184089","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}
Pub Date : 2005-07-11DOI: 10.1109/PERSER.2005.1506384
G. Santhanakrishnan, Qinglan Li, J. Beaver, Panos K. Chrysanthis, A. Amer, Alexandros Labrinidis
Interconnected computing nodes in pervasive systems demand efficient management to ensure longevity and effectiveness. This is particularly true when we consider wireless sensor networks, for which we propose a new scheme for adaptive route management. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power. However there has been comparatively less prior art in the area of semantic and multi-criteria based routing. We look at routing in sensor networks from these perspectives and propose an adaptive multi-criteria routing protocol in the context of wireless sensor networks. Our experimental results show that our approach consistently outperforms the leading multi-criteria algorithm in its class that considers query semantics, in terms of network lifetime, network coverage and the survivability of critical nodes.
{"title":"Multi-criteria routing in pervasive environment with sensors","authors":"G. Santhanakrishnan, Qinglan Li, J. Beaver, Panos K. Chrysanthis, A. Amer, Alexandros Labrinidis","doi":"10.1109/PERSER.2005.1506384","DOIUrl":"https://doi.org/10.1109/PERSER.2005.1506384","url":null,"abstract":"Interconnected computing nodes in pervasive systems demand efficient management to ensure longevity and effectiveness. This is particularly true when we consider wireless sensor networks, for which we propose a new scheme for adaptive route management. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power. However there has been comparatively less prior art in the area of semantic and multi-criteria based routing. We look at routing in sensor networks from these perspectives and propose an adaptive multi-criteria routing protocol in the context of wireless sensor networks. Our experimental results show that our approach consistently outperforms the leading multi-criteria algorithm in its class that considers query semantics, in terms of network lifetime, network coverage and the survivability of critical nodes.","PeriodicalId":375822,"journal":{"name":"ICPS '05. Proceedings. International Conference on Pervasive Services, 2005.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121386041","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
扫码关注我们
求助内容：
应助结果提醒方式：