Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

On the hardness of approximating label-cover

The Label-Cover problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10]. In this paper we present a direct combinatorial reduction from low error-probability PCP [Proceedings of 31st ACM Symposium on Theory of Computing, 1999, pp. 29-40] to Label-Cover showing it NP-hard to approximate to within 2^{(logn)1−o(1)}. This improves upon the best previous hardness of approximation results known for this problem.We also consider the Minimum-Monotone-Satisfying-Assignment (MMSA) problem of finding a satisfying assignment to a monotone formula with the least number of 1's, introduced by M. Alekhnovich, S. Buss, S. Moran, T. Pitassi [Minimum propositional proof length is NP-hard to linearly approximate, 1998]. We define a hierarchy of approximation problems obtained by restricting the number of alternations of the monotone formula. This hierarchy turns out to be equivalent to an AND/OR scheduling hierarchy suggested by M.H. Goldwasser, R. Motwani [Lecture Notes in Comput. Sci., Vol. 1272, Springer-Verlag, 1997, pp. 307-320]. We show some hardness results for certain levels in this hierarchy, and place Label-Cover between levels 3 and 4. This partially answers an open problem from M.H. Goldwasser, R. Motwani regarding the precise complexity of each level in the hierarchy, and the place of Label-Cover in it.     

A global output-feedback controller for stabilization and tracking of underactuated ODIN: A spherical underwater vehicle

This paper presents a method to design an output-feedback controller that simultaneously solves global asymptotic stabilization and tracking of an underactuated omni-directional intelligent navigator—a spherical underwater vehicle moving in a horizontal plane (i.e. at a constant depth). The vehicle does not have a sway actuator and has only position and orientation measurements available. The control development is based on Lyapunov's direct method, backstepping technique and use of interconnected structure of the vehicle dynamics. Numerical simulations demonstrate the results.     

一种外置式视频同步信号发生器的设计

对随机视频信号的特点进行了研究，提出了采用谱分析提取随机视频信号的同步频率的方法，根据数据传输的要求设计了基于USB接口的外置式视频同步信号发生器并给出了系统的硬件框图和软件流程。系统具有自动分析随机视频信息隐含的同步信号频率，精确产生同步脉冲信号的特点，满足随机视频信号采集和稳定显示的同步要求。同步精度达到300帧内图像漂移小于1个像素。利用该视频同步信号发生器控制非标准图像采集卡实现了计算机辐射的随机视频信号的采集和稳定显示。     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

Coordinating production and distribution of jobs with bundling operations

We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.     

WKB近似下的Fourier衍射成象方法

对于介质目标微波衍射成象，本文引入了ＷＫＢ近似来模拟目标内部总场。基于这种近似，我们导出了Ｆｏｕｒｉｅｒ衍射公式，并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用ＷＫＢ近似重建目标特性较Ｂｏｒｎ近似有明显改善。     

The Continuous Interpolating Self-organizing Map

The self-organizing map (SOM) [5] provides a general data approximation method which is suitable for several application domains. The topology preservation is an important feature in data-analysis and may also be advantageous for the evaluation of the data in a function approximation or regression task. For this reason the interpolated self-organizing map (I-SOM) adds an output layer to the SOM architecture which computes a real valued output vector. This paper presents an extension of I-SOM towards a continuous interpolation. It is compared to RBF and to the parametrized self-organizing map.     

暴雨洪水流域系统随机模拟(研究之三)

本文提出的移置特大暴雨的不连序序列的随机插补方法,以及利用W—H逆变换法将偏态暴雨序列转为正态序列和随机扣除模拟的暴雨过程损失量等方法,基本是可行的,对提高模型的代表性、稳定性和实用性有重要作用。     

随机徐变应力影响下重力坝时变可靠度初探

由于重力坝的随机温度场以及随机徐变应力场均为非平稳随机过程，由此所涉及的结构可靠度是非平稳向量随机过程非线性组合的时变可靠度．本文计入重力坝徐变应力场和混凝土强度随机性的影响，将时变可靠度的数值解法与随机有限元法相结合，模拟施工过程，对一典型重力坝的时变可靠度进行了计算，得出了一些有益的结论．