This paper deals with a state observation problem when the dynamic model of a plant contains an uncertainty or it is completely unknown (the only some smoothness properties are assumed to be in force). The dynamic neural network approach is applied in this informative situation. A new learning law, containing relay (signum) terms, is suggested to be in use. The nominal parameters of this procedure are adjusted during the preliminary "training process" where the sliding-mode technique as well as the LS-method are applied to obtain the "best" nominal parameter values using training experimental data. The upper bounds for the weights as well as for the averaged estimation error are derived. Two numeric examples illustrate this approach: first, the water ozone-purification process supplied by a bilinear model with unknown parameters, and, second, a nonlinear mechanical system, governed by the Euler's equations with unknown parameters and noises
{"title":"Dynamic Neural Observer with Sliding Mode Learning","authors":"I. Chairez, A. Poznyak, T. Poznyak","doi":"10.1109/IS.2006.348487","DOIUrl":"https://doi.org/10.1109/IS.2006.348487","url":null,"abstract":"This paper deals with a state observation problem when the dynamic model of a plant contains an uncertainty or it is completely unknown (the only some smoothness properties are assumed to be in force). The dynamic neural network approach is applied in this informative situation. A new learning law, containing relay (signum) terms, is suggested to be in use. The nominal parameters of this procedure are adjusted during the preliminary \"training process\" where the sliding-mode technique as well as the LS-method are applied to obtain the \"best\" nominal parameter values using training experimental data. The upper bounds for the weights as well as for the averaged estimation error are derived. Two numeric examples illustrate this approach: first, the water ozone-purification process supplied by a bilinear model with unknown parameters, and, second, a nonlinear mechanical system, governed by the Euler's equations with unknown parameters and noises","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127409430","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}
This paper proposes a Thai vehicle license plate recognition system, called the hierarchical cross-correlation ARTMAP. An ability to separately train each segment of the network gives the hierarchical cross-correlation ARTMAP an advantage over the other approaches. The experimental results show that the hierarchical cross-correlation ARTMAP outperforms the other approaches by a wide margin
{"title":"Thai Vehicle License Plate Recognition Using the Hierarchical Cross-correlation ARTMAP","authors":"P. Duangphasuk, A. Thammano","doi":"10.1109/IS.2006.348496","DOIUrl":"https://doi.org/10.1109/IS.2006.348496","url":null,"abstract":"This paper proposes a Thai vehicle license plate recognition system, called the hierarchical cross-correlation ARTMAP. An ability to separately train each segment of the network gives the hierarchical cross-correlation ARTMAP an advantage over the other approaches. The experimental results show that the hierarchical cross-correlation ARTMAP outperforms the other approaches by a wide margin","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132586126","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}
Alexander V. Lyaletski, A. Paskevich, K. Verchinine
Formal methods are widely used in the computer science community. Formal verification and certification is an important component of any formal approach. Such a work can not be done by hand, hence the software that can do a part of it is rather required. The verification methods are often based on a deductive system and "verify" means "prove". Corresponding software is called proof assistant. We describe in this paper the System for Automated Deduction (SAD): its architecture, input language, and reasoning facilities. We show how to use SAD as a proof assistant. We outline specific features of SAD - a handy input language, powerful reasoning strategy, opportunity to use various low level inference engines. Examples and results of some experiments are also given
{"title":"The SAD System: Deductive Assistance in an Intelligent Linguistic Environment","authors":"Alexander V. Lyaletski, A. Paskevich, K. Verchinine","doi":"10.1109/IS.2006.348446","DOIUrl":"https://doi.org/10.1109/IS.2006.348446","url":null,"abstract":"Formal methods are widely used in the computer science community. Formal verification and certification is an important component of any formal approach. Such a work can not be done by hand, hence the software that can do a part of it is rather required. The verification methods are often based on a deductive system and \"verify\" means \"prove\". Corresponding software is called proof assistant. We describe in this paper the System for Automated Deduction (SAD): its architecture, input language, and reasoning facilities. We show how to use SAD as a proof assistant. We outline specific features of SAD - a handy input language, powerful reasoning strategy, opportunity to use various low level inference engines. Examples and results of some experiments are also given","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128115528","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}
There is a growing necessity to embed a simulator within a decision support system. For a complex system, there is usually the need both to utilize a commercial package to perform the simulations and to read data from an in-house database. The DSS is programmed in different software packages which interact via the user-friendly, readily available MSExcel. A situation in which a company is faced with a sequencing problem is presented
{"title":"Integrating Simulation into Decision Support Systems","authors":"Javier Otamendi","doi":"10.1109/IS.2006.348525","DOIUrl":"https://doi.org/10.1109/IS.2006.348525","url":null,"abstract":"There is a growing necessity to embed a simulator within a decision support system. For a complex system, there is usually the need both to utilize a commercial package to perform the simulations and to read data from an in-house database. The DSS is programmed in different software packages which interact via the user-friendly, readily available MSExcel. A situation in which a company is faced with a sequencing problem is presented","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316083","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}
In this paper we introduce a novel document clustering approach that solves some major problems of traditional document clustering approaches. Instead of depending on traditional vector space model, this approach represents documents as graphs using domain knowledge in ontology because graphs can represent the semantic relationships among the concepts in documents. Based on scale-free network theory, our approach generates a model for each document cluster from the ontology-enriched graph representation by identifying k high density subgraphs capturing the core semantic relationship information about each document cluster. Using these k high density subgraphs, each document is assigned to a proper document cluster. Our extensive experimental results on MEDLINE articles show that our approach outperforms two leading document clustering algorithms, BiSecting K-means and CLUTO's vcluster. Moreover, our approach provides a meaningful explanation for document clustering through generated models. This explanation helps users to understand clustering results and documents as a whole
{"title":"Clustering Ontology-enriched Graph Representation for Biomedical Documents based on Scale-Free Network Theory","authors":"Illhoi Yoo, Xiaohua Hu","doi":"10.1109/IS.2006.348532","DOIUrl":"https://doi.org/10.1109/IS.2006.348532","url":null,"abstract":"In this paper we introduce a novel document clustering approach that solves some major problems of traditional document clustering approaches. Instead of depending on traditional vector space model, this approach represents documents as graphs using domain knowledge in ontology because graphs can represent the semantic relationships among the concepts in documents. Based on scale-free network theory, our approach generates a model for each document cluster from the ontology-enriched graph representation by identifying k high density subgraphs capturing the core semantic relationship information about each document cluster. Using these k high density subgraphs, each document is assigned to a proper document cluster. Our extensive experimental results on MEDLINE articles show that our approach outperforms two leading document clustering algorithms, BiSecting K-means and CLUTO's vcluster. Moreover, our approach provides a meaningful explanation for document clustering through generated models. This explanation helps users to understand clustering results and documents as a whole","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133007722","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}
In this paper we introduce definitions of t-intuitionistic fuzzy sets and (t - t*)-intuitionistic fuzzy sets where t(t*) is a t-norm (t-conorm). Algebraic properties of them are studied. This put the theory of (k1, k2)-intuitionistic fuzzy sets and generalized intuitionistic fuzzy sets in a further general framework
{"title":"(t - t*) - Intuitionistic fuzzy sets","authors":"Amitava Samanta, S. Samanta","doi":"10.1109/IS.2006.348518","DOIUrl":"https://doi.org/10.1109/IS.2006.348518","url":null,"abstract":"In this paper we introduce definitions of t-intuitionistic fuzzy sets and (t - t*)-intuitionistic fuzzy sets where t(t*) is a t-norm (t-conorm). Algebraic properties of them are studied. This put the theory of (k1, k2)-intuitionistic fuzzy sets and generalized intuitionistic fuzzy sets in a further general framework","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133231791","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}
Tracking moving objects is of central interest in mobile robotics. It is a prerequisite for providing a robot with cooperative behaviour. Most algorithms assume punctiform targets, which is not always suitable. In this work we extend the problem to extended objects and compare the algorithms that have been developed by our research group. These algorithms are capable of tracking extended objects
{"title":"Tracking Extended Moving Objects with a Mobile Robot","authors":"A. Kraubling","doi":"10.1109/IS.2006.348504","DOIUrl":"https://doi.org/10.1109/IS.2006.348504","url":null,"abstract":"Tracking moving objects is of central interest in mobile robotics. It is a prerequisite for providing a robot with cooperative behaviour. Most algorithms assume punctiform targets, which is not always suitable. In this work we extend the problem to extended objects and compare the algorithms that have been developed by our research group. These algorithms are capable of tracking extended objects","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133238308","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}
Due to the interactions between the control channels, it is not an easy task to express the control strategies in the form of related multi-situations to multi-actions control fuzzy rules. Decoupled control is one answer to this problem. It separates the control task into two types: one is the dominating controller applied to fulfil the tracking task of a particular single-situation to a single-action loop, and the other is the compensator used to decouple the channels themselves. This paper adopts the self-organizing fuzzy logic control (SOFLC) strategy, which has the ability of self-generating and modifying the control rules depending on the on-line system control information, as the main controller for each channel. The compensating controller is triggered according to the nature of the effect of the interaction from the corresponding channel. The strategy of identifying the interaction effect follows the system performance evaluation method applied in SOFLC as well. A series of simulations were carried out on a two-input and two-output biomedical process, with the conclusion that the proposed decoupling control mechanism has the ability to deal with varying system dynamics, noise and inaccurate estimation of compensator gains very effectively
{"title":"Multivariable Self-organizing fuzzy logic control (SOFLC) using a switching mode linguistic compensator","authors":"Q. Lu, M. Mahfouf","doi":"10.1109/IS.2006.348425","DOIUrl":"https://doi.org/10.1109/IS.2006.348425","url":null,"abstract":"Due to the interactions between the control channels, it is not an easy task to express the control strategies in the form of related multi-situations to multi-actions control fuzzy rules. Decoupled control is one answer to this problem. It separates the control task into two types: one is the dominating controller applied to fulfil the tracking task of a particular single-situation to a single-action loop, and the other is the compensator used to decouple the channels themselves. This paper adopts the self-organizing fuzzy logic control (SOFLC) strategy, which has the ability of self-generating and modifying the control rules depending on the on-line system control information, as the main controller for each channel. The compensating controller is triggered according to the nature of the effect of the interaction from the corresponding channel. The strategy of identifying the interaction effect follows the system performance evaluation method applied in SOFLC as well. A series of simulations were carried out on a two-input and two-output biomedical process, with the conclusion that the proposed decoupling control mechanism has the ability to deal with varying system dynamics, noise and inaccurate estimation of compensator gains very effectively","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125249717","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}
Most of the solutions proposed in image database applications are limited to a specific application domain. Generic models attempt to ease the development of applications to researchers. In this paper, to overcome the difficulties faced by application-specific systems, we present a general purpose image management model, oriented to fill the gap between systems and users. To the retrieval process the most important issue is to have a query model that efficiently represents the image nature integrated with traditional data and a feedback mechanism to model the user's information needs. This work develops a query language to deal with the fuzzy nature of images. The query language, I-OQL, based on the ODMG standard, also is able to define high level concepts and to integrate different levels of abstraction. We also propose a general-purpose relevance feedback mechanism oriented to fill the gap between systems and users, expressing user subjectivity in the retrieval process. Experiment results are presented to explore and validate the query refinement process
{"title":"A Query Model with Relevance Feedback for Image Database Retrieval","authors":"S. Montenegro Gonzalez, A. Yamakami","doi":"10.1109/IS.2006.348399","DOIUrl":"https://doi.org/10.1109/IS.2006.348399","url":null,"abstract":"Most of the solutions proposed in image database applications are limited to a specific application domain. Generic models attempt to ease the development of applications to researchers. In this paper, to overcome the difficulties faced by application-specific systems, we present a general purpose image management model, oriented to fill the gap between systems and users. To the retrieval process the most important issue is to have a query model that efficiently represents the image nature integrated with traditional data and a feedback mechanism to model the user's information needs. This work develops a query language to deal with the fuzzy nature of images. The query language, I-OQL, based on the ODMG standard, also is able to define high level concepts and to integrate different levels of abstraction. We also propose a general-purpose relevance feedback mechanism oriented to fill the gap between systems and users, expressing user subjectivity in the retrieval process. Experiment results are presented to explore and validate the query refinement process","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105097","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}
The paper built an analysis model of financial statements based on data mining methods, that is making data mining methods such as clustering, association rules and decision making tree work together to step by step go into deeper analysis of existing financial statements, during which a annual assets structure statement is worked out. The data used for research is from financial statements of electronic product corporations published on Internet. The paper established and implemented an integrated data mining model for the electronic product industry. Finally, some meaningful conclusions were drawn, which is great benefit to decision makers and investors in this industry to analyze financial situations of some corporate and make better investment decisions, budget or management plans
{"title":"An Analysis Model of Financial Statements Based on Data Mining","authors":"L. Yanhong, Liuyan Peng, Qin Zheng","doi":"10.1109/IS.2006.348531","DOIUrl":"https://doi.org/10.1109/IS.2006.348531","url":null,"abstract":"The paper built an analysis model of financial statements based on data mining methods, that is making data mining methods such as clustering, association rules and decision making tree work together to step by step go into deeper analysis of existing financial statements, during which a annual assets structure statement is worked out. The data used for research is from financial statements of electronic product corporations published on Internet. The paper established and implemented an integrated data mining model for the electronic product industry. Finally, some meaningful conclusions were drawn, which is great benefit to decision makers and investors in this industry to analyze financial situations of some corporate and make better investment decisions, budget or management plans","PeriodicalId":116809,"journal":{"name":"2006 3rd International IEEE Conference Intelligent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121994552","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}