Results 201 to 210 of about 27,968 (274)
From pineal photoreception to optogenetics: functional colour opponency based on a pineal bistable opsin. [PDF]
Wada S +3 more
europepmc +1 more source
Phase Control Mechanisms in Metasurfaces: From Static Approaches to Active and Space-Time Modulation. [PDF]
Haroon M, Kim SW, Choi DY.
europepmc +1 more source
The Principle and Application of Achromatic Metalens. [PDF]
Liu R, Li L, Zhou J.
europepmc +1 more source
Visual Neuroplasticity: Modulating Cortical Excitability with Flickering Light Stimulation. [PDF]
Ávila FJ.
europepmc +1 more source
Multimodal Optical Imaging and Modulation with Simultaneous Electrophysiology Through Smart Dura in Non-Human Primates. [PDF]
Hong N +10 more
europepmc +1 more source
Can DNN models simulate appearance variations of #TheDress? [PDF]
Kuriki I +4 more
europepmc +1 more source
RGB Achromatic Metalens Doublet for Digital Imaging
Chromatic aberration is a major challenge faced by metalenses. Current methods to achieve broadband achromatic operation in metalenses usually suffer from limited size, numerical aperture, and working bandwidth due to the finite group delay of meta-atoms,
Jianchao Zhang +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Achromatic and super-achromatic zero-order waveplates
Journal of Quantitative Spectroscopy and Radiative Transfer, 2004Abstract We discuss a brief classification of waveplates including achromatic and super-achromatic ones. Anizotropic properties of polymethylmethacrylat (PMMA) subjected to one-axis stretching are analyzed. The parameters controlling the value of the PMMA birefringence are identified and their typical spectral dependence is discussed.
A.V. Samoylov +3 more
exaly +3 more sources
On Approximating the Achromatic Number
Summary: The achromatic number problem is to legally color the vertices of an input graph with the maximum number of colors, denoted \(\psi^*\), so that every two color classes share at least one edge. This problem is known to be NP-hard. For general graphs we give an algorithm that approximates the achromatic number within a ratio of \(O(n\cdot \log ...
Guy Kortsarz, Robert Krauthgamer
openaire +4 more sources

