发布求助
文献互助 智能选刊 最新文献

The 2005 Symposium on Applications and the Internet最新文献

筛选
英文 中文
The fluid computing middleware: bringing application fluidity to the mobile Internet 流体计算中间件:为移动互联网带来应用的流动性
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.63
D. Bourges-Waldegg, Yann Duponchel, M. Graf, M. Moser
{"title":"The fluid computing middleware: bringing application fluidity to the mobile Internet","authors":"D. Bourges-Waldegg, Yann Duponchel, M. Graf, M. Moser","doi":"10.1109/SAINT.2005.63","DOIUrl":"https://doi.org/10.1109/SAINT.2005.63","url":null,"abstract":"The fluid computing middleware allows application data to flow, as a liquid, between devices. The middleware, based on the model-view-controller design pattern, transforms a collection of devices into a cooperative platform and provides application programmers with appropriate abstractions to use generic data management services, such as data replication and synchronization of arbitrary data structures. Relieved from managing this underlying complexity, programmers can focus on developing new application functionality. In particular, they can program applications that seamlessly transition between devices and connectivity degrees, by relying on the fluid real-time optimistic replication mechanism. By shifting the focus from the network and devices to the data, fluid computing enables new interaction paradigms, where users can access and manipulate their data from any of their devices transparently. Applications, then, become multidevice - a characteristic that can be applied to both single-user and collaboration scenarios.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117101463","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}
引用次数: 23
A timer-based protocol for connected dominating set construction in IEEE 802.11 multihop mobile ad hoc networks 基于定时器的IEEE 802.11多跳移动自组网连接支配集构建协议
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.9
Dong Zhou, Min Sun, T. Lai
{"title":"A timer-based protocol for connected dominating set construction in IEEE 802.11 multihop mobile ad hoc networks","authors":"Dong Zhou, Min Sun, T. Lai","doi":"10.1109/SAINT.2005.9","DOIUrl":"https://doi.org/10.1109/SAINT.2005.9","url":null,"abstract":"Connected dominating set has been used widely in multihop ad hoc networks (MANET) by numerous routing, broadcast and collision avoidance protocols. Although computing minimum connected dominating set is known to be NP-hard, many protocols have been proposed to construct a suboptimal dominating set. However, these protocols are either too complicated, needing nonlocal information, or not adaptive to topology changes. In this paper, we present a MAC-layer timer-based connected dominating set construction protocol. In our protocol, candidate nodes set up a timer based on the number of uncovered neighbors and determine whether or not to join the dominating set when the timer expires. The protocol is simple, distributed, inexpensive, and adaptive to station mobility. The simulation results show that our protocol can construct connected dominating set using 35% to 60% less nodes than other distributed connected dominating set protocols.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132696045","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}
引用次数: 38
Roles of an intelligent tutor agent in a virtual society 虚拟社会中智能导师代理的角色
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.55
B. Marin, A. Hunger, S. Werner, S. Meila, Christian Schuetz
{"title":"Roles of an intelligent tutor agent in a virtual society","authors":"B. Marin, A. Hunger, S. Werner, S. Meila, Christian Schuetz","doi":"10.1109/SAINT.2005.55","DOIUrl":"https://doi.org/10.1109/SAINT.2005.55","url":null,"abstract":"In this paper we investigate how agents can facilitate and mediate interaction, communication and cooperation among participants of spatially distributed teams. We illustrate the architecture of an agent mediated-collaborative system that can serve the role of a tutor within a virtual group. In the virtual group the software agent should play besides the tutoring role also the group management role. The group manager has the responsibility to control the coherence of the actual group in regard to the actual group structure definition. This research will highlight also the incorporation of social-filter algorithms to mental models of software animated agents. Those algorithms may qualify an agent's expression of its emotional state by the social context, thereby enhancing the agent's believability not only as a tutor but also as a conversational partner or virtual teammate.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134532205","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}
引用次数: 9
A case study in running a parallel branch and bound application on the grid 在网格上运行并行分支和绑定应用程序的案例研究
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.1
K. Aida, Tomotaka Osumi
{"title":"A case study in running a parallel branch and bound application on the grid","authors":"K. Aida, Tomotaka Osumi","doi":"10.1109/SAINT.2005.1","DOIUrl":"https://doi.org/10.1109/SAINT.2005.1","url":null,"abstract":"This paper presents a case study to effectively run a parallel branch and bound application on the grid. The application discussed in this paper is a fine-grain application and is parallelized with the hierarchical master-worker paradigm. This hierarchical algorithm performs master-worker computing in two levels, computing among PC clusters on the grid and that among computing nodes in each PC cluster. This hierarchical manner reduces communication overhead by localizing frequent communication in tightly coupled computing resources, or a single PC cluster. The algorithm is implemented on a grid testbed by using GridRPC middleware, Ninf-G and Ninf. In the implementation, communication among PC clusters is securely performed via Ninf-G, which uses grid security service on the globus toolkit, and communication among computing nodes in each PC cluster is performed via Ninf which enables fast invocation of remote computing routines. The experimental results showed that implementation of the application with the hierarchical master-worker paradigm using a combination of Ninf-G and Ninf effectively utilized computing resources on the grid testbed in order to run the fine-grain application, where the average computation time of the single task was less than 1[sec].","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"114 40","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826877","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}
引用次数: 33
Security architecture for control networks using IPsec and KINK 采用IPsec和KINK的控制网络的安全体系结构
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.57
N. Okabe, S. Sakane, K. Miyazawa, K. Kamada, Atsushi Inoue, M. Ishiyama
{"title":"Security architecture for control networks using IPsec and KINK","authors":"N. Okabe, S. Sakane, K. Miyazawa, K. Kamada, Atsushi Inoue, M. Ishiyama","doi":"10.1109/SAINT.2005.57","DOIUrl":"https://doi.org/10.1109/SAINT.2005.57","url":null,"abstract":"There are many kinds of control networks which have been used in various nonIP network areas, such as BA (building automation), FA (factory automation) and PA (process automation). These do not incorporate reasonable security mechanisms as they have been mainly used for closed networks. Recently the security of control networks is becoming important because of the popularization of the Internet, the deployment of wireless technologies and the security requirements of such infrastructures. Control networks require security mechanisms which 1) enable end-to-end security that do not depend upon specific network topology, 2) work with multiple control network technologies, and 3) are suited to small embedded devices commonly used in control networks. This paper shows security mechanisms which can meet the above requirements, assuming that IP is applied to the control networks.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130788666","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}
引用次数: 25
Edge server software architecture for sensor applications 传感器应用的边缘服务器软件架构
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.24
S. Rooney, D. Bauer, P. Scotton
{"title":"Edge server software architecture for sensor applications","authors":"S. Rooney, D. Bauer, P. Scotton","doi":"10.1109/SAINT.2005.24","DOIUrl":"https://doi.org/10.1109/SAINT.2005.24","url":null,"abstract":"Edge servers perform computation on data in addition to that performed by the application server. Typically edge servers are deployed just in front of the application server and perform simple generic functions such as load balancing. With the increasing integration of network connected sensors into Internet based applications we foresee the need for the deployment of edge servers at the other end of the network, i.e. at the boundary with the external sensor network. These edge servers reduce the amount of data that has to be sent to the application server by filtering, summarizing and aggregating the sensor data. They are distinct from existing servers in both the location they run and the application-specific functions they perform. Both these differences influence their design. We describe our implementation of such an edge server.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040719","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}
引用次数: 13
Distributed resource discovery in large scale computing systems 大规模计算系统中的分布式资源发现
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.21
Abhishek K. Gupta, D. Agrawal, A. E. Abbadi
{"title":"Distributed resource discovery in large scale computing systems","authors":"Abhishek K. Gupta, D. Agrawal, A. E. Abbadi","doi":"10.1109/SAINT.2005.21","DOIUrl":"https://doi.org/10.1109/SAINT.2005.21","url":null,"abstract":"There has been significant effort to build high throughput delivering computing systems out of distributed workstations. These systems are growing to accommodate larger number of workstations with growing demand. Discovery of available resources in such environments is a challenging problem. We present a completely distributed resource discovery solution, which utilizes P2P design to provide a scalable service. Our design allows jobs to search for desired workstations, as well as, workstations to search for jobs that may run on them.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133978892","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}
引用次数: 26
A lightweight approach to authenticated Web caching 经过身份验证的Web缓存的轻量级方法
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.5
C. Blundo, S. Cimato, R. Prisco
{"title":"A lightweight approach to authenticated Web caching","authors":"C. Blundo, S. Cimato, R. Prisco","doi":"10.1109/SAINT.2005.5","DOIUrl":"https://doi.org/10.1109/SAINT.2005.5","url":null,"abstract":"Distributed caching is increasingly used to shorten the response time of Web servers and balance the load on the network by avoiding repeated transmission of the same content. An important research issue is the provision of access control mechanisms in the cache servers in order to service only authenticated client requests. In this paper, we provide a solution based on the distribution of secure cookies, avoiding the distribution and replication of sensitive information to the cache servers. With respect to previous proposals, our solution is lightweight, since it does not rely on computational heavy security mechanisms. We analyze two scenarios for authenticated caching involving different participants and, in both cases, describe a viable caching scheme.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131385264","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}
引用次数: 12
Enhanced flooding control methods based on biotic growth 基于生物生长的增强型防洪方法
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.27
H. Tode, M. Wada, K. Kinoshita, T. Masaki, K. Murakami
{"title":"Enhanced flooding control methods based on biotic growth","authors":"H. Tode, M. Wada, K. Kinoshita, T. Masaki, K. Murakami","doi":"10.1109/SAINT.2005.27","DOIUrl":"https://doi.org/10.1109/SAINT.2005.27","url":null,"abstract":"A flooding algorithm is an indispensable and fundamental network control mechanism for achieving some tasks, such notifying all nodes of some information, transferring data with high reliability, getting some information from all nodes, or to reserve a route by flooding the messages in the network. It is applied to grasp the network topology in a sensor network or an ad-hoc network, or to retrieve content information by mobile agent systems. A flooding algorithm has the advantages of robustness and optimality by parallel processing of messages. However, the flooding mechanism has a fundamental disadvantage: it increases the processing time until the flooding control is finished and causes congestion in the network. We propose and evaluate methods for producing a more efficient flooding algorithm by adopting the growth processes of primitive creatures, such as molds or microbes, to produce a simple flooding control mechanism.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133443262","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}
引用次数: 0
On coordinating personalized Web services using CooPS 关于使用合作社协调个性化Web服务
The 2005 Symposium on Applications and the Internet Pub Date : 2005-01-31 DOI: 10.1109/SAINT.2005.44
Z. Maamar, Emad Bataineh, Ghazi AlKhatib
{"title":"On coordinating personalized Web services using CooPS","authors":"Z. Maamar, Emad Bataineh, Ghazi AlKhatib","doi":"10.1109/SAINT.2005.44","DOIUrl":"https://doi.org/10.1109/SAINT.2005.44","url":null,"abstract":"This paper presents CooPS, which is a method for coordinating personalized services. These services are primarily offered to mobile users. Very little has been done so far regarding first, personalizing Web services for the benefit of mobile users and second, providing the methodological support to designers who specify the operations of personalization. Various obstacles still exist such as lack of techniques for modeling and specifying the integration of personalization into Web services, and existing approaches for Web services composition typically facilitate orchestration only, while neglecting contextual information on users and Web services.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487561","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信