2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献

筛选
英文 中文
LZpack: A Cluster File System Benchmark LZpack:集群文件系统基准测试
X. Li, Zhanhuai Li, Xiao Zhang, Lexiao Wang
{"title":"LZpack: A Cluster File System Benchmark","authors":"X. Li, Zhanhuai Li, Xiao Zhang, Lexiao Wang","doi":"10.1109/CYBERC.2010.88","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.88","url":null,"abstract":"LZpack is a general file system benchmark tool conforming to POSIX.1. It provides an effective method to evaluate different file systems. It also offers reliable data to the developers who use POSIX.1 file system API to design applications. With the cluster testing structure, LZpack can make precise evaluations of file IO performance and file system metadata operation performance. This paper not only made clear descriptions of the system structure and key features of LZpack, but also analyzed the results from tests in some file systems under the application of LZpack. Finally, it put forward the train of thought on improvement of LZpack in later stage.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"44 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":"116627016","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}
引用次数: 1
Research of an Improved Weighted Centroid Localization Algorithm and Anchor Distribution 一种改进的加权质心定位算法及锚点分布研究
Qingru Kong, Xinyu Yang, Xiangjun Dai
{"title":"Research of an Improved Weighted Centroid Localization Algorithm and Anchor Distribution","authors":"Qingru Kong, Xinyu Yang, Xiangjun Dai","doi":"10.1109/CYBERC.2010.79","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.79","url":null,"abstract":"Localization plays an important role in Wireless Sensor Networks. This paper proposed a weighted centroid localization algorithm based on received signal strength difference (RDWCL). RDWCL utilizes RSSI difference to calculate weight so as to improve localization precision and reduce the impact of anchor density and environment changing. Anchor distribution is also introduced and analyzed in this paper. Simulation and experiment results show that compared with Centroid and Weighted Centroid, RDWCL has better performance. When anchor nodes are randomly deployed, the accuracy has been improved by 13.5%. When anchor nodes are deployed as grid, the accuracy has been improved by 25.04%. When anchor nodes are deployed as equilateral triangle, the accuracy has been improved by 27.4%.","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":"128805290","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}
引用次数: 3
Retrospective detection of malware attacks by cloud computing 基于云计算的恶意软件攻击回顾性检测
Shun-Te Liu, Yi-Ming Chen
{"title":"Retrospective detection of malware attacks by cloud computing","authors":"Shun-Te Liu, Yi-Ming Chen","doi":"10.1504/IJITCC.2011.042126","DOIUrl":"https://doi.org/10.1504/IJITCC.2011.042126","url":null,"abstract":"As malware becomes pervasive and fast-evolving on the Internet, every computer linking to the outer world faces the risks of malware attacks. Therefore, it is important to not only detect malware as early as possible but also to determine which computer has been attacked. Among the various methods to find and trace the existence of malware, retrospective detection is promising one. Once a threat is identified, it allows one to determine exactly which host or users open similar files by searching historical information. In the past, the huge volume of historical information represents an insurmountable barrier to such traces. Fortunately, with the evolution of cloud computing technologies, this barrier can be broken. In this paper, we propose a new retrospective detection approach based on Portable Executable (PE) format file relationships. We implement our system in a Hadoop platform and use 18 real-world malware to do effective and efficient tests. Our results show that our system has a higher detection rate as well as a lower false positive rate than the famous Splunk tool. We also find that, although cloud computing is suitable for processing a small number of huge files, it has shortcomings in dealing with a large number of small files.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"34 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":"130542264","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}
引用次数: 27
Unordered Tree Matching and Strict Unordered Tree Matching: The Evaluation of Tree Pattern Queries 无序树匹配与严格无序树匹配:树模式查询的求值
Yangjun Chen, D. Cooke
{"title":"Unordered Tree Matching and Strict Unordered Tree Matching: The Evaluation of Tree Pattern Queries","authors":"Yangjun Chen, D. Cooke","doi":"10.1109/CYBERC.2010.17","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.17","url":null,"abstract":"In this paper, we consider two kinds of unordered tree matchings for evaluating tree pattern queries in XML databases. For the first kind of unordered tree matching, we propose a new algorithm, which runs in O(|D| |Q|) time, where Q is a tree pattern and D is a largest data stream associated with a node of Q. It can also be adapted to an indexing environment with XB-trees being used to speed up disk access. Experiments have been conducted, showing that the new algorithm is promising. For the second of tree matching, the so-called strict unordered tree matching, we show that the problem is NP-complete by a reduction from the satisfiability problem.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2 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":"121113954","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}
引用次数: 3
A Study on Topology Model and Data Contribution Strategy of PPLive PPLive拓扑模型及数据贡献策略研究
Qing Ye, Changjia Chen
{"title":"A Study on Topology Model and Data Contribution Strategy of PPLive","authors":"Qing Ye, Changjia Chen","doi":"10.1109/CYBERC.2010.61","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.61","url":null,"abstract":"PPLive is one of the successful applications of p2p technology. Understanding the topology model and peer behavior in the PPLive network is an important field of PPLive. Our paper focuses on the data transmission features and the contribution strategy between the peers in the PPLive network. By passive measurement, which is parsing the PPLive data packet, we show that: i) PPLive network has a mesh topology, ii) The bi-directional peer has an absolute advantage both in peer number and the data transmission, iii) According to some reciprocal models, we get that PPLive reciprocal coefficient is about 0.599, which further validates the mesh model of the PPLive network. iv) We try to identify the PPLive network data sharing mechanisms and get the conclusion that a small number of peers contribute the majority of data and the main contributors are stable in both time and flow. Thus the PPLive network has choice and retention strategies based on quality.","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":"128823269","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}
引用次数: 2
Entities Identification on the Deep Web Using Neural Network 基于神经网络的深度网络实体识别
Baohua Qiang, Chunming Wu, Long Zhang
{"title":"Entities Identification on the Deep Web Using Neural Network","authors":"Baohua Qiang, Chunming Wu, Long Zhang","doi":"10.1109/CYBERC.2010.93","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.93","url":null,"abstract":"With the rapid developments and extensive applications of internet, a large number of duplicated entities on the Web, especially on the Deep Web, require to be eliminated and integrated effectively. So identifying the corresponding entities on the Deep Web is critical. Due to the query interface on the HTML page represents the schema of the Web database, we firstly try to obtain the schema of the entities on the Deep Web by extracting the schema of the query interface in order to improve the accuracy for entities matching. Then an entities identification approach on the Deep Web using neural network is proposed. The experimental results show the effectiveness of our proposed algorithm.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"46 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":"134155255","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}
引用次数: 4
Redundant Design of Parallel MLFMA Distributed Levels on a Cluster with Distributed Memory 分布式存储集群上并行MLFMA分布级的冗余设计
Yanbao Cui, W. Tong, Yue Hu, Liangliang Cai
{"title":"Redundant Design of Parallel MLFMA Distributed Levels on a Cluster with Distributed Memory","authors":"Yanbao Cui, W. Tong, Yue Hu, Liangliang Cai","doi":"10.1109/CYBERC.2010.48","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.48","url":null,"abstract":"in this paper, we study and analyze the distributed levels of MLFMA and propose an efficient scheme. This scheme uses the top-down method to construct the distributed levels from the coarsest distributed level which is equally divided. The method can reduce the communications of the ghost boxes compared to the bottom-up method during the aggregation phase. And the non local far-field boxes are redundantly stored and computed using shifting originally during the disaggregation phase, so the downward pass operation does not require communications to obtain the outgoing patterns of these boxes. The numerical results demonstrate that, this strategy can greatly reduce the iterative time and improve parallel efficiency of the whole algorithm effectively.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"9 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":"133508400","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}
引用次数: 0
Joint PAPR Reduction Method Base on ACE POCS and Peak Clipping 基于ACE POCS和峰值裁剪的联合PAPR降低方法
Qingwen Han, Xiaoping Zeng, Lingqiu Zeng, Tao Wang
{"title":"Joint PAPR Reduction Method Base on ACE POCS and Peak Clipping","authors":"Qingwen Han, Xiaoping Zeng, Lingqiu Zeng, Tao Wang","doi":"10.1109/CYBERC.2010.73","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.73","url":null,"abstract":"The high peak-to-average power ratio (PAR) in Orthogonal Frequency Division Multiplexing (OFDM) modulation systems can significantly reduce power efficiency and performance. This paper examines the problem of reducing the peak-to-average power ratio (PAPR) occurring in OFDM systems based on IEEE 802.11a. A low complexity PAPR reduction algorithm is proposed. A revised ACE-POCS method is put forward and the simulation results for its performance are given. Proposed algorithm used revised ACE-POCS as the preferred method to reduce PAPR while clipping is used as last resort. System simulation based on OFDM shows that proposed algorithm can reduce system PAPR efficiently with low calculation complexity at the cost of Bit-Error-Ratio (BER) performance degradation slightly.","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":"131291919","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}
引用次数: 6
Combination of Relative Neighborhood Graph and Forbidden Set in the Design of Distributed Broadcast Algorithms for Wireless Ad Hoc Networks 相对邻域图与禁止集在无线自组网分布式广播算法设计中的结合
Hwang-Cheng Wang, Jia-Bao Lin, Fang-Chang Kuo, Kuo-Chang Ting
{"title":"Combination of Relative Neighborhood Graph and Forbidden Set in the Design of Distributed Broadcast Algorithms for Wireless Ad Hoc Networks","authors":"Hwang-Cheng Wang, Jia-Bao Lin, Fang-Chang Kuo, Kuo-Chang Ting","doi":"10.1109/CYBERC.2010.26","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.26","url":null,"abstract":"A wireless ad hoc network typically comprises of nodes with energy supplied by batteries. Hence, energy conservation is crucial to extending the lifetimes of individual nodes and the network as a whole. In topology control type of broadcast algorithms, the distance between neighbors is used to adjust the transmission power to reduce energy consumption. One such example is based on relative neighborhood graph (RNG). In RNG each node maintains a list of relative neighbors and the information is employed to construct a broadcast path. In this paper, distributed broadcast algorithms are proposed that incorporate the notion of forbidden set in RNG to improve the performance. The key idea of forbidden set is to prohibit nodes with low remaining battery capacity from serving as rebroadcast nodes. Via this selection criterion, we can avoid the disruption of the broadcast path due to energy depletion at nodes with low energy capacity, thereby achieving the goal of elongating the lifetime of the broadcast path. Further power saving can be achieved by getting rid of redundant rebroadcasts. The procedure is described with illustrations. In particular, the removal of such redundancy is dependent on the source node. Simulation results confirm the improvement furnished by the proposed algorithms.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"103 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":"124794217","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}
引用次数: 5
Decoding of the (47, 24, 11) Quadratic Residue Code with Hash Table 基于哈希表的(47,24,11)二次剩余码译码
Yan-Haw Chen, Sai Lui, C. Huang, C. Chien
{"title":"Decoding of the (47, 24, 11) Quadratic Residue Code with Hash Table","authors":"Yan-Haw Chen, Sai Lui, C. Huang, C. Chien","doi":"10.1109/CYBERC.2010.101","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.101","url":null,"abstract":"the key ideas behind this decoding technique are utilizing the shift search algorithm. Only those error patterns of weight less than 5 are necessary to be stored in the memory. By utilizing the hash search scheme for finding error pattern, the decrease of CPU time in decoding process is about 38% and the size of memory requirement is about 6% more than binary search scheme. Moreover, the new method could be utilized in real-time systems because of high speed and low memory requirement. It is readily adaptable suitable for use in automation link establish (ALE) system and Digital Signal Processing (DSP) systems.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"95 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":"123161407","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信