扰动值模糊有限自动机及其语言*

引入扰动值模糊有限自动机及其语言的概念,讨论扰动值模糊有限自动机的状态转移函数的扩张问题,证明3类确定型扰动值模糊有限自动机、非确定型扰动值模糊有限自动机相互等价性,研究扰动值模糊有限自动机的语言关于正则运算的封闭性.     

Nonlinear Systems Identification via Two Types of Recurrent Fuzzy CMAC

Normal fuzzy CMAC neural network performs well for nonlinear systems identification because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires huge memory and the dimension increases exponentially with the number of inputs. It is difficult to model dynamic systems with static fuzzy CMACs. In this paper, we use two types of recurrent techniques for fuzzy CMAC to overcome the above problems. The new CMAC neural networks are named recurrent fuzzy CMAC (RFCMAC) which add feedback connections in the inner layers (local feedback) or the output layer (global feedback). The corresponding learning algorithms have time-varying learning rates, the stabilities of the neural identifications are proven.     

Efficient and Robust Music Identification With Weighted Finite-State Transducers

We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recognition. Our modeling approach is based on learning a set of elementary music sounds in a fully unsupervised manner. While the space of possible music sound sequences is very large, our method enables the construction of a compact and efficient representation for the song collection using finite-state transducers. This paper gives a novel and substantially faster algorithm for the construction of factor transducers, the key representation of song snippets supporting our music identification technique. The complexity of our algorithm is linear with respect to the size of the suffix automaton constructed. Our experiments further show that it helps speed up the construction of the weighted suffix automaton in our task by a factor of 17 with respect to our previous method using the intermediate steps of determinization and minimization. We show that, using these techniques, a large-scale music identification system can be constructed for a database of over 15 000 songs while achieving an identification accuracy of 99.4% on undistorted test data, and performing robustly in the presence of noise and distortions.      

Representation of Finite State Automata in Recurrent Radial Basis Function Networks

In this paper, we propose some techniques for injecting finite state automata into Recurrent Radial Basis Function networks (R2BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function to the ordinary cost. Successful experimental results are shown for inductive inference of regular grammars.     

Indistinguishability of Finite-State Automata with Respect to Some Environments

The paper deals with the problem of indistinguishability of finite-state automata interacting with the same environment. A method of construction of efficient environments, i.e., the environments for which this problem is algorithmically solvable, is proposed. An example of an inefficient geometric environment is given.     

Identification Input Design for Consistent Parameter Estimation of Linear Systems With Binary-Valued Output Observations

Input design is of essential importance in system identification for providing sufficient probing capabilities to guarantee convergence of parameter estimates to their true values. This paper presents conditions on input signals that characterize their probing richness for strongly consistent parameter estimation of linear systems with binary-valued output observations. Necessary and sufficient conditions on periodic signals are derived for sufficient richness. These conditions are further studied under different system configurations including open-loop and feedback systems, and different scenarios of noises including actuator noise, input measurement noise, and output measurement noise. In addition to system parameter estimation, essential properties of identifiability and input conditions are also derived when sensor thresholds or noise distribution functions are unknown. The findings of this paper provide a foundation to study identification of systems that either use binary-valued or quantized sensors or involve communication channels, which mandate quantization of signals.     

A New Approach to Guaranteed Cost Control of T-S Fuzzy Dynamic Systems With Interval Parameter Uncertainties

This paper investigates the problem of guaranteed cost control for Takagi-Sugeno fuzzy dynamic systems with interval parameter uncertainties. The parameter uncertainty is characterized by the matrix bound, which is quite natural in real applications. Attention is focused on the fuzzy state feedback controller design via the so-called parallel distributed compensation scheme, which guarantees the closed-loop system to be robustly stable with a prescribed upper bound of the cost function. By utilizing the instrumental idea of delay dividing, a new Lyapunov-Krasovskii functional is introduced, which leads the resultant conditions to be much less conservative than most existing results in the literature. Some other new ideas such as basis dependence are also employed, which help to reduce the conservatism. All the results are formulated in the form of linear matrix inequalities (LMIs), which can readily be solved via standard numerical software. Finally, illustrative examples are given to show the less conservatism and applicability of the obtained results.     

非线性系统的回归网络辨识

针对未知非线性系统的辨识问题,本文提出了一种新型的回归网络模型,证明了该网络模型在一定条件下能够逼近非线性系统的输入输出关系,提出了训练网络前向连接和反向连接权值的动态反向传播算法,伪真结果验证该方法的有效性。     

时滞分布参数系统中和控制器设计

首先给出中和控制器设计思路,针对具有时滞特性的分布参数系统,设计中和控制器,讨论此类系统的稳定问题.利用Lyapunov稳定性理论并结合矩阵不等式处理方法,得出具有时滞特性分布参数系统稳定中和控制器存在的充分条件.最后结合所给条件,给出一个数值仿真说明其有效性.     

基于拟非线性模糊模型的复杂系统模糊辨识

针对一阶Takagi－Sugeno[以下简称T－S]到模型辨识复杂系统的困难，本文提出了一种新的拟非线性模糊模型．即在一阶T－S模型的基础上，再进行一次非线性映射．这种模糊模型不仅具有较高的辨识精度，而且具有良好的泛化功能．运用改进的FCM（FuzzyC－Means）模糊聚类方法，辨识该模糊模型的结构，与以往的方法比较，极大地简化了结构辨识的复杂性．仿真结果进一步说明了该方法的有效性．     

基于拟非线性模糊模型的复杂系统模糊辨识

针对一阶Takagi-Sugeno（以下简称T-S）模型辨识复杂系统的困难，本文提出了一种新的拟非线性模糊模型。即在一阶T-S模型的基础上，再进行一次非线性映射。这种模糊模型不仅具有较高的辨识精度，而且具有良好的泛化功能。运用改进的FCM（Fuzzy-C-Means）模糊聚类方法，辨识该模糊模型的结构，与以往的方法比较，极大地简化了结构辨识的复杂性。仿真结果进一步说明了该方法的有效性。     

复杂系统的递阶模糊辨识

针对Takagi_Sugeno模糊模型 (T_S模型 )严重的维数灾问题, 借鉴GMDH算法, 提出了一种新的复杂系统递阶模糊辨识方法. 本文首先详细描述了由两输入变量的特殊T_S模型所组成的递阶模糊模型 ;然后提出了具体的辨识该递阶模糊模型的方法. 该方法的特点是 :a)在结构辨识阶段, 用FCM模糊聚类方法评价系统中每个输入变量的重要性, 以便构造合理的递阶模糊模型 ;b)预先合理地确定了所要辨识的参数的初始值, 用扩展卡尔曼滤波方法可很快地得到这些参数. 最后, 给出的仿真实例说明了本文辨识方法的有     

