Before we discuss the details of the Bayesian detection, let us take a quick tour about the overall framework to detect (or classify) an object in practice. In the Bayesian setting, we model observations as random samples drawn from some probability distributions. The classification process usually involves extracting features from the observations, and a decision rule that satisfies certain op...

Properties of the most familiar optimality criteria, for example A-, Dand E-optimality, are well known, but the distance optimality criterion has not drawn much attention to date. In this paper properties of the distance optimality criterion for the parameter vector of the classical linear model under normally distributed errors are investigated. DS-optimal designs are derived for ®rst-order po...

Let n and k be integers, with n > 1 and k > 0. An (n×n)/k semiLatin square S is an n × n array, whose entries are k-subsets of an nk-set, the set of symbols of S, such that each symbol of S is in exactly one entry in each row and exactly one entry in each column of S. SemiLatin squares form an interesting class of combinatorial objects which are useful in the design of comparative experiments. ...

Herein, the problem of estimating propagation delays of the transmitted signals in a direct-sequence code-division multiple access (DS-CDMA) system operating over fading channels is considered. Even though this study is limited to the case when the propagation delays are xed during the observation interval , the channel gain and phase are allowed to vary in time. Special attention is given to t...

An algorithm is derived which performs optimal symbolby-symbol detection of a pulse amplitude modulated sequence. The algorithm is similar to the Viterhi algorithm with the optimality criterion optimal symbol detection rather than optimal sequence detection. A salient common feature is the merge phenomenon which allows common decisions to be made before the entire sequence is received.

ε-Differential privacy is a property that seeks to characterize privacy in data sets. It is formulated as a query-response method, and computationally achieved by output perturbation. Several noise-addition methods to implement such output perturbation have been proposed in the literature. We focus on data-independent noise, that is, noise whose distribution is constant across data sets. Our go...

Unfortunately, the incorrect version of [1, Theorem 4.3] was published. The correct version of [1, Theorem 4.3] is given in this paper. By employing the generalized higher-order contingent derivatives of set-valued maps, Wang et al. [1] established a sufficient optimality condition of weakly efficient solutions for (SV P): (SV P) min F(x), s.t. G(x) (−D) = ∅, x ∈ E. Theorem 1 (see [1, Theorem 4...

This article obtains some sufficient conditions to establish the A-optimality of block designs with unequal block sizes for making test treatments control comparisons under a suitable heteroscedastic model. Balanced test treatments incomplete block designs with unequal block sizes of type G are defined. Some general methods of constructing these designs are given and their A-efficiencies are in...

The A* admissibility and optimality proofs presented to date have been based on overly restrictive assumptions about the relationship between real and estimated costs. This paper shows that idealism, accuracy and selectivity, properties hitherto thought to be unique to A*, are in fact common to all ordered searches, and do not require the evaluation function / = g+ h traditionally assumed. Cons...