We consider sequential detection based on quantized data in the presence of eavesdropper. Stochastic encryption is employed as a counter measure that flips the quantization bits at each sensor according to certain probabilities, and the flipping probabilities are only known to the legitimate fusion center (LFC) but not the eavesdropping fusion center (EFC). As a result, the LFC employs the opti...

We present an efficient, reliable, and easy-to-implement algorithm to compute steady-state probabilities for birth-death processes whose upper-tail probabilities decay geometrically or faster. The algorithm can provide any required accuracy and it avoids overand underflow. In addition to steady-state probabilities, the algorithm can compute any performance measure that can be expressed as the e...

Gibbs-type random probability measures, or Gibbs-type priors, are arguably the most “natural” generalization of the celebrated Dirichlet prior. Among them the two parameter Poisson–Dirichlet prior certainly stands out for the mathematical tractability and interpretability of its predictive probabilities, which made it the natural candidate in several applications. Given a sample of size n, in t...

The information contained in any given experimental time series can be utilized more exhaustively when transition probabilities between states are studied rather than state probabilities alone. Using advanced techniques of time series analysis, it is shown that deviations from dynamical randomness indicate evidence for unexpected temporal correlation features in selected data sets taken from a ...

To obtain test probabilities based on empirical approximations to the distribution of a Studentized function of a mean we need the approximations to be accurate with suuciently high probability. In particular, when these test probabilities are small it is best to consider relative errors. Here we show that in the case of univari-ate standardized means and in the general case of tests based on s...

When making decisions involving risky outcomes on the basis of verbal descriptions of the outcomes and their associated probabilities, people behave as if they overweight small probabilities. In contrast, when the same outcomes are instead experienced in a series of samples, people behave as if they underweight small probabilities. We present two experiments showing that the existing explanatio...

Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubitflip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-ShorSteane construction based on two linear codes. We present families of toric surfaces, toric codes and associated asymmetric quantum error-correcting codes.

Boosting is a general method for improving the accuracy of any given learning algorithm. Focusing primarily on the AdaBoost algorithm , we brieey survey theoretical work on boosting including analyses of AdaBoost's training error and generalization error, connections between boosting and game theory, methods of estimating probabilities using boosting, and extensions of AdaBoost for multiclass c...

This paper 1 investigates the efficiency of the applied redundancy via channel coding or source coding diversity in narrowband short range wireless networks on the example of Bluetooth. The efficiency of such approaches is investigated in order to be applied as data reliability improvement techniques. Taking into account their error correction capabilities, the packet error probabilities are es...