Signal Detection in Generalized Gaussian Noise by Nonlinear Wavelet Denoising

In this paper, a nonlinear suboptimal detector whose performance in heavy-tailed noise is significantly better than that of the matched filter is proposed. The detector consists of a nonlinear wavelet denoising filter to enhance the signal-to-noise ratio, followed by a replica correlator. Performance of the detector is investigated through an asymptotic theoretical analysis as well as Monte Carlo simulations. The proposed detector offers the following advantages over the optimal (in the Neyman-Pearson sense) detector: it is easier to implement, and it is more robust with respect to error in modeling the probability distribution of noise.

Lipschitz Correspondence between Metric Measure Spaces and Random Distance Matrices

Given a metric space with a Borel probability measure, for each integer N, we obtain a probability distribution on N x N distance matrices by considering the distances between pairs of points in a sample consisting of N points chosen independently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Modeling Time-Varying Aggregate Interference in Cognitive Radio Systems, and Application to Primary Exclusive Zone Design

Accurately characterizing the time-varying interference caused to the primary users is essential in ensuring a successful deployment of cognitive radios (CR). We show that the aggregate interference at the primary receiver (PU-Rx) from multiple, randomly located cognitive users (CUs) is well modeled as a shifted lognormal random process, which is more accurate than the lognormal and the Gaussian process models considered in the literature, even for a relatively dense deployment of CUs. It also compares favorably with the asymptotically exact stable and symmetric truncated stable distribution models, except at high CU densities. Our model accounts for the effect of imperfect spectrum sensing, which depends on path-loss, shadowing, and small-scale fading of the link from the primary transmitter to the CU; the interweave and underlay modes or CR operation, which determine the transmit powers of the CUs; and time-correlated shadowing and fading of the links from the CUs to the PU-Rx. It leads to expressions for the probability distribution function, level crossing rate, and average exceedance duration. The impact of cooperative spectrum sensing is also characterized. We validate the model by applying it to redesign the primary exclusive zone to account for the time-varying nature of interference.

Flame surface statistics of constant-pressure turbulent expanding premixed flames

In this paper we investigate the local flame surface statistics of constant-pressure turbulent expanding flames. First the statistics of local length ratio is experimentally determined from high-speed planar Mie scattering images of spherically expanding flames, with the length ratio on the measurement plane, at predefined equiangular sectors, defined as the ratio of the actual flame length to the length of a circular-arc of radius equal to the average radius of the flame. Assuming isotropic distribution of such flame segments we then convolute suitable forms of the length-ratio probability distribution functions (pdfs) to arrive at the corresponding area-ratio pdfs. It is found that both the length ratio and area ratio pdfs are near log-normally distributed and shows self-similar behavior with increasing radius. Near log-normality and rather intermittent behavior of the flame-length ratio suggests similarity with dissipation rate quantities which stimulates multifractal analysis. (C) 2014 AIP Publishing LLC.

Statistics of the inverse-cascade regime in two-dimensional magnetohydrodynamic turbulence

We present a detailed direct numerical simulation of statistically steady, homogeneous, isotropic, two-dimensional magnetohydrodynamic turbulence. Our study concentrates on the inverse cascade of the magnetic vector potential. We examine the dependence of the statistical properties of such turbulence on dissipation and friction coefficients. We extend earlier work significantly by calculating fluid and magnetic spectra, probability distribution functions (PDFs) of the velocity, magnetic, vorticity, current, stream-function, and magnetic-vector-potential fields, and their increments. We quantify the deviations of these PDFs from Gaussian ones by computing their flatnesses and hyperflatnesses. We also present PDFs of the Okubo-Weiss parameter, which distinguishes between vortical and extensional flow regions, and its magnetic analog. We show that the hyperflatnesses of PDFs of the increments of the stream function and the magnetic vector potential exhibit significant scale dependence and we examine the implication of this for the multiscaling of structure functions. We compare our results with those of earlier studies.

Electron transfer statistics and thermal fluctuations in molecular junctions

We derive analytical expressions for probability distribution function (PDF) for electron transport in a simple model of quantum junction in presence of thermal fluctuations. Our approach is based on the large deviation theory combined with the generating function method. For large number of electrons transferred, the PDF is found to decay exponentially in the tails with different rates due to applied bias. This asymmetry in the PDF is related to the fluctuation theorem. Statistics of fluctuations are analyzed in terms of the Fano factor. Thermal fluctuations play a quantitative role in determining the statistics of electron transfer; they tend to suppress the average current while enhancing the fluctuations in particle transfer. This gives rise to both bunching and antibunching phenomena as determined by the Fano factor. The thermal fluctuations and shot noise compete with each other and determine the net (effective) statistics of particle transfer. Exact analytical expression is obtained for delay time distribution. The optimal values of the delay time between successive electron transfers can be lowered below the corresponding shot noise values by tuning the thermal effects. (C) 2015 AIP Publishing LLC.

