Conformal Geometry of Sequential Test in Multidimensional Curved Exponential Family

This article presents a differential geometrical method for analyzing sequential test procedures. It is based on the primal result on the conformal geometry of statistical manifold developed in Kumon, Takemura and Takeuchi (2011). By introducing curvature-type random variables, the condition is first clarified for a statistical manifold to be an exponential family under an appropriate sequential test procedure. This result is further elaborated for investigating the efficient sequential test in a multidimensional curved exponential family. The theoretical results are numerically examined by using von Mises-Fisher and hyperboloid models

Managing appointment booking under customer choices

Motivated by the increasing use of online appointment booking platforms, we study how to offer appointment slots to customers to maximize the total number of slots booked. We develop two models, nonsequential offering and sequential offering, to capture different types of interactions between customers and the scheduling system. In these two models, the scheduler offers either a single set of appointment slots for the arriving customer to choose from or multiple sets in sequence, respectively. For the nonsequential model, we identify a static randomized policy, which is asymptotically optimal when the system demand and capacity increase simultaneously, and we further show that offering all available slots at all times has a constant factor of two performance guarantee. For the sequential model, we derive a closed form optimal policy for a large class of instances and develop a simple, effective heuristic for those instances without an explicit optimal policy. By comparing these two models, our study generates useful operational insights for improving the current appointment booking processes. In particular, our analysis reveals an interesting equivalence between the sequential offering model and the nonsequential offering model with perfect customer preference information. This equivalence allows us to apply sequential offering in a wide range of interactive scheduling contexts. Our extensive numerical study shows that sequential offering can significantly improve the slot fill rate (6%–8% on average and up to 18% in our testing cases) compared with nonsequential offering. Given the recent and ongoing growth of online and mobile appointment booking platforms, our research findings can be particularly useful to inform user interface design of these booking platforms

Universal lossless source coding with the Burrows Wheeler transform

The Burrows Wheeler transform (1994) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes are widely touted as low-complexity algorithms giving lossless coding rates better than those of the Ziv-Lempel codes (commonly known as LZ'77 and LZ'78) and almost as good as those achieved by prediction by partial matching (PPM) algorithms. To date, the coding performance claims have been made primarily on the basis of experimental results. This work gives a theoretical evaluation of BWT-based coding. The main results of this theoretical evaluation include: (1) statistical characterizations of the BWT output on both finite strings and sequences of length n → ∞, (2) a variety of very simple new techniques for BWT-based lossless source coding, and (3) proofs of the universality and bounds on the rates of convergence of both new and existing BWT-based codes for finite-memory and stationary ergodic sources. The end result is a theoretical justification and validation of the experimentally derived conclusions: BWT-based lossless source codes achieve universal lossless coding performance that converges to the optimal coding performance more quickly than the rate of convergence observed in Ziv-Lempel style codes and, for some BWT-based codes, within a constant factor of the optimal rate of convergence for finite-memory source

A Universal Scheme for Wyner–Ziv Coding of Discrete Sources

We consider the Wyner–Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by Lempel–Ziv (LZ) compression, while the decompressor is based on a modification of the discrete universal denoiser (DUDE) algorithm to take advantage of side information. The new algorithms not only universally attain the fundamental limits, but also suggest a paradigm for practical WZ coding. The effectiveness of our approach is illustrated with experiments on binary images, and English text using a low complexity algorithm motivated by our class of universally optimal WZ codes

Stretching and folding versus cutting and shuffling: An illustrated perspective on mixing and deformations of continua

We compare and contrast two types of deformations inspired by mixing applications -- one from the mixing of fluids (stretching and folding), the other from the mixing of granular matter (cutting and shuffling). The connection between mechanics and dynamical systems is discussed in the context of the kinematics of deformation, emphasizing the equivalence between stretches and Lyapunov exponents. The stretching and folding motion exemplified by the baker's map is shown to give rise to a dynamical system with a positive Lyapunov exponent, the hallmark of chaotic mixing. On the other hand, cutting and shuffling does not stretch. When an interval exchange transformation is used as the basis for cutting and shuffling, we establish that all of the map's Lyapunov exponents are zero. Mixing, as quantified by the interfacial area per unit volume, is shown to be exponentially fast when there is stretching and folding, but linear when there is only cutting and shuffling. We also discuss how a simple computational approach can discern stretching in discrete data.Comment: REVTeX 4.1, 9 pages, 3 figures; v2 corrects some misprints. The following article appeared in the American Journal of Physics and may be found at http://ajp.aapt.org/resource/1/ajpias/v79/i4/p359_s1 . Copyright 2011 American Association of Physics Teachers. This article may be downloaded for personal use only. Any other use requires prior permission of the author and the AAP

Compactness in Spaces of Inner Regular Measures and a General Portmanteau Lemma

This paper may be understood as a continuation of Topsøe’s seminal paper ([16]) to characterize, within an abstract setting, compact subsets of finite inner regular measures w.r.t. the weak topology. The new aspect is that neither assumptions on compactness of the inner approximating lattices nor nonsequential continuity properties for the measures will be imposed. As a providing step also a generalization of the classical Portmanteau lemma will be established. The obtained characterizations of compact subsets w.r.t. the weak topology encompass several known ones from literature. The investigations rely basically on the inner extension theory for measures which has been systemized recently by König ([8], [10],[12]).Inner Premeasures, Weak Topology, Generalized Portmanteau Lemma.