How visual information influences dual-task driving and tracking

The study examined the impact of visual predictability on dual-task performance in driving and tracking tasks. Participants (N = 27) performed a simulated driving task and a pursuit tracking task. In either task, visual predictability was manipulated by systematically varying the amount of advance visual information: in the driving task, participants drove at night with low beam, at night with high beam, or in daylight; in the tracking task, participants saw a white line that specified the future target trajectory for 200, 400 or 800 ms. Concurrently with driving or tracking, participants performed an auditory task. They had to discriminate between two sounds and press a pedal upon hearing the higher sound. Results show that in general, visual predictability benefited driving and tracking; however, dual-task driving performance was best with highest visual predictability (daylight), dual-task tracking performance was best with medium visual predictability (400 ms). Braking/reaction times were higher in dual tasks compared to single tasks, but were unaffected by visual predictability, showing that its beneficial effects did not transfer to the auditory task. In both tasks, manual accuracy decreased around the moment the foot pressed the pedal, indicating interference between tasks. We, therefore, conclude that despite a general beneficial impact of predictability, the integration of visual information seems to be rather task specific, and that interference between driving and audiomotor tasks, and tracking and audiomotor tasks, seems comparable

Exact Energy-Time Uncertainty Relation for Arrival Time by Absorption

We prove an uncertainty relation for energy and arrival time, where the arrival of a particle at a detector is modeled by an absorbing term added to the Hamiltonian. In this well-known scheme the probability for the particle's arrival at the counter is identified with the loss of normalization for an initial wave packet. Under the sole assumption that the absorbing term vanishes on the initial wave function, we show that $\Delta T \Delta E \geq \sqrt p \hbar/2$ and $\Delta E\geq 1.37\sqrt p\hbar$, where $e$ denotes the mean arrival time, and $p$ is the probability for the particle to be eventually absorbed. Nearly minimal uncertainty can be achieved in a two-level system, and we propose a trapped ion experiment to realize this situation.Comment: 8 pages, 2 figure

Simultaneous Surface Plasmon Resonance and X-ray Absorption Spectroscopy

We present here an experimental set-up to perform simultaneously measurements of surface plasmon resonance (SPR) and X-ray absorption spectroscopy (XAS) in a synchrotron beamline. The system allows measuring in situ and in real time the effect of X-ray irradiation on the SPR curves to explore the interaction of X-rays with matter. It is also possible to record XAS spectra while exciting SPR in order to detect the changes in the electronic configuration of thin films induced by the excitation of surface plasmons. Combined experiments recording simultaneously SPR and XAS curves while scanning different parameters can be carried out. The relative variations in the SPR and XAS spectra that can be detected with this set-up ranges from 10-3 to 10-5, depending on the particular experiment

Quantum Channels with Memory

We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be decomposed into a concatenated memory channel. We then examine and present different physical setups in which channels with memory may be operated for the transfer of (private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings, and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.Comment: 21 pages with 5 EPS figures. V2: Presentation clarified, references adde

Reexamination of Quantum Bit Commitment: the Possible and the Impossible

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger variety of protocols, which may have an arbitrary number of rounds, in which both classical and quantum information is exchanged, and which may include aborts and resets. Moreover, we do not consider the receiver to be bound to a fixed "honest" strategy, so that "anonymous state protocols", which were recently suggested as a possible way to beat the known no-go results are also covered. We show that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver. Moreover, if the concealing property holds only approximately, the cheat goes undetected with a high probability, which we explicitly estimate. The proof uses an explicit formalization of general two party protocols, which is applicable to more general situations, and a new estimate about the continuity of the Stinespring dilation of a general quantum channel. The result also provides a natural characterization of protocols that fall outside the standard setting of unlimited available technology, and thus may allow secure bit commitment. We present a new such protocol whose security, perhaps surprisingly, relies on decoherence in the receiver's lab.Comment: v1: 26 pages, 4 eps figures. v2: 31 pages, 5 eps figures; replaced with published version; title changed to comply with puzzling Phys. Rev. regulations; impossibility proof extended to protocols with infinitely many rounds or a continuous communication tree; security proof of decoherence monster protocol expanded; presentation clarifie

Use of polyethylene glycol coatings for optical fibre humidity sensing

Humidity induced change in the refractive index and thickness of the polyethylene glycol (PEG) coatings are in situ investigated for a range from 10 to 95%, using an optical waveguide spectroscopic technique. It is experimentally demonstrated that, upon humidity change, the optical and swelling characteristics of the PEG coatings can be employed to build a plastic fibre optic humidity sensor. The sensing mechanism is based on the humidity induced change in the refractive index of the PEG film, which is directly coated onto a polished segment of a plastic optical fibre with dip-coating method. It is observed that PEG, which is a highly hydrophilic material, shows no monotonic linear response to humidity but gives different characteristics for various ranges of humidity levels both in index of refraction and in thickness. It undergoes a physical phase change from a semi-crystal line structure to a gel one at around 80% relative humidity. At this phase change point, a drastic decrease occurs in the index of refraction as well as a drastic increase in the swelling of the PEG film. In addition, PEG coatings are hydrogenated in a vacuum chamber. It is observed that the hydrogen has a preventing effect on the humidity induced phase change in PEG coatings. Finally, the possibility of using PEG coatings in construction of a real plastic fibre optic humidity sensor is discussed. (C) 2008 The Optical Society of Japan

Universally Coupled Massive Gravity

We derive Einstein's equations from a linear theory in flat space-time using free-field gauge invariance and universal coupling. The gravitational potential can be either covariant or contravariant and of almost any density weight. We adapt these results to yield universally coupled massive variants of Einstein's equations, yielding two one-parameter families of distinct theories with spin 2 and spin 0. The Freund-Maheshwari-Schonberg theory is therefore not the unique universally coupled massive generalization of Einstein's theory, although it is privileged in some respects. The theories we derive are a subset of those found by Ogievetsky and Polubarinov by other means. The question of positive energy, which continues to be discussed, might be addressed numerically in spherical symmetry. We briefly comment on the issue of causality with two observable metrics and the need for gauge freedom and address some criticisms by Padmanabhan of field derivations of Einstein-like equations along the way.Comment: Introduction notes resemblance between Einstein's discovery process and later field/spin 2 project; matches journal versio

Tema Con Variazioni: Quantum Channel Capacity

Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the mathematically precise statements of this idea which have been put forward in the literature. We show that all the variations considered lead to equivalent capacity definitions. In particular, it makes no difference whether one requires mean or maximal errors to go to zero, and it makes no difference whether errors are required to vanish for any sequence of block sizes compatible with the rate, or only for one infinite sequence.Comment: 32 pages, uses iopart.cl

Many-body physics and the capacity of quantum channels with memory

Published versio

A Computational Strategy for Protein Function Assignment Which Addresses the Multidomain Problem

A method for assigning functions to unknown sequences based on finding correlations between short signals and functional annotations in a protein database is presented. This approach is based on keyword (KW) and feature (FT) information stored in the SWISS-PROT database. The former refers to particular protein characteristics and the latter locates these characteristics at a specific sequence position. In this way, a certain keyword is only assigned to a sequence if sequence similarity is found in the position described by the FT field. Exhaustive tests performed over sequences with homologues (cluster set) and without homologues (singleton set) in the database show that assigning functions is much ’cleaner’ when information about domains (FT field) is used, than when only the keywords are used