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...

Amethodology is developed to add runs to existing supersaturated designs. The technique uses information from the analysis of the initial experiment to choose the best possible follow-up runs. After analysis of the initial data, factors are classified into one of three groups: primary, secondary, and potential. Runs are added to maximize a Bayesian D-optimality criterion to increase the informa...

A second order sufficient optimality criterion is presented for a multiobjective problem subject to a constraint given just as a set. To this aim, we first refine known necessary conditions in such a way that the sufficient ones differ by the replacement of inequalities by strict inequalities. Furthermore, we show that no relationship holds between this criterion and a sufficient multipliers ru...

Tree structures have been shown to provide an efficient framework for propagating beliefs [Pearl,l986]. This paper studies the problem of finding an optimal approximating tree. The star­ decomposition scheme for sets of three binary variables [Lazarsfeld,l966; Pearl,1986] is shown to enhance the class of probability distributions that can support tree structures; such structures are called tree...