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.     

Differential effects of cue changes and task changes on task-set selection costs.

A task-switching paradigm with a 2:1 mapping between cues and tasks was used to separate cue-switching processes (indexed through pure cue-switch costs) from actual task-switching processes (indexed through additional costs in case of cue and task changes). A large portion of total switch costs was due to cue changes (Experiments 1 and 2), and cue-switch costs but not task-switch costs were sensitive to effects of practice (Experiment 1) and preparation (Experiment 2). In contrast, task-switch costs were particularly sensitive to response-priming effects (Experiments 1 and 2) and task-set inhibition (Experiment 3). Results suggest two processing stages relevant during task-set selection: cue-driven retrieval of task rules from long-term memory and the automatic application of rules to a particular stimulus situation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Multiplicative cases from additive cases: Extension of Kolmogorov–Feller equation to parametric Poisson white noise processes

In this paper the response of nonlinear systems driven by parametric Poissonian white noise is examined.As is well known, the response sample function or the response statistics of a system driven by external white noise processes is completely defined. Starting from the system driven by external white noise processes, when an invertible nonlinear transformation is applied, the transformed system in the new state variable is driven by a parametric type excitation. So this latter artificial system may be used as a tool to find out the proper solution to solve systems driven by parametric white noises. In fact, solving this new system, being the nonlinear transformation invertible, we must pass from the solution of the artificial system (driven by parametric noise) to that of the original one (driven by external noise, that is known). Moreover, introducing this invertible nonlinear transformation into the Itô’s rule for the original system driven by external input, one can derive the Itô’s rule for systems driven by a parametric type excitation, directly. In this latter case one can see how natural is the presence of the Wong–Zakai correction term or the presence of the hierarchy of correction terms in the case of normal and Poissonian white noise, respectively. Direct transformation on the Fokker–Planck and on the Kolmogorov–Feller equation for the case of parametric input are found.     

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

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

Coupling of free surface and groundwater flows

In this paper we present some preliminary results about the coupling of shallow water equations for free surface flows and Darcy equation for groundwater flows. A suitable set of interface conditions is discussed: the Beavers and Joseph formula for the bottom stress is used. An iterative algorithm to solve the coupled problem is proposed and some numerical results are presented.     

Stabilization Methods for Spectral Element Computations of Incompressible Flows

A stabilization method for the spectral element computation of incompressible flow problems is investigated. It is based on a filtering procedure which consists in filtering the velocity field by a spectral vanishing Helmholtz-type operator at each time step. Relationship between this filtering procedure and SVV-stabilization method, introduced recently in [JCP, 2004, 196(2), p680], is established. A number of numerical examples are presented to show the accuracy and stabilization capability of the method.     

Numerical Study of a Modified Time-Stepping θ-Scheme for Incompressible Flow Simulations

In [Turek (1996). Int. J. Numer. Meth. Fluids 22, 987–1011], we had performed numerical comparisons for different time stepping schemes for the incompressible Navier–Stokes equations. In this paper, we present the numerical analysis in the context of the Navier–Stokes equations for a modified time-stepping θ-scheme which has been recently proposed by Glowinski [Glowinski (2003). In: Ciarlet, P. G., and Lions, J. L. (eds.), Handbook of Numerical Analysis, Vol. IX, North-Holland, Amsterdam, pp. 3–1176]. Like the well-known classical Fractional-Step-θ-scheme which had been introduced by Glowinski [Glowinski (1985). In Murman, E. M. and Abarbanel, S. S. (eds.), Progress and Supercomputing in Computational Fluid Dynamics, Birkh?user, Boston MA; Bristeau et al. (1987). Comput. Phys. Rep. 6, 73–187], too, and which is still one of the most popular time stepping schemes, with or without operator splitting techniques, this new scheme consists of 3 substeps with nonequidistant substepping to build one macro time step. However, in contrast to the Fractional-Step-θ-scheme, the second substep can be formulated as an extrapolation step for previously computed data only, and the two remaining substeps look like a Backward Euler step so that no expensive operator evaluations for the right hand side vector with older solutions, as for instance in the Crank–Nicolson scheme, have to be performed. This modified scheme is implicit, strongly A-stable and second order accurate, too, which promises some advantageous behavior, particularly in implicit CFD simulations for the nonstationary Navier–Stokes equations. Representative numerical results, based on the software package FEATFLOW [Turek (2000). FEATFLOW Finite element software for the incompressible Navier–Stokes equations: User Manual, Release 1.2, University of Dortmund] are obtained for typical flow problems with benchmark character which provide a fair rating of the solution schemes, particularly in long time simulations.Dedicated to David Gottlieb on the occasion of his 60th anniversary     

Implicit–Explicit Schemes for BGK Kinetic Equations

In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be constructed with this technique. The methods proposed are based on an explicit–implicit time discretization. In particular the convective terms are treated explicitly, while the source terms are implicit. In this fashion even problems with infinite stiffness can be integrated with relatively large time steps. The conservation properties of the schemes are investigated. Numerical results are shown for schemes of order 1, 2 and 5 in space, and up to third-order accurate in time.     

Viscoelastic State for the Solutions of Spherically Symmetric Viscoelasticity Problems

The solutions of the spherically symmetric, linear, isothermal, and transient viscoelasticity problems via reciprocity theorem have been investigated for a specific material. The integral form of stress–strain relations has been used. The Laplace transform of a viscoelastic state, which is necessary for the integral equation arising as a result of reciprocity theorem, has been derived. This integral equation has been solved by Laplace transform. A sample problem has been solved to test the presented formulation. A numerical application of the analytic solution of this problem has been given.     

The Lambda Library: unnamed functions in C++

The Lambda Library (LL) adds a form of lambda functions to C++, which are common in functional programming languages. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL consists of a rich set of tools for defining unnamed functions. In particular these unnamed functions work seamlessly with the generic algorithms in the C++ Standard Library. The LL offers significant improvements, in terms of generality and ease of use, compared to the current tools in the C++ Standard Library. Copyright © 2003 John Wiley & Sons, Ltd.