{"title":"Blind Equalization Based on Neural Network under LS Criterion by Gradient Iteration Algorithm","authors":"Xiao Ying, Dong Yu-hua","doi":"10.1109/ICNC.2009.134","DOIUrl":"https://doi.org/10.1109/ICNC.2009.134","url":null,"abstract":"A blind equalization based on neural network under LS criterion was proposed in this paper and gradient iteration algorithm adopted to avoid computing the reverse matrix of correlation of input signal. The BP algorithm in the traditional blind equalization based on feedforward neural network is a stochastic gradient descent algorithm, which has low convergence rate and high residual error; meanwhile, it is often absorbed in locally minimum. The method proposed in this paper has better performance and no adding computation complexity compare with BP algorithm. Simulation results show that the equalization performance is improved under the nonlinear communication channel condition.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122018067","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}
{"title":"Using SOM to Mine Product Features from Free-Text Customer Reviews","authors":"Chuanming Yu, Lu An, Xiaoqing Zhang","doi":"10.1109/ICNC.2009.359","DOIUrl":"https://doi.org/10.1109/ICNC.2009.359","url":null,"abstract":"This study examines how the Self-Organizing Map (SOM) technique can be used to identify product features from free-text customer reviews. A novel SOM display named “Attribute Accumulative Matrix” is presented. To verify the validity of the proposed approach, 22157 restaurant reviews are collected and product features of catering industry are identified. The experiment results show that this approach can effectively identify the product features.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129858844","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}
{"title":"Travel Time Prediction Method for Urban Expressway Link Based on Artificial Neural Network","authors":"Liying Wei, Zhiwei Fang, Shu Luan","doi":"10.1109/ICNC.2009.448","DOIUrl":"https://doi.org/10.1109/ICNC.2009.448","url":null,"abstract":"According to the floating-car data measured from urban links, some data-processing techniques including data mending, wavelet de-noise and others are used to establish a time series of data to better reflect the original running characteristic of urban links. On this basis, the travel time forecasting researches are executed both by the BP neural network based on Bayesian Regularization algorithm and the genetic algorithm based on BP network. In this period, several prediction schemes are designed according to different network architecture and sample data. What’s more, the validity evaluation and the results contrast are performed. The experiments prove that the genetic algorithm based on BP artificial neural network is more practical and can improve the precision better.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750100","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}
{"title":"Identifying Kinetic Constants by the Intrinsic Properties of Markov Chain","authors":"Xuyan Xiang, Yingchun Deng, Xiangqun Yang","doi":"10.1109/ICNC.2009.521","DOIUrl":"https://doi.org/10.1109/ICNC.2009.521","url":null,"abstract":"The process underlying the opening and closing of ion channels in biological can be modelled kinetically as a time-homogeneous Markov chain. How to identify the kinetic constants (transition rates) that measure the 'speed' to jump from one state to another plays a very important role in ion channels. Maximum likelihood method is widely employed for estimating the kinetic constants. However it leads to the non-identifiability since the joint probability distributions could be the same to models with different generator matrices, and the estimation could be very rough since it involves the estimating of some latent variables. Here we develop a totally different approach to supply a gap. Our algorithms employ the intrinsic properties of the Markov process and all calculations are simply reduced to the estimation of their PDFs (probability density functions) of lifetime and death-time of observable states. Once we have them, all subsequent calculations are then automatic and exact. In the current paper, four classical mechanisms: star-graph, line,star-graph branch and (reversible) cyclic chain, are considered to single-ion channels. It is found that all kinetic constants are uniquely determined by the PDFs of their lifetime and death-time for partially (a few) observable states. Numerical examples are included to demonstrate the application of our approach to data.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128340849","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}
{"title":"On the Inviscid Limit for the 2D Non-dissipative Quasi-geostrophic Equations","authors":"Linrui Li, Shu Wang","doi":"10.1109/ICNC.2009.451","DOIUrl":"https://doi.org/10.1109/ICNC.2009.451","url":null,"abstract":"In this paper we prove the inviscid limit for the 2D non-dissipative quasi-geostrophic equations, and study the global existence on the weak solution. Our proofs are based on the vanishing viscosity method.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545948","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}
{"title":"Understanding the Behavior of Structure from Motion Problem with False Focal Length","authors":"Qiu Ning, Xu Xiang","doi":"10.1109/ICNC.2009.314","DOIUrl":"https://doi.org/10.1109/ICNC.2009.314","url":null,"abstract":"After intensive research in the past two decades, the geometric and computational aspect of structure from motion (SFM) seems well studied. However, the state of the art is that a practical SFM algorithm that can handle general visual tasks in the real world is still unavailable. One of the contributing reasons is that the first step of SFM involves solving an ill-conditioned problem. In this paper, we present an expressions to describe the error behavior of egomotion estimation when the focal length is calibrated with error. The key results are independent of both the egomotion estimation as well as the calibration algorithms. We show the bas-relief valley will be rotated according to the error in the focal length, in a way that is dependent on the motion-scene configuration. One important suggestion is that, provided that one knows the rough range of the true focal length, setting a larger-than-true focal length helps to estimate the direction of translation better though possibly with larger biases.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128563630","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}
{"title":"Architectures and Algorithms for Multi-source Object Detection and Tracking","authors":"Xiuhui Wang, Junqin Wen","doi":"10.1109/ICNC.2009.643","DOIUrl":"https://doi.org/10.1109/ICNC.2009.643","url":null,"abstract":"Target tracking using multiple information sources can generally provide better performance and reliability than using a single one. The paper proposes a new solution for multi-source Information collection and retrieval. Two processing architectures and sensors for information collection are presented: cameras to image sequences, and radio transmitters to RFID information. Algorithms related to the information fusion between sensors are discussed. Test results show that the proposed solution is capable to track objects with a good degree of precision. Abrupt changes of lighting conditions can also be handled, especially when photometric invariant color features are used.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128611205","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}
{"title":"Matrix Multiplication Based on DNA Computing","authors":"Guozhi Zhang, Shiying Wang","doi":"10.1109/ICNC.2009.11","DOIUrl":"https://doi.org/10.1109/ICNC.2009.11","url":null,"abstract":"In this paper, a directed graph is defined for the product of two matrices whose elements are rational numbers. There is a relation between the directed graph and the matrix multiplication. The product of two matrices whose elements are rational numbers is solved by DNA computing.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128623228","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}
{"title":"Privacy-Preserving SVM Classification on Vertically Partitioned Data without Secure Multi-party Computation","authors":"Huang Yunhong, Fang Liang, H. Guoping","doi":"10.1109/ICNC.2009.120","DOIUrl":"https://doi.org/10.1109/ICNC.2009.120","url":null,"abstract":"With the development of information science and modern technology, it becomes more important about how to protect privacy information. In this paper, a novel privacy-preserving support vector machine (SVM) classifier is put forward for a vertically partitioned data. The proposed SVM classifier, which is public but does not reveal the privately-held data, has accuracy comparable to that of an ordinary SVM classifier based on the original data. We prove the feasibility of our algorithms by using matrix factorization theory and show the security without using the secure multi-party computation.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666219","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}
{"title":"Cultural Particle Swarm Optimization Neural Network and Its Application in Soft-Sensing Modeling","authors":"Guochu Chen, Jinshou Yu","doi":"10.1007/11539117_86","DOIUrl":"https://doi.org/10.1007/11539117_86","url":null,"abstract":"","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124637570","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}