{"title":"Electric Power Data Acquisition System Based on Multi-thread Mechanism","authors":"Yu Peng, F. Meng, Dianhui Chu","doi":"10.1109/CyberC.2013.53","DOIUrl":"https://doi.org/10.1109/CyberC.2013.53","url":null,"abstract":"An electric power data acquisition system based on multi-thread mechanism is proposed in this paper to solve the problems of large-scale data acquisition such as low acquisition rate, server overload and poor reliability of the IP address of data nodes. Through designing a multi-thread scheduling strategy, the power data can be acquired from multiple data nodes concurrently. The reliability of the connection between the system and a data node can be assured through a monitoring thread. An experiment system of data acquisition from 100 data nodes is designed. The data acquisition rate is 1832 per minute and data update cycle is 30 seconds approximately. The results show that efficient data acquisition can be achieved in large-scale network and the electric power data can be guaranteed to be real-time. The system has met the requirements of the customer and officially run.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"27 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":"132806060","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 Virtualized Hybrid Distributed File System","authors":"Xingyu Zhou, Liangyu He","doi":"10.1109/CyberC.2013.39","DOIUrl":"https://doi.org/10.1109/CyberC.2013.39","url":null,"abstract":"We have designed a virtualized hybrid distributed file system for large scale data storage. It ensembles the characteristic of fault tolerance based on inexpensive commodity hardware inherited from the classic Google File System but also integrates the advantage of the P2P network. While sharing many of the same goals as previous distributed file systems, this new system design aims to reduce the scale and previously necessary space, bandwidth and energy consumptions of the data center and reduces the cost of running a large-scale distributed file system. Traditionally, only local or inner-enterprise servers are used for constructing cloud-computing network for a certain enterprise. This new design tries to induce a new method of integrating leisure hard-disk space, bandwidth and CPU capacity of from external sources. With a distributed data storage network and an inner-enterprise server system as a central controller, large clusters of data can be managed in a classic C/S like way and data can be transmitted like the P2P network. To ensure security, more stratified virtualization is required to ensure the isolation between realistic file owner and storage space provider. Workload estimations have been conducted to test the efficiency of time and space in this design.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"46 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":"134381763","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":"Diagnosis Rule Mining of Airborne Avionics Using Formal Concept Analysis","authors":"Wen Ying, Xiao Mingqing","doi":"10.1109/CYBERC.2013.51","DOIUrl":"https://doi.org/10.1109/CYBERC.2013.51","url":null,"abstract":"A diagnosis rule mining approach based on formal concept analysis is proposed to discover diagnosis knowledge in airborne avionics. Diagnosis formal context is defined to organize fault samples in 0-1 table. Concept lattices are constructed from the diagnosis formal context, using a parallel Next Closure algorithm applying MapReduce framework. Knowledge reduction in diagnosis formal context is discussed to get reduced attribute sets. The discernibility matrix and Boolean function defined in a rule acquisition perspective are used to calculate all the reduced attribute sets. Compact diagnosis rules can then be derived from the reduced concept lattices. The proposed diagnosis rule mining approach is demonstrated with the historical diagnostic dataset of some aviation radar system.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"86 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":"114177701","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 Energy-Efficient Asynchronous MAC for Bulk-Data Collection in Wireless Sensor Networks","authors":"Fulong Jiang, Hao Liu","doi":"10.1109/CyberC.2013.61","DOIUrl":"https://doi.org/10.1109/CyberC.2013.61","url":null,"abstract":"In this paper, we propose a new asynchronous MAC protocol, the AW-MAC, for bulk-data collection in wireless sensor networks. We develop a routing-enhanced adaptive wakeup mechanism and an on-demand channel assignment scheme that allow the protocol to transform from single channel asynchronous schedule to multi-channel TDMA schedule in an on-demand fashion. These schemes overcome the sleep latency problem of duty-cycling and avoid the inefficiency of unscheduled asynchronous channel access. The simulation results show that our protocol largely reduces the latency on collecting bulk data then the state-of-the-art asynchronous duty-cycle MAC protocol while consuming similar energy.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"77 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":"127166246","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":"Authorship Attribution of Short Historical Arabic Texts Based on Lexical Features","authors":"Siham Ouamour-Sayoud, H. Sayoud","doi":"10.1109/CyberC.2013.31","DOIUrl":"https://doi.org/10.1109/CyberC.2013.31","url":null,"abstract":"In this paper the authors investigate the authorship of several short historical texts that are written by ten ancient Arabic travelers: this Arabic dataset, which was collected by the authors in 2011, is called AAAT dataset. Several experiments of authorship attribution are conducted on these Arabic texts, by using different lexical features such as words, word-big rams, word-trig rams, word-tetra grams and rare words. Furthermore, seven different classifiers are employed, namely: Manhattan distance, Cosine distance, Stamatatos distance, Camberra distance, Multi Layer Perceptron (MLP), Sequential Minimal Optimization based Support Vector Machine (SMO-SVM) and Linear Regression. For the evaluation task, several experiments of authorship attribution are conducted on the AAAT dataset by using the different quoted features and classifiers. Results show good attribution performances with an optimal score of 80% of good authorship attribution. Moreover, this investigation has revealed interesting results concerning the Arabic language and more particularly for the short texts.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"49 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":"120947612","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":"DAG Based Feature Additive XML Schema Generation for Unstructured Text","authors":"K. Rajbabu, S. Selvaraj","doi":"10.1109/CyberC.2013.27","DOIUrl":"https://doi.org/10.1109/CyberC.2013.27","url":null,"abstract":"Recent works on handling unstructured text employ multilevel filtering techniques for identifying the key terms in documents and then apply mining techniques to extract necessary information. Though these techniques are more efficient in information retrieval, they cannot be applied directly for information extraction, for documents that are more critical in context and also accuracy cannot be expected. Further, loss of hidden and significant information cannot be tolerated in data critical applications emerging based on unstructured documents. Hence, a novel idea of re-organizing the unstructured textual model into feature enriched structured graphical model by adding spatial, logical, lexical, syntactical and semantic features is proposed. The generated graph depicts relationships across the document at all levels from its micro level token to macro level document. Moreover, a structural pattern identification algorithm for generating an XML schema from the generated graph is also recommended. The experimental outcome for a real-time dataset is presented.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"88 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":"115927107","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":"Backup Path with Energy Prediction Based on Energy-Aware Spanning Tree in Wireless Sensor Networks","authors":"Yao Lu, Jianping Chen, I. Comsa, P. Kuonen","doi":"10.1109/CyberC.2013.73","DOIUrl":"https://doi.org/10.1109/CyberC.2013.73","url":null,"abstract":"In order to decrease the energy consumption and to prolong the network lifetime, the energy-aware spanning tree as a data aggregation technique has been used in wireless sensor networks. Nevertheless, the energy constraint caused by the global reconstruction still severely influences the performance of the sensor system. Our approach aims to reduce the occurrence of the global reconstruction through the backup path. In addition, in order to prevent the redundant paths, a dynamic prediction method is proposed in order to adaptively estimate the possibility of the node failure. The theoretical analysis and simulations demonstrate the efficient performance of the proposed approach.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"13 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":"130774316","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":"MatBall: Matrix-Based File Allocation Method for Hybrid File System","authors":"Jaechun No, Sung-Soon Park","doi":"10.1109/CyberC.2013.76","DOIUrl":"https://doi.org/10.1109/CyberC.2013.76","url":null,"abstract":"One way of improving I/O performance is to provide a hybrid file system where the entire address space is provided by combining a small portion of SSD (Solid-State Device) partition with a much larger HDD storage capacity. Since the address space to be offered by SSD partition is very small, utilizing SSD storage resources is the critical aspect in improving I/O performance of the hybrid file system. We present a matrix-based file allocation scheme, called Mat Ball (Matrix-Based file allocation), whose objective is to increase space utilization of SSD partition in the hybrid file system by reducing fragmentation overhead. In Mat Ball, to consume the remaining spaces as much as possible posterior to file allocations, I/O units (extents) of the hybrid file system are recursively partitioned into segments in the subsequent level and further file allocations are performed in units of the partitioned segments. Since Mat Ball defines easy-to-compute segment sizes and block positions in I/O units, allocating more files in the remaining spaces can be performed with a little overhead. The performance measurement with IOzone shows that the hybrid file system using Mat Ball enables to produce higher bandwidth over ext2 installed on HDD and SSD.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"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":"128849866","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":"Intelligent Checkers to Improve Attack Detection in Cyber Physical Systems","authors":"Giedre Sabaliauskaite, A. Mathur","doi":"10.1109/CyberC.2013.14","DOIUrl":"https://doi.org/10.1109/CyberC.2013.14","url":null,"abstract":"An approach to improve the security of cyber physical systems (CPS) through Intelligent Checkers (IC) is presented. ICs are designed to be behaviorally and structurally independent of the cyber-portion of a CPS and hence not subject to cyber attacks. An IC monitors the status of a physical process and raises an alarm when process measurements violate predefined constraints. A strict one-way communication from an IC to the CPS command center validates the authenticity of the data received from CPS sensors. An IC is able to raise an alarm despite communication failure or undetected cyber attacks. Strategic placement of one or more ICs throughout a CPS is expected to improve the potential for the early detection of attacks.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"64 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":"122208520","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}
Liang Shi, Jialan Que, Zhenyu Zhong, Brett Meyer, Patrick Crenshaw, Yuanchen He
{"title":"A Scalable Implementation of Malware Detection Based on Network Connection Behaviors","authors":"Liang Shi, Jialan Que, Zhenyu Zhong, Brett Meyer, Patrick Crenshaw, Yuanchen He","doi":"10.1109/CyberC.2013.19","DOIUrl":"https://doi.org/10.1109/CyberC.2013.19","url":null,"abstract":"When hundreds of thousands of applications need to be analyzed within a short period of time, existing static and dynamic malware detection methods may become less desirable because they could quickly exhaust system and human resources. Additionally, many behavioral malware detection methods may not be practical because they require the collection of applications' system-level and network-level activities, which may not always be available. In this paper, we propose a malware behavioral clustering approach to detect malware variants based on applications' simple network connection data, which can be easily collected from anti-virus (AV) products. This approach is highly scalable and has been used on huge volumes of real-world data. Our experiments demonstrate that, at a false positive rate lower than 0.001%, the proposed method achieved a detection rate of 80%+ in identifying spambots and achieved a 50%+ detection rate on average when detecting 3 popular malware families. In addition, the proposed method was deployed in a real environment and it detected malware instances more than one week earlier on average than two other leading AV products.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"341 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":"122992759","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}