With the advances in computer technology, many systems have been developed for educational and instructional purposes. In particular, a computer-based system is very attractive in sports instruction and training as compared to the traditional human coaching approach, saving time, space, and cost. Among several important technical issues to be resolved in such sports instructional systems, motion or gesture capture and the organization of the database are the major ones. Of course, the most successful implementations are the systems from the gaming industry. In this work, we briefly discuss these commercial technologies and systems. A prototype system for learning tennis is introduced. Various techniques for motion capture are described and discussed. An event-based motion detecting and matching algorithm for capturing tennis swings from people of different size is presented. Finally, a framework for a Web-based generic sport system is presented.
{"title":"The Design of a Web-Based Multimedia Sport Instructional System","authors":"Kosuke Takano, K. F. Li, M. G. Johnson","doi":"10.1109/WAINA.2011.141","DOIUrl":"https://doi.org/10.1109/WAINA.2011.141","url":null,"abstract":"With the advances in computer technology, many systems have been developed for educational and instructional purposes. In particular, a computer-based system is very attractive in sports instruction and training as compared to the traditional human coaching approach, saving time, space, and cost. Among several important technical issues to be resolved in such sports instructional systems, motion or gesture capture and the organization of the database are the major ones. Of course, the most successful implementations are the systems from the gaming industry. In this work, we briefly discuss these commercial technologies and systems. A prototype system for learning tennis is introduced. Various techniques for motion capture are described and discussed. An event-based motion detecting and matching algorithm for capturing tennis swings from people of different size is presented. Finally, a framework for a Web-based generic sport system is presented.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131750521","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}
Complex Web-based information systems involving multiple entities and their dynamic mobile-based collaborations require efficient techniques for context information sharing. Sharing control is a requirement for preserving the privacy of personal context and shared context. Our sharing control mechanism is hybrid, based on sharing control rules defined by enterprise as well as by individuals users. Our complex scenario involves multiple entities which require prioritization and conflict handling mechanism for entities and their policy rules. This paper presents a sharing control model, Web services-based architecture and its implementation with a running example. The system is evaluated by comparing our hybrid sharing control policy with enterprise-defined role -based policy and shows effectiveness of our hybrid policy in collaborative information sharing environments.
{"title":"A Hybrid Sharing Control Model for Context Sharing and Privacy in Collaborative Systems","authors":"Ahmad Kamran Malik, S. Dustdar","doi":"10.1109/WAINA.2011.134","DOIUrl":"https://doi.org/10.1109/WAINA.2011.134","url":null,"abstract":"Complex Web-based information systems involving multiple entities and their dynamic mobile-based collaborations require efficient techniques for context information sharing. Sharing control is a requirement for preserving the privacy of personal context and shared context. Our sharing control mechanism is hybrid, based on sharing control rules defined by enterprise as well as by individuals users. Our complex scenario involves multiple entities which require prioritization and conflict handling mechanism for entities and their policy rules. This paper presents a sharing control model, Web services-based architecture and its implementation with a running example. The system is evaluated by comparing our hybrid sharing control policy with enterprise-defined role -based policy and shows effectiveness of our hybrid policy in collaborative information sharing environments.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894586","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}
Cloud computing has been evolved as a key computing platform for sharing resources and services. People should have a relatively convenient environment and life for handling home-appliances. This study designs and develops a Web 2.0 Service Platform (WSP) for DPWS-based Home-appliances in the Cloud environment, which is composed of mobile users, home appliances and the cloud environment. WSP automatically records and observes user's behaviors to adapt related home-appliances based on the ontology technique. A mobile user can use a smart phone to control and handle home-appliances through Web2.0 Blog-based interfaces. Finally, WSP can be an inference model for researchers when developing home-appliance controllers in the future.
{"title":"Design and Implementation of a Web 2.0 Service Platform for DPWS-Based Home-Appliances in the Cloud Environment","authors":"Chung-Ming Huang, Hao-Hsiang Ku, Yen-Wen Chen","doi":"10.1109/WAINA.2011.32","DOIUrl":"https://doi.org/10.1109/WAINA.2011.32","url":null,"abstract":"Cloud computing has been evolved as a key computing platform for sharing resources and services. People should have a relatively convenient environment and life for handling home-appliances. This study designs and develops a Web 2.0 Service Platform (WSP) for DPWS-based Home-appliances in the Cloud environment, which is composed of mobile users, home appliances and the cloud environment. WSP automatically records and observes user's behaviors to adapt related home-appliances based on the ontology technique. A mobile user can use a smart phone to control and handle home-appliances through Web2.0 Blog-based interfaces. Finally, WSP can be an inference model for researchers when developing home-appliance controllers in the future.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667977","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}
Ji Su Park, Heonchang Yu, Kwang-Sik Chung, EunYoung Lee
Mobile cloud computing is a combination of mobile computing and cloud computing, and provides cloud computing environment through various mobile devices. Recently, due to rapid expansion of smart phone market and wireless communication environment, mobile devices are considered as resource for large scale distributed processing. But mobile devices have several problems, such as unstable wireless connection, limitation of power capacity, low communication bandwidth and frequent location changes. As resource providers, mobile devices can join and leave the distributed computing environment unpredictably. This interrupts the undergoing operation, and the delay or failure of completing the operation may cause a system failure. Because of low reliability and no-guarantee of completing an operation, it is difficult to use a mobile device as a resource. That means that mobile devices are volatile. Therefore, we should consider volatility, one of dynamic characteristics of mobile devices, for stable resource provision. In this paper, we propose a monitoring technique based on the Markov Chain model, which analyzes and predicts resource states. With the proposed monitoring technique and state prediction, a cloud system will get more resistant to the fault problem caused by the volatility of mobile devices. The proposed technique diminishes the volatility of a mobile device through modeling the patterns of past states and making a prediction of future state of a mobile device.
{"title":"Markov Chain Based Monitoring Service for Fault Tolerance in Mobile Cloud Computing","authors":"Ji Su Park, Heonchang Yu, Kwang-Sik Chung, EunYoung Lee","doi":"10.1109/WAINA.2011.10","DOIUrl":"https://doi.org/10.1109/WAINA.2011.10","url":null,"abstract":"Mobile cloud computing is a combination of mobile computing and cloud computing, and provides cloud computing environment through various mobile devices. Recently, due to rapid expansion of smart phone market and wireless communication environment, mobile devices are considered as resource for large scale distributed processing. But mobile devices have several problems, such as unstable wireless connection, limitation of power capacity, low communication bandwidth and frequent location changes. As resource providers, mobile devices can join and leave the distributed computing environment unpredictably. This interrupts the undergoing operation, and the delay or failure of completing the operation may cause a system failure. Because of low reliability and no-guarantee of completing an operation, it is difficult to use a mobile device as a resource. That means that mobile devices are volatile. Therefore, we should consider volatility, one of dynamic characteristics of mobile devices, for stable resource provision. In this paper, we propose a monitoring technique based on the Markov Chain model, which analyzes and predicts resource states. With the proposed monitoring technique and state prediction, a cloud system will get more resistant to the fault problem caused by the volatility of mobile devices. The proposed technique diminishes the volatility of a mobile device through modeling the patterns of past states and making a prediction of future state of a mobile device.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478754","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}
Numerous researches about Mobile IPv6 (MIPv6) have been proposed recently and the handover delay of the Mobile Nodes (MNs) among different networks is surely a worthy noticing issue. There are three major reasons for the MIPv6 handover delay: Movement Detection, Duplicate Address Detection (DAD), and Binding Update (BU), in, which DAD occupies most of the MIPv6 handover delay and influences real-time services greatly. No previous paper mentions how to reconfigure another unique Care of Address (CoA) when the generated CoA is used by other nodes during the DAD, and how to generate a unique CoA to accelerate the handover, reduce the handover delay and avoid the packet loss during the handover. To avert the problems that worsen the handover latency and the packet loss, this paper presents a Fast-Reconfigure Address Mechanism (F-RAM) to generate a unique CoA rapidly when duplicate address occurs, to evade the occurrence of the second duplication, and to reconfigure a unique address quickly. Our experiment results prove that our proposed scheme indeed reduces the handover delay and the packet loss when the CoA is duplicated.
近年来，人们对移动IPv6 (MIPv6)进行了大量的研究，其中移动节点(MNs)在不同网络之间的切换延迟是一个值得关注的问题。造成MIPv6切换延迟的原因主要有三个:运动检测、重复地址检测和绑定更新。其中，绑定更新占据了MIPv6切换延迟的大部分，对实时业务影响较大。之前没有论文提到如何在DAD过程中，当生成的CoA被其他节点使用时，重新配置另一个唯一的CoA (Care of Address)，以及如何生成唯一的CoA来加速切换，减少切换延迟，避免切换过程中的丢包。为了避免切换延迟和丢包问题，本文提出了一种快速重配置地址机制(F-RAM)，在出现重复地址时快速生成唯一CoA，避免第二次重复的发生，并快速重新配置唯一地址。实验结果表明，该方案确实降低了重复CoA时的切换延迟和丢包。
{"title":"A Novel Mechanism to Improve Handover Efficiency Considering the Duplicate Address Occurs in HMIPv6","authors":"Yuhan Chen, T. Wu, Wei-Tsong Lee","doi":"10.1109/WAINA.2011.65","DOIUrl":"https://doi.org/10.1109/WAINA.2011.65","url":null,"abstract":"Numerous researches about Mobile IPv6 (MIPv6) have been proposed recently and the handover delay of the Mobile Nodes (MNs) among different networks is surely a worthy noticing issue. There are three major reasons for the MIPv6 handover delay: Movement Detection, Duplicate Address Detection (DAD), and Binding Update (BU), in, which DAD occupies most of the MIPv6 handover delay and influences real-time services greatly. No previous paper mentions how to reconfigure another unique Care of Address (CoA) when the generated CoA is used by other nodes during the DAD, and how to generate a unique CoA to accelerate the handover, reduce the handover delay and avoid the packet loss during the handover. To avert the problems that worsen the handover latency and the packet loss, this paper presents a Fast-Reconfigure Address Mechanism (F-RAM) to generate a unique CoA rapidly when duplicate address occurs, to evade the occurrence of the second duplication, and to reconfigure a unique address quickly. Our experiment results prove that our proposed scheme indeed reduces the handover delay and the packet loss when the CoA is duplicated.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131963953","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}
This paper presents a study of the optimal network design for efficient energy utilization in continuous data-gathering Wireless Sensor Networks (WSNs). We examine the problem of minimizing the network cost through the minimum number of relay-station installation. We model the network design problem as a mixed integer linear programming. Our key contribution is that the proposed model not only guarantee the network lifetime but also ensure the radio communication between the energy-limited sensor nodes so that the network can guarantee packet delivery from sensor nodes to the base station. Numerical experiments were conducted to evaluate and demonstrate the effectiveness of the proposed method.
{"title":"Optimal Wireless Sensor Network Design for Efficient Energy Utilization","authors":"C. Prommak, Sujitra Modhirun","doi":"10.1109/WAINA.2011.89","DOIUrl":"https://doi.org/10.1109/WAINA.2011.89","url":null,"abstract":"This paper presents a study of the optimal network design for efficient energy utilization in continuous data-gathering Wireless Sensor Networks (WSNs). We examine the problem of minimizing the network cost through the minimum number of relay-station installation. We model the network design problem as a mixed integer linear programming. Our key contribution is that the proposed model not only guarantee the network lifetime but also ensure the radio communication between the energy-limited sensor nodes so that the network can guarantee packet delivery from sensor nodes to the base station. Numerical experiments were conducted to evaluate and demonstrate the effectiveness of the proposed method.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637492","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}
When using replication as a technique for achieving high performance and scalability, optimistic replication is the natural choice. But optimistic replication introduces uncertainty that may lead to confusion in the clients. For example consecutive requests from the same client may be processed out of order, or the answer from a query might be too old to be useful to the client, or an operation may cause unwanted side-effect in the system when the client times out due to long response time. In such situations the clients can benefit from being allowed to specify their tolerable levels of uncertainty, in other words their desired quality-of-service (QoS) from the system. This paper introduces a novel optimistic replication protocol QRep with its QoS-aware middleware that allows the clients' to specify the following three QoS parameters: (1) session guarantee, (2) freshness and (3) deadline. QRep attempts to fulfill the specified QoS while processing the requests. QRep supports both synchronous and asynchronous clients. We carried out experiments to demonstrate the effectiveness of the protocol in terms of both QoS fulfillment and scalability. We also demonstrated that there is no significant performance penalty for providing the QoS.
{"title":"QoS-Aware Middleware for Scalable Replication","authors":"Raihan Al-Ekram, R. Holt","doi":"10.1109/WAINA.2011.33","DOIUrl":"https://doi.org/10.1109/WAINA.2011.33","url":null,"abstract":"When using replication as a technique for achieving high performance and scalability, optimistic replication is the natural choice. But optimistic replication introduces uncertainty that may lead to confusion in the clients. For example consecutive requests from the same client may be processed out of order, or the answer from a query might be too old to be useful to the client, or an operation may cause unwanted side-effect in the system when the client times out due to long response time. In such situations the clients can benefit from being allowed to specify their tolerable levels of uncertainty, in other words their desired quality-of-service (QoS) from the system. This paper introduces a novel optimistic replication protocol QRep with its QoS-aware middleware that allows the clients' to specify the following three QoS parameters: (1) session guarantee, (2) freshness and (3) deadline. QRep attempts to fulfill the specified QoS while processing the requests. QRep supports both synchronous and asynchronous clients. We carried out experiments to demonstrate the effectiveness of the protocol in terms of both QoS fulfillment and scalability. We also demonstrated that there is no significant performance penalty for providing the QoS.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128949062","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}
We propose a way to reuse obsolete older model PCs as a grid in keeping with Green IT. A grid has the advantage of creating a high performance environment consisting of ordinary PCs. However, it has the disadvantage of always requiring electricity, which is undesirable for the global environment due to the increased CO2 emissions from generating electricity. Therefore, this study proposes a grid powered by solar power to solve the disadvantage while at the same time reusing obsolete older model PCs.
{"title":"Proposal for Solar Powered Grid Based on Reused PCs","authors":"Kenichi Fujii, M. Yamagiwa, M. Uehara","doi":"10.1109/WAINA.2011.81","DOIUrl":"https://doi.org/10.1109/WAINA.2011.81","url":null,"abstract":"We propose a way to reuse obsolete older model PCs as a grid in keeping with Green IT. A grid has the advantage of creating a high performance environment consisting of ordinary PCs. However, it has the disadvantage of always requiring electricity, which is undesirable for the global environment due to the increased CO2 emissions from generating electricity. Therefore, this study proposes a grid powered by solar power to solve the disadvantage while at the same time reusing obsolete older model PCs.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115880694","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}
High availability WAN connectivity can be achieved with a single service provider link built with high quality hardware, redundancy, and SLA guarantees, or by bundling a number of inexpensive connections together, similar to RAID for computer storage. In this paper, we investigate the performance of a Redundant Array of Independent Internet Connections (RAIIC). We discuss proper planning and signaling of a RAIIC, and show the effect of individual links breaking down while people are transmitting data.
{"title":"Bundling Consumer Connections -- A Performance Analysis","authors":"Antti Mäkelä, J. Manner","doi":"10.1109/WAINA.2011.8","DOIUrl":"https://doi.org/10.1109/WAINA.2011.8","url":null,"abstract":"High availability WAN connectivity can be achieved with a single service provider link built with high quality hardware, redundancy, and SLA guarantees, or by bundling a number of inexpensive connections together, similar to RAID for computer storage. In this paper, we investigate the performance of a Redundant Array of Independent Internet Connections (RAIIC). We discuss proper planning and signaling of a RAIIC, and show the effect of individual links breaking down while people are transmitting data.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661297","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}
In this paper, we propose a P2P network construction method to achieve effective sensor data collection in a ubiquitous sensor environment. Our method constructs a P2P network overlay considering the location and the cycle of sensing of each sensor device (peer). First, according to the location of each peer, a hierarchical overlay network is constructed. In addition, considering the cycle of sensing, another overlay network is constructed in each hierarchy. Our method suppresses messages for query propagation.
{"title":"A P2P Network Construction Method Based on Cycle of Sensing and Location in Ubiquitous Sensor Environment","authors":"Yoshihiro Kosaka, A. Kanzaki, T. Hara, S. Nishio","doi":"10.1109/WAINA.2011.40","DOIUrl":"https://doi.org/10.1109/WAINA.2011.40","url":null,"abstract":"In this paper, we propose a P2P network construction method to achieve effective sensor data collection in a ubiquitous sensor environment. Our method constructs a P2P network overlay considering the location and the cycle of sensing of each sensor device (peer). First, according to the location of each peer, a hierarchical overlay network is constructed. In addition, considering the cycle of sensing, another overlay network is constructed in each hierarchy. Our method suppresses messages for query propagation.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122977738","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
扫码关注我们
求助内容：
应助结果提醒方式：