{"title":"An Ambient Service Model for Providing Structured Web Information Based on User-Contexts","authors":"Kyun-Seok Seo, Yong-hee Jang, Y. Kwon, Ryong Lee","doi":"10.1109/CYBERC.2010.83","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.83","url":null,"abstract":"Users often visit many stores while they compare merchandise in order to purchase the merchandise or merchandise related to it. Given a service providing information such as location of these stores, they can reduce their time and effort spent by wandering around them because they can go straight to these stores. And they can obtain new purchase opportunities because they can know what kinds of related stores are around them. Thus, they can do efficient purchasing activities. In this paper, we discuss service providing information of related stores efficiently in order to support users’ efficient purchasing activities. And we propose an ambient service model that consists of three layers: structured (purchase-related) information space, real-life space, and ambient information space. In this model, a lot of store information collected from the web is grouped and structured automatically by relation in terms of purchasing. And users search information of related stores by using an ambient query that is automatically created by their context in real-life space. Finally, they obtain information of related stores in the form of hierarchy structure through map interface. Then, they can search other kinds of information of related stores additionally by using the hierarchy structure. We implemented a system based on this model by using Radio-Frequency Identification (RFID), map-based, location-based and ontology technology. The implemented system was performed in specific shopping region (Ilsan Lapesta shopping mall, Goyang-city Gyeonggi-do, Korea). And we confirmed that users can efficiently obtain information of related stores through the system. We expect that this model can be used for developing services that provide information of objects related to various objects besides stores.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114433770","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}
{"title":"Using Packet Size Distribution to Identify P2P-TV Traffic","authors":"Li Jin, Zhang Xin, Zuo Xiao-Liang, Wang Hui","doi":"10.1109/CYBERC.2010.35","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.35","url":null,"abstract":"We propose an approach to accurately identify the traffic generaed by P2P-TV applications. This approach only relies on accounting packet size distribution (PSD) of the P2P-TV application during small time-windows. The rationale is that the packet size distributions of P2P-TV applications are different from each other. Based on the statistic, we make use of Support Vector Machines on a large set of P2P-TV test-bed traces. Experiment results show that our approach is effective and reliable to identify P2P-TV traffic.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128918530","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}
{"title":"A Study on Recommendation Features for an RSS Reader","authors":"Cansheng Ji, Jingyu Zhou","doi":"10.1109/CYBERC.2010.43","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.43","url":null,"abstract":"In the era of web 2.0, everyone can create and update content, and everyone can host a personal web site with little effort, making it hard to gather valuable information from different web sites. With RSS, people can read information from different resources in a uniform way, and in a single tool, such as an RSS reader. However, most of the RSS readers only display items in chronological order, which doesn't work well when users are inundated with too many items in the feeds. We propose using recommendation to help people find items in an RSS reader. Specifically, we consider profiled based features (i.e., text similarity and favorite fraction), update frequency, as well as Post Rank values for RSS recommendation. Experimental results indicate that favorite fraction and update frequency perform better than text similarity. Additionally, we also study the effect of feature combination and find that the combination of similarity and favorite fraction performs the best.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879959","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}
{"title":"WORM-Based Data Protection Approach","authors":"Jinsun Suk, Jaechun No","doi":"10.1109/CYBERC.2010.81","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.81","url":null,"abstract":"In this paper we present a WORM-based data protection mechanism in the WOWSnap file system. In the WOWSnap, once the WORM files have been created, only the privileged read requests to them are allowed to access, to protect the WORM files against any intentional or accidental deletion or modification. Different from the past works, the WOWSnap provides a capability of efficiently managing the WORM files that have a limited protection period. Once their protection period is expired, to save the costly WORM disk section, the WOWSnap automatically moves those files to the general disk section without any user interference. Also, the WOWSnap provides a snapshot scheme to protect files, including WORMs, against data crash. In the snapshot of WOWSnap, we attempted to minimize I/O processing overhead, by pre-allocating inode and data blocks for the following snapshot image. Also, by using the snapshot spatial algorithm implemented in the WOWSnap, we tried to maintain the disk space allocated for snapshot images as small as possible. A series of measurements were conducted to verify our scheme.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690346","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}
{"title":"Providing SMS Notification with Less Interruption","authors":"Tiantian Gao, Zhiqiang Yang, Heng Wang","doi":"10.1109/CYBERC.2010.33","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.33","url":null,"abstract":"SMS communication is gaining increasing popularity in people’s daily life. Along with the growing number of times people sending and receiving SMSs every day, there are also increasing unwanted interruption to people when they are busy with their work or feel less receptive to unimportant messages. Unfortunately, current SMS systems are unable to present notifications according to user’s states and willingness of being interrupted. In this work, we develop a SMS system that intelligently determines a good way to present notifications to the user at a suitable time. A decision module is made to analyze the message content, the relation between the sender and the user, and the user state when a new message comes. The results of the decision module are used to implement a nicer notification and to reduce interruptions to a user’s ongoing tasks.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129607407","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}
{"title":"Research on SOA-Based Integrated Strategy to Enable the Smart Grid","authors":"Chang Liu, T. Reynolds, Hong Bao","doi":"10.1109/CYBERC.2010.98","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.98","url":null,"abstract":"This paper proposes the use of service-oriented architecture and Web service technology, to address the current energy control problem. We propose a extended hierarchical model to organize the integrated smart grid system connected over the IP cloud, so that coordination and cooperation of all information systems are achieved autonomously and provides consumers with a carbon network management platform for real-time control. Detailed analyses and explanation of each layer of the architecture is presented and a related technology is introduced such as UDDI, SOAP, RDF. This study was designed to solve the energy restructuring, energy supply and consumption regulation, and the effective use of existing resources to strengthen the power infrastructure system agility and interactivity.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133851171","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}
{"title":"Automatic Construction of Domain Concept Hierarchy","authors":"Sun Qiao, Z. Chunhui, Chen Zhibo","doi":"10.1109/CYBERC.2010.85","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.85","url":null,"abstract":"A general automatic domain concept hierarchy construction procedure is presented in this paper. This is a domain independent construct a domain concept hierarchy from a domain corpus . The construction procedure mainly includes domain terminology extraction, word sense disambiguation, similarity computation, hierarchy construction and subsumption relation detection. All extracted candidate terms are ranked first, then one can select the top terms as domain terminologies. Frequency ratio and entropy of a word are considered to rank candidate terms. Relations between terms are taken into account for words in WordNet, while distributional similarity is used to compute similarity between words outside WordNet. Experiments on two domain corpus show that the proposed procedure is feasible and can get reasonable concept hierarchy.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130868382","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}
{"title":"An Improved Mobile Object Tracking Scheme Combining Range-Hybrid Localizations and Prediction Mechanisms","authors":"Jaebok Park, Gihwan Cho","doi":"10.1109/CYBERC.2010.37","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.37","url":null,"abstract":"Localization is the most important feature in the sensor net-work environment, as it is a basic element enabling people and things to be aware of the surrounding environment. This pa-per proposes a mobile object tracking method, which aims to greatly improve mobile tracking accuracy in a low-density sensor network environment. The proposed scheme reduces the location estimation area using the information of surrounding nodes combining range-based and range-free techniques. It tries to conspicuously enhance the accuracy of mobile object tracking by adding an adaptive tracking prediction mechanism and estimative grid points, by considering the advance direction of the mobile object. Simulation results show that our method outperforms other localization and tracking methods in tracking accuracy.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115063717","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}
{"title":"A Precise 2-D Wireless Localization Technique Using Smart Antenna","authors":"Zhu Xiaorong, Wang Yong, Z. Hongbo","doi":"10.1109/CYBERC.2010.21","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.21","url":null,"abstract":"In recent years, localization using angle of arrival (AOA) has gathered more attention, due to the use of smart antenna techniques for performance improvement in mobile communications. In this paper, we propose a precise two dimensional (2-D) localization approach by using AOA measurements which considers the error due to multipath propagation as well as angle estimation error. Specifically, we propose to use three antenna arrays to provide a fix, each with a unique combination of another antenna array. Thus, three sets of antenna arrays are formed altogether. For each set, we first transform angle information into location coordinates by standard geometry and linearization method is used for getting the initial location estimates. Then the Final Position is estimated from the three initial location estimates by the Precision-Weighted Aggregation approach which considers the errors from measurement and multipath propagation. Finally, the performance of the proposed method is evaluated.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114772206","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}
{"title":"Improving Cooperative Spectrum Sensing under Correlated Log-Normal Shadowing","authors":"D. T. T. Mai, T. C. Chung, N. Q. Tuan, D. Nguyen","doi":"10.1109/CYBERC.2010.72","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.72","url":null,"abstract":"It is well known that exploiting spatial diversity via cooperation of many cognitive radios leads to an increase in energy detection reliability. This is because the probability that many radio channels concurrently experience the worst shadowing and fading channel conditions decreases as the number of cooperative CRs increases. Compared to multipath fading, shadowing effects tend to produce weak and correlated received signals, hence reducing spatial diversity gain over a much larger distance, depending on the characteristics and the size of the obstruction. The motivation of our paper is that because signals received by neighboring CRs subject to shadowing by the same obstacle or cluster of obstacles are highly correlated, these CRs should be excluded from the cooperative sensing group. In this paper we present a technique to successfully identify those CRs and how to quantify justification for their exclusion.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125877775","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}