EmStar: development with high system visibility
نویسندگان
چکیده
منابع مشابه
High visibility gravimetry with a Bose-Einstein condensate
A Bose-Einstein condensate (BEC) is frequently described as the matter-wave analog of an optical laser – the preferred source for optical interferometry. In this project, we have demonstrated an atom interferometer-based gravimeter using a Rb Bose-condensed source [1]. Our data represent the highest fringe visibility yet achieved in such a device (Fig. 1), for both standard, and large-momentum-...
متن کاملHigh-visibility interference fringes with femtosecond laser radiation.
We propose and experimentally demonstrate an interferometer for femtosecond pulses with spectral bandwidth about 100 nm. The scheme is based on a Michelson interferometer with a dispersion compensating module. A diffractive lens serves the purpose of equalizing the optical-path-length difference for a wide range of frequencies. In this way, it is possible to register high-contrast interference ...
متن کاملHigh Performance Transactions via Early Write Visibility
In order to guarantee recoverable transaction execution, database systems permit a transaction’s writes to be observable only at the end of its execution. As a consequence, there is generally a delay between the time a transaction performs a write and the time later transactions are permitted to read it. This delayed write visibility can significantly impact the performance of serializable data...
متن کاملAutomated Mobile Highway Sign Visibility Measurement System
This paper describes a prototype of a digital video image analysis system that measures the relative luminance of highway signs using nighttime video images taken by a camera mounted in a moving vehicle. The concept is that by using an inexpensive video camera and laptop computer mounted in a vehicle a measurement of the brightness and visibility of the sign can be made. The system uses real ti...
متن کاملVisibility with Multiple Reflections
We show that the region lit by a point light source inside a simple n-gon after at most k reeections oo the boundary has combinatorial complexity O(n 2k), for any k 1. A lower bound of ((n=k ? (1)) 2k) is also established which matches the upper bound for any xed k. A simple near-optimal algorithm for computing the illuminated region is presented, which runs in O(n 2k log n) time and O(n 2k) sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Wireless Communications
سال: 2004
ISSN: 1536-1284
DOI: 10.1109/mwc.2004.1368899