The Bernoulli shift is a fundamental theoretic model of a sequence of independent and identically distributed(i.i.d.) binary random variables in probability theory, ergodic theory, information theory, and so on. We give a simple sufficient condition for a class of ergodic maps with some symmetric properties to produce a chaotic sequence of i.i.d. binary random variables. This condition is expre...

We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction problems called problems of distance. This class of problems include 1-d, 2-d and circular Golomb rulers. We identify a large number of diierent models, both binary and non-binary, and compare theoretically the level of c...

In this article, we derive the distribution of partially exchangeable binary random variables, generalizing the distribution of exchangeable binary random variables and hence the binomial distribution. The distribution can also be viewed as a mixture of Markov chains. We introduce rectangular complete monotonicity and show that partial exchangebility can be characterized by rectangular complete...

Three constructions for binary lattices with strong pseudorandom properties are given. These constructions are the two dimensional extensions and modifications of three of the most important one dimensional constructions. The upper estimates for the pseudorandom measures of the binary lattices constructed are based on the principle that character sums in two variables can be estimated by fixing...

A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the general case is reduced to the binary case. A Markov basis for binary hierarchical models whose simplicial complexes is the complement of an interval is given.

This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary...

This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary...

Binary decision diagrams (BDDs) are effective means to cope with complex concurrent system. But the size of BDD itself can be relatively large. We study the BDD representation of large synchronous, asynchronous and interleaved processes with communication via shared variables. Due to the features of communication, we introduce a novel representation strategy. Based on the model, we continue to ...

Conway’s game of Life provides interesting problems in which modelling issues in constraint programming can be explored. The problem of finding a maximum density stable pattern (‘still-life’) is discussed. A formulation of this problem as a constraint satisfaction problem with 0-1 variables and non-binary constraints is compared with its dual graph translation into a binary CSP. The success of ...