26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)最新文献

筛选
英文 中文
Restriction, Modification and Extension of Consumer Devices for Prototyping Ubiquitous Computing Environments 面向普适计算环境原型的消费设备的限制、修改和扩展
M. Kranz, A. Schmidt
{"title":"Restriction, Modification and Extension of Consumer Devices for Prototyping Ubiquitous Computing Environments","authors":"M. Kranz, A. Schmidt","doi":"10.1109/ICDCSW.2006.91","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.91","url":null,"abstract":"In this paper, we report on several work-in-progress projects of our research group and other systems that exploit commercially available off-the-shelf components for deriving research prototypes and systems in the field of ubiquitous computing. We discuss the benefits of restricting, modifying and extending the built-in functionality of these systems to ease the development process. Using the approach presented reduces the amount of low level knowledge, of e.g. electrical engineering, to achieve the actual goal of building new appliances and ubiquitous computing systems. The approach presented empowers researchers from many domains to build prototypes that can be experienced by users. We present an example of an extended commercial product, the Nokia 770 tablet PC.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133293009","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}
引用次数: 6
Towards a Scalable Heterogeneous P2P Data and Knowledge Sharing Facility 面向可扩展异构P2P数据和知识共享设施
S. Deen, K. Ponnamperuma, M. Takizawa
{"title":"Towards a Scalable Heterogeneous P2P Data and Knowledge Sharing Facility","authors":"S. Deen, K. Ponnamperuma, M. Takizawa","doi":"10.1109/ICDCSW.2006.111","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.111","url":null,"abstract":"Starting with research issues, the paper explores how a scalable P2P/DAKS facility can be supported with inter-peer schema heterogeneity, while preserving peer autonomy, such that a given peer can join multiple P2P coalitions (i.e. networks) of its interest. Peers need to provide coalition-specific ontologies of their schemas, which are dynamically integrated and managed by the system. The scalability is provided through the concepts of topic-tree, class, minder and domain, all of which can change dynamically without requiring any action from the peer users. An associated central issue covered is integration technique and integration compatibility of ontologies.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132286548","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}
引用次数: 3
Fault-diameter of generalized Cartesian products 广义笛卡尔积的断层直径
I. Banič, J. Žerovnik
{"title":"Fault-diameter of generalized Cartesian products","authors":"I. Banič, J. Žerovnik","doi":"10.1109/ICDCSW.2006.51","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.51","url":null,"abstract":"Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and D_c(G) denote the diameter of G after deleting any of its c lt kG vertices. For a product of three factors G_1, G_2 and G_3, we prove that D_a+b+c+2(G) lt D_a(G_1) + D_b(G_2) + D_c(G_3) + 1. We indicate how analogous proof gives the upper bound D_a+b+1(G) lt D_a(G_1) + D_b(G_2) + 1 for the product of two factors. Finally, we show that D_a+b+1(G) lt D_a(F) + D_b(B)+1 if G is a graph bundle with fibre F over base B, a lt k_F,and b lt k_B.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117177064","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}
引用次数: 3
Concurrency Control in Multi-Role Association 多角色关联中的并发控制
T. Enokido, M. Takizawa
{"title":"Concurrency Control in Multi-Role Association","authors":"T. Enokido, M. Takizawa","doi":"10.1109/ICDCSW.2006.31","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.31","url":null,"abstract":"A role shows a job function in an enterprise. In a rolebased access control model, a role is a set of access rights. A subject doing jobs is granted roles showing the jobs. In addition, objects have to be consistent in presence of multiple conflicting transactions. A transaction issued by a subject is associated with a subset of roles granted to the subject, which is named purpose. A method with a more significant purpose is performed before another method with a less significant purpose. We discuss which purpose is more significant than another purpose. We discuss general role-ordering (GRO) schedulers so that multiple conflicting transactions are serializable in the significant order of subjects and purposes. We evaluate the GRO scheduler compared with the traditional two-phase locking protocol.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124487664","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
From static distributed systems to dynamic systems: an approach for a first step 从静态分布式系统到动态系统:第一步的方法
M. Raynal
{"title":"From static distributed systems to dynamic systems: an approach for a first step","authors":"M. Raynal","doi":"10.1109/ICDCSW.2006.56","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.56","url":null,"abstract":"A noteworthy advance in distributed computing is due to the recent development of peer-to-peer systems. These systems are essentially dynamic in the sense that no process can get a global knowledge on the system structure. They mainly allow processes to look up for data that can be dynamically added/suppressed in a permanently evolving set of nodes. Although protocols have been developed for such dynamic systems, to our knowledge, up to date no computation model for dynamic systems has been proposed. Nevertheless, there is a strong demand for the definition of such models as soon as one wants to develop provably correct protocols suited to dynamic systems. The talk will present an approach aiming at defining an appropriate model for (a class of) dynamic systems. That dynamic model is defined by (1) a parameter (an integer denoted alpah) and (2) two basic communication abstractions (query-response and persistent reliable broadcast). The parameter alpha is a threshold value introduced to capture the liveness part of the system (it is the counterpart of the minimal number of processes that do not crash in a static system). To show the relevance of the model, the paper discusses several distributed computing issues in the context of dynamic systems, such as atomicity, quorums, and leader election.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125734522","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
An Event Service Supporting Autonomic Management of Ubiquitous Systems for e-Health 支持电子健康泛在系统自治管理的事件服务
Stephen D. Strowes, N. Badr, S. Heeps, Emil C. Lupu, M. Sloman
{"title":"An Event Service Supporting Autonomic Management of Ubiquitous Systems for e-Health","authors":"Stephen D. Strowes, N. Badr, S. Heeps, Emil C. Lupu, M. Sloman","doi":"10.1109/ICDCSW.2006.17","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.17","url":null,"abstract":"An event system suitable for very simple devices corresponding to a body area network for monitoring patients is presented. Event systems can be used both for self-management of the components as well as indicating alarms relating to patient health state. Traditional event systems emphasise scalability and complex event dissemination for internet based systems, whereas we are considering ubiquitous systems with wireless communication and mobile nodes which may join or leave the system over time intervals of minutes. Issues such as persistent delivery are also important. We describe the design, prototype implementation, and performance characteristics of an event system architecture targeted at this application domain.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128409192","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}
引用次数: 21
Using an Interpolation Algorithm for VCR like Functions in Multimedia Communications 多媒体通信中VCR类功能的插值算法
Hsien-Ming Tsai, Tzu-Chiang Chiang, Yueh-Min Huang
{"title":"Using an Interpolation Algorithm for VCR like Functions in Multimedia Communications","authors":"Hsien-Ming Tsai, Tzu-Chiang Chiang, Yueh-Min Huang","doi":"10.1109/ICDCSW.2006.113","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.113","url":null,"abstract":"The main problem of true Video-On-Demand System is the scalability for the concurrent access clients is restricted to the bandwidth of the system. In order to solve the insufficient of bandwidth and improve video quality, many researches proposed a variety of methods to provide all kinds of approaches to reduce admission time and more complete VCR functions in a near Video-On-Demand system. To achieve the goals, more buffer space is required in clients to save more data streams to perform VCR functions. Hence it will cost more and overhead for the systems. In this paper, we proposed a segment broadcast scheme which dividing the film into a lot of chunks, and utilizing multi-channel to broadcast the data streams simultaneously. Each client can receive the data stream from multi-channel to offer complete VCR functions in multimedia communications. The result of the simulation and compare with some scheme which had proposed shows our scheme under the circumstances that bandwidth can distribute to more channels, can also reduce the admission latency time effectively. The segments broadcasting scheme and receiving interpolation algorithm in this paper can really not sacrifice VCR functions and play smoothly under the least resources requirement.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126025742","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
Flexible Network Infrastructure for Wearable Computing Using Conductive Fabric and Its Evaluation 基于导电织物的可穿戴计算柔性网络基础设施及其评价
J. Akita, T. Shinmura, M. Toda
{"title":"Flexible Network Infrastructure for Wearable Computing Using Conductive Fabric and Its Evaluation","authors":"J. Akita, T. Shinmura, M. Toda","doi":"10.1109/ICDCSW.2006.54","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.54","url":null,"abstract":"Numbers of devices are distributed in the environment in wearable and ubiquitous computing systems, and all of such devices need power supply and communication ways as well as flexibility of placement. Both wireless and wired communication systems intrinsically contain the problems in power supply or flexibility of placement. In this paper, we introduce the flexible network infrastructure for wearable computing systems, named as TextileNet, and experimental results of its evaluation. TextileNet uses the wear both of sides of which are made of conductive fabric as electrodes. On this year, the power is supplied from a battery, and the devices are attached by sticking so that electric contact can obtain the suficient power and communication way on the wear's surface. This paper describes the implementation and evaluation of the TextileNet system.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127608391","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}
引用次数: 11
COCA: A Contract-Based Infrastructure for Composing Adaptive Multimedia Systems 用于组合自适应多媒体系统的基于契约的基础结构
Zhinan Zhou, P. McKinley
{"title":"COCA: A Contract-Based Infrastructure for Composing Adaptive Multimedia Systems","authors":"Zhinan Zhou, P. McKinley","doi":"10.1109/ICDCSW.2006.29","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.29","url":null,"abstract":"Achieving acceptable quality of service in highly dynamic computing environments requires not only adaptation and reconfiguration of individual components of the system, but also collaboration among these components. To address these issues in adaptive multimedia applications, we propose COCA, a contract-based collaborative adaptation infrastructure. COCA uses contract specifications to describe the relationships among different system components, to generate code that realizes adaptive functionality, and to govern system-wide adaptive behavior during execution. COCA also provides a set of reusable adaptation services that enable legacy components to be integrated into an adaptive system. We demonstrate the use of COCA to construct an adaptive multimedia conferencing system from a collection of existing components that were not originally designed for interoperation.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133122686","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}
引用次数: 2
Coping with Variable Latency and Disorder in Distributed Event Streams 分布式事件流中可变延迟和无序的处理
R. Barga, Gueorgui Chkodrov
{"title":"Coping with Variable Latency and Disorder in Distributed Event Streams","authors":"R. Barga, Gueorgui Chkodrov","doi":"10.1109/ICDCSW.2006.34","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.34","url":null,"abstract":"Distributed event processing systems often require input streams that are ordered in some predetermined way or that events arrive within a fixed time interval. This order may simply be arrival order or given explicitly on a specific event attribute, such as a timestamp or sequence number. Standing event queries, such as a temporal correlation of events across multiple streams, can block if an input stream incurs latency or may produce an incorrect answer if events fail to arrive within the fixed time interval. In this paper, we describe a stream conditioning mechanism developed for Event Correlation Services (ECS), which is a high performance event processing service for monitoring distributed applications. We show how punctuation messages that carry timestamps can be generated by event sources and then forwarded through the network, to align events from multiple distributed streams and unblock event pattern queries.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134349852","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}
引用次数: 3
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学术文献互助群
群 号:481959085
Book学术官方微信