Synchronization of Speech and Gesture : Evidence for Interaction in Action

Peer reviewedPostprin

Symbolic analysis for some planar piecewise linear maps

In this paper a class of linear maps on the 2-torus and some planar piecewise isometries are discussed. For these discontinuous maps, by introducing codings underlying the map operations, symbolic descriptions of the dynamics and admissibility conditions for itineraries are given, and explicit expressions in terms of the codings for periodic points are presented.Comment: 4 Figure

Quantisation of a particle moving on a group manifold

The Hilbert space of a free massless particle moving on a group manifold is studied in details using canonical quantisation. While the simplest model is invariant under a global symmetry, $G \times G$, there is a very natural way to ``factorise" the theory so that only one copy of the global symmetry is preserved. In the case of $G=SU(2)$, a simple deformation of the quantised theory is proposed to give a realisation of the quantum group, $U_t(SL(2))$. The symplectic structures of the corresponding classical theory is derived. This can be used, in principle, to obtain a Lagrangian formulation for the $U_t(SL(2))$ symmetry.Comment: DAMTP-94-41, 11 page

Growth of Pseudotypes of Vesicular Stomatitis Virus with N-Tropic Murine Leukemia Virus Coats in Cells Resistant to N-Tropic Viruses

Formation of pseudotypes between murine RNA tumor viruses and vesicular stomatitis virus (VSV) has been confirmed. Pseudotypes of VSV genomes coated by the surface envelope from an N-tropic tumor virus grew equally well in cells homozygous for either the Fv-1n or Fv-1b alleles. Therefore, the product of the Fv-1 locus, which restricts growth of murine RNA tumor viruses, must act on an intracellular aspect of tumor virus replication, a step after attachment and penetration

Stable Model Counting and Its Application in Probabilistic Logic Programming

Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the probability of given queries being true provided a set of mutually independent random variables, a model (a logic program) and some evidence. The core of solving this inference task involves translating the logic program to a propositional theory and using a model counter. In this paper, we show that for some problems that involve inductive definitions like reachability in a graph, the translation of logic programs to SAT can be expensive for the purpose of solving inference tasks. For such problems, direct implementation of stable model semantics allows for more efficient solving. We present two implementation techniques, based on unfounded set detection, that extend a propositional model counter to a stable model counter. Our experiments show that for particular problems, our approach can outperform a state-of-the-art probabilistic logic programming solver by several orders of magnitude in terms of running time and space requirements, and can solve instances of significantly larger sizes on which the current solver runs out of time or memory.Comment: Accepted in AAAI, 201

Electrophysiological and kinematic correlates of communicative intent in the planning and production of pointing gestures and speech

Acknowledgements We thank Albert Russel for assistance in setting up the experiments, and Charlotte Paulisse for help in data collection.Peer reviewedPublisher PD