Image characterization and classification by physical complexity

We present a method for estimating the complexity of an image based on Bennett's concept of logical depth. Bennett identified logical depth as the appropriate measure of organized complexity, and hence as being better suited to the evaluation of the complexity of objects in the physical world. Its use results in a different, and in some sense a finer characterization than is obtained through the application of the concept of Kolmogorov complexity alone. We use this measure to classify images by their information content. The method provides a means for classifying and evaluating the complexity of objects by way of their visual representations. To the authors' knowledge, the method and application inspired by the concept of logical depth presented herein are being proposed and implemented for the first time. © 2011 Wiley Periodicals, Inc. Complexity, 2011     

Random fuzzy differential equations under generalized Lipschitz condition

We present the studies on two kinds of solutions to random fuzzy differential equations (RFDEs). The different types of solutions to RFDEs are generated by the usage of two different concepts of fuzzy derivative in the formulation of a differential problem. Under generalized Lipschitz condition, the existence and uniqueness of both kinds of solutions to RFDEs are obtained. We show that solutions (of the same kind) are close to each other in the case when the data of the equation did not differ much. By an example, we present an application of each type of solutions in a population growth model which is subjected to two kinds of uncertainties: fuzziness and randomness.     

Maximum likelihood least squares identification for systems with autoregressive moving average noise

Maximum likelihood methods are important for system modeling and parameter estimation. This paper derives a recursive maximum likelihood least squares identification algorithm for systems with autoregressive moving average noises, based on the maximum likelihood principle. In this derivation, we prove that the maximum of the likelihood function is equivalent to minimizing the least squares cost function. The proposed algorithm is different from the corresponding generalized extended least squares algorithm. The simulation test shows that the proposed algorithm has a higher estimation accuracy than the recursive generalized extended least squares algorithm.     

一类循环序列的稳定性

讨论了循环序列x_(n+1)=(α-βx_n)/(γ+x_(n-1)),n=0,1,2,….解的整体渐近稳定性,用系数α,β,γ给出了其正的平衡点是全局吸引的充分条件及全局吸引域.其中α,β,γ为正实数.     

应对说话人位置突变的鲁棒语声去混响*

多通道线性预测算法是一种有效的语声去混响方法,但若房间内说话人位置发生变化,房间冲激响应也会随之改变,从而导致去混响效果变差。本文研究了基于递归最小二乘算法的自适应多通道线性预测语声去混响方法,提出了一种去混响过程中检测说话人位置突变的方法,它借助已有的多通道传声器信号,并未明显增加系统开销。实验表明该方法可以有效检测说话人位置的突变,并通过重置滤波器改善算法的收敛速度和稳定性。     

Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming

This paper discusses a nonlinear programming problem which arises when the optimum scheduling of an electric power system is being considered. A realistic, moderately large text example is described in detail; and the solution of this example by a recent method based on quadratic programming is also reported.     

Computability of Minimizers and Separating Hyperplanes

We prove in recursive analysis an existence theorem for computable minimizers of convex computable continuous real-valued functions, and a computable separation theorem for convex sets in ?^m. Mathematics Subject Classification: 03F60, 52A40.     

随机系统的状态与参数估计

本文根据Ｋａｌｍａｎ滤波与时间序列分析的理论，对非线性随机系统，导出了状与参数同时进行估计的递推算法，确定了它们的统计性质。为减少估计误差，用两层估计方法改进了估计精度。这个结果在ＳＩＳＯ系统中得到了证实。