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

筛选
英文 中文
Motion Analysis for the Standing Long Jump 立定跳远的动作分析
Hui-Huang Hsu, Sheng-Wen Hsieh, Wu-Chou Chen, Chun-Jung Chen, Che-Yu Yang
{"title":"Motion Analysis for the Standing Long Jump","authors":"Hui-Huang Hsu, Sheng-Wen Hsieh, Wu-Chou Chen, Chun-Jung Chen, Che-Yu Yang","doi":"10.1109/ICDCSW.2006.74","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.74","url":null,"abstract":"The standing long jump is a standard test for primary school students. It can be used to evaluate the development of basic sports skills of a child. This paper presents a system that can automatically detect the motion during a standing long jump from a video sequence. The silhouette of the jumper in the film is segmented from the background first for all frames. A stick model is applied to the silhouette found in the first frame. Then a GA-based search algorithm is used to find the stick models for the rest of the frames. The stick model points out the important joints of a person and can be used to represent the pose of the jumper in each frame. From the pose change in consecutive frames, we will be able to analyze the movement of the jumper.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"23 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":"115256594","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
Enforcing Truthful-Rating Equilibria in Electronic Marketplaces 在电子市场中执行诚实评级均衡
Thanasis G. Papaioannou, G. Stamoulis
{"title":"Enforcing Truthful-Rating Equilibria in Electronic Marketplaces","authors":"Thanasis G. Papaioannou, G. Stamoulis","doi":"10.1109/ICDCSW.2006.45","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.45","url":null,"abstract":"Reputation-based mechanisms and policies are vulnerable to the submission of untruthful ratings. In this paper, we define and analyze a game-theoretic model that captures the dynamics and the rational incentives in a competitive e-marketplace in which providers and clients exchange roles. We also study how we can enforce equilibria where ratings are submitted truthfully. We employ a mechanism prescribing that each service provision is rated by both the provider and the client, while this rating is included in the calculation of reputation only in case of agreement. First, we analyze the case where fixed monetary penalties are induced to both raters in case of disagreement. We prove that, under certain assumptions on the initial conditions, the system is led to a stable equilibrium where all participants report truthfully their ratings. We also investigate the introduction of non-fixed penalties to provide the right incentives for truthful reporting. We derive lower bounds on such penalties that depend on the participant’s reputation values. Thus, by employing a punishment that is tailored properly for each participant, this approach can limit the unavoidable social welfare losses due to the penalties for disagreement.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"167 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":"114636365","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
Publish/Subscribe on the top of Overlay networks: when subscription dynamics meet churn 发布/订阅覆盖网络的顶部:当订阅动态满足流失
R. Baldoni
{"title":"Publish/Subscribe on the top of Overlay networks: when subscription dynamics meet churn","authors":"R. Baldoni","doi":"10.1109/ICDCSW.2006.86","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.86","url":null,"abstract":"Distributed event routing on the top of overlay networks has emerged as a key technology for achieving scalable information dissemination. In particular it has been used as preferential communication backbone within publish/ subscribe communication system. Its aim is to reduce the network and computational overhead per event diffusion to a set (possibly large) of interested recipients despite churn and subscription changes. This talk points out the functional decomposition between event-based routing layer, the overlay infrastructure layer (structured and unstructured) and the network protocols layer. Hence the talk surveys solutions for event based routing on overlay infrastructures discussing their inherent limitations and constraints related to both the process of arrival and departure of nodes from the overlay network and the process of subscription changes at the application level.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"1 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":"130860873","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
Benchmarking a Semantic Web Service Architecture for Fault-tolerant B2B Integration 对用于容错B2B集成的语义Web服务架构进行基准测试
J. Cardoso
{"title":"Benchmarking a Semantic Web Service Architecture for Fault-tolerant B2B Integration","authors":"J. Cardoso","doi":"10.1109/ICDCSW.2006.27","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.27","url":null,"abstract":"With the development and maturity of Service- Oriented Architectures (SOA) to support business-tobusiness transactions, organizations are implementing Web services to expose their public functionalities associated with internal systems and business processes. In many business processes, Web services need to provide is a high level of availability, since the globalization of the Internet enables business partners to easily switch to other competitors when services are not available. Along with the development of SOA, considerable technological advances are being made to use the semantic Web to achieve the automated processing and integration of data and applications. This paper describes the implementation and benchmarking of an architecture that semantically integrates Web services with a peer-to-peer infrastructure to increase service availability through fault-tolerance.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"79 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":"129923895","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
Fault-Tolerance Verification of the Fluids and Combustion Facility of the International Space Station 国际空间站流体和燃烧设备的容错验证
Raquel S. Whittlesey-Harris, Mikhail Nesterenko
{"title":"Fault-Tolerance Verification of the Fluids and Combustion Facility of the International Space Station","authors":"Raquel S. Whittlesey-Harris, Mikhail Nesterenko","doi":"10.1109/ICDCSW.2006.52","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.52","url":null,"abstract":"This article describes our experience with faulttolerance verification of the Fluids and Combustion Facility (FCF) of the International Space Station (ISS). The FCF will be a permanent installation for scientific microgravity experiments in the U.S. Laboratory Module aboard the ISS. The ability to withstand faults is vital for all ISS installations. Currently, the FCF safety specification requires one-component faulttolerance. In future versions, even greater robustness may be required. Faults encountered by ISS modules vary in nature and extent. Self-stabilization is an adequate approach to tolerance design of the FCF. However, for systems as complex as the FCF, analytical tolerance verification is not feasible. We use automated model-checking. We model the FCF in SPIN and specify stabilization predicates to which the FCF must conform. Our model of the FCF allows us to inject component faults as well as hazardous conditions. We use SPIN to automatically verify the convergence of the FCF model to legitimate states.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"134 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":"122654331","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
Balance-Based Energy-Efficient Communication Protocols forWireless Sensor Networks 基于平衡的无线传感器网络节能通信协议
Yu Wang, Hongyi Wu, R. Nelavelli, N. Tzeng
{"title":"Balance-Based Energy-Efficient Communication Protocols forWireless Sensor Networks","authors":"Yu Wang, Hongyi Wu, R. Nelavelli, N. Tzeng","doi":"10.1109/ICDCSW.2006.26","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.26","url":null,"abstract":"Energy efficiency is a critical design issue in wireless sensor networks, where each sensor node relies on its limited battery power for data acquisition, processing, transmission, and reception. In this paper, we propose several energy-efficient communication schemes based on power control and load balancing, aiming at even distribution of the residual energy of the sensors and thus prolonging the lifetime of overall wireless sensor networks. More specifically, an Integer Linear Programming (ILP) algorithm and a Distributed Energy Efficient Routing (DEER) protocol are proposed for time-driven sensor networks. A Residual Energy-based Traffic Splitting (RETS) protocol is introduced for event-driven sensor networks. We have carried out extensive simulations to evaluate the proposed protocols. Our simulation results show that most heuristic approaches yield network lifetimes far smaller than the upper bound obtained from the ILP algorithm. The proposed DEER and RETS approaches can effectively distribute energy consumption evenly among the sensor nodes to prolong the network lifetime by up to 200% or more, when compared with other approaches in the literature.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"176 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":"124349663","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
An Adaptive Hybrid Strategy of Integrated Service Discovery for Wireless Mobile Ad Hoc Networks 无线移动自组织网络集成业务发现的自适应混合策略
Donggeon Noh, Heonshik Shin
{"title":"An Adaptive Hybrid Strategy of Integrated Service Discovery for Wireless Mobile Ad Hoc Networks","authors":"Donggeon Noh, Heonshik Shin","doi":"10.1109/ICDCSW.2006.14","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.14","url":null,"abstract":"An ad-hoc wireless network consists of a set of mobile nodes that are unstably connected by wireless links. Efficient service Ad/D (advertisement and discovery) is particularly important in such a network due to its dynamic topology, absence of centralized administration, and resource-constrained nodes/links. Several protocols have been presented with a goal of achieving efficient service Ad/D, but they have shortcomings in respect of their adaptation to dynamic network change and the efficiency of their service discovery algorithms. Therefore, we introduce SPIZ (service Ad/D protocol with independent zone) which can reduce system overhead by integrating service Ad/D with routing, and adapt locally to changing conditions, such as mobility and popularity levels. With a variable zone size, it uses an effective hybrid Ad/D strategy. Simulation results show that SPIZ indeed tracks a changing environment while reducing the service Ad/D network overhead, saving resources and decreasing latency.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"10 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":"123886184","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}
引用次数: 4
Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach 一种减少基于遗传算法的路由方法搜索空间的网络提取拓扑算法的评价
Makoto Ikeda, L. Barolli, G. Marco, A. Durresi, A. Koyama, M. Durresi
{"title":"Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach","authors":"Makoto Ikeda, L. Barolli, G. Marco, A. Durresi, A. Koyama, M. Durresi","doi":"10.1109/ICDCSW.2006.47","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.47","url":null,"abstract":"In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. The proposed routing algorithm is a combination of source and distributed routing. However, in the previous research, we only considered the time delay for the routing. Also, QoS and congestion control parameters were considered just as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on fuzzy logic and genetic algorithm which use for admission control and routing many QoS parameters. Also, we evaluate by simulations the performance of the network extraction topology algorithm which reduces the search space of the proposed GA-based routing approach. Thus, the GA can find a feasible route very fast.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"19 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120975827","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}
引用次数: 7
A directional gossip protocol for path discovery in MANETs 一种用于manet中路径发现的定向八卦协议
R. Beraldi
{"title":"A directional gossip protocol for path discovery in MANETs","authors":"R. Beraldi","doi":"10.1109/ICDCSW.2006.6","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.6","url":null,"abstract":"In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with the same probability, our proposal is characterized by a variable gossiping probability, which is high enough only for sustaining the spreading process towards the destination. No external location service, e.g. via GPS, is required to determine the gossip probability at each node; rather, the estimation is done from the \"inside\" of the network by using periodic beacons. The paper reports a simulation study and a mathematical model for better understanding the property of the directional gossip process.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"320 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":"115669997","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
Dealing with Class Skew in Context Recognition 上下文识别中类倾斜的处理
M. Stäger, P. Lukowicz, G. Tröster
{"title":"Dealing with Class Skew in Context Recognition","authors":"M. Stäger, P. Lukowicz, G. Tröster","doi":"10.1109/ICDCSW.2006.36","DOIUrl":"https://doi.org/10.1109/ICDCSW.2006.36","url":null,"abstract":"As research in context recognition moves towards more maturity and real life applications, appropriate and reliable performance metrics gain importance. This paper focuses on the issue of performance evaluation in the face of class skew (varying, unequal occurrence of individual classes), which is common for many context recognition problems. We propose to use ROC curves and Area Under the Curve (AUC) instead of the more commonly used accuracy to better account for class skew. The main contributions of the paper are to draw the attention of the community to these methods, present a theoretical analysis of their advantages for context recognition, and illustrate their performance on a real life case study.","PeriodicalId":333505,"journal":{"name":"26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06)","volume":"1 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":"122300639","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}
引用次数: 30
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学术官方微信