Results 231 to 240 of about 152,187 (305)
Quantum Thermodynamic Transformation Optics: A Unified Framework for Energy and Entropy With Application to the Casimir Force in Dissipative Metamaterials. [PDF]
Sadeghi MM, Sarısaman M.
europepmc +1 more source
Recent progress of the exchange bias based on 2D van der Waals ferromagnet
Ultrathin magnetic materials could help make smaller, energy‐efficient memories, but their magnetic states must remain stable and controllable. This review brings together recent research on exchange bias, a magnetic pinning effect in layered materials, and explains how interfaces and electrical, thermal or mechanical controls can tune it, with optical
Wajahat Ali, Shaojie Hu
wiley +1 more source
Quantum Speed Limits and the Ultimate Scaling of the Quantum Sensors. [PDF]
Maleki Y.
europepmc +1 more source
Pseudomagnetic fields make light and sound emulate charged particles in magnetic fields, enabling magnetic‐free signal processing. This Review summarizes their origins, three implementations in two‐dimensional artificial lattices, and applications in energy localization and robust transport, guiding the design of topological integrated devices ...
Shuaihu Liu +5 more
wiley +1 more source
A structure-aware generative AI framework for revealing functional relationships in protein families. [PDF]
Shukla D +3 more
europepmc +1 more source
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
Symplectic Method Analysis of the Thermal Buckling Behavior of Graphene Origami-Reinforced Composite Beams. [PDF]
Zhu Z, Zhao M, Zhao N, Zhou Y, Du H.
europepmc +1 more source
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source

