As one type of the attacks happening in MAC layer of distributed cognitive radio networks, a selfish behavior can degrade network performance significantly. In this paper, we analyze the characteristics of selfish behavior and the methods how to expose it. In order to improve the self-giving cooperation between the nodes in cognitive radio networks and increase the fairness index of the whole networks, a rigorous punishment mechanism based on a puzzle model was proposed in this paper. The punishment mechanism was used both in a common control channel and a data channel. The results of stimulations show that the proposed punishment mechanism increases the fairness index of the cognitive radio networks and improves the self-giving cooperation between nodes in the networks.
{"title":"An Improved Security Mechanism in Cognitive Radio Networks","authors":"Huayi Wu, Baohua Bai","doi":"10.1109/ICICIS.2011.91","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.91","url":null,"abstract":"As one type of the attacks happening in MAC layer of distributed cognitive radio networks, a selfish behavior can degrade network performance significantly. In this paper, we analyze the characteristics of selfish behavior and the methods how to expose it. In order to improve the self-giving cooperation between the nodes in cognitive radio networks and increase the fairness index of the whole networks, a rigorous punishment mechanism based on a puzzle model was proposed in this paper. The punishment mechanism was used both in a common control channel and a data channel. The results of stimulations show that the proposed punishment mechanism increases the fairness index of the cognitive radio networks and improves the self-giving cooperation between nodes in the networks.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129305902","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}
Texture synthesis is a technique of generate new large image, from a small sample, that different from the original but has the same visual appearance. This technique is very valuable for filling missing information in images. In this paper, we apply Markov Random Fields (MRF) based texture synthesis technology to fill in occlusion areas on remotely sensed images. In order to improve the quality of results, we use GIS vector data to help to fill in the occlusion regions. Experiments show that the proposed method can obtain satisfying results and is practical in remote sensing application.
{"title":"Fill in Occlusion Regions on Remotely Sensed Images Using Texture Synthesis Technique","authors":"Renxi Chen, Xinhui Li","doi":"10.1109/ICICIS.2011.20","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.20","url":null,"abstract":"Texture synthesis is a technique of generate new large image, from a small sample, that different from the original but has the same visual appearance. This technique is very valuable for filling missing information in images. In this paper, we apply Markov Random Fields (MRF) based texture synthesis technology to fill in occlusion areas on remotely sensed images. In order to improve the quality of results, we use GIS vector data to help to fill in the occlusion regions. Experiments show that the proposed method can obtain satisfying results and is practical in remote sensing application.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126642021","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}
This paper gets two main conclusions about ®-times integrated C semi groups based on the Hille exponential formulas of the other kinds of semi groups, the generation theorem in terms of the Laplace transform and the properties of exponential bounded ®-times integrated C semi groups. One is the representation theorem, the other is the Laplace inverse transform as well as two deductions.
{"title":"Some Conclusions about alpha-times Integrated C Semigroups","authors":"Chunjing Liu, Xiaoqiu Song, Tao Wang","doi":"10.1109/ICICIS.2011.22","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.22","url":null,"abstract":"This paper gets two main conclusions about ®-times integrated C semi groups based on the Hille exponential formulas of the other kinds of semi groups, the generation theorem in terms of the Laplace transform and the properties of exponential bounded ®-times integrated C semi groups. One is the representation theorem, the other is the Laplace inverse transform as well as two deductions.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123003138","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 existence of local analytic solutions of an iterative functional differential equation is studied. As well as in previous works, we reduce this problem with the Schrodƒtƒt er transformation to finding analytic solutions of a functional equation without iteration of the unknown function x. For technical reasons, in previous works the constant ƒÑ given in the Schroƒtƒtder transformation is required to fulfil that ƒÑ is off the unite circle s1 or lies on the circle with the Diophantine condition. In this paper, we obtain analytic solutions in the case of ƒÑ at resonance, i.e., at a root of the unity and the case of near resonance under the Brjuno condition.
{"title":"Analytic Solutions of an Iterative Functional Differential Equation Near Resonance","authors":"Lingxia Liu","doi":"10.1109/ICICIS.2011.15","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.15","url":null,"abstract":"In this paper existence of local analytic solutions of an iterative functional differential equation is studied. As well as in previous works, we reduce this problem with the Schrodƒtƒt er transformation to finding analytic solutions of a functional equation without iteration of the unknown function x. For technical reasons, in previous works the constant ƒÑ given in the Schroƒtƒtder transformation is required to fulfil that ƒÑ is off the unite circle s1 or lies on the circle with the Diophantine condition. In this paper, we obtain analytic solutions in the case of ƒÑ at resonance, i.e., at a root of the unity and the case of near resonance under the Brjuno condition.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126301911","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 order to improve the performance of the car, the paper mainly introduces the use of genetic algorithm for the best match of automotive power train parameters, The author mainly explains the optimized theory and a computer simulation program is developed. Moreover, the author discusses the problems occurring in the object and gives the methods to solve them. The result of simulation is analyzed.
{"title":"Simulation Study of Optimization of GA for Vehicle Power Train","authors":"C. Fangxiao, L. Xudong, Li Xiaomei","doi":"10.1109/ICICIS.2011.86","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.86","url":null,"abstract":"In order to improve the performance of the car, the paper mainly introduces the use of genetic algorithm for the best match of automotive power train parameters, The author mainly explains the optimized theory and a computer simulation program is developed. Moreover, the author discusses the problems occurring in the object and gives the methods to solve them. The result of simulation is analyzed.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126572380","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}
Xiaoming Yao, W.-C. Du, Taijun Li, Longjuan Wang, Honglei Li, H. Wu, Zequn Wang
How to stipulate data consistence is very important when developing software packages for integrating or modifying the existing distributed vision-based traffic surveillance systems into a larger one. We extend our previous holonic architecture to verify formally the data consistence of the novel system via an intermediate modular using a STF-based set theoretical approach under the assumption that all existing subsystems are data consistent.
{"title":"Data Consistence for Distributed Vision-based Traffic Surveillance Systems","authors":"Xiaoming Yao, W.-C. Du, Taijun Li, Longjuan Wang, Honglei Li, H. Wu, Zequn Wang","doi":"10.1109/ICICIS.2011.26","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.26","url":null,"abstract":"How to stipulate data consistence is very important when developing software packages for integrating or modifying the existing distributed vision-based traffic surveillance systems into a larger one. We extend our previous holonic architecture to verify formally the data consistence of the novel system via an intermediate modular using a STF-based set theoretical approach under the assumption that all existing subsystems are data consistent.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144643","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 min-max information (MMI) clustering algorithm was proposed in [8] for robust detection and separation of spherical shells. In current paper, we make efforts to revisit the proposed MMI algorithm theoretically and practically. Firstly, we present the theoretical derivations of the MMI clustering algorithm, i.e., the detailed derivations of the minimization and maximization optimization of the mutual information. Secondly, several insights on the selection of the pruning parameter ¸ are also discussed in this paper.
{"title":"Theoretical Derivations of Min-Max Information Clustering Algorithm","authors":"Chi Zhang, Xulei Yang, G. Zhao, J. Wan","doi":"10.1109/ICICIS.2011.38","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.38","url":null,"abstract":"The min-max information (MMI) clustering algorithm was proposed in [8] for robust detection and separation of spherical shells. In current paper, we make efforts to revisit the proposed MMI algorithm theoretically and practically. Firstly, we present the theoretical derivations of the MMI clustering algorithm, i.e., the detailed derivations of the minimization and maximization optimization of the mutual information. Secondly, several insights on the selection of the pruning parameter ¸ are also discussed in this paper.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115256786","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}
Traditional sculling algorithms make use of incremental output of gyros and accelerometers to design algorithms, when they are applied to fiber-optical gyro (FOG) strap down inertial system (SINS), whose gyros output angular rate signal, we should simulate incremental signals by angular rate, which not only increases design difficulty but also reduce calculation accuracy. In view of this, an improved sculling algorithm was proposed, which made use of angular rate/specific force signal directly, and the error formula was derived in the condition of sculling input. Theoretical deduction and simulation results indicate: precision of improved algorithms are far superior to that of traditional ones.
{"title":"Study on Optimized Coefficients and Error of Sculling Algorithm","authors":"L. Heng, Zhang Jing-yuan, Shen Jian, Luo Xuan","doi":"10.1109/ICICIS.2011.135","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.135","url":null,"abstract":"Traditional sculling algorithms make use of incremental output of gyros and accelerometers to design algorithms, when they are applied to fiber-optical gyro (FOG) strap down inertial system (SINS), whose gyros output angular rate signal, we should simulate incremental signals by angular rate, which not only increases design difficulty but also reduce calculation accuracy. In view of this, an improved sculling algorithm was proposed, which made use of angular rate/specific force signal directly, and the error formula was derived in the condition of sculling input. Theoretical deduction and simulation results indicate: precision of improved algorithms are far superior to that of traditional ones.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651651","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 subspace blind channel estimation algorithm based on repetition index is proposed in this paper. Compared with the original blind channel estimation algorithm, the number of received symbols needed for achieving the desired estimation is reduced greatly, which relaxes the requirement that the unknown channel must remain time invariant during estimation. Simulation results show that the proposed scheme has similar or even better performance with fewer received symbols over the referenced subspace-based methods.
{"title":"Blind Channel Estimation for MIMO-OFDM Systems Based on Repetition Index","authors":"Xiang Shao, Jian Chen, Yonghong Kuo","doi":"10.1109/ICICIS.2011.71","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.71","url":null,"abstract":"A subspace blind channel estimation algorithm based on repetition index is proposed in this paper. Compared with the original blind channel estimation algorithm, the number of received symbols needed for achieving the desired estimation is reduced greatly, which relaxes the requirement that the unknown channel must remain time invariant during estimation. Simulation results show that the proposed scheme has similar or even better performance with fewer received symbols over the referenced subspace-based methods.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816205","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}
For the problems such as monitoring for dangerous goods transport costs are high, sensor access is not flexible, single function, the network robustness is poor, to achieve long distance transmission is difficult, combining sensor technology, WSN technology and 3G technology, this paper has designed a perceptual system of the dangerous goods in transit escort which is flexible in structure, fast of layout, reliable for information transmission. Applications in practice show that the system has achieved the moving target location tracking and communications, environmental argument of motion detection and pre-alarm, improved the speed and responding precision of informing danger, reduced insecure incidents of dangerous goods during transport, ultimately, realized the pre-alarm function.
{"title":"Perceptual System of the Dangerous Goods in Transit Escort Based on WSN","authors":"Liu Jun, Yang Chao, W. Cong","doi":"10.1109/ICICIS.2011.139","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.139","url":null,"abstract":"For the problems such as monitoring for dangerous goods transport costs are high, sensor access is not flexible, single function, the network robustness is poor, to achieve long distance transmission is difficult, combining sensor technology, WSN technology and 3G technology, this paper has designed a perceptual system of the dangerous goods in transit escort which is flexible in structure, fast of layout, reliable for information transmission. Applications in practice show that the system has achieved the moving target location tracking and communications, environmental argument of motion detection and pre-alarm, improved the speed and responding precision of informing danger, reduced insecure incidents of dangerous goods during transport, ultimately, realized the pre-alarm function.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"106 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009157","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
扫码关注我们
求助内容：
应助结果提醒方式：