Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed to detect stepping-stone since 1995. One of those approaches proposed by A. Blum detects stepping-stone by checking if the difference between the number of the send packets of an incoming connection and the one of an outgoing connection is bounded. One weakness of this method is in resisting intruders' evasion, such as chaff perturbation. In this paper, we propose a method based on random walk theory to detect stepping-stone intrusion. Our theoretical analysis shows that the proposed method is more effective than Blum's approach in terms of resisting intruders' chaff perturbation.
{"title":"Monitoring Network Traffic to Detect Stepping-Stone Intrusion","authors":"Jianhua Yang, Byong Lee, Stephen S. H. Huang","doi":"10.1109/WAINA.2008.30","DOIUrl":"https://doi.org/10.1109/WAINA.2008.30","url":null,"abstract":"Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed to detect stepping-stone since 1995. One of those approaches proposed by A. Blum detects stepping-stone by checking if the difference between the number of the send packets of an incoming connection and the one of an outgoing connection is bounded. One weakness of this method is in resisting intruders' evasion, such as chaff perturbation. In this paper, we propose a method based on random walk theory to detect stepping-stone intrusion. Our theoretical analysis shows that the proposed method is more effective than Blum's approach in terms of resisting intruders' chaff perturbation.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"8 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":"134110744","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}
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}
Han-Bin Chang, T. Shih, Hui-Huang Hsu, Chun-Chia Wang
Interactive video was developed to enable different video experiences to users. By using the technology, video materials can be augmented to attract students. An interactive video course platform integrated with authoring and playback systems is proposed in this paper. Content providers can produce interactive video courses by using the interactive video authoring tool. Video files will be cut into several smaller segments called scenes as the basic unit in a video course. Interactive objects and multimedia resources can also be inserted to video courses to enhance variety. Users can play interactive video via the proposed playback platform. Interactions, messages and other multimedia objects will be displayed in scenes when users browse video courses. The integrated system was used in class room and received positive feedbacks. Interested readers are welcome to visit our demonstrations at http://member.mine.tku.edu.tw/www/ham/IVEL.wmv.
{"title":"An Interactive Video Course Platform with Authoring and Playback Systems","authors":"Han-Bin Chang, T. Shih, Hui-Huang Hsu, Chun-Chia Wang","doi":"10.1109/WAINA.2008.55","DOIUrl":"https://doi.org/10.1109/WAINA.2008.55","url":null,"abstract":"Interactive video was developed to enable different video experiences to users. By using the technology, video materials can be augmented to attract students. An interactive video course platform integrated with authoring and playback systems is proposed in this paper. Content providers can produce interactive video courses by using the interactive video authoring tool. Video files will be cut into several smaller segments called scenes as the basic unit in a video course. Interactive objects and multimedia resources can also be inserted to video courses to enhance variety. Users can play interactive video via the proposed playback platform. Interactions, messages and other multimedia objects will be displayed in scenes when users browse video courses. The integrated system was used in class room and received positive feedbacks. Interested readers are welcome to visit our demonstrations at http://member.mine.tku.edu.tw/www/ham/IVEL.wmv.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"44 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":"122542997","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 business Grid, the owner of a workflow is assumed to ask an SLA Workflow broker to execute the workflow for him. The price for executing a workflow on the Grid is negotiated between the user and the broker. Determining a price that satisfies both, the user and the SLA workflow broker, is a difficult task. This paper proposes a method using bilateral bargaining game model based on fuzzy logic to determine the price that the user and the broker could accept after the first negotiation round. We also analyze many parameters affecting the price determination process. The validation results show that the approach is suitable with business rules.
{"title":"Bilateral Bargaining Game and Fuzzy Logic in the System Handling SLA-Based Workflow","authors":"D. Quan, J. Altmann","doi":"10.1109/WAINA.2008.239","DOIUrl":"https://doi.org/10.1109/WAINA.2008.239","url":null,"abstract":"In the business Grid, the owner of a workflow is assumed to ask an SLA Workflow broker to execute the workflow for him. The price for executing a workflow on the Grid is negotiated between the user and the broker. Determining a price that satisfies both, the user and the SLA workflow broker, is a difficult task. This paper proposes a method using bilateral bargaining game model based on fuzzy logic to determine the price that the user and the broker could accept after the first negotiation round. We also analyze many parameters affecting the price determination process. The validation results show that the approach is suitable with business rules.","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":"128715343","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 wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called cluster-based minimal spanning tree with degree-constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as low-energy adaptive clustering hierarchy (LEACH) and group-based sensor network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.
{"title":"An Energy Efficient Routing Scheme in Wireless Sensor Networks","authors":"Chiu-Kuo Liang, Yu-Jie Huang, J. Lin","doi":"10.1109/WAINA.2008.199","DOIUrl":"https://doi.org/10.1109/WAINA.2008.199","url":null,"abstract":"In wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called cluster-based minimal spanning tree with degree-constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as low-energy adaptive clustering hierarchy (LEACH) and group-based sensor network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"44 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":"128408796","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}
Security issues are become more and more important in network application. This paper proposed an application of distance learning which integrated with citizen digital certificate (CDC) public key infrastructure (PKI), including the grade uploading, student information inquiring, and electronic documentation flow control. We integrated a tracking and persistent agent-based mobility management system in the case of distance learning. The main purpose of this system is addressed to achieve the universal access objective. We addressed to solve the problems in case of the data transferring in the network, such as eavesdropping, snooping, modification, masquerading and repudiation. And this would improve the efficiency of entire computerize procedure of electronic campus policy totally which in the following projects: Grade Processing System And Governmental Autographing System, etc. Especially, the Grade Uploading System was the first time to integrate with CDC. This experience was very important to integrate/generate the most secured application system in the Distance Learning.
{"title":"Digital Certificate Mobile Agent Technologies in Distance Learning","authors":"Dong-liang Lee, L. Deng","doi":"10.1109/WAINA.2008.164","DOIUrl":"https://doi.org/10.1109/WAINA.2008.164","url":null,"abstract":"Security issues are become more and more important in network application. This paper proposed an application of distance learning which integrated with citizen digital certificate (CDC) public key infrastructure (PKI), including the grade uploading, student information inquiring, and electronic documentation flow control. We integrated a tracking and persistent agent-based mobility management system in the case of distance learning. The main purpose of this system is addressed to achieve the universal access objective. We addressed to solve the problems in case of the data transferring in the network, such as eavesdropping, snooping, modification, masquerading and repudiation. And this would improve the efficiency of entire computerize procedure of electronic campus policy totally which in the following projects: Grade Processing System And Governmental Autographing System, etc. Especially, the Grade Uploading System was the first time to integrate with CDC. This experience was very important to integrate/generate the most secured application system in the Distance Learning.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"164 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":"115147525","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}
Recent times have seen a strong increase in the size, scope and number of information processing tasks computers are commonly used to perform. Grids are one form of distributed computing that, generally, aim for HTC (high throughput computing). Grids can also be constructed to perform HPC (high performance computing) at a relatively low cost when compared to clusters. There currently exists open source middleware for building grids. But when such grids consist of Windows machines it is difficult to use members of the grid efficiently. This research concerns the construction of a cheap grid of Windows machines. In this paper, we describe a Windows grid that uses multiple core processors which are becoming increasingly popular.
{"title":"Parallel Computing of CG Using an Open Source Windows Grid","authors":"Kenichi Tanaka, M. Uehara, H. Mori","doi":"10.1109/WAINA.2008.290","DOIUrl":"https://doi.org/10.1109/WAINA.2008.290","url":null,"abstract":"Recent times have seen a strong increase in the size, scope and number of information processing tasks computers are commonly used to perform. Grids are one form of distributed computing that, generally, aim for HTC (high throughput computing). Grids can also be constructed to perform HPC (high performance computing) at a relatively low cost when compared to clusters. There currently exists open source middleware for building grids. But when such grids consist of Windows machines it is difficult to use members of the grid efficiently. This research concerns the construction of a cheap grid of Windows machines. In this paper, we describe a Windows grid that uses multiple core processors which are becoming increasingly popular.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"61 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114110493","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}
Kanae Sakamoto, Misako Urakami, Tetsuya Shigeyasu, H. Matsuno
Safety information of evacuee is the most important information in relief activities in a disaster such as earthquake. We have been developing an autonomous disaster information service system using ad-hoc networks that is constructed after the occurrences of a disaster, providing safety information of evacuee in safe shelters. This paper proposes an algorithm to compute a network of safe shelters based on geographical conditions such as distances, altitudes and arrangements of mountains and buildings in the distressed area. In addition, we report the results of field experiments conducted in a small urban area aiming at testing automatic routing function of the wireless router used in our research.
{"title":"Disaster Information Service System for Relief Activities Using Ad-Hoc Network A Network Construction Algorithm and Results of Field Experiments","authors":"Kanae Sakamoto, Misako Urakami, Tetsuya Shigeyasu, H. Matsuno","doi":"10.1109/WAINA.2008.109","DOIUrl":"https://doi.org/10.1109/WAINA.2008.109","url":null,"abstract":"Safety information of evacuee is the most important information in relief activities in a disaster such as earthquake. We have been developing an autonomous disaster information service system using ad-hoc networks that is constructed after the occurrences of a disaster, providing safety information of evacuee in safe shelters. This paper proposes an algorithm to compute a network of safe shelters based on geographical conditions such as distances, altitudes and arrangements of mountains and buildings in the distressed area. In addition, we report the results of field experiments conducted in a small urban area aiming at testing automatic routing function of the wireless router used in our research.","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":"114908764","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}
Text categorization is an important research area in information retrieval. In order to save the storage space and get better accuracy, efficient and effective feature selection methods for reducing the data before analysis are highly desired. Usually, researches on feature selection use only a proper measurement such as information gain. In this paper, we propose a new feature selection method by adopting an attractive hidden topic analysis and entropy-based feature ranking. Experiments dealing with the well-known Reuters-21578 and Ohsumed datasets show that our method can achieve a better classification accuracy while reducing the feature dimension dramatically.
{"title":"An Efficient Feature Selection Using Hidden Topic in Text Categorization","authors":"Zhiwei Zhang, X. Phan, S. Horiguchi","doi":"10.1109/WAINA.2008.137","DOIUrl":"https://doi.org/10.1109/WAINA.2008.137","url":null,"abstract":"Text categorization is an important research area in information retrieval. In order to save the storage space and get better accuracy, efficient and effective feature selection methods for reducing the data before analysis are highly desired. Usually, researches on feature selection use only a proper measurement such as information gain. In this paper, we propose a new feature selection method by adopting an attractive hidden topic analysis and entropy-based feature ranking. Experiments dealing with the well-known Reuters-21578 and Ohsumed datasets show that our method can achieve a better classification accuracy while reducing the feature dimension dramatically.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"26 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":"122035838","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
扫码关注我们
求助内容：
应助结果提醒方式：