Results 1  10
of
7,792
Optical Path Length Equalization
"... The Optical Path Length Equalizer (OPLE) subsystem provides the variable delays necessary to keep the telescopes phased as they track an object under observation. This subsystem is a critical part of the CHARA Array. The basic CHARA design goal of simultaneously combining light from each telescope ..."
Abstract
 Add to MetaCart
The Optical Path Length Equalizer (OPLE) subsystem provides the variable delays necessary to keep the telescopes phased as they track an object under observation. This subsystem is a critical part of the CHARA Array. The basic CHARA design goal of simultaneously combining light from each
On the Optimal Path Length for Tor
, 2010
"... Choosing a path length for low latency anonymous networks that optimally balances security and performance is an open problem. Tor’s design decision to build paths with precisely three routers is thought to strike the correct balance. In this paper, we investigate this design decision by experiment ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Choosing a path length for low latency anonymous networks that optimally balances security and performance is an open problem. Tor’s design decision to build paths with precisely three routers is thought to strike the correct balance. In this paper, we investigate this design decision
MEASURING AND ADJUSTING THE PATH LENGTH AT CEBAF*
"... this paper we explain how the arrival times of higher pass beams are measured with respect to the first pass to less than one degree of RF phase and how the path length around the machine is adjusted. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this paper we explain how the arrival times of higher pass beams are measured with respect to the first pass to less than one degree of RF phase and how the path length around the machine is adjusted.
On the distribution of free path lengths . . .
, 2003
"... For r ∈ (0, 1), let Zr = {x ∈ R 2  dist(x,Z 2)> r/2} and τr(x, v) = inf{t> 0  x + tv ∈ ∂Zr}. Let Φr(t) be the probability that τr(x, v) ≥ t for x and v uniformly distributed in Zr and S1 respectively. We prove in this paper that limsup ǫ→0 + ..."
Abstract
 Add to MetaCart
For r ∈ (0, 1), let Zr = {x ∈ R 2  dist(x,Z 2)> r/2} and τr(x, v) = inf{t> 0  x + tv ∈ ∂Zr}. Let Φr(t) be the probability that τr(x, v) ≥ t for x and v uniformly distributed in Zr and S1 respectively. We prove in this paper that limsup ǫ→0 +
The path length of random skip lists
 ACTA INFORMATICA
, 1994
"... The skip list is a recently introduced data structure that may be seen as an alternative to (digital) tries. In the present paper we analyze the path length of random skip lists asymptotically, i.e. we study the cumulated successful search costs. In particular we derive a precise asymptotic result ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
The skip list is a recently introduced data structure that may be seen as an alternative to (digital) tries. In the present paper we analyze the path length of random skip lists asymptotically, i.e. we study the cumulated successful search costs. In particular we derive a precise asymptotic
Free path lengths in quasi crystals
 J. Stat. Phys
, 2012
"... ABSTRACT. The Lorentz gas is a model for a cloud of point particles (electrons) in a distribution of scatterers in space. The scatterers are often assumed to be spherical with a fixed diameter d, and the point particles move with constant velocity between the scatterers, and are specularly reflected ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
reflected when hitting a scatterer. There is no interaction between point particles. An interesting question concerns the distribution of free path lengths, i.e. the distance a point particle moves between the scattering events, and how this distribution scales with scatterer diameter, scatterer density
On the Distribution of Free Path Lengths for the Periodic Lorentz Gas
"... Consider the domain Z " = fx 2 Rn j dist(x; "Zn) ? "flg; and let the free path length be defined as ..."
Abstract

Cited by 51 (9 self)
 Add to MetaCart
Consider the domain Z " = fx 2 Rn j dist(x; "Zn) ? "flg; and let the free path length be defined as
The total path length of split trees
, 2011
"... We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths o ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths
Results 1  10
of
7,792