Results 101 to 110 of about 680,508 (291)
Development of Laterally Graded X‐Ray Multilayer Optics
This work presents the development of laterally graded X‐ray multilayer optics with both constant and variable lateral gradients. By precisely controlling substrate speed profiles and mask design, these multilayers achieve highly accurate lateral gradients and excellent sagittal thickness uniformity, making them ideal for spectroscopy application at ...
Arindam Majhi +11 more
wiley +1 more source
This review outlines how understanding bone's biology, hierarchical architecture, and mechanical anisotropy informs the design of lattice structures that replicate bone morphology and mechanical behavior. Additive manufacturing enables the fabrication of orthopedic implants that incorporate such structures using a range of engineering materials ...
Stylianos Kechagias +4 more
wiley +1 more source
A broadband terahertz polarization rotator consisting of twistingly stacked silicon–air metagratings is designed based on the polarization guiding effect and experimentally shown to achieve 90° linear polarization rotation for both TE and TM incidences.
Yun‐Seok Choi +4 more
wiley +1 more source
On the uniqueness of d-vertex magic constant
Let G = (V,E) be a graph of order n and let D ⊆ {0, 1, 2, 3, . . .}. For v ∈ V, let ND(v) = {u ∈ V : d(u, v) ∈ D}. The graph G is said to be D-vertex magic if there exists a bijection f : V (G) → {1, 2, . . .
Arumugam S. +2 more
doaj +1 more source
Benchmarking Organic Photodiodes at the Noise Floor
A precise measurement framework based on a calibrated, ultra‐low‐noise automated setup with open‐source Python scripts enables accurate benchmarking of photodiodes. The unique combination of time‐dependent current measurement under dark conditions, followed by continuous‐wave faint illumination, facilitates reliable extraction of photocurrent near ...
Siddhartha Saggar +2 more
wiley +1 more source
Semi-strong split domination in graphs [PDF]
Given a graph $G = (V,E)$, a dominating set $D subseteq V$ is called a semi-strong split dominating set of $G$ if $|V setminus D| geq 1$ and the maximum degree of the subgraph induced by $V setminus D$ is 1.
Anwar Alwardi +3 more
doaj
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
This review highlights recent advances in accelerating luminescence in nanostructures through cooperative emission, resonator coupling, and nonlocal light–matter interactions. By unifying concepts such as excitonic superradiance, superfluorescence, and the plasmonic Purcell effect, it reveals physical limits of ultrafast emission and their potential ...
Masaaki Ashida +3 more
wiley +1 more source
A graphene‐based bowtie plasmonic nanotweezer is designed and optimized using particle swarm optimization and transfer matrix analysis. The structure achieves strong field confinement, delivering trapping forces up to 6 nN W−1 for 10 nm bioparticles with sixfold lower power requirements than conventional designs.
Saba Ebrahimpanah +2 more
wiley +1 more source
On the nuclear trace of Fourier integral operators
In this paper we characterise the r-nuclearity of Fourier integral operators on Lebesgue spaces. Fourier integral operators will be considered in Rn, the discrete group Zn, the n-dimensional torus and symmetric spaces (compact homogeneous manifolds).
Duván Cardona
doaj

