Testing for randomness in stream ciphers using the binary derivative

The binary derivative has been used to measure the randomness of a binary string formed by a pseudorandom number generator for use in cipher systems. In this paper we develop statistical properties of the binary derivative and show that certain types of randomness testing in binary derivatives are equivalent to well-established tests for randomness in the original string. A uniform method of testing randomness in binary strings is described based on using the binary derivative. We show that the new tests are faster and more powerful than several of the well-established tests for randomness.     

On Block Updating in Markov Random Field Models for Disease Mapping

Gaussian Markov random field (GMRF) models are commonly used to model spatial correlation in disease mapping applications. For Bayesian inference by MCMC, so far mainly single-site updating algorithms have been considered. However, convergence and mixing properties of such algorithms can be extremely poor due to strong dependencies of parameters in the posterior distribution. In this paper, we propose various block sampling algorithms in order to improve the MCMC performance. The methodology is rather general, allows for non-standard full conditionals, and can be applied in a modular fashion in a large number of different scenarios. For illustration we consider three different applications: two formulations for spatial modelling of a single disease (with and without additional unstructured parameters respectively), and one formulation for the joint analysis of two diseases. The results indicate that the largest benefits are obtained if parameters and the corresponding hyperparameter are updated jointly in one large block. Implementation of such block algorithms is relatively easy using methods for fast sampling of Gaussian Markov random fields ( Rue, 2001 ). By comparison, Monte Carlo estimates based on single-site updating can be rather misleading, even for very long runs. Our results may have wider relevance for efficient MCMC simulation in hierarchical models with Markov random field components.     

Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs

This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs. Working of the algorithm is illustrated with the help of an example. The algorithm is able to generate balanced incomplete block designs very fast in most of the cases. The performance of the proposed algorithm is compared with other algorithms proposed in the literature. It is demonstrated that the proposed algorithm is competitive with the existing algorithms.     

A note on the optimality of resolvable block designs with unequal block sizes

(M,S)-optimality is used in computer search algorithms as a quick way of filtering out inefficient designs. We show that it does not work well for resolvable designs with unequal block sizes. Instead we suggest the use of a criterion based on the dual design.     

Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model

ABSTRACT

In this study, methods for efficient construction of A-, MV-, D- and E-optimal or near-optimal block designs for two-colour cDNA microarray experiments with array as the block effect are considered. Two algorithms, namely the array exchange and treatment exchange algorithms together with the complete enumeration technique are introduced. For large numbers of arrays or treatments or both, the complete enumeration method is highly computer intensive. The treatment exchange algorithm computes the optimal or near-optimal designs faster than the array exchange algorithm. The two methods however produce optimal or near-optimal designs with the same efficiency under the four optimality criteria.     

Recursive formulae for the average efficiency factor in block and row-column designs

Interchange algorithms are widely used to construct efficient block and row-column designs. We provide simple recursive formulae for updating this average efficiency factor, so that it is no longer computationally expensive to calculate it after each possible interchange.     

On MCMC sampling in hierarchical longitudinal models

Markov chain Monte Carlo (MCMC) algorithms have revolutionized Bayesian practice. In their simplest form (i.e., when parameters are updated one at a time) they are, however, often slow to converge when applied to high-dimensional statistical models. A remedy for this problem is to block the parameters into groups, which are then updated simultaneously using either a Gibbs or Metropolis-Hastings step. In this paper we construct several (partially and fully blocked) MCMC algorithms for minimizing the autocorrelation in MCMC samples arising from important classes of longitudinal data models. We exploit an identity used by Chib (1995) in the context of Bayes factor computation to show how the parameters in a general linear mixed model may be updated in a single block, improving convergence and producing essentially independent draws from the posterior of the parameters of interest. We also investigate the value of blocking in non-Gaussian mixed models, as well as in a class of binary response data longitudinal models. We illustrate the approaches in detail with three real-data examples.     

An evolutionary algorithm for A-optimal incomplete block designs

