Pub Date : 2010-11-22DOI: 10.1109/CINC.2010.5643759
Xingbo Sun, Xiuhua Tang
Ammonium dihydrogen phosphate(DAP) is widely used in the industry. Usually this product contains impurities and substances and may not satisfy the need of modern agricultural and industrial demand, so we must dip and recrystalize for high quality product. In the process of crystallization, the nucleation rate and the growth rate are the most important parameter, then we study these parameter in order to instruct the technology of crystallization. A liquid fluidized bed crystallizer was used to determine the nucleation rate and the growth rate of ammonium dihydrogen phosphate (ADP) at crystallization temperature 15 and 25 for different saturation temperature solution. The growth rate in a Liquid fluidized bed is decided manly by the supersaturation, cooling temperature, saturation temperature and suspension density. In the paper we build a model predicting the growth rate through these conditions based on Back Propagation (BP) neural network with experimental data as training data. The experimental data, which collected from a Liquid fluidized bed, is preprocessed using the level of consistency in rough sets theory before be using as training sets in modeling process. The simulation results show that the neural network model given in this paper is capable of forecasting the behavior of growth rate exactly and rapidly, and the maximum relative error does not exceed 4.8% as compared with measured values. It also indicates the BP network has prodigious practicability.
{"title":"Prediction of the crystal's growth rate based on BPNN and rough sets","authors":"Xingbo Sun, Xiuhua Tang","doi":"10.1109/CINC.2010.5643759","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643759","url":null,"abstract":"Ammonium dihydrogen phosphate(DAP) is widely used in the industry. Usually this product contains impurities and substances and may not satisfy the need of modern agricultural and industrial demand, so we must dip and recrystalize for high quality product. In the process of crystallization, the nucleation rate and the growth rate are the most important parameter, then we study these parameter in order to instruct the technology of crystallization. A liquid fluidized bed crystallizer was used to determine the nucleation rate and the growth rate of ammonium dihydrogen phosphate (ADP) at crystallization temperature 15 and 25 for different saturation temperature solution. The growth rate in a Liquid fluidized bed is decided manly by the supersaturation, cooling temperature, saturation temperature and suspension density. In the paper we build a model predicting the growth rate through these conditions based on Back Propagation (BP) neural network with experimental data as training data. The experimental data, which collected from a Liquid fluidized bed, is preprocessed using the level of consistency in rough sets theory before be using as training sets in modeling process. The simulation results show that the neural network model given in this paper is capable of forecasting the behavior of growth rate exactly and rapidly, and the maximum relative error does not exceed 4.8% as compared with measured values. It also indicates the BP network has prodigious practicability.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122830702","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-22DOI: 10.1109/CINC.2010.5643742
Yan Ying, Luo Yingli, Lu Wenbin, Hu Bin
The detection and diagnosis for the asynchronous motors' working states under the periodically variable running condition can be achieved by using theirs electrical parameters in the continuous short intervals, and the accuracy of these parameters can directly influence the results of the diagnosis. Fourier Transform has good properties and is a traditional method to exact the electrical parameters from the input signals. Unfortunately, it is easily corrupted by the presences of the frequency fluctuation and the noninteger harmonics in the signals. To overcome this defect of Fourier Transform, this paper presents a computational algorithm based on Complex Morlet Wavelet (CMW) to calculate the motors' electrical parameters, which has better time and frequency characteristics and increases the reliability and accuracy of the detection process. Simulations are conducted to verify the superiority of the proposed algorithm and the simulation results have shown that CMW algorithm is much more reliable and has much higher calculating accuracy than Fourier algorithm.
{"title":"Calculation of the electrical parameters for asynchronous motors under the periodically variable running condition","authors":"Yan Ying, Luo Yingli, Lu Wenbin, Hu Bin","doi":"10.1109/CINC.2010.5643742","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643742","url":null,"abstract":"The detection and diagnosis for the asynchronous motors' working states under the periodically variable running condition can be achieved by using theirs electrical parameters in the continuous short intervals, and the accuracy of these parameters can directly influence the results of the diagnosis. Fourier Transform has good properties and is a traditional method to exact the electrical parameters from the input signals. Unfortunately, it is easily corrupted by the presences of the frequency fluctuation and the noninteger harmonics in the signals. To overcome this defect of Fourier Transform, this paper presents a computational algorithm based on Complex Morlet Wavelet (CMW) to calculate the motors' electrical parameters, which has better time and frequency characteristics and increases the reliability and accuracy of the detection process. Simulations are conducted to verify the superiority of the proposed algorithm and the simulation results have shown that CMW algorithm is much more reliable and has much higher calculating accuracy than Fourier algorithm.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389621","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-22DOI: 10.1109/CINC.2010.5643730
J. Jun, Fan Liang-zhong, Zhang Fu-an
A design of CAN-bus based collector for AMR (Automatic Meter Reading) system is presented in this paper. The design uses the VRS51L3074 MCU as microprocessor control unit, reed switch as sensor, CAN-bus as data transmission line, three-terminal regulator as power. Experiments show that the collector is robust and can meet the actual requirements, and it has abroad application prospects in remote measure and management fields.
{"title":"A design of CAN-bus based collector for Automatic Meter Reading system","authors":"J. Jun, Fan Liang-zhong, Zhang Fu-an","doi":"10.1109/CINC.2010.5643730","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643730","url":null,"abstract":"A design of CAN-bus based collector for AMR (Automatic Meter Reading) system is presented in this paper. The design uses the VRS51L3074 MCU as microprocessor control unit, reed switch as sensor, CAN-bus as data transmission line, three-terminal regulator as power. Experiments show that the collector is robust and can meet the actual requirements, and it has abroad application prospects in remote measure and management fields.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695158","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-22DOI: 10.1109/CINC.2010.5643818
Li Jin
This paper analyses the local behavior of the general cubic function approximation to a function which has a given power series expansion about the origin. It is shown that the general cubic Hermite-Padé form always defines a cubic function and that this function is analytic in a neighbourhood of the origin. This result holds even if the origin is a critical point of the function (i.e., the discriminant has a zero at the origin).
{"title":"Existence and local behavior of general cubic Hermite-Padé Approximation","authors":"Li Jin","doi":"10.1109/CINC.2010.5643818","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643818","url":null,"abstract":"This paper analyses the local behavior of the general cubic function approximation to a function which has a given power series expansion about the origin. It is shown that the general cubic Hermite-Padé form always defines a cubic function and that this function is analytic in a neighbourhood of the origin. This result holds even if the origin is a critical point of the function (i.e., the discriminant has a zero at the origin).","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497905","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-22DOI: 10.1109/CINC.2010.5643794
Yong Bao, Xiaowei Fu, Xiao-guang Gao
This paper presents a method of fixed-point reconnaissance path planning for Unmanned Aerial Vehicle(UAV). In this method, Particle Swarm Optimization(PSO) is introduced into reconnaissance UAV path planning algorithm, and targets value, effective reconnaissance path and other factors that impact UAV path planning are included in the objective function of PSO. The optimal solution of reconnaissance path is obtained by optimizing of PSO. At last, the simulation is carried out and satisfactory results are achieved.
{"title":"Path planning for reconnaissance UAV based on Particle Swarm Optimization","authors":"Yong Bao, Xiaowei Fu, Xiao-guang Gao","doi":"10.1109/CINC.2010.5643794","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643794","url":null,"abstract":"This paper presents a method of fixed-point reconnaissance path planning for Unmanned Aerial Vehicle(UAV). In this method, Particle Swarm Optimization(PSO) is introduced into reconnaissance UAV path planning algorithm, and targets value, effective reconnaissance path and other factors that impact UAV path planning are included in the objective function of PSO. The optimal solution of reconnaissance path is obtained by optimizing of PSO. At last, the simulation is carried out and satisfactory results are achieved.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114626632","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-22DOI: 10.1109/CINC.2010.5643895
Shilin Zhang, Bo Zhang
In this paper, we present a revised method to compute the similarity of traditional string edit distance. Given two strings X and Y over a finite alphabet, an edit distance between X and Y can be defined as the minimum weight of transforming X into Y through a sequence of weighted edit operations. Because this method lacks some types of normalization, it would bring some computation errors when the sizes of the strings that are compared are variable. In order to compute the edit distance, a new algorithm is introduced. This algorithm is shown to work in O (m*n*log(n)) time and O(n*m) memory space for strings of lengths m and n. Content-based video retrieval is a challenging field, and most research focus on the low level features such as color histogram, texture and etc. In this paper, we solve the retrieval problem by high level features used by hand language trajectory and compare the similarity by our revised string edit distance algorithms. Trajectory based video retrieval is widely explored in recent years by many excellent researchers. Experiments in trajectory-based sign language video retrieval are presented in our paper at last, revealing that our revised edit distance algorithm consistently provide better results than classical edit distances.
{"title":"Using revised string edit distance to sign language video retrieval","authors":"Shilin Zhang, Bo Zhang","doi":"10.1109/CINC.2010.5643895","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643895","url":null,"abstract":"In this paper, we present a revised method to compute the similarity of traditional string edit distance. Given two strings X and Y over a finite alphabet, an edit distance between X and Y can be defined as the minimum weight of transforming X into Y through a sequence of weighted edit operations. Because this method lacks some types of normalization, it would bring some computation errors when the sizes of the strings that are compared are variable. In order to compute the edit distance, a new algorithm is introduced. This algorithm is shown to work in O (m*n*log(n)) time and O(n*m) memory space for strings of lengths m and n. Content-based video retrieval is a challenging field, and most research focus on the low level features such as color histogram, texture and etc. In this paper, we solve the retrieval problem by high level features used by hand language trajectory and compare the similarity by our revised string edit distance algorithms. Trajectory based video retrieval is widely explored in recent years by many excellent researchers. Experiments in trajectory-based sign language video retrieval are presented in our paper at last, revealing that our revised edit distance algorithm consistently provide better results than classical edit distances.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130303490","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-22DOI: 10.1109/CINC.2010.5643867
Wei-gang Wang, H. Ni
Many engineering optimization problems frequently encounter mixed variables and nonlinear constraints, which add considerably to the solution complexity. Very few of the existing methods can yield a globally optimal solution when the objective functions are non-convex and non-differentiable. We developed a new particle swarm optimization (PSO) algorithm. The algorithm introduced a mechanism of simulated annealing (SA), crossover and mutation operator. It may improve the evolutionary rate and precision of the algorithm. We put forward a method of stochastic approximation, in order to realize the transformation from continuous variable to discrete variable. For handling constraints, we used death penalty function method. Based on engineering design problem, computational result was better than the other solutions reported in the literature. Therefore, the new algorithm is feasible, and its accuracy and robustness are obviously superior to the other algorithms.
{"title":"A new particle swarm optimization algorithm for solving constraint and mixed variables optimization problem","authors":"Wei-gang Wang, H. Ni","doi":"10.1109/CINC.2010.5643867","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643867","url":null,"abstract":"Many engineering optimization problems frequently encounter mixed variables and nonlinear constraints, which add considerably to the solution complexity. Very few of the existing methods can yield a globally optimal solution when the objective functions are non-convex and non-differentiable. We developed a new particle swarm optimization (PSO) algorithm. The algorithm introduced a mechanism of simulated annealing (SA), crossover and mutation operator. It may improve the evolutionary rate and precision of the algorithm. We put forward a method of stochastic approximation, in order to realize the transformation from continuous variable to discrete variable. For handling constraints, we used death penalty function method. Based on engineering design problem, computational result was better than the other solutions reported in the literature. Therefore, the new algorithm is feasible, and its accuracy and robustness are obviously superior to the other algorithms.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131144995","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-22DOI: 10.1109/CINC.2010.5643720
Chang-sheng Zhu, Ying-ying Gso, Lei Qian, Qing-rong Wang
Fuzzy set has become the focus method of trust model.Based on the existing research,this trust model give a description of the trust with fuzzy set theory,and trust assessment is separated two aspects which are subjective trust assessment and objective environment impact.In order to adapt to the dynamic of credibility,we use close function which from fuzzy set and distributed storage method in trust update model.Simulation experiment results show that this model is effective and rational.
{"title":"A trust model based on fuzzy set in peer-to-peer network","authors":"Chang-sheng Zhu, Ying-ying Gso, Lei Qian, Qing-rong Wang","doi":"10.1109/CINC.2010.5643720","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643720","url":null,"abstract":"Fuzzy set has become the focus method of trust model.Based on the existing research,this trust model give a description of the trust with fuzzy set theory,and trust assessment is separated two aspects which are subjective trust assessment and objective environment impact.In order to adapt to the dynamic of credibility,we use close function which from fuzzy set and distributed storage method in trust update model.Simulation experiment results show that this model is effective and rational.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133720582","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-22DOI: 10.1109/CINC.2010.5643843
Kainan Liu
the key to the intelligently early warning technology of underground mine hazards is the accurate and reliable data collected with multi-sensor timely and efficiently. In the paper, the hierarchical clustering algorithm is applied to realize the 3 hierarchical clustering application combined with the data type of hierarchical clustering and value of the security standards, in which the complementary of multi-source information is made full use of to shield its redundancy. And the application of coding technology of the definition of data frame deals wtih data transfer and optimization of transmission by events triggered, effectively improveing the accuracy and reliability of deviation data and emergency response data, to improve the efficiency of wireless sensor network data collection and transmission.
{"title":"Research on the intelligently early warning of the mine safety based on the multi-sensor data fusion technology","authors":"Kainan Liu","doi":"10.1109/CINC.2010.5643843","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643843","url":null,"abstract":"the key to the intelligently early warning technology of underground mine hazards is the accurate and reliable data collected with multi-sensor timely and efficiently. In the paper, the hierarchical clustering algorithm is applied to realize the 3 hierarchical clustering application combined with the data type of hierarchical clustering and value of the security standards, in which the complementary of multi-source information is made full use of to shield its redundancy. And the application of coding technology of the definition of data frame deals wtih data transfer and optimization of transmission by events triggered, effectively improveing the accuracy and reliability of deviation data and emergency response data, to improve the efficiency of wireless sensor network data collection and transmission.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132166141","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-22DOI: 10.1109/CINC.2010.5643822
Xian-fei Yang, Jian-pei Zhang, Yang Jing, Li Xiang
Burst Change of probability distribution at any moment is an important characteristic in data streams. When it has happened, data mining algorithm must adapt itself to new probability distribution. So how to detect burst change in data streams is an important part of data stream mining. In this paper, we proposed an algorithm BCDADS to detect it by using hoeffding theorem and independent identical distribution central limit theorem. Theory and experiment indicated this algorithm can effectively detect burst change in data streams.
{"title":"A burst change detection algorithm for data streams","authors":"Xian-fei Yang, Jian-pei Zhang, Yang Jing, Li Xiang","doi":"10.1109/CINC.2010.5643822","DOIUrl":"https://doi.org/10.1109/CINC.2010.5643822","url":null,"abstract":"Burst Change of probability distribution at any moment is an important characteristic in data streams. When it has happened, data mining algorithm must adapt itself to new probability distribution. So how to detect burst change in data streams is an important part of data stream mining. In this paper, we proposed an algorithm BCDADS to detect it by using hoeffding theorem and independent identical distribution central limit theorem. Theory and experiment indicated this algorithm can effectively detect burst change in data streams.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114848860","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
扫码关注我们
求助内容：
应助结果提醒方式：