One of the major earthquakes named "Chuesu-oki Earthquake" was happened in Niigara Prefecture, central part of Japan on July 16, 2007. Since four days after the earthquake, our researchers' team has joined volunteer coordination activities as so called "information volunteer" by using WIDIS (Wide area Disaster Information Sharing system) which is a kind of Web based geographical information system. Our activity includes 1) making daily reports on the activity and disclosing information by using WIDIS (http://saigai.jp/), 2) building and updating database for affected houses, 3) coordination activities of volunteers to the disaster victims. WIDIS has been actually used for all aspects of these activities. Through these experiences, it became clear that G- WIDIS can be effectively used to coordinate disaster relevant information between each volunteer centre which will be placed in afflicted cities and towns.
2007年7月16日，日本中部的新加拉县发生了一次大地震，名为“秋树地震”。从地震发生的第4天开始，我们的研究团队就利用一种基于Web的地理信息系统WIDIS (Wide area Disaster information Sharing system，广域灾害信息共享系统)，以“信息志愿者”的身份参与志愿者协调活动。我们的活动包括:1)通过WIDIS (http://saigai.jp/)对活动进行每日报告和信息披露;2)建立和更新受灾房屋数据库;3)协调志愿者的救灾活动。实际上，WIDIS已用于这些活动的所有方面。通过这些经验，很明显，G- WIDIS可以有效地用于在受灾城镇的每个志愿服务中心之间协调与灾害有关的信息。
{"title":"Web-Based Support Coordination by Using WIDIS - Case Study of Chuesu-oki Earthquake in 2007","authors":"N. Sawano, Tsuyoshi Hoshikawa, Takayuki Obata","doi":"10.1109/WAINA.2008.141","DOIUrl":"https://doi.org/10.1109/WAINA.2008.141","url":null,"abstract":"One of the major earthquakes named \"Chuesu-oki Earthquake\" was happened in Niigara Prefecture, central part of Japan on July 16, 2007. Since four days after the earthquake, our researchers' team has joined volunteer coordination activities as so called \"information volunteer\" by using WIDIS (Wide area Disaster Information Sharing system) which is a kind of Web based geographical information system. Our activity includes 1) making daily reports on the activity and disclosing information by using WIDIS (http://saigai.jp/), 2) building and updating database for affected houses, 3) coordination activities of volunteers to the disaster victims. WIDIS has been actually used for all aspects of these activities. Through these experiences, it became clear that G- WIDIS can be effectively used to coordinate disaster relevant information between each volunteer centre which will be placed in afflicted cities and towns.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114705521","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}
There are a lot of studies concerned with video streaming methods based on peer-to-peer network in order to realize efficient video services. However, a lot of these are not considering user's real network environment, and these are not enough about efficiency in the use of network resources and device resources. On the other hand, the strategy of an appropriate quality streaming is needed in order to deal with the user's various quality demands. In this paper, we propose PLEXCast system: peer-to-peer video streaming system that deal with each user's multiple network environments, quality demand, and dynamic change of delivery network. PLEXCast system has following functions: 1) IP unicast/multicast selecting protocol with user's network environment, 2) contents transcoding function with user's quality demand, 3) sub-streaming function for assuring service continuity.
{"title":"PLEXCast: Peer-to-Peer Flexble Broadcast System","authors":"Yoshitaka Yokokawa, K. Hashimoto, Y. Shibata","doi":"10.1109/WAINA.2008.54","DOIUrl":"https://doi.org/10.1109/WAINA.2008.54","url":null,"abstract":"There are a lot of studies concerned with video streaming methods based on peer-to-peer network in order to realize efficient video services. However, a lot of these are not considering user's real network environment, and these are not enough about efficiency in the use of network resources and device resources. On the other hand, the strategy of an appropriate quality streaming is needed in order to deal with the user's various quality demands. In this paper, we propose PLEXCast system: peer-to-peer video streaming system that deal with each user's multiple network environments, quality demand, and dynamic change of delivery network. PLEXCast system has following functions: 1) IP unicast/multicast selecting protocol with user's network environment, 2) contents transcoding function with user's quality demand, 3) sub-streaming function for assuring service continuity.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116875053","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}
The Web is an information repository that grows and evolves fast. Traditional data management systems are based on a persistence model that are not suited for management of Web data. In this paper, we propose a semi-persistence model to capture the evolving nature of the Web. By semi-persistence, we mean data with relaxed persistence requirement where obsolete data may be moved to somewhere or removed implicitly and autonomously. In a semi-persistent data management system, data and the associated statistics have to be maintained efficiently to support trend-report queries and age estimation. We propose a space-efficient data structure, called moving bloom filters (MBF) to maintain time-sensitive statistics of underlying data. The preliminary experiments show that the optimized MBF achieves considerable improvement on space usage while maintaining the same precise estimation of frequency statistics.
{"title":"Efficient Management of Semi-Persistent Data for the Evolving Web","authors":"K. Cheng, X. You, Yanchun Zhang","doi":"10.1109/WAINA.2008.192","DOIUrl":"https://doi.org/10.1109/WAINA.2008.192","url":null,"abstract":"The Web is an information repository that grows and evolves fast. Traditional data management systems are based on a persistence model that are not suited for management of Web data. In this paper, we propose a semi-persistence model to capture the evolving nature of the Web. By semi-persistence, we mean data with relaxed persistence requirement where obsolete data may be moved to somewhere or removed implicitly and autonomously. In a semi-persistent data management system, data and the associated statistics have to be maintained efficiently to support trend-report queries and age estimation. We propose a space-efficient data structure, called moving bloom filters (MBF) to maintain time-sensitive statistics of underlying data. The preliminary experiments show that the optimized MBF achieves considerable improvement on space usage while maintaining the same precise estimation of frequency statistics.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115532396","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}
Some simulators were designed for wireless sensor networks. The main goal of these simulators is to provide a framework to closely model and simulate various sensor networks scenarios. Two important factors for accurate evaluation are simulator and method of simulation. In this paper, we don't want to produce a new simulator for sensor networks. We will show how to use current simulators for getting accurate results. On the other hand, we will talk about the role of evaluation methods in simulation results and show current evaluation method; analysis of routing protocols based on results of finite states of network, isn't an exact evaluation for using in a special application for sensor networks. Then we offer a method for accurate and practical evaluation of routing protocols in sensor networks. We name it special evaluation method and compare it with traditional evaluation method. Then, we show that our offer method has more accurate results than traditional evaluation method. Finally, we find reasons of result difference between two methods.
{"title":"Special Evaluation: A Practical Simulation-Based Method for Accurate Performance Evaluation of Routing Protocols in Wireless Sensor Networks","authors":"E. Ahvar, M. Fathy","doi":"10.1109/WAINA.2008.235","DOIUrl":"https://doi.org/10.1109/WAINA.2008.235","url":null,"abstract":"Some simulators were designed for wireless sensor networks. The main goal of these simulators is to provide a framework to closely model and simulate various sensor networks scenarios. Two important factors for accurate evaluation are simulator and method of simulation. In this paper, we don't want to produce a new simulator for sensor networks. We will show how to use current simulators for getting accurate results. On the other hand, we will talk about the role of evaluation methods in simulation results and show current evaluation method; analysis of routing protocols based on results of finite states of network, isn't an exact evaluation for using in a special application for sensor networks. Then we offer a method for accurate and practical evaluation of routing protocols in sensor networks. We name it special evaluation method and compare it with traditional evaluation method. Then, we show that our offer method has more accurate results than traditional evaluation method. Finally, we find reasons of result difference between two methods.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"307 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123242945","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 investigate performance characteristics of secure group communication systems (GCSs) in mobile ad hoc networks that employ intrusion detection techniques for dealing with insider attacks tightly coupled with rekeying techniques for dealing with outsider attacks. The objective is to identify optimal settings including the best intrusion detection interval and the best batch rekey interval under which the system lifetime (mean time to security failure) is maximized while satisfying performance requirements. We develop a mathematical model based on stochastic Petri net (SPN) to analyze tradeoffs between security and performance properties, when given a set of parameter values characterizing operational and environmental conditions of a GCS instrumented with intrusion detection tightly coupled with batch rekeying. We compare our design with a baseline system using intrusion detection integrated with individual rekeying to demonstrate the effectiveness.
{"title":"Performance Analysis of Dynamic Group Communication Systems with Intrusion Detection Integrated with Batch Rekeying in Mobile Ad Hoc Networks","authors":"Jin-Hee Cho, I. Chen, Phu-Gui Feng","doi":"10.1109/WAINA.2008.140","DOIUrl":"https://doi.org/10.1109/WAINA.2008.140","url":null,"abstract":"We investigate performance characteristics of secure group communication systems (GCSs) in mobile ad hoc networks that employ intrusion detection techniques for dealing with insider attacks tightly coupled with rekeying techniques for dealing with outsider attacks. The objective is to identify optimal settings including the best intrusion detection interval and the best batch rekey interval under which the system lifetime (mean time to security failure) is maximized while satisfying performance requirements. We develop a mathematical model based on stochastic Petri net (SPN) to analyze tradeoffs between security and performance properties, when given a set of parameter values characterizing operational and environmental conditions of a GCS instrumented with intrusion detection tightly coupled with batch rekeying. We compare our design with a baseline system using intrusion detection integrated with individual rekeying to demonstrate the effectiveness.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125040331","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}
A wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the neighbor-aware clusterhead (NAC). NAC establishes a dynamic wireless mobile infrastructure. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.
{"title":"Neighbor-Aware Clusterhead for SNET","authors":"T. Sheltami","doi":"10.1109/WAINA.2008.219","DOIUrl":"https://doi.org/10.1109/WAINA.2008.219","url":null,"abstract":"A wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the neighbor-aware clusterhead (NAC). NAC establishes a dynamic wireless mobile infrastructure. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122942404","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}
RFID are small wireless devices which can be used for identification of objects and humans as well. Their acceptance has grown in past years and is expected to grow further. Due to reduction in cost of production RFID devices are being deployed in large numbers in supply chains (by Wal-Mart, etc.) In this paper we provide a comprehensive survey of various RFID authentication protocols proposed in the literature and classify them in different categories. We then study RFID authentication protocols having minimalist technique namely EMAP, LMAP and M2MAP.
{"title":"A Survey of RFID Authentication Protocols","authors":"Yawer Yousuf, V. Potdar","doi":"10.1109/WAINA.2008.214","DOIUrl":"https://doi.org/10.1109/WAINA.2008.214","url":null,"abstract":"RFID are small wireless devices which can be used for identification of objects and humans as well. Their acceptance has grown in past years and is expected to grow further. Due to reduction in cost of production RFID devices are being deployed in large numbers in supply chains (by Wal-Mart, etc.) In this paper we provide a comprehensive survey of various RFID authentication protocols proposed in the literature and classify them in different categories. We then study RFID authentication protocols having minimalist technique namely EMAP, LMAP and M2MAP.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123559943","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 the information age, information is usually communicated and exchanged with heterogeneous databases in a distributed internetworking environment. When multiple heterogeneous databases show different values for the same data item, its actual value is not known with certainty. Probabilistic relational databases have extended from the relational database model by incorporating probability measures to capture the data uncertainty associated with data items. In this paper, we apply the probabilistic relational database techniques to the area of biomedical informatics. We address the issue of database interoperability by using a data warehousing approach to resolve mismatched domains and to integrate information from different data sources. We then develop query processing strategies to effectively evaluate and answer queries from the consolidated database.
{"title":"Probabilistic Relational Database Applications for Biomedical Informatics","authors":"Ping-Tsai Chung, Hsin-Hua Hsiao","doi":"10.1109/WAINA.2008.280","DOIUrl":"https://doi.org/10.1109/WAINA.2008.280","url":null,"abstract":"In the information age, information is usually communicated and exchanged with heterogeneous databases in a distributed internetworking environment. When multiple heterogeneous databases show different values for the same data item, its actual value is not known with certainty. Probabilistic relational databases have extended from the relational database model by incorporating probability measures to capture the data uncertainty associated with data items. In this paper, we apply the probabilistic relational database techniques to the area of biomedical informatics. We address the issue of database interoperability by using a data warehousing approach to resolve mismatched domains and to integrate information from different data sources. We then develop query processing strategies to effectively evaluate and answer queries from the consolidated database.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123673488","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}
Strip-mining technique is critical for improving performance of large-scale scientific applications on Imagine. In this paper, we present a model-guided strip size selection approach (OSS) for finding the optimal strip size to minimize the execution time. Our strategy consists of a detailed analytical model that characterizes the effect of strip size on program behavior. Then according to the model analysis, we design a simple strip size selection strategy, that is, the optimal strip size is 512 words. Our experimental results show that when the optimal strip size is used, the execution time is close to the experimentally best. It is certain that our strategy can efficiently exploit the tremendous potential of Imagine.
{"title":"OSS: Efficient Compiler Approach for Selecting Optimal Strip Size on the Imagine Stream Processor","authors":"Jing Du, Canqun Yang, F. Ao, Xuejun Yang","doi":"10.1109/WAINA.2008.63","DOIUrl":"https://doi.org/10.1109/WAINA.2008.63","url":null,"abstract":"Strip-mining technique is critical for improving performance of large-scale scientific applications on Imagine. In this paper, we present a model-guided strip size selection approach (OSS) for finding the optimal strip size to minimize the execution time. Our strategy consists of a detailed analytical model that characterizes the effect of strip size on program behavior. Then according to the model analysis, we design a simple strip size selection strategy, that is, the optimal strip size is 512 words. Our experimental results show that when the optimal strip size is used, the execution time is close to the experimentally best. It is certain that our strategy can efficiently exploit the tremendous potential of Imagine.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121708359","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 present a tool allowing the design of service orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an abstract way, as annotations on the services orchestration. Our purpose is to generate code, including security code, from this specification. This is especially important in the context of complex execution platforms like enterprise service buses. Our tool is used in the context of industrial plants using more and more services like DPWS to implement applications.
{"title":"Transparently Adding Security Properties to Service Orchestration","authors":"Stéphanie Chollet, P. Lalanda, A. Bottaro","doi":"10.1109/WAINA.2008.70","DOIUrl":"https://doi.org/10.1109/WAINA.2008.70","url":null,"abstract":"In this paper, we present a tool allowing the design of service orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an abstract way, as annotations on the services orchestration. Our purpose is to generate code, including security code, from this specification. This is especially important in the context of complex execution platforms like enterprise service buses. Our tool is used in the context of industrial plants using more and more services like DPWS to implement applications.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126058228","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
扫码关注我们
求助内容：
应助结果提醒方式：