Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713109
Qiong Huang, Ming-jing Ni, Lun Tang, Rong Chai, Qianbin Chen
Under the background of TDD mode and LTE-Advanced scene, in this paper, we combine physical network coding with relay technology in order to make physical network coding-decode and forward(PNC-DF)together with physical network coding-amplify and forward(PNC-AF)transfer mode can be used to improve network throughput by using interference. Because of the ability to listen to the multi-user relay service, we need to optimize and select user group of physical network coding. In this paper, we use over-hearing mechanism in order to optimize user group, even more we also need to improve the department of transport protocol on delay. At last, depending on improved transport protocol, we design two kinds of frame structure which could adapt to improved transfer model. The simulation result shows that PNC-DF and PNC-AF with over-hearing mechanism could reduce the bit error rate.
{"title":"Relay protocol improvement and frame structure design base on overhearing mechanism and physical network coding","authors":"Qiong Huang, Ming-jing Ni, Lun Tang, Rong Chai, Qianbin Chen","doi":"10.1109/YCICT.2010.5713109","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713109","url":null,"abstract":"Under the background of TDD mode and LTE-Advanced scene, in this paper, we combine physical network coding with relay technology in order to make physical network coding-decode and forward(PNC-DF)together with physical network coding-amplify and forward(PNC-AF)transfer mode can be used to improve network throughput by using interference. Because of the ability to listen to the multi-user relay service, we need to optimize and select user group of physical network coding. In this paper, we use over-hearing mechanism in order to optimize user group, even more we also need to improve the department of transport protocol on delay. At last, depending on improved transport protocol, we design two kinds of frame structure which could adapt to improved transfer model. The simulation result shows that PNC-DF and PNC-AF with over-hearing mechanism could reduce the bit error rate.","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":"123816111","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.5713084
Xiang Li, Bai Lin, DaQi Li
The satellite network has features like complex, dynamic and fuzzy. Compared to ground information systems, satellite network has more vulnerabilities that are hard to anticipate, and needs a beforehand study to ensure its safely construction. This article uses a vulnerability Analyzing method based on graph model. It uses the relatively still structure as stand point in the dynamic satellite network environment. It synthetically analyses relative vulnerabilities in the network from node level, chain level and access path level. Through simulations with the GIG application layer network structures as the scenarios, this kind of satellite network structure vulnerability analysis method gets its veracity and application value proved.
{"title":"A graph-model-based structure vulnerability Analyzing method on satellite network","authors":"Xiang Li, Bai Lin, DaQi Li","doi":"10.1109/YCICT.2010.5713084","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713084","url":null,"abstract":"The satellite network has features like complex, dynamic and fuzzy. Compared to ground information systems, satellite network has more vulnerabilities that are hard to anticipate, and needs a beforehand study to ensure its safely construction. This article uses a vulnerability Analyzing method based on graph model. It uses the relatively still structure as stand point in the dynamic satellite network environment. It synthetically analyses relative vulnerabilities in the network from node level, chain level and access path level. Through simulations with the GIG application layer network structures as the scenarios, this kind of satellite network structure vulnerability analysis method gets its veracity and application value proved.","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":"116306559","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.5713069
Xiongfei Zeng, Zheng Li, Haining Huang, Guiqing Sun
High accurate ranging for near-field sources requires that the array aperture should be long enough, especially for the weak underwater acoustic signal with very low frequency. The passive synthetic aperture technique can increase the array aperture artificially by the motion of physical array and signal processing. This paper applies it to the near-field ranging with focused beamforming, which provides a feasible ranging method for near-field weak signal. Theoretical analysis and simulation results both indicate: 1) the proposed method can achieve high ranging precision for near-field sources; 2) because of the error accumulation, the times of extending array would affect the ranging precision directly, and if the sizes of synthetic apertures are same, the fewer times array is extended, the better performance it owns, on the contrary, the ranging precision is independent on the speed of the towed array.
{"title":"Focused passive synthetic aperture","authors":"Xiongfei Zeng, Zheng Li, Haining Huang, Guiqing Sun","doi":"10.1109/YCICT.2010.5713069","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713069","url":null,"abstract":"High accurate ranging for near-field sources requires that the array aperture should be long enough, especially for the weak underwater acoustic signal with very low frequency. The passive synthetic aperture technique can increase the array aperture artificially by the motion of physical array and signal processing. This paper applies it to the near-field ranging with focused beamforming, which provides a feasible ranging method for near-field weak signal. Theoretical analysis and simulation results both indicate: 1) the proposed method can achieve high ranging precision for near-field sources; 2) because of the error accumulation, the times of extending array would affect the ranging precision directly, and if the sizes of synthetic apertures are same, the fewer times array is extended, the better performance it owns, on the contrary, the ranging precision is independent on the speed of the towed array.","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":"122986179","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.5713082
Jun Xiao, Jiaorao Su, Zhiqiang Ma
As a new authentication technique for digital information, semi-fragile watermarking has gained great development, and since JPEG compression is one of the usually used image processing methods, more and more semi-fragile watermarking algorithms based on JPEG compression standard are proposed, but how to make full use of the properties of JPEG compression is still a problem. In this paper, the theory of semi-fragile watermarking based on properties of JPEG and DCT coefficients are introduced, and the parameters that affect the performances are analyzed theoretically and experimentally. The result of study shows that the positions of DCT coefficients used to generate watermark, the number of watermarks generated from a couple of blocks and the positions used to hide watermarks have great effect on the performances of the algorithm. Unless some special requirements exist, both the positions of coefficients used to generate and embed watermark should be chosen according to the order of zig-zag, and usually the best performance can be obtained when only one bit watermark is generated from a couple of blocks.
{"title":"Study on the parameters of the semi-fragile watermarking based on JPEG properties","authors":"Jun Xiao, Jiaorao Su, Zhiqiang Ma","doi":"10.1109/YCICT.2010.5713082","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713082","url":null,"abstract":"As a new authentication technique for digital information, semi-fragile watermarking has gained great development, and since JPEG compression is one of the usually used image processing methods, more and more semi-fragile watermarking algorithms based on JPEG compression standard are proposed, but how to make full use of the properties of JPEG compression is still a problem. In this paper, the theory of semi-fragile watermarking based on properties of JPEG and DCT coefficients are introduced, and the parameters that affect the performances are analyzed theoretically and experimentally. The result of study shows that the positions of DCT coefficients used to generate watermark, the number of watermarks generated from a couple of blocks and the positions used to hide watermarks have great effect on the performances of the algorithm. Unless some special requirements exist, both the positions of coefficients used to generate and embed watermark should be chosen according to the order of zig-zag, and usually the best performance can be obtained when only one bit watermark is generated from a couple of blocks.","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":"115888412","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.5713064
Sun Qiaomei, Ren Guang, Yue Jin, Qi Xiaowei
This paper describes a control methodology of SVM inverse model for unmanned surface vehicle (USV) system heading control. The method is composed of SVM inverse model and PID feedback compensation that are illustrated in detail. In the MATLAB platform, unmanned surface vehicle module and SVM control module were established. The whole system simulation was conducted. The experiments results show that the proposed SVM inverse model approach can achieve effective control of USV.
{"title":"SVM inverse model-based heading control of unmanned surface vehicle","authors":"Sun Qiaomei, Ren Guang, Yue Jin, Qi Xiaowei","doi":"10.1109/YCICT.2010.5713064","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713064","url":null,"abstract":"This paper describes a control methodology of SVM inverse model for unmanned surface vehicle (USV) system heading control. The method is composed of SVM inverse model and PID feedback compensation that are illustrated in detail. In the MATLAB platform, unmanned surface vehicle module and SVM control module were established. The whole system simulation was conducted. The experiments results show that the proposed SVM inverse model approach can achieve effective control of USV.","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":"122545896","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.5713094
Feng Wang, Xin Xu
One crucial task of learning to rank in the field of information retrieval (IR) is to determine an ordering of documents according to their degree of relevance to the user given query. In this paper, a learning method is proposed named AdaGP-Rank by applying boosting techniques to genetic programming. This approach uses genetic programming to evolve ranking functions while a process inspired from AdaBoost technique helps the evolved ranking functions concentrate on the ranking of those documents associating those ‘hard’ queries. Based on the confidence coefficients, the ranking functions obtained at each boosting round are then combined into a final strong ranker. Experiments conform that AdaGP-Rank has general better performance than several state-of-the-art ranking algorithms on the benchmark data sets.
{"title":"AdaGP-Rank: Applying boosting technique to genetic programming for learning to rank","authors":"Feng Wang, Xin Xu","doi":"10.1109/YCICT.2010.5713094","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713094","url":null,"abstract":"One crucial task of learning to rank in the field of information retrieval (IR) is to determine an ordering of documents according to their degree of relevance to the user given query. In this paper, a learning method is proposed named AdaGP-Rank by applying boosting techniques to genetic programming. This approach uses genetic programming to evolve ranking functions while a process inspired from AdaBoost technique helps the evolved ranking functions concentrate on the ranking of those documents associating those ‘hard’ queries. Based on the confidence coefficients, the ranking functions obtained at each boosting round are then combined into a final strong ranker. Experiments conform that AdaGP-Rank has general better performance than several state-of-the-art ranking algorithms on the benchmark data sets.","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":"132535298","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.5713147
Ye Shen, Jing Feng, Hao Zhu
GML, a geographic information coding standard, has been widely used in WebGIS, heterogeneous GIS data sharing, integration, and interoperation. However, its features of large amount of redundancy inherited from XML file structure and geographic information system make a serious obstacle in WebGIS applications. According to the characteristics of GML, a data stream-based compression algorithm GDSC ( GML data stream compression ) was given, which separated the GML into structure data and value data using “Draw Pattern”, replaced the structure data with dictionary table during the separation process, and compressed the structure data and value data respectively to increase compression rate. In order to reduce compression time, GDSC uses two sub-threads for compression, decompression and network transmission.
{"title":"An approach to efficient compression transmission schema of GML","authors":"Ye Shen, Jing Feng, Hao Zhu","doi":"10.1109/YCICT.2010.5713147","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713147","url":null,"abstract":"GML, a geographic information coding standard, has been widely used in WebGIS, heterogeneous GIS data sharing, integration, and interoperation. However, its features of large amount of redundancy inherited from XML file structure and geographic information system make a serious obstacle in WebGIS applications. According to the characteristics of GML, a data stream-based compression algorithm GDSC ( GML data stream compression ) was given, which separated the GML into structure data and value data using “Draw Pattern”, replaced the structure data with dictionary table during the separation process, and compressed the structure data and value data respectively to increase compression rate. In order to reduce compression time, GDSC uses two sub-threads for compression, decompression and network transmission.","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":"128623558","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.5713057
Haifeng Li, Ning Zhang
Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a problem that how to mine maximal frequent itemsets over a stream sliding window. We employ a simple but effective data structure to dynamically maintain the maximal frequent itemsets and other helpful information; thus, an algorithm named MFIoSSW is proposed to efficiently mine the results in an incremental manner with our theoretical analysis. Our experimental results show our algorithm achieves a better running time cost.
{"title":"Mining maximal frequent itemsets over a stream sliding window","authors":"Haifeng Li, Ning Zhang","doi":"10.1109/YCICT.2010.5713057","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713057","url":null,"abstract":"Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a problem that how to mine maximal frequent itemsets over a stream sliding window. We employ a simple but effective data structure to dynamically maintain the maximal frequent itemsets and other helpful information; thus, an algorithm named MFIoSSW is proposed to efficiently mine the results in an incremental manner with our theoretical analysis. Our experimental results show our algorithm achieves a better running time cost.","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":"129772303","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.5713114
Jing An, Zhichen Wang, Hongyu Wang
Two fundamental problems in any cellular systems are limited capacity and the presence of unbalanced traffic. In this paper, we propose a novel grouping infrastructure for next generation cellular networks, whose objective is to increase the system throughput and further improve the system balance. In the cellular system, we consider all the available users are divided into two groups. One is the super group which locates in the cell central region, and another is the regular group which locates in the cell boundary. The super group is served by Base Station, and the Mobile Stations locate in the cell boundary are served by the clusterhead which is elect from the regular group. By using the grouping scheme, it's possible to improve the system performance in terms of SINR cumulative distribution function, system throughput and cell boundary throughput. Results show that good SINR is achieved, as well as significant gains in the whole cell throughput compared to the conventional cellular system.
{"title":"A novel grouping algorithm for future cellular networks","authors":"Jing An, Zhichen Wang, Hongyu Wang","doi":"10.1109/YCICT.2010.5713114","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713114","url":null,"abstract":"Two fundamental problems in any cellular systems are limited capacity and the presence of unbalanced traffic. In this paper, we propose a novel grouping infrastructure for next generation cellular networks, whose objective is to increase the system throughput and further improve the system balance. In the cellular system, we consider all the available users are divided into two groups. One is the super group which locates in the cell central region, and another is the regular group which locates in the cell boundary. The super group is served by Base Station, and the Mobile Stations locate in the cell boundary are served by the clusterhead which is elect from the regular group. By using the grouping scheme, it's possible to improve the system performance in terms of SINR cumulative distribution function, system throughput and cell boundary throughput. Results show that good SINR is achieved, as well as significant gains in the whole cell throughput compared to the conventional cellular system.","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":"123674826","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.5713141
Zhong Chen, Xianda Zhang, Tianxiang Luan
In this paper, we propose a cooperative spectrum sharing scheme based on decode and forward relaying and a three phase protocol in cognitive radio networks for a secondary system to access the spectrum concurrent with the primary system. The whole system consists of a pair of primary transmitter (PT) and receiver (PR) and a pair of secondary transmitter (ST) and receiver (SR). PT broadcasts the signal to ST and PR during the first fraction 1 − α of time. ST decodes and regenerates the relaying signal to PR in the second fraction αβ of time and transmits the secondary signal to SR in the third fraction α(1 − β) of time. We consider the case that the channel state information (CSI) is fully known where the secondary system won't impact the primary transmission by ensuring the achievable rate, and the case that the distance information between each nodes is known where outage performance of the primary system is ensured. The performance of the secondary system is optimized to get optimal α and β. Simulation results illustrate that the proposed scheme can significantly realize spectrum sharing.
{"title":"Cooperation based spectrum sharing in cognitive radio networks","authors":"Zhong Chen, Xianda Zhang, Tianxiang Luan","doi":"10.1109/YCICT.2010.5713141","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713141","url":null,"abstract":"In this paper, we propose a cooperative spectrum sharing scheme based on decode and forward relaying and a three phase protocol in cognitive radio networks for a secondary system to access the spectrum concurrent with the primary system. The whole system consists of a pair of primary transmitter (PT) and receiver (PR) and a pair of secondary transmitter (ST) and receiver (SR). PT broadcasts the signal to ST and PR during the first fraction 1 − α of time. ST decodes and regenerates the relaying signal to PR in the second fraction αβ of time and transmits the secondary signal to SR in the third fraction α(1 − β) of time. We consider the case that the channel state information (CSI) is fully known where the secondary system won't impact the primary transmission by ensuring the achievable rate, and the case that the distance information between each nodes is known where outage performance of the primary system is ensured. The performance of the secondary system is optimized to get optimal α and β. Simulation results illustrate that the proposed scheme can significantly realize spectrum sharing.","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":"126423768","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
扫码关注我们
求助内容：
应助结果提醒方式：