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

Unknown Word Recognition Based on Maximal Cliques 基于最大团的未知词识别

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-11-18 DOI: 10.1109/CyberC.2011.46

Hao Chen, Bo Xiao, Zhiqing Lin

引用次数: 3

Cyber Security Concerns for Ubiquitous/Pervasive Computing Environments 普适计算环境下的网络安全问题

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.53

J. Walker, Travis Jones, Mansour Mortazavi, R. Blount

{"title":"Cyber Security Concerns for Ubiquitous/Pervasive Computing Environments","authors":"J. Walker, Travis Jones, Mansour Mortazavi, R. Blount","doi":"10.1109/CyberC.2011.53","DOIUrl":"https://doi.org/10.1109/CyberC.2011.53","url":null,"abstract":"The computing paradigm of ubiquitous/pervasive computing has changed the way in which nomadic computer users interact with computer devices and network systems. Modern ubiquitous computing devices have enabled nomadic computer users to interact with computer and network systems anywhere and at anytime. Although the issue of cyber security has been overlooked by many within the community, these devices provide users with a rich set of context-relevant information including location, usage data, and even the location/state of similar devices within the reach. Cyber Security has become a matter of national, economic, and societal importance. Present-day attacks on the nation's computer systems do not simply damage an isolated machine or disrupt a single enterprise system. Instead, modern attacks target infrastructure that is integral to the economy, and daily life. Computer networks have joined food, water, transportation, and energy as critical resources for the functioning of the national economy. As a result of our interconnected world no device is an island, and security still remains a significant obstacle for ubiquitous and pervasive environments, partially in terms intrusions. This paper examines intrusion detection within ubiquitous and pervasive environments within the context of plan recognition as means to classify attacks both quantitatively and qualitatively.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115520886","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

The Performance Study on Several Distributed File Systems 几种分布式文件系统的性能研究

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.45

Songlin Bai, Haohao Wu

引用次数: 12

Orthogonal Space-Time Codes Based Signal Constellations for MIMO System 基于正交空时码的MIMO系统信号星座

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.90

Md. Zahangir Alom, H. Lee, Md. Hashem Ali Khan, M. H. Lee

引用次数: 0

Constructing a Cloud-Centric Service Assurance Platform for Computing as a Service 构建以云为中心的计算即服务服务保障平台

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.32

Jun-Yan Hu, C. Wu, Chia-Chen Chu, Kuan-Hsiung Liang, Hey-Chyi Young, Yung-Yi Hsu, Chung-Hua Hu, Huan-Guo Lin

引用次数: 5

Dynamic Threshold-Based Energy Efficient Scheduling Algorithm for Parallel Tasks on Homogeneous DVS-Enabled Clusters 基于动态阈值的同构分布式集群并行任务高效调度算法

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.58

Wei Liu, Hang Yin, Wei Du

引用次数: 4

A Family of Heuristics for Agent-Based Cloud Bag-of-Tasks Scheduling 基于agent的云任务袋调度的一类启发式算法

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CYBERC.2011.74

Octavio Gutiérrez, K. Sim

{"title":"A Family of Heuristics for Agent-Based Cloud Bag-of-Tasks Scheduling","authors":"Octavio Gutiérrez, K. Sim","doi":"10.1109/CYBERC.2011.74","DOIUrl":"https://doi.org/10.1109/CYBERC.2011.74","url":null,"abstract":"The scheduling of bag-of-tasks applications (BoTs) in Clouds deal with fixed predefined allocation slots of Cloud resources, e.g., 1-hour time slots, that start being exhausted right after their allocation disregarding whether tasks are being executed or not. In addition, Cloud resources may be allocated for several hours to execute BoTs. However, some resource types (e.g., clusters) may be allocated for only a few hours, while others (e.g., CPU instances) may be allocated for several hours, so BoTs may be executed in such heterogeneous sets of Cloud resources (probably) allocated for a different number of hours. In this paper, a family of 15 scheduling heuristics consisting of two phases: (i) task ordering and (ii) task mapping (based on the remaining allocation times of Cloud resources) is proposed. The heuristics aim to maximize resource utilization while executing BoTs in heterogeneous sets of Cloud resources allocated for different numbers of hours. Cloud resources for executing BoTs are dynamically composed by adopting the contract net protocol. In addition, an agent-based testbed for Cloud BoT scheduling and execution was implemented. Simulation results show that the agents are capable of successfully and efficiently scheduling and executing BoTs in sets of Cloud resources composed from multiple Cloud environments.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280968","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}

引用次数: 15

Extending Work Queue of HCA Endpoint Using Software Work Queue Approach: Experimental Evaluation with uDAPL 用软件工作队列方法扩展HCA端点的工作队列:基于uDAPL的实验评估

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.66

Jasjit Singh, Eva Mishra, Yogeshwar Sonawane

{"title":"Extending Work Queue of HCA Endpoint Using Software Work Queue Approach: Experimental Evaluation with uDAPL","authors":"Jasjit Singh, Eva Mishra, Yogeshwar Sonawane","doi":"10.1109/CyberC.2011.66","DOIUrl":"https://doi.org/10.1109/CyberC.2011.66","url":null,"abstract":"With an ever increasing demand for computing power, number of nodes to be deployed in a high performance cluster is increasing. This has put stress on various hardware resources like endpoints (equivalent to Queue Pairs), memory etc. One of the factors limiting number of endpoints with a Host Channel Adaptor (HCA) is the amount of total descriptor space available in the form of on-board memory. For the same amount of descriptor space available, number of endpoints supported by an HCA is inversely proportional to the depth of work queue (WQ) for an endpoint (EP). Therefore to support more number of endpoints, depth of WQ has to be decreased. In this paper, we present an optimal approach of extending WQ using Software Work Queue (SWQ). SWQ is an extension to the work queue of EP on HCA. It provides a larger pool of descriptors (i.e. work requests) per EP to an application (e.g. uDAPL application, MPI library) than that available in the hardware. The advantage of this technique lies in the fact that more number of endpoints are supported by HCA without costing the depth of the WQ. Experimental evaluation suggests positive impact as requests in SWQ are given to hardware work queue (HWQ) as soon as it gets depleted.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133863449","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

Efficient Approach for Repeated Patterns Mining Based on Indent Shape of HTML Documents 基于HTML文档缩进形状的重复模式挖掘方法

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.15

Yanxu Zhu, Gang Yin, Huaimin Wang, Dian-xi Shi, Xiang Rao, Lin Yuan

{"title":"Efficient Approach for Repeated Patterns Mining Based on Indent Shape of HTML Documents","authors":"Yanxu Zhu, Gang Yin, Huaimin Wang, Dian-xi Shi, Xiang Rao, Lin Yuan","doi":"10.1109/CyberC.2011.15","DOIUrl":"https://doi.org/10.1109/CyberC.2011.15","url":null,"abstract":"Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131570310","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

Automatic Fine-Grained Transaction Categorization for Multi-tier Applications 多层应用程序的自动细粒度事务分类

2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2011-10-10 DOI: 10.1109/CyberC.2011.31

Zhen Zhang, Shanping Li

{"title":"Automatic Fine-Grained Transaction Categorization for Multi-tier Applications","authors":"Zhen Zhang, Shanping Li","doi":"10.1109/CyberC.2011.31","DOIUrl":"https://doi.org/10.1109/CyberC.2011.31","url":null,"abstract":"Multi-tier architecture has become the industry standard for building Web applications. These applications feature in multiple categories of transactions. Properly categorizing the transactions and accurately characterizing the resource usage for each category is crucial for modeling the performance of multi-tier application. Existing studies either ignores the transaction categorization problem by simply using the URL path as the identifier of category, or require complex monitoring infrastructure. In this paper we propose a method called Transaction ICA, which automatically categorize transactions based on only widely available Web access log and aggregate resource utilization data. The method use URL path as the initial categorization setting, and iteratively split and merge categories based on estimated resource usage. The method incorporates regression based resource usage estimation technique and independent component analysis based request categorization technique. We validate the feasibility of our method using a synthetic 2-tier Web application. The experiments shows the method can correctly categorize transactions into coherent groups and give accurate per category resource demand, the result categorization is also more fine-grained than the one from existing method.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115345337","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