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

Performance Analysis of MRC Diversity for Spectrum Sharing Systems with Imperfect Channel Estimation 不完全信道估计下频谱共享系统MRC分集性能分析

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

Yu-zhen Huang, Yunpeng Cheng, Xueqiang Zheng, Jinlong Wang

{"title":"Performance Analysis of MRC Diversity for Spectrum Sharing Systems with Imperfect Channel Estimation","authors":"Yu-zhen Huang, Yunpeng Cheng, Xueqiang Zheng, Jinlong Wang","doi":"10.1109/CyberC.2013.79","DOIUrl":"https://doi.org/10.1109/CyberC.2013.79","url":null,"abstract":"In this paper, we analyze the performance of maximum ratio combining (MRC) diversity in spectrum sharing systems with imperfect channel estimation. Considering the limited power and number of pilot symbols, we study the impact of imperfect channel estimation about the secondary transmission link on the performance of the spectrum sharing system. Specifically, the exact closed-form expressions for the outage probability and average symbol error rate (SER) of spectrum sharing systems are derived, and the impact of various key system parameters, such as interference temperature, number of antennas, and channel estimation error, is investigated. Moreover, simple asymptotic expressions for the outage probability and average SER at the high signal-to-noise-ratio regime are provided, based on which the diversity and coding gains achieved by the secondary system are characterized. The finding of this paper suggests that zero diversity gain is attained due to imperfect channel estimation whereas a full diversity can be achieved under the perfect channel estimation case.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"63 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":"116105651","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

Finite Ridgelet Transform Based Listless Block-Partitioning Image Coding Algorithm 基于有限脊波变换的无表分块图像编码算法

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

Zhenghua Shu, Guodon Liu, Zhihua Xie, Z. Ren, Lixin Gan

{"title":"Finite Ridgelet Transform Based Listless Block-Partitioning Image Coding Algorithm","authors":"Zhenghua Shu, Guodon Liu, Zhihua Xie, Z. Ren, Lixin Gan","doi":"10.1109/CyberC.2013.94","DOIUrl":"https://doi.org/10.1109/CyberC.2013.94","url":null,"abstract":"In this paper, an image coding algorithm based on a rate-distortion optimized orthonormal finite ridge let transform (OFRIT) decomposition and on an improved listless block-partitioning coding scheme which quantizes each sub band separately is proposed. The ridge let transform can provide optimally sparse representation of objects with singularities along straight edges and the orthonormal finite ridge let transform(OFRIT) can decompose the high frequency parts of the images. A linear indexing technique is used to rep resent the coordinate of a coefficient with a single number instead of two for computational efficiency and algorithm simplicity. Instead of lists, a state table with four bits per coefficient keep s track of the significance of the set and pixel. Each sub band is encoded by a quad tree based set partitioning process. This algorithm needs no lists and thus can avoid unfixed memory requirement and the operations of list nodes. The experimental results show that the proposed algorithm runs faster than SPIHT and JPEG2000 and set partitioning in hierarchical trees. The proposed algorithm outperforms SPIHT and JPEG2000 schemes in novel image with straight lines significantly or curve lines significantly coding in terms of both PSNR and visual quality, it has a fixed predetermined memory requirement of about 50% of the image size.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"23 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":"123466476","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

Robustness of Community Partition Similarity Metrics 社区划分相似度度量的鲁棒性

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

Dingyi Yin, Qi Ye

引用次数: 1

The Architecture and Design of a Community-Based Cloud Platform for Curating Big Data 基于社区的大数据管理云平台架构与设计

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

Sulayman K. Sowe, K. Zettsu

{"title":"The Architecture and Design of a Community-Based Cloud Platform for Curating Big Data","authors":"Sulayman K. Sowe, K. Zettsu","doi":"10.1109/CyberC.2013.35","DOIUrl":"https://doi.org/10.1109/CyberC.2013.35","url":null,"abstract":"The digital universe is exponentially producing unprecedented volume of data that has brought benefits, as well as fundamental challenges for the research community. This trend is inherently exciting for the development and deployment of cloud platforms to support research communities curate data. The excitements stems from the fact that researchers can now have more access and discover more value in data, establish relationships between bits and pieces of information from many types of data, and collaborate with a diverse community of researchers from various domains. Technically, however, platform providers must design their infrastructure in such a way that users can easily search, find, share, and seamlessly collaborate. In this paper, we present the architecture and design of a cloud platform and describe how a community of disaster response scientists could use the platform to curate data. Motivation for developing the platform, lessons learnt in overcoming some challenges associated with collaborative and cooperative cloud environments, and future research directions are also presented. The contribution of this research is in the field of cloud infrastructure for supporting data curation activities, and the sustenance of research communities for the utilization of information assets and cyber technologies.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"24 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":"134449811","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

Mining Frequent Rooted Ordered Tree Generators Efficiently 高效挖掘频繁根有序树生成器

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

Shengwei Yi, Jize Xu, Yong Peng, Qi Xiong, Ting Wang, Shilong Ma

{"title":"Mining Frequent Rooted Ordered Tree Generators Efficiently","authors":"Shengwei Yi, Jize Xu, Yong Peng, Qi Xiong, Ting Wang, Shilong Ma","doi":"10.1109/CyberC.2013.29","DOIUrl":"https://doi.org/10.1109/CyberC.2013.29","url":null,"abstract":"With the wide applications of tree structured data, such as XML databases, research of mining frequent sub tree patterns have recently attracted much attention in the data mining and database communities. Due to the downward closure property, mining complete frequent sub tree patterns can lead to an exponential number of results. Although the existing studies have proposed several alleviative solutions (i.e. mining frequent closed sub tree patterns or maximal sub tree patterns) to compress the size of large results, the existing solutions are not suitable some real applications, such as frequent pattern-based classification. Furthermore, according to the Minimum Description Length (MDL) Principle, frequent rooted sub trees generators are preferable to frequent closed/maximal sub tree patterns in the applications of frequent pattern-based classification. In this paper, we study a novel problem of mining frequent rooted ordered tree generators. To speed up the efficiency of mining process, we propose a depth-first-search-based framework. Moreover, two effective pruning strategies are integrated into the framework to reduce the search space and avoid redundant computation. Finally, we verify the effectiveness and efficiency of our proposed approaches through extensive experiments.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 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":"130702342","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

A Business Computing System Optimization Research on the Efficiency of Database Queries 商业计算系统数据库查询效率的优化研究

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

Lin Hong, Mingda Lu, Weiting Hong

引用次数: 3

A Novel Cell Reselection Method in the Scenario of Multi-RAT 一种新的多鼠场景下的细胞重选方法

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

Rong Wang, Zhang Tao, Xin-long Luo, Dengkun Xiao, Fauzi Fanny

引用次数: 0

Design of a RS485-to-1553B Bus Bridge rs485 - 1553b总线桥的设计

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

Li Zhou, Junshe An

引用次数: 1

Energy Efficient Terminal-Discovering in Mobile Delay Tolerant Ad-hoc Networks 移动容错Ad-hoc网络中的节能终端发现

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

W. Feng, Shihang Li

引用次数: 5

Replication in Distributed Storage Systems: State of the Art, Possible Directions, and Open Issues 分布式存储系统中的复制:现状、可能的方向和开放的问题

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

Y. Liu, Vladimir Vlassov

引用次数: 12