Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713047
Xuexue Zhang, Junhui Zhao
Based on a Space-Time Block Coding Multi-Carrier Code Division Multiple Access (STBC MC-CDMA) system, a Asynchronous Distributed Pricing (ADP) Algorithm is studied in this paper, in which the cognitive radio(CR) users announces a price that reflect other users' compensation paid. The power control is implemented by updating pricing and power level. The ADP algorithm is a distributed power control scheme based on the supermodular game theory. Introduced in the STBC MC-CDMA system, it can improve the capacity and the utility of the system, and show faster convergence.
{"title":"Power control based on the Asynchronous Distributed Pricing Algorithm in cognitive radios","authors":"Xuexue Zhang, Junhui Zhao","doi":"10.1109/YCICT.2010.5713047","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713047","url":null,"abstract":"Based on a Space-Time Block Coding Multi-Carrier Code Division Multiple Access (STBC MC-CDMA) system, a Asynchronous Distributed Pricing (ADP) Algorithm is studied in this paper, in which the cognitive radio(CR) users announces a price that reflect other users' compensation paid. The power control is implemented by updating pricing and power level. The ADP algorithm is a distributed power control scheme based on the supermodular game theory. Introduced in the STBC MC-CDMA system, it can improve the capacity and the utility of the system, and show faster convergence.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311570","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}
Drought has become a great constraint in the process of sustainable development of human society and China is one of the countries frequently affected by severe droughts. Thus, along with research on the drought prediction and prevention, it is of key importance to study how to reasonably allocate the limited water resources during drought. When drought occurs, there is a struggle for water among various users. The main objective of this study is to define an appropriate proportion of water to be distributed between industry and agriculture in order to avoid heavy economic losses when suffering the emergency drought. So, we designed a simple algorithm to account for economic losses and on that basis to choose the optimum scheme of water allocation under different drought scenarios.
{"title":"Optimization of water allocation based on the economic loss analysis under different drought scenarios","authors":"Yanqi Zhao, Changming Liu, Yingfei Yang, Hongxing Zheng","doi":"10.1109/YCICT.2010.5713137","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713137","url":null,"abstract":"Drought has become a great constraint in the process of sustainable development of human society and China is one of the countries frequently affected by severe droughts. Thus, along with research on the drought prediction and prevention, it is of key importance to study how to reasonably allocate the limited water resources during drought. When drought occurs, there is a struggle for water among various users. The main objective of this study is to define an appropriate proportion of water to be distributed between industry and agriculture in order to avoid heavy economic losses when suffering the emergency drought. So, we designed a simple algorithm to account for economic losses and on that basis to choose the optimum scheme of water allocation under different drought scenarios.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114520001","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713100
Liu Kai, Wu Xuan-li, Shen Qing-hua
In cooperative spectrum sensing, the detection performance is affected seriously by the error of channel estimation. Hence, the accurate channel estimation is very necessary. In this paper, the performance of cooperative spectrum sensing under the LMMSE channel estimation method with time-domain windowing technique is analyzed. Simulation results show that the probability of detection can reach high accuracy by this channel estimation method. Given the 1st hop Eb/N0 = 20dB and the 2nd hop Eb/N0 = 15dB in AF relay channel, the error of detection between the proposed estimation and the perfect estimation is 0.0059, and actual false alarm just deviates the system requirement 1.16%.
{"title":"Cooperative spectrum sensing under LMMSE channel estimation","authors":"Liu Kai, Wu Xuan-li, Shen Qing-hua","doi":"10.1109/YCICT.2010.5713100","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713100","url":null,"abstract":"In cooperative spectrum sensing, the detection performance is affected seriously by the error of channel estimation. Hence, the accurate channel estimation is very necessary. In this paper, the performance of cooperative spectrum sensing under the LMMSE channel estimation method with time-domain windowing technique is analyzed. Simulation results show that the probability of detection can reach high accuracy by this channel estimation method. Given the 1st hop Eb/N0 = 20dB and the 2nd hop Eb/N0 = 15dB in AF relay channel, the error of detection between the proposed estimation and the perfect estimation is 0.0059, and actual false alarm just deviates the system requirement 1.16%.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116963221","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713080
Jun Xiao, Zhiqiang Ma, Bai Lin, Jiaorao Su, Ying Wang
Semi-fragile watermarking which is robust to given operations and fragile to conscious operations, is a useful authentication technique for digital media. In this paper, a novel semi-fragile image watermarking algorithm that accepts JPEG compression and gray-scale-transformation is proposed. In the proposed algorithm, the properties of JPEG compression, DCT coefficients and gray-scale-transformation are analyzed and used to optimize the embedding parameters especially the quantization step, which can make sure of the robustness and frangibility of the algorithm to given processes and attacks. The robustness and frangibility of the proposed algorithm to given image processes are analyzed, and the results show that the proposed algorithm is very robust to JPEG compression, gray-scale-transformation, and the combination of JPEG compression and gray-scale-transformation, while it is very fragile to malicious attacks, such as cropping, adding signature and median filtering. Namely, the proposed algorithm can distinguish JPEG compression and gray-scale-transformation from other attacks accurately.
{"title":"A semi-fragile watermarking distinguishing JPEG compression and gray-scale-transformation from malicious manipulation","authors":"Jun Xiao, Zhiqiang Ma, Bai Lin, Jiaorao Su, Ying Wang","doi":"10.1109/YCICT.2010.5713080","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713080","url":null,"abstract":"Semi-fragile watermarking which is robust to given operations and fragile to conscious operations, is a useful authentication technique for digital media. In this paper, a novel semi-fragile image watermarking algorithm that accepts JPEG compression and gray-scale-transformation is proposed. In the proposed algorithm, the properties of JPEG compression, DCT coefficients and gray-scale-transformation are analyzed and used to optimize the embedding parameters especially the quantization step, which can make sure of the robustness and frangibility of the algorithm to given processes and attacks. The robustness and frangibility of the proposed algorithm to given image processes are analyzed, and the results show that the proposed algorithm is very robust to JPEG compression, gray-scale-transformation, and the combination of JPEG compression and gray-scale-transformation, while it is very fragile to malicious attacks, such as cropping, adding signature and median filtering. Namely, the proposed algorithm can distinguish JPEG compression and gray-scale-transformation from other attacks accurately.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096726","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713153
Weihong Zhou, Shun-Qing Xiong, L. Ying
It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.
{"title":"A new hybrid genetic algorithm based on clan competition","authors":"Weihong Zhou, Shun-Qing Xiong, L. Ying","doi":"10.1109/YCICT.2010.5713153","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713153","url":null,"abstract":"It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117248383","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713151
Cong Shi, N. Wu, Zhihua Wang
This paper proposes a novel high-speed vision processor based on pixel-parallel PE array. The processor consists of a pixel-parallel PE array, an embedded RISC core, an AHB bus, some SRAM blocks and other logical controllers. PE array performs the low- and mid-level vision processing, and RISC core carries out the high-level vision processing in succession. The vision processor can process vision information at a speed higher than 1000fps. Many application algorithms can be implemented by software programming on the vision processor. The processor prototype is implemented on a FPGA board with a 64×64 PE array and the clock frequency is 100MHz. It can realize moving detection in 128×128 image data at a rate of 4500fps, and 104fps in complicated face detection task for 160×120 video frame sequence. The results demonstrated that the vision processor outperforms the general serial CPUs for more than 60 times.
{"title":"A high-speed vision processor based on pixel-parallel PE array and its applications","authors":"Cong Shi, N. Wu, Zhihua Wang","doi":"10.1109/YCICT.2010.5713151","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713151","url":null,"abstract":"This paper proposes a novel high-speed vision processor based on pixel-parallel PE array. The processor consists of a pixel-parallel PE array, an embedded RISC core, an AHB bus, some SRAM blocks and other logical controllers. PE array performs the low- and mid-level vision processing, and RISC core carries out the high-level vision processing in succession. The vision processor can process vision information at a speed higher than 1000fps. Many application algorithms can be implemented by software programming on the vision processor. The processor prototype is implemented on a FPGA board with a 64×64 PE array and the clock frequency is 100MHz. It can realize moving detection in 128×128 image data at a rate of 4500fps, and 104fps in complicated face detection task for 160×120 video frame sequence. The results demonstrated that the vision processor outperforms the general serial CPUs for more than 60 times.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126161279","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713112
Hao Ren, Jinlin Wang, Jiali You
In order to evaluate the influence of neighbors' quality to P2P streaming system's performance during scheduling, this paper establishes a markov chain based differential function model to analyze the relationship between peer's average startup delay and probability neighbors have wanted data as well as neighbors' available upload bandwidth. This paper also proposes a scheduling feedback algorithm, which learns real-time information of neighbors' data ownership as well as service capacity during data transferring and feeds back to overlay to help its optimization. The algorithm could help overlay discover possible better Qos neighbors when scheduling. Numerical analysis and experiment shows better quality neighbors can improve system's average startup delay significantly during scheduling.
{"title":"A research on modeling feedback-based data scheduling in P2P streaming system","authors":"Hao Ren, Jinlin Wang, Jiali You","doi":"10.1109/YCICT.2010.5713112","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713112","url":null,"abstract":"In order to evaluate the influence of neighbors' quality to P2P streaming system's performance during scheduling, this paper establishes a markov chain based differential function model to analyze the relationship between peer's average startup delay and probability neighbors have wanted data as well as neighbors' available upload bandwidth. This paper also proposes a scheduling feedback algorithm, which learns real-time information of neighbors' data ownership as well as service capacity during data transferring and feeds back to overlay to help its optimization. The algorithm could help overlay discover possible better Qos neighbors when scheduling. Numerical analysis and experiment shows better quality neighbors can improve system's average startup delay significantly during scheduling.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130778644","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713050
Yongqing Wang, W. Mao
Listwise is an important approach in learning to rank. Most of the existing lisewise methods use a linear ranking function which can only achieve a limited performance being applied to complex ranking problem. This paper proposes a non-linear listwise algorithm inspired by boosting and clustering. Different from the previous listwise approaches, our algorithm constructs weak rankers through directly discovering hidden order in single feature, and then combines these weak rankers using a boosting procedure. To discover the hidden order, we utilize (KNN) method. In our preliminary experiment, we compare our approach with other listwise algorithms and show the effectiveness of our proposed algorithm.
{"title":"Featurerank: A non-linear listwise approach with clustering and boosting","authors":"Yongqing Wang, W. Mao","doi":"10.1109/YCICT.2010.5713050","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713050","url":null,"abstract":"Listwise is an important approach in learning to rank. Most of the existing lisewise methods use a linear ranking function which can only achieve a limited performance being applied to complex ranking problem. This paper proposes a non-linear listwise algorithm inspired by boosting and clustering. Different from the previous listwise approaches, our algorithm constructs weak rankers through directly discovering hidden order in single feature, and then combines these weak rankers using a boosting procedure. To discover the hidden order, we utilize (KNN) method. In our preliminary experiment, we compare our approach with other listwise algorithms and show the effectiveness of our proposed algorithm.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129235386","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713075
Yuan Ping, Yajian Zhou, Yixian Yang, Weiping Peng
In text categorization, vectorizing a document by probability distribution is an effective dimension reduction way to save training time. However, the data sets that share many common keywords between categories affect the classification performance seriously. To address that problem, firstly, we conduct an effective term weighting scheme consisting of posterior probability and relevance frequency to improve the performance of the traditional hybrid classification model. To get a better representation of the information contained in a document, as well as the introduction of an advanced hybrid classification model, we also propose a novel term weighting scheme with distributional coefficient so as to obtain further accuracy enhancement. The experimental results show that these proposed schemes are significantly better than the traditional method.
{"title":"A novel term weighting scheme with distributional coefficient for text categorization with support vector machine","authors":"Yuan Ping, Yajian Zhou, Yixian Yang, Weiping Peng","doi":"10.1109/YCICT.2010.5713075","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713075","url":null,"abstract":"In text categorization, vectorizing a document by probability distribution is an effective dimension reduction way to save training time. However, the data sets that share many common keywords between categories affect the classification performance seriously. To address that problem, firstly, we conduct an effective term weighting scheme consisting of posterior probability and relevance frequency to improve the performance of the traditional hybrid classification model. To get a better representation of the information contained in a document, as well as the introduction of an advanced hybrid classification model, we also propose a novel term weighting scheme with distributional coefficient so as to obtain further accuracy enhancement. The experimental results show that these proposed schemes are significantly better than the traditional method.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125704807","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713111
Jing An, Yongsheng Jia, Hao Wu
Cooperative diversity is a transmission technique, where multiple users pool their resources to form a virtual antenna array that obtain spatial diversity. We evaluate the performance of coded cooperation with multiple relays in Reyleigh fading channels. The closed-form expressions with multiple relays are derived in this work. Our numerical results show that the new coded cooperation method can achieve a noticeable gain over non-cooperative networks. Moreover, the analytical upper bounds are validated with simulation results.
{"title":"A distributed coding protocol for wireless relay networks","authors":"Jing An, Yongsheng Jia, Hao Wu","doi":"10.1109/YCICT.2010.5713111","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713111","url":null,"abstract":"Cooperative diversity is a transmission technique, where multiple users pool their resources to form a virtual antenna array that obtain spatial diversity. We evaluate the performance of coded cooperation with multiple relays in Reyleigh fading channels. The closed-form expressions with multiple relays are derived in this work. Our numerical results show that the new coded cooperation method can achieve a noticeable gain over non-cooperative networks. Moreover, the analytical upper bounds are validated with simulation results.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114112037","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
扫码关注我们
求助内容：
应助结果提醒方式：