Interoperability testing for ad hoc routing protocols is crucial to the reliability of wireless mobile ad hoc networks. Nevertheless, most of the works in this area are devoted to simulations analyzing the performance of such protocols without taking into account their formal requirements and specifications. Our works deal with formal methods to test the interoperability of a MANET routing protocol, DSR. From previous works, many inconclusive verdicts were obtained on some test cases. To reduce them, a node self- similarity approach is presented in that paper.
{"title":"A Node Self Similarity Approach for Interoperability Testing of Ad Hoc Routing Protocols","authors":"S. Maag, C. Grepet","doi":"10.1109/WAINA.2008.61","DOIUrl":"https://doi.org/10.1109/WAINA.2008.61","url":null,"abstract":"Interoperability testing for ad hoc routing protocols is crucial to the reliability of wireless mobile ad hoc networks. Nevertheless, most of the works in this area are devoted to simulations analyzing the performance of such protocols without taking into account their formal requirements and specifications. Our works deal with formal methods to test the interoperability of a MANET routing protocol, DSR. From previous works, many inconclusive verdicts were obtained on some test cases. To reduce them, a node self- similarity approach is presented in that paper.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"102 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":"134478866","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}
Wikipedia, a huge scale Web-based dictionary, is an impressive corpus for knowledge extraction. We already proved that Wikipedia can be used for constructing an English association thesaurus and our link structure mining method is significantly effective for this aim. However, we want to find out how we can apply this method to other languages and what the requirements, differences and characteristics are. Nowadays, Wikipedia supports more than 250 languages such as English, German, French, Polish and Japanese. Among Asian languages, the Japanese Wikipedia is the largest corpus in Wikipedia. In this research, therefore, we analyzed all Japanese articles in Wikipedia and constructed a huge scale Japanese association thesaurus. After constructing the thesaurus, we realized that it shows several impressive characteristics depending on language and culture.
{"title":"Wikipedia Mining for Huge Scale Japanese Association Thesaurus Construction","authors":"Kotaro Nakayama, Masahiro Ito, T. Hara, S. Nishio","doi":"10.1109/WAINA.2008.37","DOIUrl":"https://doi.org/10.1109/WAINA.2008.37","url":null,"abstract":"Wikipedia, a huge scale Web-based dictionary, is an impressive corpus for knowledge extraction. We already proved that Wikipedia can be used for constructing an English association thesaurus and our link structure mining method is significantly effective for this aim. However, we want to find out how we can apply this method to other languages and what the requirements, differences and characteristics are. Nowadays, Wikipedia supports more than 250 languages such as English, German, French, Polish and Japanese. Among Asian languages, the Japanese Wikipedia is the largest corpus in Wikipedia. In this research, therefore, we analyzed all Japanese articles in Wikipedia and constructed a huge scale Japanese association thesaurus. After constructing the thesaurus, we realized that it shows several impressive characteristics depending on language and culture.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"72 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":"134644271","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 computational grid offers services for efficiently scheduling jobs on the grid, but for grid- enabled applications where data handling is a most relevant part in performance, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites using services such as GRID-ftp, plus a replica manager to keep track of where replicas are located. Usually, careful original data layout is not considered because the data can be moved based on some replica optimization models to computing sites. We consider cooperative shared computations for huge data that is distributed over a variable number of sites. In this context, data layout is a relevant problem because moving very large amounts of data is too expensive. Consequently, it is a balance between data layout and load-balancing capabilities on top of the basic infrastructure that is the most crucial issue. In this paper we propose a mixed replication layout and load-balancing approach to yield very good performance results in such environments.
{"title":"Efficient Shared Computations over Distributed Sites","authors":"P. Furtado","doi":"10.1109/WAINA.2008.171","DOIUrl":"https://doi.org/10.1109/WAINA.2008.171","url":null,"abstract":"The computational grid offers services for efficiently scheduling jobs on the grid, but for grid- enabled applications where data handling is a most relevant part in performance, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites using services such as GRID-ftp, plus a replica manager to keep track of where replicas are located. Usually, careful original data layout is not considered because the data can be moved based on some replica optimization models to computing sites. We consider cooperative shared computations for huge data that is distributed over a variable number of sites. In this context, data layout is a relevant problem because moving very large amounts of data is too expensive. Consequently, it is a balance between data layout and load-balancing capabilities on top of the basic infrastructure that is the most crucial issue. In this paper we propose a mixed replication layout and load-balancing approach to yield very good performance results in such environments.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"279 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":"132226393","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 optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.
{"title":"The Design of Optimal Period Interleaver","authors":"Y. Wang, Xinjun Du, Hui Li, Yumin Wang","doi":"10.1109/WAINA.2008.276","DOIUrl":"https://doi.org/10.1109/WAINA.2008.276","url":null,"abstract":"The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process of short frame Turbo codes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"5 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":"132680975","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 system which extracts faces and person names from news articles with photos on the Web and associates them automatically. The system detects face images in news photos with a face detector and extracts person names from news text with a morphological analyzer. In addition, the bag-of-keypoints technique is applied to the extracted face images for filtering out non-face images. The system uses the eigenface representation as image features of the extracted faces, and associates them with the extracted names by the modified k-means clustering in the eigenface subspace. In the experiment, we obtained the 66% precision rate regarding association of faces and names.
{"title":"Associating Faces and Names in Japanese Photo News Articles on the Web","authors":"Akio Kitahara, Taichi Joutou, Keiji Yanai","doi":"10.1109/WAINA.2008.97","DOIUrl":"https://doi.org/10.1109/WAINA.2008.97","url":null,"abstract":"We propose a system which extracts faces and person names from news articles with photos on the Web and associates them automatically. The system detects face images in news photos with a face detector and extracts person names from news text with a morphological analyzer. In addition, the bag-of-keypoints technique is applied to the extracted face images for filtering out non-face images. The system uses the eigenface representation as image features of the extracted faces, and associates them with the extracted names by the modified k-means clustering in the eigenface subspace. In the experiment, we obtained the 66% precision rate regarding association of faces and names.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"11 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":"132753301","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}
Mobility has emerged as an important new trend in the arena of distributed computing bringing along with it deep social and technical transformations. These changes clearly create an increasing demand for applications and middleware that exploit and support mobility. This paper surveys the main classes of paradigms and middlewares for distributed (mobile) systems and proposes a new paradigm inspired in the concept of magnetic fields from physics. The model is then formally defined and implementation issues concerning extensions to be applied to current middlewares in order to support the paradigm are detailed. Finally, conclusions are drawn and the main future works are listed.
{"title":"A Paradigm Shift in the Design of Mobile Applications","authors":"L. Lima, A. Calsavara","doi":"10.1109/WAINA.2008.295","DOIUrl":"https://doi.org/10.1109/WAINA.2008.295","url":null,"abstract":"Mobility has emerged as an important new trend in the arena of distributed computing bringing along with it deep social and technical transformations. These changes clearly create an increasing demand for applications and middleware that exploit and support mobility. This paper surveys the main classes of paradigms and middlewares for distributed (mobile) systems and proposes a new paradigm inspired in the concept of magnetic fields from physics. The model is then formally defined and implementation issues concerning extensions to be applied to current middlewares in order to support the paradigm are detailed. Finally, conclusions are drawn and the main future works are listed.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"57 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132900594","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}
Yusuke Murase, A. Aikebaier, T. Enokido, M. Takizawa
Information and communication systems for vehicles are getting significant like ETC (electronic toll collection) and car navigation systems. In the next generation navigation systems, each vehicle can not only receive various types of information like maps and traffic but also obtain traffic information around the vehicle by using the sensors and send them to a navigation center. It is critical to discuss how to store information collected by vehicles in databases and how vehicles access the information in the database in the presence of a huge number of vehicles on roads. In this paper, we propose an enhanced dynamic R-tree (EDR-tree) scheme to store and retrieve traffic data collected by vehicles in dynamic distributed database systems. In distributed tree-structured indexes like R-tree and B-tree, the root node and nodes at upper layers easily get performance bottleneck and points of failure since every query request is transferred from root to leaf node. In this paper, we propose a new tree-structured scheme named EDR-tree to store data. A road is realized as a sequence of road units. A geographical space of roads is separated into area units where road units are stored. An area unit is stored in a leaf node and there is a tree-structured index on the leaf nodes like B+-tree and R-tree. Each vehicle first makes an access to a leaf node, not the root, which has information of a road unit where the vehicle is currently moving. Then, a query request is efficiently and reliably delivered to a target node by using not only parent-child links but also enhancing links, sibling and adjacent links. We evaluate the EDR-tree in terms of search time and insertion time.
{"title":"Distributed Databases in Dynamic R-Tree for Vehicle Information Systems","authors":"Yusuke Murase, A. Aikebaier, T. Enokido, M. Takizawa","doi":"10.1109/WAINA.2008.237","DOIUrl":"https://doi.org/10.1109/WAINA.2008.237","url":null,"abstract":"Information and communication systems for vehicles are getting significant like ETC (electronic toll collection) and car navigation systems. In the next generation navigation systems, each vehicle can not only receive various types of information like maps and traffic but also obtain traffic information around the vehicle by using the sensors and send them to a navigation center. It is critical to discuss how to store information collected by vehicles in databases and how vehicles access the information in the database in the presence of a huge number of vehicles on roads. In this paper, we propose an enhanced dynamic R-tree (EDR-tree) scheme to store and retrieve traffic data collected by vehicles in dynamic distributed database systems. In distributed tree-structured indexes like R-tree and B-tree, the root node and nodes at upper layers easily get performance bottleneck and points of failure since every query request is transferred from root to leaf node. In this paper, we propose a new tree-structured scheme named EDR-tree to store data. A road is realized as a sequence of road units. A geographical space of roads is separated into area units where road units are stored. An area unit is stored in a leaf node and there is a tree-structured index on the leaf nodes like B+-tree and R-tree. Each vehicle first makes an access to a leaf node, not the root, which has information of a road unit where the vehicle is currently moving. Then, a query request is efficiently and reliably delivered to a target node by using not only parent-child links but also enhancing links, sibling and adjacent links. We evaluate the EDR-tree in terms of search time and insertion time.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"1 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":"122349856","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}
Since Semantic Web is increasing in size and variety of resources, it is difficult for users to find the information that they really need. In this paper, we propose a new approach of integrating four processes for Web resource categorization which can promote the efficiency of information retrieval. The processes can extract both the explicit relations extracted directly from the ontologies in a traditional way and the potential relations inferred from existing ontologies by focusing on some new challenges such as extracting important class names, using WordNet relations and detecting the methods of describing the Web resources. Our proposed method can achieve a notable improvement in categorizing the valuable Web resources based on incomplete ontologies for a Semantic Web search system.
{"title":"An Integrated Method for Web Resource Categorization","authors":"Minghua Pei, Kotaro Nakayama, T. Hara, S. Nishio","doi":"10.1109/WAINA.2008.100","DOIUrl":"https://doi.org/10.1109/WAINA.2008.100","url":null,"abstract":"Since Semantic Web is increasing in size and variety of resources, it is difficult for users to find the information that they really need. In this paper, we propose a new approach of integrating four processes for Web resource categorization which can promote the efficiency of information retrieval. The processes can extract both the explicit relations extracted directly from the ontologies in a traditional way and the potential relations inferred from existing ontologies by focusing on some new challenges such as extracting important class names, using WordNet relations and detecting the methods of describing the Web resources. Our proposed method can achieve a notable improvement in categorizing the valuable Web resources based on incomplete ontologies for a Semantic Web search system.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"30 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":"114174010","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：