Tailoring teleportation to the quantum alphabet

We introduce a refinement of the standard continuous variable teleportation measurement and displacement strategies. This refinement makes use of prior knowledge about the target state and the partial information carried by the classical channel when entanglement is nonmaximal. This gives an improvement in the output quality of the protocol. The strategies we introduce could be used in current continuous variable teleportation experiments.

Parsing Arabic relative clauses: A paninian dependency grammar approach

We present an approach to parsing rehive clauses in Arabic in the tradition of the Paninian Grammar Frumework/2] which leads to deriving U common logicul form for equivalent sentences. Particular attention is paid to the analysis of resumptive pronouns in the retrieval of syntuctico-semantic relationships. The analysis arises from the development of a lexicalised dependency grammar for Arabic that has application for machine translation.

Prefrontal cortex involvement in selective letter generation: A functional magnetic resonance imaging study

Cerebral responses to alternating periods of a control task and a selective letter generation paradigm were investigated with functional Magnetic Resonance Imaging (fMRI). Subjects selectively generated letters from four designated sets of six letters from the English language alphabet, with the instruction that they were not to produce letters in alphabetical order either forward or backward, repeat or alternate letters. Performance during this condition was compared with that of a control condition in which subjects recited the same letters in alphabetical order. Analyses revealed significant and extensive foci of activation in a number of cerebral regions including mid-dorsolateral frontal cortex, inferior frontal gyrus, precuneus, supramarginal gyrus, and cerebellum during the selective letter generation condition. These findings are discussed with respect to recent positron emission tomography (PET) and fMRI studies of verbal working memory and encoding/retrieval in episodic memory.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.