Setting the Backdrop: Analyzing the Collection and Implementation of Cross-Cultural Research in Screenwriting Setting Development

Undergraduate Creative and Artisti

A Generative Model for Score Normalization in Speaker Recognition

We propose a theoretical framework for thinking about score normalization, which confirms that normalization is not needed under (admittedly fragile) ideal conditions. If, however, these conditions are not met, e.g. under data-set shift between training and runtime, our theory reveals dependencies between scores that could be exploited by strategies such as score normalization. Indeed, it has been demonstrated over and over experimentally, that various ad-hoc score normalization recipes do work. We present a first attempt at using probability theory to design a generative score-space normalization model which gives similar improvements to ZT-norm on the text-dependent RSR 2015 database

Voter models with heterozygosity selection

This paper studies variations of the usual voter model that favor types that are locally less common. Such models are dual to certain systems of branching annihilating random walks that are parity preserving. For both the voter models and their dual branching annihilating systems we determine all homogeneous invariant laws, and we study convergence to these laws started from other initial laws.Comment: Published in at http://dx.doi.org/10.1214/07-AAP444 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Systems of branching, annihilating, and coalescing particles

This paper studies systems of particles following independent random walks and subject to annihilation, binary branching, coalescence, and deaths. In the case without annihilation, such systems have been studied in our 2005 paper "Branching-coalescing particle systems". The case with annihilation is considerably more difficult, mainly as a consequence of the non-monotonicity of such systems and a more complicated duality. Nevertheless, we show that adding annihilation does not significantly change the long-time behavior of the process and in fact, systems with annihilation can be obtained by thinning systems without annihilation

The Brownian net

The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is possible to obtain a nontrivial limiting object if the random walks in addition branch with a small probability. We call the limiting object the Brownian net, and study some of its elementary properties.Comment: Published in at http://dx.doi.org/10.1214/07-AOP357 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org