نتایج جستجو برای: lau product

تعداد نتایج: 281464  

Journal: :Nanomanufacturing and Metrology 2021

Abstract Illumination with LEDs is of increasing interest in imaging and lithography. In particular, compared to lasers, are temporally spatially incoherent, so that speckle effects can be avoided by the application LEDs. Besides, LED arrays qualified due their high optical output power. However, have not been widely used for investigating effects, e.g., Lau effect. this paper, we propose an ar...

Journal: :Optics express 2009
William B Case Mathias Tomandl Sarayut Deachapunya Markus Arndt

Talbot and Talbot-Lau effects are frequently used in lensless imaging applications with light, ultrasound, x-rays, atoms and molecules--generally in situations where refractive optical elements are non-existent or not suitable. We here show an experimental visualization of the intriguing wave patterns that are associated with near-field interferometry behind a single periodic diffraction gratin...

2006
Alexander D. Cronin Ben McMorran

We present an electron interferometer based on near-field diffraction from two nanostructure gratings. Lau fringes are observed with an imaging detector, and revivals in the fringe visibility occur as the separation between gratings is increased from 0 to 3 mm. This verifies that electron beams diffracted by nanostructures remain coherent after propagating farther than the Talbot length zT = 2d...

Journal: :Journal of clinical microbiology 2015
Romney M Humphries James A McKinnell

Detecting carbapenem-resistant Enterobacteriaceae (CRE) can be difficult. In particular, the absence of FDA-cleared automated antimicrobial susceptibility test (AST) devices that use revised Clinical and Laboratory Standards Institute (CLSI) carbapenem breakpoints for Enterobacteriaceae and the lack of active surveillance tests hamper the clinical laboratory. In this issue of the Journal of Cli...

2010
Anand Louis Nisheeth K. Vishnoi

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید