Traffic flow data are un-periodical, nonlinear and stochastic, the practicability and accuracy are affected due to its drawbacks of falling into local optimization and low convergence rate. Thus, RBF neural network optimized by particle swarm optimization algorithm (PSO-RBFNN) is proposed to predict traffic flow in the paper. Being easy to realize, simple to operate with profound intelligence background, the parameters and connection weight are optimized by the algorithm and short time traffic flow prediction is simulated by the optimized RBF Neural Network. The prediction results of the instance show that it has better prediction results, higher precision, faster convergence than that of RBF prediction model. The optimized RBF Neural Network is suitable for short time traffic flow prediction. The method has good prediction accuracy and popularization value.
{"title":"The value of short-time traffic flow prediction in the PSO-RBFNN study","authors":"Shucai Song, Jianchen Liu, Aihua Qi, Yaohui Li, Mingzhan Zhao","doi":"10.1109/CSIP.2012.6309037","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309037","url":null,"abstract":"Traffic flow data are un-periodical, nonlinear and stochastic, the practicability and accuracy are affected due to its drawbacks of falling into local optimization and low convergence rate. Thus, RBF neural network optimized by particle swarm optimization algorithm (PSO-RBFNN) is proposed to predict traffic flow in the paper. Being easy to realize, simple to operate with profound intelligence background, the parameters and connection weight are optimized by the algorithm and short time traffic flow prediction is simulated by the optimized RBF Neural Network. The prediction results of the instance show that it has better prediction results, higher precision, faster convergence than that of RBF prediction model. The optimized RBF Neural Network is suitable for short time traffic flow prediction. The method has good prediction accuracy and popularization value.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129677211","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308805
J. He
Many different source code clone detection methods were proposed to detect clones in commercial source codes especially in large scale source codes. However, such methods are not quite fit for detecting source code clones in college students' homework because student's source code homework may have the same logic structure. Further more, we encourage students to discuss a problem before they find the solution, thus may lead to a similar result of homework. This paper gives a proper and simple method for detecting C source code clones in college students' homework to improve the teaching efficiency and reduce the workload. This method can be easily used in other languages.
{"title":"Detecting C source code clones in college students' homework","authors":"J. He","doi":"10.1109/CSIP.2012.6308805","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308805","url":null,"abstract":"Many different source code clone detection methods were proposed to detect clones in commercial source codes especially in large scale source codes. However, such methods are not quite fit for detecting source code clones in college students' homework because student's source code homework may have the same logic structure. Further more, we encourage students to discuss a problem before they find the solution, thus may lead to a similar result of homework. This paper gives a proper and simple method for detecting C source code clones in college students' homework to improve the teaching efficiency and reduce the workload. This method can be easily used in other languages.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129910375","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309121
Fuquan Yu, Zhenlong Fang, Xiaocheng Zheng
The cement rotary kiln cement production process, its control is to ensure that the cement production reached an important means of quality, high efficiency, low consumption, but not satisfied with the traditional control method of control effect, this paper based the integration of control methods of rough set and neural network control.
{"title":"Research on fusion control of cement rotary kiln based on rough set","authors":"Fuquan Yu, Zhenlong Fang, Xiaocheng Zheng","doi":"10.1109/CSIP.2012.6309121","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309121","url":null,"abstract":"The cement rotary kiln cement production process, its control is to ensure that the cement production reached an important means of quality, high efficiency, low consumption, but not satisfied with the traditional control method of control effect, this paper based the integration of control methods of rough set and neural network control.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"2008 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114087041","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309034
Shiping Zhu, Juqiang Chen
Fractal image coding method is a novel compression method, in which the local self-similarity of the image is used to eliminate cross-scale redundancy existing in image data. It receives wide academic attention with its innovative idea, high compression ratio, high decoding speed, independent resolution etc. however, for the encoding time and quality of decoding needs to be improved, there have been many new methods in fractal coding. In this paper, a survey of fractal coding development, theoretical principles, improved methods and characteristics of the application is proposed. The improved methods focus on reducing coding time, combining DCT or wavelet method and block-based division. Finally, the future direction of development and possible applications are discussed.
{"title":"Research on fractal image coding methods","authors":"Shiping Zhu, Juqiang Chen","doi":"10.1109/CSIP.2012.6309034","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309034","url":null,"abstract":"Fractal image coding method is a novel compression method, in which the local self-similarity of the image is used to eliminate cross-scale redundancy existing in image data. It receives wide academic attention with its innovative idea, high compression ratio, high decoding speed, independent resolution etc. however, for the encoding time and quality of decoding needs to be improved, there have been many new methods in fractal coding. In this paper, a survey of fractal coding development, theoretical principles, improved methods and characteristics of the application is proposed. The improved methods focus on reducing coding time, combining DCT or wavelet method and block-based division. Finally, the future direction of development and possible applications are discussed.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116209261","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309033
Shiping Zhu, Yang Yu
Virtual view synthesis is the key technology of virtual reality and multi-view video system. Thus a new algorithm based on disparity estimation and interpolation is proposed in order to achieve intermediate view of any position between original images. A method of precise matching of every pixel based on block matching in the whole image is proposed in disparity estimation. And prediction work of start point of searching is also adopted to decrease computation of disparity estimation. Image interpolation is adopted to synthesize virtual view. Reverse mapping is used as an optimizing approach to fill up the holes formed in interpolation. Satisfying visual effect is shown in experimental results when there exist few sharp edges in the scene.
{"title":"Intermediate view synthesis based on disparity estimation and image interpolation","authors":"Shiping Zhu, Yang Yu","doi":"10.1109/CSIP.2012.6309033","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309033","url":null,"abstract":"Virtual view synthesis is the key technology of virtual reality and multi-view video system. Thus a new algorithm based on disparity estimation and interpolation is proposed in order to achieve intermediate view of any position between original images. A method of precise matching of every pixel based on block matching in the whole image is proposed in disparity estimation. And prediction work of start point of searching is also adopted to decrease computation of disparity estimation. Image interpolation is adopted to synthesize virtual view. Reverse mapping is used as an optimizing approach to fill up the holes formed in interpolation. Satisfying visual effect is shown in experimental results when there exist few sharp edges in the scene.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121536013","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309046
Zhang Hua, L. Jianping, Cai Chaoshi
The paper proposes a joint precoding algorithm for cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) system that enables blind channel estimation. The study analyzes the impact of the precoding algorithm for channel estimation error and data detection error. Instead of only considering one aspect of channel estimation, as done in previous works where a fixed precoding matrix is used, the paper considers both estimation error and detection error, and then proposes a joint Hadamard precoding scheme. The method can achieve good bit-error-rate (BER) on the premise of good estimation of the channel. Some experimental results for Rayleigh channel are included to support these conclusions. In addition, it illustrates better performance of the proposed method. When the BER is 10-3,the proposed scheme can achieve more than 3dB code gain, compared with previous proposals.
{"title":"Joint precoding algorithm for OFDM blind channel estimation","authors":"Zhang Hua, L. Jianping, Cai Chaoshi","doi":"10.1109/CSIP.2012.6309046","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309046","url":null,"abstract":"The paper proposes a joint precoding algorithm for cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) system that enables blind channel estimation. The study analyzes the impact of the precoding algorithm for channel estimation error and data detection error. Instead of only considering one aspect of channel estimation, as done in previous works where a fixed precoding matrix is used, the paper considers both estimation error and detection error, and then proposes a joint Hadamard precoding scheme. The method can achieve good bit-error-rate (BER) on the premise of good estimation of the channel. Some experimental results for Rayleigh channel are included to support these conclusions. In addition, it illustrates better performance of the proposed method. When the BER is 10-3,the proposed scheme can achieve more than 3dB code gain, compared with previous proposals.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121588614","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308989
Yingxing Li, Kai-ying Deng
Tibetan people living in the Qinghai-Tibet Plateau all and some of the edge of the Qinghai-Tibet Plateau transition zone, with its unique charm dimensions world, a culture of human civilization is indispensable. Tibetan user's access interest must be shown by his behavior, to analyze user behavior, you can determine the user's interest. The user may have different degrees of interest, proposed the use of fuzzy comprehensive evaluation method to judge the degree of interest of the web page, and to verify in practice it is feasible to take into account the different pages.
{"title":"User browsing interest in the propagation of public opinion in Tibetan internet to determine research","authors":"Yingxing Li, Kai-ying Deng","doi":"10.1109/CSIP.2012.6308989","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308989","url":null,"abstract":"Tibetan people living in the Qinghai-Tibet Plateau all and some of the edge of the Qinghai-Tibet Plateau transition zone, with its unique charm dimensions world, a culture of human civilization is indispensable. Tibetan user's access interest must be shown by his behavior, to analyze user behavior, you can determine the user's interest. The user may have different degrees of interest, proposed the use of fuzzy comprehensive evaluation method to judge the degree of interest of the web page, and to verify in practice it is feasible to take into account the different pages.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114704052","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308857
Jianfeng Zhou, G. Chen
Monitoring and early warning of major hazard installations is an important part of safety management. In this paper, agent-based design and development of major hazard installations monitoring and early warning information system is discussed. This paper focuses on analysis of the Agent Communication and cooperation mechanism. Journal subscription process based Multi-Agent interaction model is proposed. The main steps and the state transition of the interaction model are analyzed. It presents the application and validation of a prototype developed to monitoring two hazard installations.
{"title":"Cooperation of the Multi-Agent System for monitoring of regional major hazard installations","authors":"Jianfeng Zhou, G. Chen","doi":"10.1109/CSIP.2012.6308857","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308857","url":null,"abstract":"Monitoring and early warning of major hazard installations is an important part of safety management. In this paper, agent-based design and development of major hazard installations monitoring and early warning information system is discussed. This paper focuses on analysis of the Agent Communication and cooperation mechanism. Journal subscription process based Multi-Agent interaction model is proposed. The main steps and the state transition of the interaction model are analyzed. It presents the application and validation of a prototype developed to monitoring two hazard installations.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114728253","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6309008
Xinan Zhang, Y. Gong
In allusion to the complexity of AVS motion estimation algorithm, On the basis of deep analysis and study to the diamond algorithm, according to the characteristics of the AVS motion estimation, this paper improves the diamond fast motion estimation algorithm and puts forward a new square-diamond algorithm. The experimental results show that compared with the diamond algorithm, it effectively reduces the required search points of the whole pixel motion estimation. The search speed is increased by 11.2% to 30.1% with an average only 0.06 dB PSNR drop. The new algorithm keeps a low coding bit rate and good image quality and improves the coding speed of the motion estimation.
{"title":"A fast motion estimation algorithm for AVS","authors":"Xinan Zhang, Y. Gong","doi":"10.1109/CSIP.2012.6309008","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6309008","url":null,"abstract":"In allusion to the complexity of AVS motion estimation algorithm, On the basis of deep analysis and study to the diamond algorithm, according to the characteristics of the AVS motion estimation, this paper improves the diamond fast motion estimation algorithm and puts forward a new square-diamond algorithm. The experimental results show that compared with the diamond algorithm, it effectively reduces the required search points of the whole pixel motion estimation. The search speed is increased by 11.2% to 30.1% with an average only 0.06 dB PSNR drop. The new algorithm keeps a low coding bit rate and good image quality and improves the coding speed of the motion estimation.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124311714","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 : 2012-09-24DOI: 10.1109/CSIP.2012.6308997
Yanfei Liu, Lunzheng Tan, Qiaoling Yi
Virtualization is core technology of cloud computing, and cloud security reference model proposed by CSA is adopted, TPM and TNA Basing on virtualization, TPM and TNA, a trusted network platform architecture scheme on cloud computing is present, the scheme can ensure not only the security of client and server, but also the integrity of provided cloud service.
{"title":"A trusted network platform architecture scheme on clouding computing model","authors":"Yanfei Liu, Lunzheng Tan, Qiaoling Yi","doi":"10.1109/CSIP.2012.6308997","DOIUrl":"https://doi.org/10.1109/CSIP.2012.6308997","url":null,"abstract":"Virtualization is core technology of cloud computing, and cloud security reference model proposed by CSA is adopted, TPM and TNA Basing on virtualization, TPM and TNA, a trusted network platform architecture scheme on cloud computing is present, the scheme can ensure not only the security of client and server, but also the integrity of provided cloud service.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127720199","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
扫码关注我们
求助内容：
应助结果提醒方式：