Lunar navigation study, volume 2 Final report, Jan. - Dec. 1966

Performance data utilization in mission phase, lunar exploration phase, and navigational phase of lunar roving vehicle mission

Hippocampal Infusion of Zeta Inhibitory Peptide Impairs Recent, but Not Remote, Recognition Memory in Rats.

Spatial memory in rodents can be erased following the infusion of zeta inhibitory peptide (ZIP) into the dorsal hippocampus via indwelling guide cannulas. It is believed that ZIP impairs spatial memory by reversing established late-phase long-term potentiation (LTP). However, it is unclear whether other forms of hippocampus-dependent memory, such as recognition memory, are also supported by hippocampal LTP. In the current study, we tested recognition memory in rats following hippocampal ZIP infusion. In order to combat the limited targeting of infusions via cannula, we implemented a stereotaxic approach for infusing ZIP throughout the dorsal, intermediate, and ventral hippocampus. Rats infused with ZIP 3-7 days after training on the novel object recognition task exhibited impaired object recognition memory compared to control rats (those infused with aCSF). In contrast, rats infused with ZIP 1 month after training performed similar to control rats. The ability to form new memories after ZIP infusions remained intact. We suggest that enhanced recognition memory for recent events is supported by hippocampal LTP, which can be reversed by hippocampal ZIP infusion

Qudit versions of the qubit "pi-over-eight" gate

When visualised as an operation on the Bloch sphere, the qubit "pi-over-eight" gate corresponds to one-eighth of a complete rotation about the vertical axis. This simple gate often plays an important role in quantum information theory, typically in situations for which Pauli and Clifford gates are insufficient. Most notably, when it supplements the set of Clifford gates then universal quantum computation can be achieved. The "pi-over-eight" gate is the simplest example of an operation from the third level of the Clifford hierarchy (i.e., it maps Pauli operations to Clifford operations under conjugation). Here we derive explicit expressions for all qudit (d-level, where d is prime) versions of this gate and analyze the resulting group structure that is generated by these diagonal gates. This group structure differs depending on whether the dimensionality of the qudit is two, three or greater than three. We then discuss the geometrical relationship of these gates (and associated states) with respect to Clifford gates and stabilizer states. We present evidence that these gates are maximally robust to depolarizing and phase damping noise, in complete analogy with the qubit case. Motivated by this and other similarities we conjecture that these gates could be useful for the task of qudit magic-state distillation and, by extension, fault-tolerant quantum computing. Very recent, independent work by Campbell, Anwar and Browne confirms the correctness of this intuition, and we build upon their work to characterize noise regimes for which noisy implementations of these gates can (or provably cannot) supplement Clifford gates to enable universal quantum computation.Comment: Version 2 changed to reflect improved distillation routines in arXiv:1205.3104v2. Minor typos fixed. 12 Pages,2 Figures,3 Table

Percolative shunting on electrified surface

The surface discharge of electrified dielectrics at high humidity is considered. The percolative nature of charge transport in electrets is established. Particular attention is given to the phenomena of adsorption and nucleation of electrically conducting phase in the cause of percolation cluster growth on electrified surface. The critical index of the correlation lenght for percolation cluster is found, and its value is in good agreement with the known theoretical estimations.Comment: 4 pages with 1 figure, revtex, published in Tech. Phys. Lett. 25 (1999) 877-879 with one additional figur

Equivalence of operator-splitting schemes for the integration of the Langevin equation

We investigate the equivalence of different operator-splitting schemes for the integration of the Langevin equation. We consider a specific problem, so called the directed percolation process, which can be extended to a wider class of problems. We first give a compact mathematical description of the operator-splitting method and introduce two typical splitting schemes that will be useful in numerical studies. We show that the two schemes are essentially equivalent through the map that turns out to be an automorphism. An associated equivalent class of operator-splitting integrations is also defined by generalizing the specified equivalence.Comment: 4 page

Lunar navigation study, summary volume Final report, Jun. 1964 - May 1965

Lunar surface navigation and guidance study to implement lunar surface vehicle exploration mission

Lunar navigation study, sections 1 through 7 Final report, Jun. 1964 - May 1965

Lunar navigation analysis using passive nongyro, inertial navigation, and radio frequency technolog

Transport on Directed Percolation Clusters

We study random lattice networks consisting of resistor like and diode like bonds. For investigating the transport properties of these random resistor diode networks we introduce a field theoretic Hamiltonian amenable to renormalization group analysis. We focus on the average two-port resistance at the transition from the nonpercolating to the directed percolating phase and calculate the corresponding resistance exponent $\phi$ to two-loop order. Moreover, we determine the backbone dimension $D_B$ of directed percolation clusters to two-loop order. We obtain a scaling relation for $D_B$ that is in agreement with well known scaling arguments.Comment: 4 page

Genetic contributions to visuospatial cognition in Williams syndrome: insights from two contrasting partial deletion patients

Background Williams syndrome (WS) is a rare neurodevelopmental disorder arising from a hemizygotic deletion of approximately 27 genes on chromosome 7, at locus 7q11.23. WS is characterised by an uneven cognitive profile, with serious deficits in visuospatial tasks in comparison to relatively proficient performance in some other cognitive domains such as language and face processing. Individuals with partial genetic deletions within the WS critical region (WSCR) have provided insights into the contribution of specific genes to this complex phenotype. However, the combinatorial effects of different genes remain elusive. Methods We report on visuospatial cognition in two individuals with contrasting partial deletions in the WSCR: one female (HR), aged 11 years 9 months, with haploinsufficiency for 24 of the WS genes (up to GTF2IRD1), and one male (JB), aged 14 years 2 months, with the three most telomeric genes within the WSCR deleted, or partially deleted. Results Our in-depth phenotyping of the visuospatial domain from table-top psychometric, and small- and large-scale experimental tasks reveal a profile in HR in line with typically developing controls, albeit with some atypical features. These data are contrasted with patient JB’s atypical profile of strengths and weaknesses across the visuospatial domain, as well as with more substantial visuospatial deficits in individuals with the full WS deletion. Conclusions Our findings point to the contribution of specific genes to spatial processing difficulties associated with WS, highlighting the multifaceted nature of spatial cognition and the divergent effects of genetic deletions within the WSCR on different components of visuospatial ability. The importance of general transcription factors at the telomeric end of the WSCR, and their combinatorial effects on the WS visuospatial phenotype are also discussed

Robots that can adapt like animals

As robots leave the controlled environments of factories to autonomously function in more complex, natural environments, they will have to respond to the inevitable fact that they will become damaged. However, while animals can quickly adapt to a wide variety of injuries, current robots cannot "think outside the box" to find a compensatory behavior when damaged: they are limited to their pre-specified self-sensing abilities, can diagnose only anticipated failure modes, and require a pre-programmed contingency plan for every type of potential damage, an impracticality for complex robots. Here we introduce an intelligent trial and error algorithm that allows robots to adapt to damage in less than two minutes, without requiring self-diagnosis or pre-specified contingency plans. Before deployment, a robot exploits a novel algorithm to create a detailed map of the space of high-performing behaviors: This map represents the robot's intuitions about what behaviors it can perform and their value. If the robot is damaged, it uses these intuitions to guide a trial-and-error learning algorithm that conducts intelligent experiments to rapidly discover a compensatory behavior that works in spite of the damage. Experiments reveal successful adaptations for a legged robot injured in five different ways, including damaged, broken, and missing legs, and for a robotic arm with joints broken in 14 different ways. This new technique will enable more robust, effective, autonomous robots, and suggests principles that animals may use to adapt to injury