Evolutionary algorithms are heuristic stochastic search and optimization techniques with principles taken from natural genetics. They are procedures mimicking the evolution process of an initial population through genetic transformations. This paper is concerned with the problem of finding A-optimal incomplete block designs for multiple treatment comparisons represented by a matrix of contrasts. An evolutionary algorithm for searching optimal, or nearly optimal, incomplete block designs is described in detail. Various examples regarding the application of the algorithm to some well-known problems illustrate the good performance of the algorithm     

Methods for testing subblock patterns

A number of statistical tests have been recommended over the last twenty years for assessing the randomness of long binary strings used in cryptographic algorithms. Several of these tests include methods of examining subblock patterns. These tests are the uniformity test, the universal test and the repetition test. The effectiveness of these tests are compared based on the subblock length, the limitations on data requirements, and on their power in detecting deviations from randomness. Due to the complexity of the test statistics, the power functions are estimated by simulation methods. The results show that for small subblocks the uniformity test is more powerful than the universal test, and that there is some doubt about the parameters of the hypothesised distribution for the universal test statistic. For larger subblocks the results show that the repetition test is the most effective test, since it requires far less data than either of the other two tests and is an efficient test in detecting deviations from randomness in binary strings.     

基于块状bootstrap技术的Bagging Trees集成算法研究

集成算法已经成为机器学习研究的一大热点,已有许多改进的集成算法,但对"病态"数据的集成研究并不常见。本文通过对一海藻繁殖案例的研究,提出了一种基于块状bootstrap技术的集成算法,并将其与几种常用的集成算法比较研究得出,在对于一些"病态"数据而言,该算法往往比其它算法具有更小的模型推广误差和更高的预测精度的优点。     

Neighbor-Balanced Bipartite Block Designs

This article deals with the neighbor-balanced block design setting when there are two disjoint sets of treatments, one set consisting of test treatments and the other of control treatments. The interest here is to estimate the contrasts pertaining to test treatments vs. control treatments (with respect to direct and neighbors) with as high precision as possible. Some series of neighbor-balanced block designs for comparing a set of test treatments to a set of control treatments have been developed. The designs obtained are totally balanced in the sense that all the contrasts among test treatments for direct and neighbor effects are estimated with same variance and all the contrasts pertaining to test vs. control for direct and neighbor effects are estimated with the same variance.     

Some results concerning off-training-set and IID error for the Gibbs and the Bayes optimal generalizers

In this paper we analyse the average behaviour of the Bayes-optimal and Gibbs learning algorithms. We do this both for off-training-set error and conventional IID (independent identically distributed) error (for which test sets overlap with training sets). For the IID case we provide a major extension to one of the better known results. We also show that expected IID test set error is a non-increasing function of training set size for either algorithm. On the other hand, as we show, the expected off-training-set error for both learning algorithms can increase with training set size, for non-uniform sampling distributions. We characterize the relationship the sampling distribution must have with the prior for such an increase. We show in particular that for uniform sampling distributions and either algorithm, the expected off-training-set error is a non-increasing function of training set size. For uniform sampling distributions, we also characterize the priors for which the expected error of the Bayes-optimal algorithm stays constant. In addition we show that for the Bayes-optimal algorithm, expected off-training-set error can increase with training set size when the target function is fixed, but if and only if the expected error averaged over all targets decreases with training set size. Our results hold for arbitrary noise and arbitrary loss functions.     

A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS

An algorithm for the construction of a wide class of block designs including Balanced Incomplete Blocks (BIB) is described. The algorithm which allows the experimenter to give weights for a set of treatment contrasts uses an initial starting design to generate an optimal block design sequentially. The performance of the algorithm is illustrated by examples, and designs constructed by the algorithm compare favourably with designs generated by other methods.     

Fast sampling of Gaussian Markov random fields