Descending from infinity: Convergence of tailed distributions

We investigate the relaxation of long-tailed distributions under stochastic dynamics that do not support such tails. Linear relaxation is found to be a borderline case in which long tails are exponentially suppressed in time but not eliminated. Relaxation stronger than linear suppresses long tails immediately, but may lead to strong transient peaks in the probability distribution. We also find that a delta-function initial distribution under stronger than linear decay displays not one but two different regimes of diffusive spreading.

Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Homogeneous isotropic superfluid turbulence in two dimensions: Inverse and forward cascades in the Hall-Vinen-Bekharevich-Khalatnikov model

We present the first direct-numerical-simulation study of the statistical properties of two-dimensional superfluid turbulence in the simplified, Hall-Vinen-Bekharevich-Khalatnikov two-fluid model. We show that both normalfluid and superfluid energy spectra can exhibit two power-law regimes, the first associated with an inverse cascade of energy and the second with the forward cascade of enstrophy. We quantify the mutual-friction-induced alignment of normal and superfluid velocities by obtaining probability distribution functions of the angle between them and the ratio of their moduli.

Burst Detection in Turbulent Channel Flows Based on Large Eddy Simulation Databases

Reliable turbulent channel flow databases at several Reynolds numbers have been established by large eddy simulation (LES), with two of them validated by comparing with typical direct numerical simulation (DNS) results. Furthermore, the statistics, such as velocity profile, turbulent intensities and shear stress, were obtained as well as the temporal and spatial structure of turbulent bursts. Based on the LES databases available, the conditional sampling methods are used to detect the structures of burst events. A method to deterimine the grouping parameter from the probability distribution function (pdf) curve of the time separation between ejection events is proposed to avoid the errors in detected results. And thus, the dependence of average burst period on thresholds is considerably weakened. Meanwhile, the average burst-to-bed area ratios are detected. It is found that the Reynolds number exhibits little effect on the burst period and burst-to-bed area ratio.

Some characteristics of low-speed streaks under sheared air-water interfaces

The characteristics of low-speed fluid streaks occurring under sheared air-water interfaces were examined by means of hydrogen bubble visualization technique. A critical shear condition under which the streaky structure first appears was determined to be u(tau) approximate to 0.19 cm/s. The mean spanwise streak spacing increases with distance from the water surface owing to merging and bursting processes, and a linear relationship describing variation of non-dimensional spacing <(+)over bar> versus y(+) was found essentially independent of shear stress on the interface. Values of <(+)over bar>, however, are remarkably smaller than their counterparts in the near-wall region of turbulent boundary layers. Though low-speed streaks occur randomly in time and space, the streak spacing exhibits a lognormal probability distribution behavior. A tentative explanation concerning the formation of streaky structure is suggested, and the fact that <(+)over bar> takes rather smaller values than that in wall turbulence is briefly discussed.

Turbulence in laminar premixed V-flames

Strong velocity fluctuations had been found in the laminar premixed V-flames. These velocity fluctuations are closely related to the chemical reaction. But the effects of the upstream combustible mixture velocity on the velocity fluctuations inside the flame are quite weak. The probability distribution function (PDF) of the velocity in the centre region of the flame appears "flat top" shaped. By analyzing the experiment results the flame-flow interactions are found to affect the flame not only at large scale in the flow field but also at small scale inside the flame. These effects will give rise to flame generated small scale turbulences.

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.

Temporally adaptive estimation of logistic classifiers on data streams

Modern technology has allowed real-time data collection in a variety of domains, ranging from environmental monitoring to healthcare. Consequently, there is a growing need for algorithms capable of performing inferential tasks in an online manner, continuously revising their estimates to reflect the current status of the underlying process. In particular, we are interested in constructing online and temporally adaptive classifiers capable of handling the possibly drifting decision boundaries arising in streaming environments. We first make a quadratic approximation to the log-likelihood that yields a recursive algorithm for fitting logistic regression online. We then suggest a novel way of equipping this framework with self-tuning forgetting factors. The resulting scheme is capable of tracking changes in the underlying probability distribution, adapting the decision boundary appropriately and hence maintaining high classification accuracy in dynamic or unstable environments. We demonstrate the scheme's effectiveness in both real and simulated streaming environments. © Springer-Verlag 2009.