Burst event detection in wall turbulence by WVITA method

Wavelet Variable Interval Time Average (WVITA) is introduced as a method incorporating burst event detection in wall turbulence. Wavelet transform is performed to unfold the longitudinal fluctuating velocity time series measured in the near wall region of a turbulent boundary layer using hot-film anemometer. This unfolding is both in time and in space simultaneously. The splitted kinetic of the longitudinal fluctuating velocity time series among different scales is obtained by integrating the square of wavelet coefficient modulus over temporal space. The time scale that related to burst events in wall turbulence passing through the fixed probe is ascertained by maximum criterion of the kinetic energy evolution across scales. Wavelet transformed localized variance of the fluctuating velocity time series at the maximum kinetic scale is put forward instead of localized short time average variance in Variable Interval Time Average (VITA) scheme. The burst event detection result shows that WVITA scheme can avoid erroneous judgement and solve the grouping problem more effectively which is caused by VITA scheme itself and can not be avoided by adjusting the threshold level or changing the short time average interval.

Effects of Noise and Detection Error in a Dynamic Adaptive Optics System

It is well known that noise and detection error can affect the performances of an adaptive optics (AO) system. Effects of noise and detection error on the phase compensation effectiveness in a dynamic AO system are investigated by means of a pure numerical simulation in this paper. A theoretical model for numerically simulating effects of noise and detection error in a static AO system and a corresponding computer program were presented in a previous article. A numerical simulation of effects of noise and detection error is combined with our previous numeral simulation of a dynamic AO system in this paper and a corresponding computer program has been compiled. Effects of detection error, readout noise and photon noise are included and investigated by a numerical simulation for finding the preferred working conditions and the best performances in a practical dynamic AO system. An approximate model is presented as well. Under many practical conditions such approximate model is a good alternative to the more accurate one. A simple algorithm which can be used for reducing the effect of noise is presented as well. When signal to noise ratio is very low, such method can be used to improve the performances of a dynamic AO system.

Bayesian Online Changepoint Detection

Changepoints are abrupt variations in the generative parameters of a data sequence. Online detection of changepoints is useful in modelling and prediction of time series in application areas such as finance, biometrics, and robotics. While frequentist methods have yielded online filtering and prediction techniques, most Bayesian papers have focused on the retrospective segmentation problem. Here we examine the case where the model parameters before and after the changepoint are independent and we derive an online algorithm for exact inference of the most recent changepoint. We compute the probability distribution of the length of the current ``run,'' or time since the last changepoint, using a simple message-passing algorithm. Our implementation is highly modular so that the algorithm may be applied to a variety of types of data. We illustrate this modularity by demonstrating the algorithm on three different real-world data sets.

Laminar Plasma Spraying of Metal Wire in Atmosphere

利用层流等离子体射流，以普通工程铁丝为喷涂材料，在Q235基体表面制备金属涂层，并利用喷涂系统的参数可调性研究工艺参数对涂层质量的影响。结果表明，利用层流等离子体射流喷涂可以得到具有典型层状结构、氧化较少的致密涂层。

Models and algorithms for detection and tracking of coordinated groups

In this paper, we describe models and algorithms for detection and tracking of group and individual targets. We develop two novel group dynamical models, within a continuous time setting, that aim to mimic behavioural properties of groups. We also describe two possible ways of modeling interactions between closely using Markov Random Field (MRF) and repulsive forces. These can be combined together with a group structure transition model to create realistic evolving group models. We use a Markov Chain Monte Carlo (MCMC)-Particles Algorithm to perform sequential inference. Computer simulations demonstrate the ability of the algorithm to detect and track targets within groups, as well as infer the correct group structure over time. ©2008 IEEE.

The cross-entropy method for blind multiuser detection

We consider the problem of blind multiuser detection. We adopt a Bayesian approach where unknown parameters are considered random and integrated out. Computing the maximum a posteriori estimate of the input data sequence requires solving a combinatorial optimization problem. We propose here to apply the Cross-Entropy method recently introduced by Rubinstein. The performance of cross-entropy is compared to Markov chain Monte Carlo. For similar Bit Error Rate performance, we demonstrate that Cross-Entropy outperforms a generic Markov chain Monte Carlo method in terms of operation time.