A sequence over an alphabet Σ is called disjunctive [13] if it contains all possible finite strings over Σ as its substrings. Disjunctive sequences have been recently studied in various contexts, e.g. [12, 9]. They abound in both category and measure senses [5]. In this paper we measure the complexity of a sequence x by the complexity of the language P (x) consisting of all prefixes of x. The l...

Abstract The superheating field H s mathvariant="normal">h of the Meissner state is thought to determine theoretical field-limit superconducting accelerator cavities. We inv...

A powerful approach to probabilistic modelling involves supplementing a set of observed variables with additional latent, or hidden, variables. By defining a joint distribution over visible and latent variables, the corresponding distribution of the observed variables is then obtained by marginalization. This allows relatively complex distributions to be expressed in terms of more tractable joi...

We consider problems in finite-sample inference with two-step, monotone incomplete data drawn from Nd(μ,Σ), a multivariate normal population with mean μ and covariance matrix Σ. We derive stochastic representations for the distributions of μ̂ and Σ̂, the maximum likelihood estimators of μ and Σ, respectively. Under the assumption that Σ is block-diagonal when partitioned according to the two-step...