Coarse-Grained Reconfigurable Architectures (CGRAs) can achieve both high performance and flexibility, and CGRAs with multi-array are used to meet the increasing performance requirement of multimedia applications. Meanwhile, the context size also becomes quite large, so many CGRAs use a configuration cache to reduce reconfiguration overhead. However, with high power consumption, configuration cache management is still a challenge. This paper first analyzes context features of media algorithms, and introduces the base hardware architecture. Then a configuration cache management technique is proposed to implement H.264 video decoding on the base architecture. It includes a novel configuration cache structure and a configuration cache replacement algorithm based on Context Sequence Prefetching & Priority (CSPP). The experimental results show that the proposed approach can drastically improve system performance and reduce power consumption. The average configuration cache hit rate of CSPP is 96.83%, the speedup ranges from 64% to 109%, and our approach can support H.264 1080p@30fps decoding at a 200MHz working frequency.
{"title":"Configuration Cache Management for Coarse-Grained Reconfigurable Architecture with Multi-Array","authors":"Peng Cao, Yong Cai, Bo Liu, Weiwei Shan","doi":"10.1109/CyberC.2012.55","DOIUrl":"https://doi.org/10.1109/CyberC.2012.55","url":null,"abstract":"Coarse-Grained Reconfigurable Architectures (CGRAs) can achieve both high performance and flexibility, and CGRAs with multi-array are used to meet the increasing performance requirement of multimedia applications. Meanwhile, the context size also becomes quite large, so many CGRAs use a configuration cache to reduce reconfiguration overhead. However, with high power consumption, configuration cache management is still a challenge. This paper first analyzes context features of media algorithms, and introduces the base hardware architecture. Then a configuration cache management technique is proposed to implement H.264 video decoding on the base architecture. It includes a novel configuration cache structure and a configuration cache replacement algorithm based on Context Sequence Prefetching & Priority (CSPP). The experimental results show that the proposed approach can drastically improve system performance and reduce power consumption. The average configuration cache hit rate of CSPP is 96.83%, the speedup ranges from 64% to 109%, and our approach can support H.264 1080p@30fps decoding at a 200MHz working frequency.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"80 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":"130175883","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}
The new age of 4G technology is upon us which is about to reshape our lives. 4G offers us greater bandwidth, higher data rates, efficient spectrum use, and increased interoperability across the globe. It supports user friendly, innovative, and secure application environment. 4G systems are expected to become a platform capable of providing seamless integrating between the existing systems like GSM and wireless LAN. These systems will support comprehensive personalized services, providing stable system performance and improved quality of service. With these enhanced capabilities 4G promises to bring wireless experience to a whole new level. User will now have access to sophisticated GUI, real time gaming and high definition video. This paper will explore benefits, challenges, Multiplexing techniques and standards of 4G technologies. In it next generation applications and integration is discussed. Solutions to the research problems in developing 4G technologies are examined. Finally a short summary on 5G vision is presented as a continuum of features in the development of mobile technology.
{"title":"4G Evolution and Multiplexing Techniques with Solution to Implementation Challenges","authors":"M. Iqbal, M. B. Iqbal, I. Rasheed, M. Sandhu","doi":"10.1109/CyberC.2012.88","DOIUrl":"https://doi.org/10.1109/CyberC.2012.88","url":null,"abstract":"The new age of 4G technology is upon us which is about to reshape our lives. 4G offers us greater bandwidth, higher data rates, efficient spectrum use, and increased interoperability across the globe. It supports user friendly, innovative, and secure application environment. 4G systems are expected to become a platform capable of providing seamless integrating between the existing systems like GSM and wireless LAN. These systems will support comprehensive personalized services, providing stable system performance and improved quality of service. With these enhanced capabilities 4G promises to bring wireless experience to a whole new level. User will now have access to sophisticated GUI, real time gaming and high definition video. This paper will explore benefits, challenges, Multiplexing techniques and standards of 4G technologies. In it next generation applications and integration is discussed. Solutions to the research problems in developing 4G technologies are examined. Finally a short summary on 5G vision is presented as a continuum of features in the development of mobile technology.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"19 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":"134274816","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}
A criminal network is a kind of social networks with both secrecy and efficiency. The hidden knowledge in criminal networks can be regarded as an important indicators for criminal investigations which can help finding the criminal's relationship and identifying suspects. However such criminal network analysis has not been studied well in an applied way and remains primarily a manual process. To assist investigators to find criminals relationship, criminal leader, and identify suspicious guys of a conspiracy, we built a comprehensive indicator model using methods developed in the field of Social Network Analysis (SNA). A simulation is done on a large office from open source reports and the ranked list with respect to comprehensive indicator indicates that we provide a reasonable ranking based on the proposed model.
{"title":"Social Network Analysis in Multiple Social Networks Data for Criminal Group Discovery","authors":"Xufeng Shang, Yubo Yuan","doi":"10.1109/CyberC.2012.14","DOIUrl":"https://doi.org/10.1109/CyberC.2012.14","url":null,"abstract":"A criminal network is a kind of social networks with both secrecy and efficiency. The hidden knowledge in criminal networks can be regarded as an important indicators for criminal investigations which can help finding the criminal's relationship and identifying suspects. However such criminal network analysis has not been studied well in an applied way and remains primarily a manual process. To assist investigators to find criminals relationship, criminal leader, and identify suspicious guys of a conspiracy, we built a comprehensive indicator model using methods developed in the field of Social Network Analysis (SNA). A simulation is done on a large office from open source reports and the ranked list with respect to comprehensive indicator indicates that we provide a reasonable ranking based on the proposed model.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"2016 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":"127509668","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}
Currently, the complexity of embedded software is increased, hence, more efficient design approaches are demanded. Although component based design is well-defined for developing Embedded Real Time (ERT) systems, the design and implementation of ERT component software is slow and complex. Distributed ERT systems can reduce the complexity of a component and increase its reliability and re-usability as well. Currently, Service Oriented Architecture (SOA) is an excellent technology for the implementation of distributed software. Some platforms are introduced to implement the components in SOA concept such as Service Component Architecture (SCA) and OSGI (Open Services Gateway Initiative). SCA provides a hierarchical component composition, distributed configurations and an interconnection with various means to design and combine services. However, SCA is unable to discover and reference services dynamically. In contrast, OSGI focuses on loading the service component. The services can be stopped, loaded and unloaded in frameworks supported by OSGI. Hence, this paper proposes an integration of SCA and OSGI to introduce a new framework for the implementation of distributed ERT systems.
{"title":"An Implementation of Embedded Real Time System Framework in Service Oriented Architecture","authors":"Mahmood Aghajani, D. Jawawi","doi":"10.1109/CyberC.2012.63","DOIUrl":"https://doi.org/10.1109/CyberC.2012.63","url":null,"abstract":"Currently, the complexity of embedded software is increased, hence, more efficient design approaches are demanded. Although component based design is well-defined for developing Embedded Real Time (ERT) systems, the design and implementation of ERT component software is slow and complex. Distributed ERT systems can reduce the complexity of a component and increase its reliability and re-usability as well. Currently, Service Oriented Architecture (SOA) is an excellent technology for the implementation of distributed software. Some platforms are introduced to implement the components in SOA concept such as Service Component Architecture (SCA) and OSGI (Open Services Gateway Initiative). SCA provides a hierarchical component composition, distributed configurations and an interconnection with various means to design and combine services. However, SCA is unable to discover and reference services dynamically. In contrast, OSGI focuses on loading the service component. The services can be stopped, loaded and unloaded in frameworks supported by OSGI. Hence, this paper proposes an integration of SCA and OSGI to introduce a new framework for the implementation of distributed ERT systems.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"14 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":"128138739","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}
In this paper, we have evaluated the performance of Beam forming algorithm for uncoded signal with and without Jacket Matrix based eigenvalue decomposition. First, the channel matrix has been converted to the Jacket form according to the Jacket matrix transformation and the eigenvalue is calculated. Eigenvalues are used to calculate the weight matrix. Finally, weight matrix is used for transmit signal with adaptive white Gaussian noise. The experimental result shows that the jacket matrix based eigenvalue decomposition performs better than normal decomposition.
{"title":"Performance Evaluation of Beamforming Algorithm with Jacket Matrix Based Eigenvalue Decomposition","authors":"Md. Hashem Ali Khan, M. Lee","doi":"10.1109/CyberC.2012.100","DOIUrl":"https://doi.org/10.1109/CyberC.2012.100","url":null,"abstract":"In this paper, we have evaluated the performance of Beam forming algorithm for uncoded signal with and without Jacket Matrix based eigenvalue decomposition. First, the channel matrix has been converted to the Jacket form according to the Jacket matrix transformation and the eigenvalue is calculated. Eigenvalues are used to calculate the weight matrix. Finally, weight matrix is used for transmit signal with adaptive white Gaussian noise. The experimental result shows that the jacket matrix based eigenvalue decomposition performs better than normal decomposition.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"67 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":"128780151","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}
In D-S evidence theory, the Dempster's rule always leads to counter-intuitive results when combining conflicting evidences. The methods proposed to solve these problems all simply focus on BBA features, and ignore the decision assistant purpose. In order to get consistent results, a new combination scheme is proposed, which imitates the thinking of our brain, and fuses evidences with different conflict levels by different rules. The new scheme firstly classifies the evidences according to decision support property, then, fuses the BBAs in the same class through classical discounting method, in which the discount factor is related to probability quality, finally, combines the evidences conflicting seriously through another discount way selecting BBA reliability as the factor. The numeric examples show that the new scheme evaluates BBAs from decision assistant point all-time long, and can solve the counter-intuitive paradoxes effectively.
{"title":"A New Evidence Combination Scheme for Decision Assistant","authors":"Wanqing Wang, Yongjun Zhao, Jie Huang","doi":"10.1109/CyberC.2012.18","DOIUrl":"https://doi.org/10.1109/CyberC.2012.18","url":null,"abstract":"In D-S evidence theory, the Dempster's rule always leads to counter-intuitive results when combining conflicting evidences. The methods proposed to solve these problems all simply focus on BBA features, and ignore the decision assistant purpose. In order to get consistent results, a new combination scheme is proposed, which imitates the thinking of our brain, and fuses evidences with different conflict levels by different rules. The new scheme firstly classifies the evidences according to decision support property, then, fuses the BBAs in the same class through classical discounting method, in which the discount factor is related to probability quality, finally, combines the evidences conflicting seriously through another discount way selecting BBA reliability as the factor. The numeric examples show that the new scheme evaluates BBAs from decision assistant point all-time long, and can solve the counter-intuitive paradoxes effectively.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"23 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":"124471542","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}
Reusable anonymous return channels proposed by Golle and Jakobsson allow any recipient of one of the anonymous messages in a mix net to send back one or more replies directly. Yet their protocol has an obvious efficiency problem caused by multiple rounds of message processing. In this paper, we introduce a technique which is based on universal re-encryption and increases the total efficiency of reusable anonymous return channels. Our protocol retains all the significant attributes of the reusable channels, known as compos ability, reusability, transferability and compatibility. And it reduces the processing rounds of a message so as to increase efficiency. Moreover, it produces some new important properties. When using our protocol, even if all the servers in our system are corrupted, they can not gain the information of message content and our system can not be easily used as a decryption oracle. We also improve the efficiency of our original protocol when processing long messages and present a hybrid construction for it. Using Pohlig-Hellman, a message is much shorter in our hybrid construction than it is in our primary construction. As a result, the larger a message is, the more efficient our hybrid construction becomes.
{"title":"An Improved Construction for Reusable Anonymous Return Channels Based on Universal Re-encryption","authors":"Chengqiang Huang, Longhai Li, Shaofeng Fu","doi":"10.1109/CyberC.2012.33","DOIUrl":"https://doi.org/10.1109/CyberC.2012.33","url":null,"abstract":"Reusable anonymous return channels proposed by Golle and Jakobsson allow any recipient of one of the anonymous messages in a mix net to send back one or more replies directly. Yet their protocol has an obvious efficiency problem caused by multiple rounds of message processing. In this paper, we introduce a technique which is based on universal re-encryption and increases the total efficiency of reusable anonymous return channels. Our protocol retains all the significant attributes of the reusable channels, known as compos ability, reusability, transferability and compatibility. And it reduces the processing rounds of a message so as to increase efficiency. Moreover, it produces some new important properties. When using our protocol, even if all the servers in our system are corrupted, they can not gain the information of message content and our system can not be easily used as a decryption oracle. We also improve the efficiency of our original protocol when processing long messages and present a hybrid construction for it. Using Pohlig-Hellman, a message is much shorter in our hybrid construction than it is in our primary construction. As a result, the larger a message is, the more efficient our hybrid construction becomes.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"67 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":"114674802","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}
A trust-based intrusion detection scheme for hybrid cloud computing is proposed. We consider a trust metric based on honesty, cooperation and efficiency for detecting malicious machines. We use Perron-Frobenius theorem to detect intrusion based on trust and observations. By statistically analyzing pair trust distributed results, the portal of the application applies trust-based intrusion detection to assess the trustworthiness and maliciousness. An analytical model and simulation for performance are developed. We analyze the sensitivity of false alarms with respect to the minimum trust threshold below which a node is considered malicious. Results confirm that our proposal is flexible enough to detect malicious behaviours considering various parameters. This work can guide future execution in the cloud resource.
{"title":"Enforcing Trust-Based Intrusion Detection in Cloud Computing Using Algebraic Methods","authors":"Amira Bradai, H. Afifi","doi":"10.1109/CyberC.2012.38","DOIUrl":"https://doi.org/10.1109/CyberC.2012.38","url":null,"abstract":"A trust-based intrusion detection scheme for hybrid cloud computing is proposed. We consider a trust metric based on honesty, cooperation and efficiency for detecting malicious machines. We use Perron-Frobenius theorem to detect intrusion based on trust and observations. By statistically analyzing pair trust distributed results, the portal of the application applies trust-based intrusion detection to assess the trustworthiness and maliciousness. An analytical model and simulation for performance are developed. We analyze the sensitivity of false alarms with respect to the minimum trust threshold below which a node is considered malicious. Results confirm that our proposal is flexible enough to detect malicious behaviours considering various parameters. This work can guide future execution in the cloud resource.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"11 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":"115002683","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}
In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.
{"title":"A Genetic Algorithm for Task Scheduling Based on User Overall Satisfaction","authors":"Xiaoguang Wang","doi":"10.1109/CyberC.2012.97","DOIUrl":"https://doi.org/10.1109/CyberC.2012.97","url":null,"abstract":"In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"81 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":"128596662","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}
As the expansion of Internet, the recommender system is attracting the attention of many industry engineers and researcher, especially the collaborating filtering recommender system. However, there are still some challenges. For example, the sparse feature and large scale system degrades the recommendation accuracy and efficiency. In this paper, we propose implied-similarity and filled-default-value methods to improve the denseness of the preference matrix and use GPU to parallel the process. Our experiments show that the accuracy can improve 20% and efficiency can speed up 4 times.
{"title":"Improving the Collaborative Filtering Recommender System by Using GPU","authors":"Gao Zhanchun, Li Yuying","doi":"10.1109/CYBERC.2012.62","DOIUrl":"https://doi.org/10.1109/CYBERC.2012.62","url":null,"abstract":"As the expansion of Internet, the recommender system is attracting the attention of many industry engineers and researcher, especially the collaborating filtering recommender system. However, there are still some challenges. For example, the sparse feature and large scale system degrades the recommendation accuracy and efficiency. In this paper, we propose implied-similarity and filled-default-value methods to improve the denseness of the preference matrix and use GPU to parallel the process. Our experiments show that the accuracy can improve 20% and efficiency can speed up 4 times.","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":"128050510","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：