Results 21 to 30 of about 48,603 (202)
Eulerian digraphs and toric Calabi-Yau varieties
We investigate the structure of a simple class of affine toric Calabi-Yau varieties that are defined from quiver representations based on finite eulerian directed graphs (digraphs). The vanishing first Chern class of these varieties just follows from the
de Medeiros, Paul
core +1 more source
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration
Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley +1 more source
A Hilbert Space Theory of Generalized Graph Signal Processing
Graph signal processing (GSP) has become an important tool in many areas such as image processing, networking learning and analysis of social network data.
Ji, Feng, Tay, Wee Peng
core +1 more source
Polymorph engineering in ErMnO3 enables low‐voltage, forming‐free threshold switching with tunable negative differential resistance. Conducting orthorhombic regions embedded in an insulating hexagonal matrix provide controlled Joule‐heating‐enhanced Poole–Frenkel transport. The hexagonal phase prevents excessive heating and breakdown.
Rong Wu +8 more
wiley +1 more source
Parameterized Streaming Algorithms for Vertex Cover [PDF]
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh +3 more
core
Quantum graph as a quantum spectral filter
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant coupling with a
Exner P. +3 more
core +1 more source
Dispensing Volumetric Additive Manufacturing
Dispensing volumetric additive manufacturing (DVAM) prints 3D structures inside a photocurable resin droplet suspended from the tip of a glass pipette, enabling sequential printing without resin vats or manual part removal. Real‐time droplet profiling and ray‐tracing‐based correction compensate for optical distortion at the curved resin‐air interface ...
Hongryung Jeon +5 more
wiley +1 more source
Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur +1 more
core +1 more source
Random tensor models in the large N limit: Uncoloring the colored tensor models
Tensor models generalize random matrix models in yielding a theory of dynamical triangulations in arbitrary dimensions. Colored tensor models have been shown to admit a 1/N expansion and a continuum limit accessible analytically.
B. Duplantier +5 more
core +1 more source

