Results 11 to 20 of about 211,072 (304)
Quantum Entanglement of Monochromatic and Non-Monochromatic Photons on a Waveguide Beam Splitter
It is well known that the waveguide beam splitter can be used as a source for the quantum entanglement of photons. The analysis of such quantum entanglement is a difficult problem even for monochromatic photons, since the system under study is ...
Dmitry Makarov, Yuliana Tsykareva
doaj +1 more source
On the complexity of edge-colored subgraph partitioning problems in network optimization [PDF]
Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network ...
Xiaoyan Zhang +3 more
doaj +1 more source
Vision is protected against blue defocus
Due to chromatic aberration, blue images are defocused when the eye is focused to the middle of the visible spectrum, yet we normally are not aware of chromatic blur. The eye suffers from monochromatic aberrations which degrade the optical quality of all
Clara Benedi-Garcia +5 more
doaj +1 more source
Study of 20 Hz high spatial-temporal resolution monochromatic X-ray dynamic micro-CT
BackgroundDynamic micro-computed tomography (micro-CT) using monochromatic X-ray offers higher density resolution and lower radiation damage compared to that using white X-ray, however balancing its imaging spatial and temporal resolution is challenging.
QIU Zhengjie +5 more
doaj +1 more source
A one-pot synthetic procedure was successfully used to synthesize monodispersed poly (styrene-butyl acrylate-acrylic acid) (P (St-BA-AA)) colloidal spheres via emulsion polymerization.
I.H. Ifijen +4 more
doaj +1 more source
Monochromatic Clique Decompositions of Graphs [PDF]
Let $G$ be a graph whose edges are coloured with $k$ colours, and $\mathcal H=(H_1,\dots , H_k)$ be a $k$-tuple of graphs. A monochromatic $\mathcal H$-decomposition of $G$ is a partition of the edge set of $G$ such that each part is either a single edge
Győri E. +6 more
core +4 more sources
Vertex Colorings without Rainbow Subgraphs
Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj +1 more source
Monochromatic triangles in three-coloured graphs [PDF]
In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than ...
Andrew Treglown +27 more
core +4 more sources
Decompositions of edge-colored infinite complete graphs into monochromatic paths [PDF]
An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored countably ...
Elekes, M. +3 more
core +2 more sources
Improving Image Quality of Bronchial Arteries with Virtual Monochromatic Spectral CT Images. [PDF]
OBJECTIVE:To evaluate the clinical value of using monochromatic images in spectral CT pulmonary angiography to improve image quality of bronchial arteries.
Guangming Ma +4 more
doaj +1 more source