This paper demonstrates how Gaussian Markov random fields (conditional autoregressions) can be sampled quickly by using numerical techniques for sparse matrices. The algorithm is general and efficient, and expands easily to various forms for conditional simulation and evaluation of normalization constants. We demonstrate its use by constructing efficient block updates in Markov chain Monte Carlo algorithms for disease mapping.     

Construction of central composite designs for balanced orthogonal blocks

Box & Hunter (1957) recommended a set of orthogonally blocked central composite designs (CCD) when the region of interest is spherical. In order to achieve rotatability along with orthogonal blocking, the block size for those designs becomes unequal and it may not be attractive or practical to use such unequally blocked designs in many practical situations. In this paper, a construction method of orthogonally blocked CCD under the assumption of equal block size is proposed and an index of block orthogonality is introduced.     

Maximum likelihood computation for fitting semiparametric mixture models

Three general algorithms that use different strategies are proposed for computing the maximum likelihood estimate of a semiparametric mixture model. They seek to maximize the likelihood function by, respectively, alternating the parameters, profiling the likelihood and modifying the support set. All three algorithms make a direct use of the recently proposed fast and stable constrained Newton method for computing the nonparametric maximum likelihood of a mixing distribution and employ additionally an optimization algorithm for unconstrained problems. The performance of the algorithms is numerically investigated and compared for solving the Neyman-Scott problem, overcoming overdispersion in logistic regression models and fitting two-level mixed effects logistic regression models. Satisfactory results have been obtained.     

On the Bumpy Road to the Dominant Mode

Abstract. Maximum likelihood estimation in many classical statistical problems is beset by multimodality. This article explores several variations of deterministic annealing that tend to avoid inferior modes and find the dominant mode. In Bayesian settings, annealing can be tailored to find the dominant mode of the log posterior. Our annealing algorithms involve essentially trivial changes to existing optimization algorithms built on block relaxation or the EM or MM principle. Our examples include estimation with the multivariate t distribution, Gaussian mixture models, latent class analysis, factor analysis, multidimensional scaling and a one‐way random effects model. In the numerical examples explored, the proposed annealing strategies significantly improve the chances for locating the global maximum.     

Block designs robust against the presence of positional effects

The problem considered is to find optimum designs for treatment effects in a block design (BD) setup, when positional effects are also present besides treatment and block effects, but they are ignored while formulating the model. In the class of symmetric balanced incomplete block designs, the Youden square design is shown to be optimal in the sense of minimizing the bias term in the mean squared error (MSE) of the best linear unbiased estimators of the full set of orthonormal treatment contrasts, irrespective of the value of the positional effects.     

Optimal Bayesian estimators for latent variable cluster models

In cluster analysis interest lies in probabilistically capturing partitions of individuals, items or observations into groups, such that those belonging to the same group share similar attributes or relational profiles. Bayesian posterior samples for the latent allocation variables can be effectively obtained in a wide range of clustering models, including finite mixtures, infinite mixtures, hidden Markov models and block models for networks. However, due to the categorical nature of the clustering variables and the lack of scalable algorithms, summary tools that can interpret such samples are not available. We adopt a Bayesian decision theoretical approach to define an optimality criterion for clusterings and propose a fast and context-independent greedy algorithm to find the best allocations. One important facet of our approach is that the optimal number of groups is automatically selected, thereby solving the clustering and the model-choice problems at the same time. We consider several loss functions to compare partitions and show that our approach can accommodate a wide range of cases. Finally, we illustrate our approach on both artificial and real datasets for three different clustering models: Gaussian mixtures, stochastic block models and latent block models for networks.     

Randomized heuristic algorithms for orthogonal projection of a point onto a set

Abstract

The problem of orthogonal projection of a point onto a set is an essential problem of computational geometry. This problem has many practical applications in different areas such as robotics, computer graphics and so on. In the present paper three algorithms for solving this problem are proposed. This algorithms are based on the idea of heuristic random search. Numerical experiments illustrating the work of the proposed methods are presented.