Some approximation properties of adaptive fuzzy systems with variable universe of discourse

In the last 20 years, while most research on fuzzy approximation theory has focused on nonadaptive fuzzy systems, little work has been done on adaptive fuzzy systems. This paper introduces an algorithm for adaptive fuzzy systems with Variable Universe of Discourse (VUD). By means of contraction-expansion factors, universe of discourse can be modified online, and fuzzy rules can reproduce automatically to adapt to the modified universe of discourse. Thus, dependence on the size of initial rule base is greatly reduced. Using Stone-Weierstrass theorem, VUD adaptive fuzzy systems are proved to be universal approximators with two-order approximation accuracy. In addition, the convergence properties of approximation error are discussed, and a sufficient condition is presented to partition universe of discourse and to calculate the size of rule base. An example is also given to illustrate the approximation power of VUD adaptive fuzzy systems.     

A constrained optimization approach for an adaptive generalized subspace tracking algorithm

In this paper, we present an orthonormal version of the generalized signal subspace tracking. It is based on an interpretation of the generalized signal subspace as the solution of a constrained minimization task. This algorithm, referred to as the CGST algorithm, guarantees the C_x-orthonormality of the estimated generalized signal subspace basis at each iteration which C_x denotes the correlation matrix of the sequence x(t). An efficient implementation of the proposed algorithm enhances applicability of it in real time applications.     

基于负熵的人员脚步震动信号检测识别算法

提出一种基于震动信号的人员脚步检测识别算法,该算法根据信息论中的负熵概念,采用高阶累积量的负熵近似计算方法.仿真与实测结果证明,与一般的模式识别算法相比,该算法具有三个重要的优点,包括环境适应性强、识别准确率高和运算量小.这些优点使得该算法更适用于能量受限、随机自组的无线传感器网络,能够在野外环境下准确、简单的检测识别人员脚步震动信号.     

基于最小平方误差逼近的线性阀体的设计

针对线性阀体的内孔筒设计问题,建立了一个以过流面积和其逼近直线之间的平方误差最小为目标的泛函优化模型.     

基于定性推理的矩形phase-portrait近似

矩形phase-portrait近似的关键是控制模态的有效划分.本文提出了基于定性推理的phase-portrait近似,给出了一种基于向量场、感兴趣多项式及其李导数动态特性的模态空间划分方法,并进一步给出了基于精化多项式的抽象模型精化方法.实验结果表明,基于定性推理划分的phase-portrait近似验证明显地减少了模态空间的划分数目,提高了验证的效率.     

Triangular approximations of fuzzy numbers using α-weighted valuations

In this paper, a fuzzy triangular approximation using α-weighted valuations is introduced and the nearest approximation by the minimization technique is obtained, such that the computational complexity is less than that in Abbasbandy and Amirfakhrian 2006. Moreover, we investigate some reasonable properties of the α-weighted triangular approximation.     

A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model.     

Model order reduction methods for coupled systems in the time domain using Laguerre polynomials

In this paper, based on Laguerre polynomials, we present new methods for model reduction of coupled systems in the time domain. By appropriately selected projection matrices, a reduced order system is produced to retain the topology structure of the original system. Meanwhile, it preserves a desired number of Laguerre coefficients of the system’s output, thereby providing good approximation accuracy. We also study the two-sided projection method in the time domain, as well as the stability of reduced order systems. Two numerical examples are used to illustrate the efficiency of the proposed methods.     

Stochastic approximation learning for mixtures of multivariate elliptical distributions

Most of the current approaches to mixture modeling consider mixture components from a few families of probability distributions, in particular from the Gaussian family. The reasons of these preferences can be traced to their training algorithms, typically versions of the Expectation-Maximization (EM) method. The re-estimation equations needed by this method become very complex as the mixture components depart from the simplest cases. Here we propose to use a stochastic approximation method for probabilistic mixture learning. Under this method it is straightforward to train mixtures composed by a wide range of mixture components from different families. Hence, it is a flexible alternative for mixture learning. Experimental results are presented to show the probability density and missing value estimation capabilities of our proposal.