On the stability of robust filter-cleaners

We study the dependence on initial conditions of two recursive filters for cleaning a contaminated time series from additive outliers. We show that the function in the recursive equation is in general not contractive, but nevertheless there exists a stationary solution and two iterates with arbitrary initial conditions coincide after some random time T₀. However T₀ may be quite large.     

Sensitivity of Bayes decisions for the success probability for samples from a nonbinomial population

Summary A family of generalised negative binomial distributions is employed to investigate inference robustness of the Bayes estimator of the unknown parameter of the binomial distribution. A zone of sensitivity for the test of significance is constructed to forewarn the pro-Jeffreys Bayesians against indiscriminate choice of the probability in favour of the null hypothesis. A few selected tables are presented to illustrate the effect of relaxation of the ‘binomiality’ assumption.     

低曝光量下投影算法的稳健性研究

研究了在低曝光量情况下灰度投影算法的稳健性,为提出的稳定成像系统的设计与实现提供可行性论证。通过合成视频实验探讨、实际视频实验论证相结合的研究方法,探讨曝光量不足对灰度投影算法性能的影响。实验结果表明,灰度投影算法在欠曝5档和存在一定随机噪声的情况下,仍能保持良好的运动矢量估计性能,从而说明了投影算法在一定的曝光量范围内仍能准确地得到运动矢量估计,是一种运算量小、实时性好且稳健性较强的电子稳像算法。投影算法在低曝光量情况下良好的稳像稳健特性,使其能在低亮度及高实时性要求等环境下应用于航拍、卫星遥感等稳定成像或高清晰成像场合。     

Robust$${\cal {H}}_{\infty}$$ Stabilization of Stochastic Hybrid Systems with Wiener Process

This paper deals with the class of uncertain continuous-time linear stochastic hybrid systems with Wiener process. The uncertainties that we are considering are of the norm-bounded type. The robust stochastic stabilization problem is treated. LMIs based sufficient conditions are developed to design the state feedback controller that robustly and stochastically stabilizes the studied class of systems and at the same time rejects a disturbance of desired level. The minimum disturbance rejection is also determined. A numerical example is provided to show the validity of the proposed results.     

Fuzzy Markov Chains and Decision-Making

Decision-making in an environment of uncertainty and imprecision for real-world problems is a complex task. In this paper it is introduced general finite state fuzzy Markov chains that have a finite convergence to a stationary (may be periodic) solution. The Cesaro average and the -potential for fuzzy Markov chains are defined, then it is shown that the relationship between them corresponds to the Blackwell formula in the classical theory of Markov decision processes. Furthermore, it is pointed out that recurrency does not necessarily imply ergodicity. However, if a fuzzy Markov chain is ergodic, then the rows of its ergodic projection equal the greatest eigen fuzzy set of the transition matrix. Then, the fuzzy Markov chain is shown to be a robust system with respect to small perturbations of the transition matrix, which is not the case for the classical probabilistic Markov chains. Fuzzy Markov decision processes are finally introduced and discussed.     

Copyright protection in digital museum based on digital holography and discrete wavelet transform

A new method to protect the copyright of digital museum based on digital holography is proposed. The Fresnel hologram of watermark image is embedded in the object to be protected through discrete wavelet transform （DWT）. After the watermark detection, the copyright information appears in the reconstructed hologram. With the higher redundancy feature in the hologram, the proposed technique can actually survive several kinds of image processing. Experimental results prove that the presented method has good robustness in image protection.     

The generation of stable project plans

This text summarises the PhD thesis that Roel Leus presented to obtain the degree of Doctor in Applied Economics at the Katholieke Universiteit Leuven, in September 2003. The promotor of the thesis was professor Willy Herroelen. The thesis is written in English and is available from the authors website. The goal of the thesis was to provide recommendations for the detailed scheduling of multi-project organisations, when a certain degree of uncertainty exists about a number of characteristics of the project. Up till now, the majority of the literature on project scheduling has consisted of deterministic models for planning a single project: both the uncertainty aspect as well as the intrinsic difficulty of coordination of a portfolio of projects have been largely ignored.Received: October 2003, MSC classification: 09B35, 90B36     

Efficiency of connected binary block designs when a single observation is unavailable

In this paper the problem of finding the design efficiency is considered when a single observation is unavailable in a connected binary block design. The explicit expression of efficiency is found for the resulting design when the original design is a balanced incomplete block design or a group divisible, singular or semiregular or regular with ₁>0, design. The efficiency does not depend on the position of the unavailable observation. For a regular group divisible design with ₁>0, the efficiency depends on the position of the unavailable observation. The bounds, both lower and upper, on the efficiency are given in this situation. The efficiencies of designs resulting from a balanced incomplete block design and a group divisible design are in fact high when a single observation is unavailable.The work of the first author is sponsored by the Air Force Office of Scientific Research under Grant AFOSR-90-0092.On leave from Indian Statistical Institute, Calcutta, India. The work of the third author was supported by a grant from the CMDS, Indian Institute of Management, Calcutta.     

DLSTM-Based Successive Cancellation Flipping Decoder for Short Polar Codes

Polar code has been adopted as the control channel coding scheme for the fifth generation (5G), and the performance of short polar codes is receiving intensive attention. The successive cancellation flipping (SC flipping) algorithm suffers a significant performance loss in short block lengths. To address this issue, we propose a double long short-term memory (DLSTM) neural network to locate the first error bit. To enhance the prediction accuracy of the DLSTM network, all frozen bits are clipped in the output layer. Then, Gaussian approximation is applied to measure the channel reliability and rank the flipping set to choose the least reliable position for multi-bit flipping. To be robust under different codewords, padding and masking strategies aid the network architecture to be compatible with multiple block lengths. Numerical results indicate that the error-correction performance of the proposed algorithm is competitive with that of the CA-SCL algorithm. It has better performance than the machine learning-based multi-bit flipping SC (ML-MSCF) decoder and the dynamic SC flipping (DSCF) decoder for short polar codes.     

不同网格扭曲率下压力修正全隐算法——IDEAL求解性能研究

2008年,本文作者和陶文铨等提出了一种用于速度和压力耦合求解的高效稳定压力修正全隐算法IDEAL,该算法通过在每个迭代层次上对压力方程进行两次内迭代计算,完全克服了SIMPLE算法的两个假设,充分满足了速度和压力之间的耦合,从而大大提高了计算的收敛性和健壮性.为了进一步实现IDEAL算法的推广应用,本文基于三维倾斜方腔顶盖驱动流动,研究了IDEAL算法在不同网格扭曲率下的求解特性.研究发现,在不同网格扭曲率下,IDEAL算法的健壮性和收敛性均优于SIMPLE算法,特别在高网格扭曲率情况下,IDEAL算法求解性能更加优于SIMPLE算法.在不同网格扭曲率下,IDEAL算法健壮性保持不变,几乎可以在任意速度亚松弛因子下获得收敛的解,同时IDEAL算法最短计算耗时较SIMPLE算法减少了56%~89%,验证了IDEAL算法的优越性.