Automatic detection and identification of shocks in Gaussian state‐space models: a Bayesian approach

An automatic monitoring and intervention algorithm that permits the supervision of very general aspects in an univariate linear Gaussian state–space model is proposed. The algorithm makes use of a model comparison and selection approach within a Bayesian framework. In addition, this algorithm incorporates the possibility of eliminating earlier interventions when subsequent evidence against them comes to light. Finally, the procedure is illustrated with two empirical examples taken from the literature. Copyright © 2005 John Wiley & Sons, Ltd.     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.     

Dual frames in connected with generalized sampling in shift-invariant spaces

The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L²(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L²(0,1) with respect to some particular frame in L²(0,1). Since any shift-invariant space with stable generator is the image of L²(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L²(0,1).     

Quotient normed cones

Given a normed cone (X, p) and a subconeY, we construct and study the quotient normed cone (X/Y,p) generated byY. In particular we characterize the bicompleteness of (X/Y, ‖·‖ ^p ,p) in terms of the bicompleteness of (X, p), and prove that the dual quotient cone ((X/Y)^*, || · ‖·‖^p,p) can be identified as a distinguished subcone of the dual cone (X ^*, || · ||_{p, u}). Furthermore, some parts of the theory are presented in the general setting of the spaceCL(X, Y) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces.     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

线性方程组通解并行数值方法

1预备知识 线性方程组消息传递MIMD算法是20世纪90年代至今的活跃课题，但尚无此问题 的通用有效算法发表.用!.}.}表示矩阵列分块划分，记AX=b为[AI司.定理1、2是文 {l]、[s]成果综述和推广. 定理i[‘]设有线性方程组!e}己l，e〔尺”“m，d〔R”“‘，rank(e)=r.当且仅当rank(!     

多元线性回归应用于近代物理实验

本文介绍非线性方程转化直线性方程和多元线性回归法来分析近代物理实验中塞曼效应分裂干涉圆环多处选点测量的处理过程。