{"title":"Decoupling control for nonlinear coupling systems based on CMAC & PID","authors":"Yi Tang, Runhua Wang","doi":"10.1109/COGINF.2009.5250722","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250722","url":null,"abstract":"In order to actualize decoupling control for nonlinear multivariate coupling system, A multivariate self-adapting decoupling control method based on CMAC and PID was proposed in this studies, and its algorithm was designed in detail. The control strategy utilizes PID controller and CMAC to combine a composite controller. Outputs of multiple same composite controllers are mapped by MIMO linear neural networks into final control actions. Because of characteristics of neural networks, multivariate control system can approach reference model, and the decoupling control aim was achieved. The simulation results show that the strategy realized effectively decoupling control for multivariate coupling system, and is good at anti-disturbance ability and strong in robustness. So the control strategy can realize the decoupling control of the multivariate nonlinear coupling system.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115453611","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}
F. Pelayo, L. D. L. Ossa, F. Cuartero, Maria L. Pelayo, J. L. Guirao
{"title":"Towards the Evolutionary Process Algebra","authors":"F. Pelayo, L. D. L. Ossa, F. Cuartero, Maria L. Pelayo, J. L. Guirao","doi":"10.1109/COGINF.2009.5250810","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250810","url":null,"abstract":"Genetic Algorithms, GA's are metaheuristic techniques that have obtained good results in problems in which exhaustive techniques fail due to the size of the search space. GA's [1], [2] have been widely used to solve problems in the fields of combinatorial and numerical optimization.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121099160","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":"Binary fuzzy rough set model based on triangle modulus and its application to image processing","authors":"Dan Wang, Mengda Wu","doi":"10.1109/COGINF.2009.5250738","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250738","url":null,"abstract":"Rough sets theory is an important tool that process uncertainty information. In this paper, image processing based on rough sets theory is discussed in detail. The paper presents a binary fuzzy rough set model based on triangle modulus, which describes binary relationship by upper approximation and lower approximation. As image can be described by binary relationship, the upper approximation and lower approximation can be used to represent an image. The model in this paper is well fit for processing image that have gentle gray change. An edge detection algorithm by the upper approximation and the lower approximation of image is presented, and image denoising also is discussed. At last, its better effect can be testified by many experiments","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127268884","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":"A new modified PSO based on black stork foraging process","authors":"Xingjuan Cai","doi":"10.1109/COGINF.2009.5250686","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250686","url":null,"abstract":"Cognitive parameter plays an important role in particle swarm optimization. Although many cognitive parameter selection strategies are proposed, there is still much work need to do. This paper proposes an individual cognitive parameter setting method by simulating the black stork foraging process. It chooses the cognitive value of each particle associated with its age dominated by its performance. For particles whose performances is better than average performance of the swarm, their cognitive values is set between [1.5, 2.5], while other cognitive values are chosen between [0.5, 1.5]. Simulation results show the modified particle swarm optimization based on this phenomenon is superior to two variants of particle swarm optimization.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129942951","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":"Research on the neural networks and the geodetic number of the graph","authors":"Jianxiang Cao, Bin Wu, Minyong Shi","doi":"10.1109/COGINF.2009.5250702","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250702","url":null,"abstract":"Graph theory is the fundamental basis of the neural networks. This paper reports the investigation work of the relationships between artificial neural networks and graph theory, and presents the analysis of the specific issues relating to the change of the geodetic number due to operations on the graphs. Recent research work on the geodetic number of graphs has been found in the literature. Determining the geodetic number of arbitrary graph can be proved to be NP-hard. However, a fundamental issue in graph theory concerns how a parameter value is affected after small changes executed to the graph. This issue is analyzed in the authors' research by adding or contracting an edge to the graph.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128738738","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":"Representative heuristic psychology and overreaction in international petroleum futures market","authors":"Shuping Wang, Xiong Kuang, Z. Wu","doi":"10.1109/COGINF.2009.5250715","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250715","url":null,"abstract":"The representative heuristic psychology is one of the unreasonable psychologies existing in the financial market. A novel research idea is given in this paper: using the corresponding relation and grey interconnect degree to check this psychology in the international petroleum futures market, and give an empirical test for some events such as OPEC meetings and the war. At the same time, we also verify the overreaction behavior, which is tightly connected with the representative heuristic psychology, by the way of events study. The results show that there is no obvious representative heuristic psychology in the petroleum futures market, but existing overreaction behavior.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132514011","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":"A self-synchronous stream cipher based on composite discrete chaos","authors":"Weng Yifang, Zheng Rong, Chen Yi","doi":"10.1109/COGINF.2009.5250746","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250746","url":null,"abstract":"A new methodology by combining chaotic generalized synchronization technique with composite discrete chaotic mappings for self-synchronous stream cipher is proposed to meet the need of secure communication in distributed virtual reality battlefield. The work also concerns the decline of sensitivity to initial conditions caused by synchronization mechanism. The encryption algorithm is developed with it. Since it belongs to asymmetric cryptosystem, it is safe in architecture. The numerical simulation results show that the sequences keep high sensitivity to initial conditions. They are close to ideal randomness with uniform distribution and nice correlation properties. Therefore the validity and feasibility of the proposed methodology are verified.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133821843","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}
D. Bhattacharyya, Jhuma Dutta, P. Das, Rathit Bandyopadhyay, S. Bandyopadhyay, Tai-hoon Kim
{"title":"Discrete Fourier Transformation based Image Authentication technique","authors":"D. Bhattacharyya, Jhuma Dutta, P. Das, Rathit Bandyopadhyay, S. Bandyopadhyay, Tai-hoon Kim","doi":"10.1109/COGINF.2009.5250756","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250756","url":null,"abstract":"In this paper a novel technique, Discrete Fourier Transformation based Image Authentication (DFTIAT) has been proposed to authenticate an image and with its own application one can also transmit secret message or image over the network. Instead of direct embedding a message or image within the source image, choosing a window of size 2 × 2 of the source image in sliding window manner then convert it from spatial domain to frequency domain using Discrete Fourier Transform (DFT). The bits of the authenticating message or image are then embedded at LSB within the real part of the transformed image. Inverse DFT is performed for the transformation from frequency domain to spatial domain as final step of encoding. Decoding is done through the reverse procedure. The experimental results have been discussed and compared with the existing steganography algorithm S-Tools. Histogram analysis and Chi-Square test of source image with embedded image shows the better results in comparison with the S-Tools.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114532981","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":"Granular algebra for modeling granular systems and granular computing","authors":"Yingxu Wang","doi":"10.1109/COGINF.2009.5250771","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250771","url":null,"abstract":"Granular computing provides a new perspective on computing architectures and behaviors. This paper presents a recent development in denotational mathematics known as granular algebra, which enables a rigorous treatment of computing granules as a generic abstract mathematical structure and granular behaviors as a set of algebraic operations. An abstract granule is modeled as a mathematical entity that elicits a set of basic properties of computing granules. Then, a set of algebraic operations on abstract granules is defined such as the relational, reproductive, and compositional operations. A real-world case study is presented that demonstrates how concrete granules and their algebraic operations are derived based on granular algebra. This work shows that granular algebra is not only a powerful conceptual modeling methodology for granular systems, but also a functional specification methodology for granular computing.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114541323","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":"Extraction of the basic feature points of handwriting data by auto translation error map","authors":"Y. Manabe, B. Chakraborty, K. Sugawara","doi":"10.1109/COGINF.2009.5250789","DOIUrl":"https://doi.org/10.1109/COGINF.2009.5250789","url":null,"abstract":"Analysis of online-handwritten time series, acquired by pen tablet system, is valuable in various fields such as handwriting recognition, person verification or skill analysis. Generally, online handwriting data is a multidimensional time series comprises of time series of pen-tips position (x, y), pressure, altitude, azimuth etc.. In case of person verification application, use of such multivariate data improves verification accuracy. However increase of data volume increases computational cost for analysis. In this study, in order to reduce data volume , we propose a new method for extraction of the basic feature points of multidimensional handwriting time series from the view point of testing determinism in the underlying dynamics behind handwriting. Proposed method is based on two-dimensional recurrence map of translation error. Basic feature points denote the principal points in the trajectory of handwriting dynamics to preserve the rough form of the individual's handwriting speciality. The simulation experiment has been done with SVC 2004 online handwriting signature data. The result shows that the basic feature point series is quite sufficient for analyzing the data for identity detection while the raw handwriting time series includes redundancy.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115086187","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}