{"title":"A 2-Dimensional ACO-Based Path Planner for Off-Line Robot Path Planning","authors":"N. Ganganath, Chi-Tsun Cheng","doi":"10.1109/CyberC.2013.59","DOIUrl":"https://doi.org/10.1109/CyberC.2013.59","url":null,"abstract":"Wireless sensor networks are usually deployed in scenarios that are too hostile for human personnel to perform maintenance tasks. Wireless sensor nodes usually exchange information in a multi-hop manner. Connectivity is crucial to the performance of a wireless sensor network. In case a network is partitioned due to node failures, it is possible to re-connect the fragments by setting up bridges using mobile platforms. Given the landscape of a terrain, the mobile platforms should be able reach the target position using a desirable path. In this paper, an off-line robot path planner is proposed to find desirable paths between arbitrary points in a given terrain. The proposed path planner is based on ACO algorithms. Unlike ordinary ACO algorithms, the proposed path planner provides its artificial ants with extra flexibility in making routing decisions. Simulation results show that such enhancement can greatly improve the qualities of the paths obtained. Performances of the proposed path planner can be further optimized by fine-tuning its parameters.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823132","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":"Discovering Massive High-Value Users from Sina Weibo Based on Quality and Activity","authors":"Guangzhi Zhang, R. Bie","doi":"10.1109/CyberC.2013.42","DOIUrl":"https://doi.org/10.1109/CyberC.2013.42","url":null,"abstract":"This paper proposes a method to discover the high-value users who are both high-quality and high-activity. First, a Trust Transfer Model is introduced to capture users with high-quality in Sina Weibo that is a social web in China. Then, analysis and discussion are shown to identify the users are high-quality. Next, fresh users who are busy reposting are captured into the dataset filled with the high-quality users. Considering that reposting stands for the high-activity, hence the four degrees including reposting are proposed to judge one user's quality and activity. We discuss the effects of the four degrees. And then, the method called \"WeiboRank\" based on the four degrees is proposed to mine the high-value users. Finally, testing for the degree of coverage based on the \"Top10 Hot Microblog\" in Weibo presents a relatively high credibility of our dataset. The evaluation indicates that the users mined in this paper are quite high-quality and high-value. In conclusion, we will continue efforts to discover the high-value users in microblog and believe that discovering and maintaining a dataset filled with the high-value users which is not too big is quite significant for both academic research and business applications.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974380","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":"Towards a Moderate-Granularity Incremental Clustering Algorithm for GPU","authors":"Chunlei Chen, Dejun Mu, Huixiang Zhang, Wei Hu","doi":"10.1109/CyberC.2013.38","DOIUrl":"https://doi.org/10.1109/CyberC.2013.38","url":null,"abstract":"The incremental clustering algorithm plays a vital role in big data processing. The massive data problems generally raise high computation demand on the hardware platform. GPU-based parallel computing is a promising method to satisfy this demand. However, the existing incremental clustering algorithms face an accuracy-parallelism dilemma when accelerated by GPU. The block-wise algorithms evolve the clusters in coarse granularity and sacrifice accuracy for parallelism, while the point-wise algorithms proceed in fine granularity and barter parallelism for accuracy. We propose a moderate-granularity algorithm. This algorithm constantly generates micro-clusters from the incoming data blocks, and then evolves the clusters in the granularity of a micro-cluster. The proposed algorithm takes the following advantages: first, it avoids predefining a cluster number searching range like block-wise algorithms, second, it alleviates the accuracy problem caused by coarse granularity, third, it adopts the parallel-friendly algorithm to generate micro-clusters and decreases the amount of serial operations, so that it is parallelism-scalable compared to point-wise algorithms. Experiments on a CPU-GPU hybrid platform show that our algorithm can achieve comparable accuracy to its batch counterpart and is scalable in terms of parallelism.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791016","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}
Przemyslaw Blaskiewicz, M. Klonowski, Krzysztof Majcher, P. Syga
{"title":"Blocker-Type Methods for Protecting Customers' Privacy in RFID Systems","authors":"Przemyslaw Blaskiewicz, M. Klonowski, Krzysztof Majcher, P. Syga","doi":"10.1109/CyberC.2013.23","DOIUrl":"https://doi.org/10.1109/CyberC.2013.23","url":null,"abstract":"In this paper we present methods of protecting RFID tags users' privacy. Based on well-known technique by Juels et al. called Blocker tag we introduce a set of methods for increasing security using a device called Hedgehog blocker. Hedgehog blocker copes with the problem of the additional information gained by the adversary through measuring signal power (i.e. learning the number of transmitting tags). We claim that although Hedgehog blocker would be more expensive than regular Blocker tags, it provides privacy protection within the context of a more realistic model. On the other hand Hedgehog blocker does not require any powerful devices like Selective jamming due to Rieback et al. We also introduce the ideas called Preventer and Proxy allower that are more demanding in terms of costs and computational power, however assuring nearly perfect protection against an adversary with ability to determine the number of antennas transmitting.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133293013","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":"Management Motivation and Earnings Management Methods","authors":"Zhonghai Yang, Sun Ying, Qianqian Zhang","doi":"10.1109/CyberC.2013.55","DOIUrl":"https://doi.org/10.1109/CyberC.2013.55","url":null,"abstract":"In this paper, we study the effectiveness of the management motivations on earnings management methods based on thousands of samples between 2006 and 2011. The empirical results indicate that Real Earnings Management is used to manipulate the earnings in order to turn a profit, avoid loss, refinance, and change executives. The companies with higher executive compensations intend to use REM. However, making big profits by using Real Earnings Management activities is not popular because the capital market in China is not perfect enough.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121902451","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 Efficient Localization Algorithm Using Sparse Anchors for the Internet of Things","authors":"G. Wang, Su-bin Shen","doi":"10.1109/CyberC.2013.70","DOIUrl":"https://doi.org/10.1109/CyberC.2013.70","url":null,"abstract":"Localization is crucial for the Internet of Things (IoT). Most of IoT components are characterized by low capabilities in terms of both energy and computing resources and thus, they cannot implement complex algorithms supporting localization. Besides, existing algorithms fail to provide efficient localization supports. In order to address this issue, we design an efficient localization algorithm using sparse anchors, LASA, by modeling IoT into mass-spring system. Compared with previous algorithms, LASA has a lower computational complexity. Theoretical analysis shows that the algorithm has a good feature of convergence and the computational complexity by O(N), where N is the maximum number of nodes' neighbors in IoT. We evaluate the performance of this algorithm through some simulations. The results show that LASA is robust to anchors' position and better for convergence.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124011748","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":"Tracking the State of Primary Users Based on Purely Discontinuous Markov Process","authors":"Bin Guo, Xinzhi Yue, Xiaoyuan Yan","doi":"10.1109/CyberC.2013.97","DOIUrl":"https://doi.org/10.1109/CyberC.2013.97","url":null,"abstract":"This paper focuses on tracking the state of primary users in spectrum detection in cognitive radio. During the process of spectrum detecting, there exist only two states of the primary user: occupying or leave. The cumulative occupying time of the primary users and their distribution in time domain along with the variation of the state represented by the transition matrix can be deduced by Fokker-Plank equation and the property of the residence time in any time for purely discontinuous Markov process following exponential distribution. Analysis of computer simulation results suggest that the probability distribution of the acquired primary user occupying time is the main basis for the tracking of the state of the primary users.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368162","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":"Security Mechanism for the Interactive Satellite Remote Education System Based on DTN","authors":"Xiangyu Bai, Yan-Jun Huang","doi":"10.1109/CyberC.2013.17","DOIUrl":"https://doi.org/10.1109/CyberC.2013.17","url":null,"abstract":"Compared with the original system that has unidirectional broadcasting characteristics, the interactive satellite remote education system which based on DTN greatly improved. However, in the special application environment of the satellite remote education system, the traditional Internet security mechanism can't meet the DTN security needs. In order to ensure the reliability and safety of the information which from terminal users to satellite broadcast center in the remote education system, the paper proposes a kind of authentication and communication security mechanism that makes full use of the functions of the conditional Access Module (CAM) which exist in the original satellite remote education system and when authenticating the nodes of the system, we use the symmetrical encryption and asymmetric encryption fusion scheme. Analysis showed that the mechanism is safe, reliable, strong compatibility, economic and applicable.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115490080","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":"Definition of Security Metrics for the Cloud Computing and Security-Aware Virtual Machine Placement Algorithms","authors":"E. Caron, Anh Dung Le, Arnaud Lefray, C. Toinard","doi":"10.1109/CyberC.2013.28","DOIUrl":"https://doi.org/10.1109/CyberC.2013.28","url":null,"abstract":"Nowadays, Cloud Computing is becoming a key factor in computer science. Besides the great benefits it brought to the information technology and to the economy, Cloud Computing shows some weakness when looking at the security. An IaaS client should be able to specify its security requirements. But the lack of a system of security metrics leads to the incapability of quantifying the security level of a client deployment in a Cloud. Therefore, we propose a system of security metrics specific to the Cloud Computing and use it to develop virtual machines placement algorithms.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127077498","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 Cluster Based Smart MAC Layer Protocol for Delay-Tolerant Underwater Wireless Sensor Networks","authors":"Zhanyang Zhang, L. Blanco","doi":"10.1109/CyberC.2013.60","DOIUrl":"https://doi.org/10.1109/CyberC.2013.60","url":null,"abstract":"The propagation speed of an acoustic signal is much slower than the speed of a terrestrial radio signal due to the physical characteristics of an underwater acoustic channel. This large delay can impact the throughput of the channel. There is also a very high delay variance which presents unique challenges to the designs of efficient MAC protocols. The long and inconsistent delay renders many traditional protocols insufficient since they rely on multiple handshakes and accurate estimations of the round trip time (RTT) between two nodes. We proposed a novel approach to develop a Cluster based delay-tolerant protocol (CBDTP) to address these problems by eliminating RTS/CTS and ACK handshaking while avoiding collision. In addition, our CBDTP protocol uses a self-adoptive algorithm to address the inconsistent delay problem and its impact on RTT estimation. Our simulation study shows that CBDTP can improve channel throughput and resource utilization in a volatile deployment environment for many underwater wireless sensor network applications.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 3 Suppl 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131728406","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}