منابع مشابه
Traversal-Time Distribution for a Classical Time-Modulated Barrier
The classical problem of a time-modulated barrier, inspired by the Büttiker and Landauer model to study the tunneling times, is analyzed. We show that the traversaltime distribution of an ensemble of non-interacting particles that arrives at the oscillating barrier, obeys a distribution with a power-law tail.
متن کاملtraversal time problem ∗
The theory of weak measurement, proposed by Aharonov and coworkers, has been applied by Steinberg to the long-discussed traversal time problem. The uncertainty and ambiguity that characterize this concept from the perspective of von Neumann measurement theory apparently vanish, and joint probabilities and conditional averages become meaningful concepts. We express the Larmor clock and some othe...
متن کاملRelativistic Time-of-Arrival and Traversal Time
We compute in a relativistic way the time-of-arrival and the traversal time through a region of a free particle with spin 1 2 . We do this by applying the relativistic extension of the Event-Enhanced Quantum Theory which we have presented in a previous paper. We find a very good coincidence of the results of our formalism and the results obtained by using classical relativistic mechanics. PACS ...
متن کاملFactors impacting corneal epithelial barrier function against Pseudomonas aeruginosa traversal.
PURPOSE Mechanisms determining epithelial resistance versus susceptibility to microbial traversal in vivo remain poorly understood. Here, a novel murine model was used to explore factors influencing the corneal epithelial barrier to Pseudomonas aeruginosa penetration. METHODS Murine corneas were blotted with tissue paper before inoculation with green fluorescent protein-expressing P. aerugino...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal
We prove time-space tradeoffs for traversing undirected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs”. 1 The Complexity of Graph Traversal Graph traversal is a fundamental problem in computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1989
ISSN: 0028-0836,1476-4687
DOI: 10.1038/341567a0