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

Proceedings 21st International Conference on Distributed Computing Systems Workshops最新文献

筛选
英文 中文
Application ordering in group communication 组通信中的应用程序排序
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918680
Gurdip Singh, Shakeel Badarpura
{"title":"Application ordering in group communication","authors":"Gurdip Singh, Shakeel Badarpura","doi":"10.1109/CDCS.2001.918680","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918680","url":null,"abstract":"Several frameworks for group communication with ordering semantics such as causal and total ordering have been studied that provide different guarantees on the sequence in which messages are delivered at different sites. To accommodate application semantics, frameworks have also been proposed to weaken these semantics using application-specific information. We find that in many cases, an application may require messages to be delivered in a sequence satisfying certain constraints which requires strengthening rather than weakening of the ordering semantics. To accommodate this, we explore a new semantics, application order, that allows an application to specify an ordering specification order spec. The multicast layer performs the necessary synchronization to ensure that the messages are delivered in an order satisfying order spec. This semantics can be used in conjunction with existing ordering semantics, and eliminates many forms of application-level synchronization. It also expands the applicability of group communication frameworks by allowing communication primitives to be used directly in applications without additional synchronization.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130031156","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
Composing concerns with a framework approach 用框架方法组合关注点
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918697
Constantinos A. Constantinides, T. Elrad
{"title":"Composing concerns with a framework approach","authors":"Constantinos A. Constantinides, T. Elrad","doi":"10.1109/CDCS.2001.918697","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918697","url":null,"abstract":"As concurrent software systems become larger, the interaction of their components is becoming more complex. This interaction may limit reuse, making it difficult to validate design and correctness and perhaps forcing reengineering of these systems in order to meet future requirements. In order to reduce this complexity and to build stable and adaptable concurrent software systems, we present an approach that emphasizes the separation of interaction components from the functional components.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130494307","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
Checkpoint-recovery for mobile computing systems 移动计算系统的检查点恢复
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918748
Yoshinori Morita, H. Higaki
{"title":"Checkpoint-recovery for mobile computing systems","authors":"Yoshinori Morita, H. Higaki","doi":"10.1109/CDCS.2001.918748","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918748","url":null,"abstract":"Recent information systems consist of mobile stations and fixed stations. Mission-critical applications are required to be executed fault-tolerantly. However, mobile stations support neither enough volume of storage, processing power nor capacity of battery to support reliable communication and computation. A hybrid checkpoint protocol for mobile computing systems is proposed. In this protocol, mobile-to-mobile communication is not supported. Thus, we propose an extended hybrid checkpoint protocol for mobile-to-mobile communication in wireless LAN protocols such as IEEE 802.11 and HIPERLAN. Compared with the conventional protocol, the proposed protocol is realized by only piggy-backing some information without additional messages.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115218322","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}
引用次数: 5
Towards forming communities using wearable musical instruments 朝着使用可穿戴乐器形成社区的方向发展
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918715
Yukio Tada, T. Maekawa, Romain Rouve, K. Mase, R. Nakatsu, Kazushi Nishimoto
{"title":"Towards forming communities using wearable musical instruments","authors":"Yukio Tada, T. Maekawa, Romain Rouve, K. Mase, R. Nakatsu, Kazushi Nishimoto","doi":"10.1109/CDCS.2001.918715","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918715","url":null,"abstract":"We describe the design and applications of CosTune (costume+tune), which is a novel wearable musical instrument. A CosTune is not only a personal wearable musical instrument but also is equipped with wireless communications functions to communicate with other CosTunes. A prototype system is also described. Music is a powerful communications medium, therefore, we designed CosTune as a communications tool. CosTune users can make collaborative compositions and perform ad hoc sessions with others who share similar musical tastes. Thus, CosTune may foster a novel musical culture as well as support the formation of communities mediated by music.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114992953","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
Muteness-based audio watermarking technique 基于静音的音频水印技术
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918733
K. Kaabneh, Abdou Youssef
{"title":"Muteness-based audio watermarking technique","authors":"K. Kaabneh, Abdou Youssef","doi":"10.1109/CDCS.2001.918733","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918733","url":null,"abstract":"Audio watermarking is a promising approach to copyright protection of audio data, especially music and songs. Several watermarking techniques have been developed and commercialized. The watermarks produced by those techniques can withstand a number of single attacks such as MPEG, resampling, filtering, and quantization. However, the watermarks are easily destroyed if subjected to chopping or multiple attacks. We present a new audio watermarking technique that provides watermark robustness not only to single attacks but also to multiple attacks and chopping.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124759442","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
A specification logic for dynamic composition of services 用于动态组合服务的规范逻辑
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918700
S. Lämmermann, E. Tyugu
{"title":"A specification logic for dynamic composition of services","authors":"S. Lämmermann, E. Tyugu","doi":"10.1109/CDCS.2001.918700","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918700","url":null,"abstract":"We focus on a composition model for services, which are composed of pre-programmed service components represented as Java classes. A common formal basis for representing the semantics of dynamic composition of services from service components is presented. We propose a logic and a specification language that enable us to reason about and deploy service components automatically. The proposed composition model uses a logical proof as witness for the correct deployment of service components in the context of their use. The composition model has been implemented in Java as an environment for dynamic composition of services. We illustrate the proposed composition method on an example of composition of a service.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"86 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123069870","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}
引用次数: 5
Client side reconfiguration on software components for load balancing 客户端重新配置软件组件以实现负载平衡
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918694
E. Putrycz, G. Bernard
{"title":"Client side reconfiguration on software components for load balancing","authors":"E. Putrycz, G. Bernard","doi":"10.1109/CDCS.2001.918694","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918694","url":null,"abstract":"The size of applications is becoming greater every day. Software components enable developers to easily build large applications with basic reusable parts. However, there is a need for system support to allow these applications to scale to many users and to large networks. Current methods for load balancing cannot be applied, since they are mostly designed for local area networks and the monitoring tools are not sufficient. To allow efficient load balancing, we first have to consider the architecture of the monitoring infrastructure. In this paper, we present a way to build a scalable monitoring platform. By using information provided by this platform, it's possible to build policies for helping system administrators in the management of complex tasks. Using application descriptions, these policies take into account the global architecture and drive reconfigurations using the monitoring data.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129642493","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}
引用次数: 8
A mobility based metric for clustering in mobile ad hoc networks 移动自组织网络中基于移动性的聚类度量
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918738
P. Basu, Naved Khan, T. Little
{"title":"A mobility based metric for clustering in mobile ad hoc networks","authors":"P. Basu, Naved Khan, T. Little","doi":"10.1109/CDCS.2001.918738","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918738","url":null,"abstract":"We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the \"least clusterhead change\" version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130105136","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}
引用次数: 761
An efficient method for computing the feasible region with translational containment between two convex polygons 一种计算两个凸多边形间平移包容可行区域的有效方法
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918735
Yu-Kumg Chen, S. Chou, Tzong-Chen Wu
{"title":"An efficient method for computing the feasible region with translational containment between two convex polygons","authors":"Yu-Kumg Chen, S. Chou, Tzong-Chen Wu","doi":"10.1109/CDCS.2001.918735","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918735","url":null,"abstract":"A convex polygon containment problem is studied: whether a given convex polygon P can be translated to fit inside another fixed convex polygon Q. An O(pq log q) time algorithm is presented for solving such a problem, where p and q are the numbers of vertices of P and Q. In addition, by utilizing the existence algorithm, it takes O(pq log q) time to find the set of all placements of P that fit inside Q.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121289246","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
SCARAB: innovative services supporting user and terminal mobility SCARAB:支持用户和终端移动性的创新服务
Proceedings 21st International Conference on Distributed Computing Systems Workshops Pub Date : 2001-04-16 DOI: 10.1109/CDCS.2001.918749
L. Ciminiera, P. Maggi, R. Sisto
{"title":"SCARAB: innovative services supporting user and terminal mobility","authors":"L. Ciminiera, P. Maggi, R. Sisto","doi":"10.1109/CDCS.2001.918749","DOIUrl":"https://doi.org/10.1109/CDCS.2001.918749","url":null,"abstract":"The paper presents the authors' experience in designing and implementing secure smart card and agent-based telecommunication services supporting user mobility and service personalization. The work described here has been performed as part of the EU ACTS SCARAB project and is based on a service architecture that has been defined by the SCARAB partners. User mobility is achieved both by using smart cards and by supporting mobile terminals based on a 3 Com Palm computer connected to a GSM phone, in addition to fixed PC-based terminals. An online travel agency service, that can be used to buy travel tickets, has been implemented as a case study. The paper focuses mainly on the description of the SCARAB service architecture and of the online travel agency demonstrative service and on its implementation for the mobile terminal, which is the most critical one, because of the severe resource limitations of Palm computers.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122965869","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学术官方微信