2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献_第3页

Securing Encryption Key Distribution in WLAN via QKD 通过QKD保护无线局域网加密密钥分发

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

Rima Djellab, M. Benmohammed

引用次数: 6

A Fast System Identification Method Based on Minimum Phase Space Volume 基于最小相空间体积的系统快速辨识方法

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

Xinzhi Xu, Jingbo Guo

引用次数: 2

An Intelligent Evaluation Model Based on the LEACH Protocol in Wireless Sensor Networks 基于LEACH协议的无线传感器网络智能评估模型

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

Ning Cao, R. Higgs, G. O’hare

引用次数: 6

Keystroke Dynamics for Continuous Access Control Enforcement 连续访问控制执行的击键动力学

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

João Ferreira, H. Santos

{"title":"Keystroke Dynamics for Continuous Access Control Enforcement","authors":"João Ferreira, H. Santos","doi":"10.1109/CyberC.2012.43","DOIUrl":"https://doi.org/10.1109/CyberC.2012.43","url":null,"abstract":"The weak connection between human users and their digital identities is often the target vulnerability explored by attacks to information systems. Currently, authentication mechanisms are the only barrier to prevent those attacks. Traditional password-based authentication is efficient (especially from the user point of view), but not effective -- the lack of continuous verification is a severe access control vulnerability. To overcome this issue, continuous identity monitoring is needed, operating in similar fashion to that of Intrusion Detection Systems (IDSs). However, traditional host-based IDSs are system-centric -- they monitor system events but fail on flagging malicious activity from intruders with access to the legitimate user's credentials. Therefore, extending the IDS concept to the user authentication level appears as a promising security control. The need to distinguish human users (user-centric anomaly-based detection) leads to the use of biometric features. In this paper we present a secure, reliable, inexpensive and non-intrusive technique for complementing traditional static authentication mechanisms with continuous identity verification, based on keystroke dynamics biometrics.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176302","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

On the Suitability of Multi-Core Processing for Embedded Automotive Systems 嵌入式汽车系统多核处理的适用性研究

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

S. Jena, M. Srinivas

{"title":"On the Suitability of Multi-Core Processing for Embedded Automotive Systems","authors":"S. Jena, M. Srinivas","doi":"10.1109/CyberC.2012.60","DOIUrl":"https://doi.org/10.1109/CyberC.2012.60","url":null,"abstract":"This paper examines the suitability of multi-core processors over single core in automotive safety critical applications. As vehicles become more and more complex with an embedded network interconnection of ECUs (Electronic Control Unit) and integrate more and more features, safety standardization is becoming increasingly important among the automakers and OEMs (Original Equipment Manufacture). Thus the demand for computing power is increasing by the day in the automotive domain to meet all the requirements of time critical functionalities. Multi-core processor hardware is seen as a solution to the problem of increasing the ECU processing power with the support of software and also to power consumption with frequency. In this work, ABS (Anti-Lock Braking System) is taken as an example to demonstrate the suitability of multicore processor. It is shown how, through the scheduling of events in the hard braking system, multicore processor can help in achieving near real time response. The performance of ABS has been studied with the help of TMS570 which is a dual core controller from Texas Instruments (TI) and compared with TMS470 which is single core controller from the same company. A software architecture using MPI (Message Passing Interface) with shared memory is described in detail and applied to quantify the performance. In addition to performance, a comparative study of power consumption by TMS570 operating at 150MHz and TMS470 operating at 80MHz at an ambient temperature of 25oC has been studied in detail.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134037925","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}

引用次数: 10

Exploiting Attribute Redundancy in Extracting Open Source Forge Websites 利用属性冗余提取开源伪造网站

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

Xiang Li, Yanxu Zhu, Gang Yin, Tao Wang, Huaimin Wang

{"title":"Exploiting Attribute Redundancy in Extracting Open Source Forge Websites","authors":"Xiang Li, Yanxu Zhu, Gang Yin, Tao Wang, Huaimin Wang","doi":"10.1109/CyberC.2012.12","DOIUrl":"https://doi.org/10.1109/CyberC.2012.12","url":null,"abstract":"Open Source Forge (OSF) websites provide information on massive open source software projects, extracting these web data is important for open source research. Traditional extraction methods use string matching among pages to detect page template, which is time-consuming. A recent work published in VLDB exploits redundant entities among websites to detect web page coordinates of these entities. The experiment gives good results when these coordinates are used for extracting other entities of the target site. However, OSF websites have few redundant project entities. This paper proposes a modified version of that redundancy-based method tailored for OSF websites, which relies on a similar yet weaker presumption that entity attributes are redundant rather than whole entities. Like the previous work, we also construct a seed database to detect web page coordinates of the redundancies, but all at the attribute-level. In addition, we apply attribute name verification to reduce false positives during extraction. The experiment result indicates that our approach is competent in extracting OSF websites, in which scenario the previous method can not be applied.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"132 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810171","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

Cooperative Spectrum Sharing in Relay-Trading Mode: A Fairness View 中继交易模式下的合作频谱共享:一个公平的观点

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

Lixia Liu, Gang Hu, Ming Xu, Yuxing Peng

引用次数: 2

Testing Health-Care Integrated Systems with Anonymized Test-Data Extracted from Production Systems 使用从生产系统提取的匿名测试数据测试医疗保健集成系统

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

A. Raza, S. Clyde

引用次数: 3

Deadline Based Performance Evaluation of Job Scheduling Algorithms 基于截止日期的作业调度算法性能评价

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

Ahmad Abba Haruna, Syed Nasir Mehmood Shah, M. N. Zakaria, A. J. Pal

{"title":"Deadline Based Performance Evaluation of Job Scheduling Algorithms","authors":"Ahmad Abba Haruna, Syed Nasir Mehmood Shah, M. N. Zakaria, A. J. Pal","doi":"10.1109/CyberC.2012.25","DOIUrl":"https://doi.org/10.1109/CyberC.2012.25","url":null,"abstract":"Grid scheduling is one of the prime challenges in grid computing. Reliability, efficiency (with regard to time utilization), effectiveness in resource usage, as well as robustness tend to be the demanded features of Grid scheduling systems. A number of algorithms have been designed and developed in order to make effective Grid scheduling. Project management is the well known area of operation research. Here we are proposing a new prioritized deadline based scheduling algorithm (PDSA) using project management technique for efficient job execution with deadline constraints of users' jobs. An extensive performance comparison has been presented using synthetic workload traces to evaluate the efficiency and robustness of grid scheduling with respect to average turnaround times and maximum tardiness. Result has shown improved performance under dynamic scheduling environment. Based on the comparative performance analysis, proposed PDSA has shown the optimal performance as compared to EDF and RR scheduling algorithms under dynamic scheduling environment. In brief, PDSA is the true application of project management in grid computing.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"163 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098266","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}

引用次数: 17

Local Oriented Efficient Detection of Overlapping Communities in Large Networks 面向局部的大型网络重叠社区高效检测

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

Shengdun Liang, Yuchun Guo

{"title":"Local Oriented Efficient Detection of Overlapping Communities in Large Networks","authors":"Shengdun Liang, Yuchun Guo","doi":"10.1109/CyberC.2012.15","DOIUrl":"https://doi.org/10.1109/CyberC.2012.15","url":null,"abstract":"Overlapping community detecting for large-scale social networks becomes a research focus with the development of online social network applications. Among the current overlapping community discovery algorithms, LFM is based on local optimization of a fitness function, which is in consistent with the local nature of community, especially in large networks. But the original LFM may fall in loops when finding community memberships for some overlapping nodes and consumes still too much time when applied in large-scale social networks with power-law community size distribution. By limiting each node to be a seed at most once, LFM can avoid loop but fail to assign community memberships to some overlapping nodes. Based on the structural analysis, we found that the loop is due to the dysfunction of the fitness metric as well as the random seed selection used in LFM. To improve the detecting quality and computation efficiency of LFM, we propose a local orientation scheme based on clustering coefficient and several efficiency enhancing schemes. With these schemes, we design a modified algorithm LOFO (local oriented fitness optimization). Comparison over several large-scale social networks shows that LOFO significantly outperforms LFM in computation efficiency and community detection goodness.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114815160","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