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":"20 1","pages":"0"},"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.5713105
B. Lu, Chunli Miao, Hui Wang
A pixel-level image fusion method based on linear structure tensor is proposed within wavelet framework. Structure tensor, which describes local structure information with its eigenvalues and eigenvectors, is adopted to design a feature selection algorithm to reconstruct high-frequency wavelet coefficients of fused image. Experimental results on grayscale and color images show that the linear structure tensor based fusion scheme can preserve more details.
{"title":"Pixel level image fusion based on linear structure tensor","authors":"B. Lu, Chunli Miao, Hui Wang","doi":"10.1109/YCICT.2010.5713105","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713105","url":null,"abstract":"A pixel-level image fusion method based on linear structure tensor is proposed within wavelet framework. Structure tensor, which describes local structure information with its eigenvalues and eigenvectors, is adopted to design a feature selection algorithm to reconstruct high-frequency wavelet coefficients of fused image. Experimental results on grayscale and color images show that the linear structure tensor based fusion scheme can preserve more details.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134015231","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.5713128
Gao Xiaopeng, Wan Sumei, Chen Xianqin
With the number of applications running upon the virtualized system increased, the virtual network circumstance becomes more and more complicated; the consequent security problems thereby have been a concern for industrial and academic fields. However, the current solutions are mostly confined to the enforcement of several patchy-works on system which still requires proficient hacking skills for administrators and cannot ensure continuous protection for VM, resulting in potential security risks. In this paper we present a framework (VNSS) which provides both guarantee of distinct security level requirement and full-lifecycle protection for VM. We have implemented a prototype system based on Xen hypervisor to evaluate our framework. The experiment results demonstrate that our framework can provide continuous protection for virtual network environment.
{"title":"VNSS: A network security sandbox for virtual computing environment","authors":"Gao Xiaopeng, Wan Sumei, Chen Xianqin","doi":"10.1109/YCICT.2010.5713128","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713128","url":null,"abstract":"With the number of applications running upon the virtualized system increased, the virtual network circumstance becomes more and more complicated; the consequent security problems thereby have been a concern for industrial and academic fields. However, the current solutions are mostly confined to the enforcement of several patchy-works on system which still requires proficient hacking skills for administrators and cannot ensure continuous protection for VM, resulting in potential security risks. In this paper we present a framework (VNSS) which provides both guarantee of distinct security level requirement and full-lifecycle protection for VM. We have implemented a prototype system based on Xen hypervisor to evaluate our framework. The experiment results demonstrate that our framework can provide continuous protection for virtual network environment.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134251862","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.5713087
Xiao Sun
Previous works on network coding have mainly focused on the throughput and the cost of bandwidth, but few cares about saving resources used to code. In this paper we present a decentralized algorithm to construct network coding solutions, which reduces the number of coding nodes. We showed the dynamic topology greatly affected the network coding solutions, which may improve coding solution or reduce the coding nodes and we also analyzed some useful behaviors in feasible network coding solutions. By the nodes independently attempting those behaviors in dynamic topology, we introduce a fully decentralized algorithm of constructing coding solution. By simulation we found our approach has excellent performance, which achieves the approximate throughput compared to completely Randomized Network Coding, but only employing 10%–20% of nodes to code.
{"title":"A decentralized approach with fewer coding nodes for network coding multicast","authors":"Xiao Sun","doi":"10.1109/YCICT.2010.5713087","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713087","url":null,"abstract":"Previous works on network coding have mainly focused on the throughput and the cost of bandwidth, but few cares about saving resources used to code. In this paper we present a decentralized algorithm to construct network coding solutions, which reduces the number of coding nodes. We showed the dynamic topology greatly affected the network coding solutions, which may improve coding solution or reduce the coding nodes and we also analyzed some useful behaviors in feasible network coding solutions. By the nodes independently attempting those behaviors in dynamic topology, we introduce a fully decentralized algorithm of constructing coding solution. By simulation we found our approach has excellent performance, which achieves the approximate throughput compared to completely Randomized Network Coding, but only employing 10%–20% of nodes to code.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132786322","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.5713068
Kun Lu, Yuwei Wu, Yunde Jia
This paper presents a novel approach for automatic visual speech recognition using Convolutional VEF snake and canonical correlations. The utterance image sequences of isolated Chinese words are recorded with a head-mounted camera, and we use Convolutional VEF snake model to detect and track lip boundary rapidly and accurately. Geometric and motion features are both extracted from lip contour sequences and concatenated to form a joint feature descriptor. Canonical correlation is applied to measure the similarity of two utterance feature matrices and a linear discriminant function is introduced to make further improvement on the recognition accuracy. Experimental results demonstrate that our approach is promising and the joint feature descriptor is more robust than individual ones.
{"title":"Visual speech recognition using Convolutional VEF snake and canonical correlations","authors":"Kun Lu, Yuwei Wu, Yunde Jia","doi":"10.1109/YCICT.2010.5713068","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713068","url":null,"abstract":"This paper presents a novel approach for automatic visual speech recognition using Convolutional VEF snake and canonical correlations. The utterance image sequences of isolated Chinese words are recorded with a head-mounted camera, and we use Convolutional VEF snake model to detect and track lip boundary rapidly and accurately. Geometric and motion features are both extracted from lip contour sequences and concatenated to form a joint feature descriptor. Canonical correlation is applied to measure the similarity of two utterance feature matrices and a linear discriminant function is introduced to make further improvement on the recognition accuracy. Experimental results demonstrate that our approach is promising and the joint feature descriptor is more robust than individual ones.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711435","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":"1 1","pages":"0"},"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":"758 1","pages":"0"},"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":"278 1","pages":"0"},"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":"343 1","pages":"0"},"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":"60 1","pages":"0"},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：