Adaptive inferential sensors based on evolving fuzzy models

A new technique to the design and use of inferential sensors in the process industry is proposed in this paper, which is based on the recently introduced concept of evolving fuzzy models (EFMs). They address the challenge that the modern process industry faces today, namely, to develop such adaptive and self-calibrating online inferential sensors that reduce the maintenance costs while keeping the high precision and interpretability/transparency. The proposed new methodology makes possible inferential sensors to recalibrate automatically, which reduces significantly the life-cycle efforts for their maintenance. This is achieved by the adaptive and flexible open-structure EFM used. The novelty of this paper lies in the following: (1) the overall concept of inferential sensors with evolving and self-developing structure from the data streams; (2) the new methodology for online automatic selection of input variables that are most relevant for the prediction; (3) the technique to detect automatically a shift in the data pattern using the age of the clusters (and fuzzy rules); (4) the online standardization technique used by the learning procedure of the evolving model; and (5) the application of this innovative approach to several real-life industrial processes from the chemical industry (evolving inferential sensors, namely, eSensors, were used for predicting the chemical properties of different products in The Dow Chemical Company, Freeport, TX). It should be noted, however, that the methodology and conclusions of this paper are valid for the broader area of chemical and process industries in general. The results demonstrate that well-interpretable and with-simple-structure inferential sensors can automatically be designed from the data stream in real time, which predict various process variables of interest. The proposed approach can be used as a basis for the development of a new generation of adaptive and evolving inferential sensors that can a- ddress the challenges of the modern advanced process industry

A survey of kernel and spectral methods for clustering

Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods. The aim of this paper is to present a survey of kernel and spectral clustering methods, two approaches able to produce nonlinear separating hypersurfaces between clusters. The presented kernel clustering methods are the kernel version of many classical clustering algorithms, e.g., K-means, SOM and neural gas. Spectral clustering arise from concepts in spectral graph theory and the clustering problem is configured as a graph cut problem where an appropriate objective function has to be optimized. An explicit proof of the fact that these two paradigms have the same objective is reported since it has been proven that these two seemingly different approaches have the same mathematical foundation. Besides, fuzzy kernel clustering methods are presented as extensions of kernel K-means clustering algorithm. (C) 2007 Pattem Recognition Society. Published by Elsevier Ltd. All rights reserved

Designing power system stabilizer for multimachine power system using neuro-fuzzy algorithm

This paper describes a design procedure for a fuzzy logic based power system stabilizer (FLPSS) and adaptive neuro-fuzzy inference system (ANFIS) and investigates their robustness for a multi-machine power system. Speed deviation of a machine and its derivative are chosen as the input signals to the FLPSS. A four-machine and a two-area power system is used as the case study. Computer simulations for the test system subjected to transient disturbances i.e. a three phase fault, were carried out and the results showed that the proposed controller is able to prove its effectiveness and improve the system damping when compared to a conventional lead-lag based power system stabilizer controller

Reliable H∞ filtering for discrete time-delay systems with randomly occurred nonlinearities via delay-partitioning method

The official published version can be found at the link below.In this paper, the reliable H∞ filtering problem is investigated for a class of uncertain discrete time-delay systems with randomly occurred nonlinearities (RONs) and sensor failures. RONs are introduced to model a class of sector-like nonlinearities that occur in a probabilistic way according to a Bernoulli distributed white sequence with a known conditional probability. The failures of sensors are quantified by a variable varying in a given interval. The time-varying delay is unknown with given lower and upper bounds. The aim of the addressed reliable H∞ filtering problem is to design a filter such that, for all possible sensor failures, RONs, time-delays as well as admissible parameter uncertainties, the filtering error dynamics is asymptotically mean-square stable and also achieves a prescribed H∞ performance level. Sufficient conditions for the existence of such a filter are obtained by using a new Lyapunov–Krasovskii functional and delay-partitioning technique. The filter gains are characterized in terms of the solution to a set of linear matrix inequalities (LMIs). A numerical example is given to demonstrate the effectiveness of the proposed design approach