基于模糊神经网络的系统辨识

基于模糊神经网络研究系统辨识问题,提出一种具体的模糊神经网络结构和相应算法,设计了开环系统和闭环系统辨识的结构。针对多个不同的对象进行仿真研究,结果表明用模糊神经网络建模较之传统建模方法能力强。     

使用输出数据对MIMO系统的参数辨识

本文给出了使用输出数据辨识线性时不变MIMO系统的一种新算法,该算法可用于辨识典范型系统的动力学和统计学参数矩阵(F,G,H,R,Q).算法的推导和结果比Tsc方法简单.对循环系统和分块系统给出了更理想的形式.     

模糊Moore型自动机的性质(英文)

给出了模糊Moore型自动机可逆、可达和完备的定义;讨论了其相关性质,进而表明这些性质之间的关系,并且研究了模糊Moore型自动机的最小化性质。最后,系统地给出了关于它们的一些重要结果。     

State-Space Recurrent Fuzzy Neural Networks for Nonlinear System Identification

In this paper, we propose a new recurrent fuzzy neural network, which has the standard state space form, we call it state-space recurrent neural networks. Input-to-state stability is applied to access robust training algorithms for system identification. Stable learning algorithms for the premise part and the consequence part of fuzzy rules are proved.     

利用调制函数法的模糊模型参数辨识

利用调制函数法辨识非线性连续系统的模糊模型参数.系统的动力学微分方程存在微分项,通过输入输出数据辨识模糊模型参数时不能忽略扰动的影响,因此辨识模糊模型参数比较困难.利用调制函数法可以消除微分项,通过无微分项的联立方程的求解容易进行模糊模型参数辨识.几个非线性连续系统的仿真实验验证了所设计的利用调制函数法的模糊模型参数辨识的正确性和有效性.     

基于模糊模型的结构和参数的一体化辨识

基于模糊集合的模糊建模捕述复杂、病态、非线性系统的特性是一种有效方法．文中讨论了从样本数据中通过正交变换和模糊聚类获取模糊规则的方法．利用正交最小二乘对模糊聚类的结果进行变换,采用CGS（Classical Gram—Schmidt）方法确定对建模贡献大的规则,删除对建模贡献小的规则,并对模型中的参数进行估计,能够同时模对糊模型的结构和参数进行辨识．仿真结果表明,提出的方法能够对非线性系统进行模糊建模．     

基于模糊聚类的非线性系统模糊辨识算法

针对模糊聚类算法中数据和运算耗时很长,不适于在线建模与控制的问题,基于模糊聚类型隶属函数和EUM方法,提出了一种新的模糊辨识算法。该方法省去了求解聚类中心的迭代过程,计算时间显著减少。采用该方法对Box—Jenkins煤气炉数据和Mackey—Glass混沌时间序列进行了仿真,结果证明了该方法的有效性。