Pub Date : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182174
Meng Liu, Wei Sun, X. Jin
This paper investigates that the high-orbit satellites enhance coverage area, using high-orbiting satellites of formation flying swing way. Through Formation flying swing of satellite design, and achieve orbit hovering configuration parameters. Simulation examples show that the method of the formation flying swing was proposed successfully enhanced coverage area of the satellite, by increasing the magnitude of the swing and reduced the distance between the satellite to high orbit satellite coverage area enhance the effect.
{"title":"On base hanging on the bottom of the swing high-orbiting satellites to enhance coverage of the research","authors":"Meng Liu, Wei Sun, X. Jin","doi":"10.1109/ICCSNT.2011.6182174","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182174","url":null,"abstract":"This paper investigates that the high-orbit satellites enhance coverage area, using high-orbiting satellites of formation flying swing way. Through Formation flying swing of satellite design, and achieve orbit hovering configuration parameters. Simulation examples show that the method of the formation flying swing was proposed successfully enhanced coverage area of the satellite, by increasing the magnitude of the swing and reduced the distance between the satellite to high orbit satellite coverage area enhance the effect.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131896870","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182014
Linyang Sheng, Jingbo Shao
Energy saving has been heated topic for years for Ad Hoc network. This paper presents a comprehensive power-aware approach to DSR (CP-DSR) in terms of the shortcomings of current solution of lacking comprehensive energy saving strategy. In routing level, enhancement is implemented for current energy saving algorithm, and power control is carried out during data transmission to reduce energy. Experimental results demonstrate the advantages of the proposed method over previous solutions.
{"title":"A comprehensive power-aware approach to improved DSR","authors":"Linyang Sheng, Jingbo Shao","doi":"10.1109/ICCSNT.2011.6182014","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182014","url":null,"abstract":"Energy saving has been heated topic for years for Ad Hoc network. This paper presents a comprehensive power-aware approach to DSR (CP-DSR) in terms of the shortcomings of current solution of lacking comprehensive energy saving strategy. In routing level, enhancement is implemented for current energy saving algorithm, and power control is carried out during data transmission to reduce energy. Experimental results demonstrate the advantages of the proposed method over previous solutions.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133854579","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182260
Qian Yang
News video captions have an important role in video analysis and retrieval. First, the article analyzed the algorithm of news video caption detection, then, analyzed the algorithm of the video subtitle processing based on the analysis of wavelet transform, consequently, analyzed the algorithm of the caption segmentation on the basis of the analysis of the line projection and the column projection. At last, the article realized the news video caption recognition using a similarity measure formula. Experiment showed that the algorithm can effectively segment the video caption and recognized the caption efficiency, which can satisfy the need of video analysis and retrieval.
{"title":"An improved algorithm of news video caption detection and recognition","authors":"Qian Yang","doi":"10.1109/ICCSNT.2011.6182260","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182260","url":null,"abstract":"News video captions have an important role in video analysis and retrieval. First, the article analyzed the algorithm of news video caption detection, then, analyzed the algorithm of the video subtitle processing based on the analysis of wavelet transform, consequently, analyzed the algorithm of the caption segmentation on the basis of the analysis of the line projection and the column projection. At last, the article realized the news video caption recognition using a similarity measure formula. Experiment showed that the algorithm can effectively segment the video caption and recognized the caption efficiency, which can satisfy the need of video analysis and retrieval.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115468646","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182416
Hao Lu, Wenjian Zheng, Tianbao Wang, Shaohua Wang
In many applications of geographic information science, we often need to calculate the shortest path from the source point to the target points. Network data model can be computed using the graph theory algorithm, when faced with raster data model, the grid cells of raster will be treated as network model nodes in general, and the eight neighborhood unit of each grid cell will be treated as the direct neighbor nodes in network model. Some scholars have pointed out that this algorithm which network model directly transplanted easily lead to the wrong direction in path finding and the high cumulative cost value problem, and gives the improved algorithm called wave spread cost distance algorithm. In this paper, we research and make experiments with the wave spread cost distance algorithm and then carried out further improvements, making the analysis of exception handling and the algorithm overall efficiency has been improved.
{"title":"An effective cost distance calculation based on raster data model improved algorithm","authors":"Hao Lu, Wenjian Zheng, Tianbao Wang, Shaohua Wang","doi":"10.1109/ICCSNT.2011.6182416","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182416","url":null,"abstract":"In many applications of geographic information science, we often need to calculate the shortest path from the source point to the target points. Network data model can be computed using the graph theory algorithm, when faced with raster data model, the grid cells of raster will be treated as network model nodes in general, and the eight neighborhood unit of each grid cell will be treated as the direct neighbor nodes in network model. Some scholars have pointed out that this algorithm which network model directly transplanted easily lead to the wrong direction in path finding and the high cumulative cost value problem, and gives the improved algorithm called wave spread cost distance algorithm. In this paper, we research and make experiments with the wave spread cost distance algorithm and then carried out further improvements, making the analysis of exception handling and the algorithm overall efficiency has been improved.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489090","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6181925
Yingjie Zhang, Zhengyuan Xu, Ning Ge
The problem of code acquisition in a direct-sequence spread-spectrum(DSSS) system in dense multipath environment is addressed. And the performance improvement of this acquisition has been a difficult issue, because the theoretical analysis is both complex and not accurate enough. In this paper, we propose a mathematical analysis based on the theory of flow graph, which has significantly reduced computation complexity by about 92% and helped to optimize parameters to get a better performance. This method is both systematic and general. Simulation indicates the accuracy and usefulness of this method of analysis.
{"title":"A new analysis of double-dwell serial search and its performance in direct-sequence spread-spectrum systems","authors":"Yingjie Zhang, Zhengyuan Xu, Ning Ge","doi":"10.1109/ICCSNT.2011.6181925","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181925","url":null,"abstract":"The problem of code acquisition in a direct-sequence spread-spectrum(DSSS) system in dense multipath environment is addressed. And the performance improvement of this acquisition has been a difficult issue, because the theoretical analysis is both complex and not accurate enough. In this paper, we propose a mathematical analysis based on the theory of flow graph, which has significantly reduced computation complexity by about 92% and helped to optimize parameters to get a better performance. This method is both systematic and general. Simulation indicates the accuracy and usefulness of this method of analysis.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124149687","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182422
Qingshan Gao, Xuran Zhang, J. Yue, Yuanqiang Wan
This paper proposes the technology of land and resources law censorial information interaction based on Web Service to solve the existing problem of information exchanging behind time, inconvenient or not enough. This technology can easily and rapidly exchange the business information of track, parcel, personnel and mission among multi-level law censorial platforms of land and resources. What's more, this technology can set an example for other multi-level information interaction systems.
{"title":"Research on multi-level platforms of land and resources law censorial information interaction based on Web Service","authors":"Qingshan Gao, Xuran Zhang, J. Yue, Yuanqiang Wan","doi":"10.1109/ICCSNT.2011.6182422","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182422","url":null,"abstract":"This paper proposes the technology of land and resources law censorial information interaction based on Web Service to solve the existing problem of information exchanging behind time, inconvenient or not enough. This technology can easily and rapidly exchange the business information of track, parcel, personnel and mission among multi-level law censorial platforms of land and resources. What's more, this technology can set an example for other multi-level information interaction systems.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124319855","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182403
Tao Wu, Yusong Yan, Xi Chen
Particle Swarm Optimization (PSO) is one of the newly developed intelligence optimization algorithms. With its simple concept, few parameters and scalable performance, PSO has become a very promising optimization tool and attracted extensive attention. In this paper, probabilistic analysis on swarm diversity in Adaptive Partly Informed Particle Swarm Optimization algorithm (API-PSO) was conducted. From the analysis results we can learn that the expectation of population diversity in the next moment are affected by the population size, problem-solving dimensions, the topology and the specific optimization function to be solved, etc. We also get the relationship between the current population diversity and the state of next time. This information could serve as the theoretic basis to solve swarm diversity lack, facilitate swarm evolution development and improve algorithm performance.
{"title":"Population diversity analysis of The Adaptive Partly Informed PSO algorithm","authors":"Tao Wu, Yusong Yan, Xi Chen","doi":"10.1109/ICCSNT.2011.6182403","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182403","url":null,"abstract":"Particle Swarm Optimization (PSO) is one of the newly developed intelligence optimization algorithms. With its simple concept, few parameters and scalable performance, PSO has become a very promising optimization tool and attracted extensive attention. In this paper, probabilistic analysis on swarm diversity in Adaptive Partly Informed Particle Swarm Optimization algorithm (API-PSO) was conducted. From the analysis results we can learn that the expectation of population diversity in the next moment are affected by the population size, problem-solving dimensions, the topology and the specific optimization function to be solved, etc. We also get the relationship between the current population diversity and the state of next time. This information could serve as the theoretic basis to solve swarm diversity lack, facilitate swarm evolution development and improve algorithm performance.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124345018","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182432
Guilian Su, Lu-Sha Han, Fang Huang, Boya Yang
This paper studies how to detect the presence of covert information in the color images. A algorithm on statistic characteristic of the color images is presented. Firstly, image's eigenvector is extracted on color change of original images and stegoimages. Then, the set of image are classified using suppor vector machine. Theoretically, we analyzed the methods correction; experimentally, validate the effect.
{"title":"A steganalysis algorithm based on statistic characteristics of the color images","authors":"Guilian Su, Lu-Sha Han, Fang Huang, Boya Yang","doi":"10.1109/ICCSNT.2011.6182432","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182432","url":null,"abstract":"This paper studies how to detect the presence of covert information in the color images. A algorithm on statistic characteristic of the color images is presented. Firstly, image's eigenvector is extracted on color change of original images and stegoimages. Then, the set of image are classified using suppor vector machine. Theoretically, we analyzed the methods correction; experimentally, validate the effect.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114830186","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182227
Qiaowei Li, Shuangyuan Yang, Senxing Zhu
Image segmentation, extracting characteristics target from the image for user's requirements, the optimum threshold selection of image segmentation is the key technique. Traditional 2-d maximum entropy image segmentation algorithms use exhaustive way to find the optimal threshold, which is time-consuming, low efficient, and easy to generate the false division. In order to improve the accuracy and efficiency of image segmentation, this paper puts forward a genetic algorithm of 2- d maximum entropy value for image segmentation and makes some improvements in genetic algorithms coding, crossover operator, and mutation operator. Simulation experiments have proved that the new algorithm can greatly shorten the time for optimization, enhance the anti-noise capability in the segmentation process, and improve the efficiency of image segmentation.
{"title":"Image segmentation based on the 2-D maximum entropy value and improved genetic algorithm","authors":"Qiaowei Li, Shuangyuan Yang, Senxing Zhu","doi":"10.1109/ICCSNT.2011.6182227","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182227","url":null,"abstract":"Image segmentation, extracting characteristics target from the image for user's requirements, the optimum threshold selection of image segmentation is the key technique. Traditional 2-d maximum entropy image segmentation algorithms use exhaustive way to find the optimal threshold, which is time-consuming, low efficient, and easy to generate the false division. In order to improve the accuracy and efficiency of image segmentation, this paper puts forward a genetic algorithm of 2- d maximum entropy value for image segmentation and makes some improvements in genetic algorithms coding, crossover operator, and mutation operator. Simulation experiments have proved that the new algorithm can greatly shorten the time for optimization, enhance the anti-noise capability in the segmentation process, and improve the efficiency of image segmentation.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114530539","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182302
L. Congying, Zhao Huanping, Yang Xinfeng
The paper uses a particle swarm optimization (ab. PSO) algorithm to solve the quadratic assignment problem (ab. QAP), and propose a novel particle presentation for the problem. The experimental results on different QAP instances show that this algorithm is able to find good solutions efficiently. PSO has got many successful applications in many continuous domain optimization problems, but is seldom applied in discrete domain. It is a kind of brand-new attempt that this paper uses PSO algorithm to solve QAP problem. It is undoubtedly enlightening us to utilize PSO algorithm to discrete domain problem (especially combinatorial optimization), and it will establish the foundation of further investigation at the same time.
{"title":"Particle swarm optimization algorithm for quadratic assignment problem","authors":"L. Congying, Zhao Huanping, Yang Xinfeng","doi":"10.1109/ICCSNT.2011.6182302","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182302","url":null,"abstract":"The paper uses a particle swarm optimization (ab. PSO) algorithm to solve the quadratic assignment problem (ab. QAP), and propose a novel particle presentation for the problem. The experimental results on different QAP instances show that this algorithm is able to find good solutions efficiently. PSO has got many successful applications in many continuous domain optimization problems, but is seldom applied in discrete domain. It is a kind of brand-new attempt that this paper uses PSO algorithm to solve QAP problem. It is undoubtedly enlightening us to utilize PSO algorithm to discrete domain problem (especially combinatorial optimization), and it will establish the foundation of further investigation at the same time.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114715211","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
扫码关注我们
求助内容：
应助结果提醒方式：