Results 121 to 130 of about 34,352 (308)
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Graph invariants in the spin model
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Unlinked Embedded Graphs [PDF]
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed.
Barrett, John W.
core
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
Soft Mechanical‐Electrical Logic Using Liquid Metal‐Filled 3D‐Printed Architectures
We present 3D‐printed soft mechanical–electrical logic elements that use liquid metal–filled silicone tubes actuated by thermoplastic polyurethane/polylactic acid (TPU/PLA) architectures to produce Boolean operations. Complementary normally open and normally closed unit cells perform repeatable binary transitions and can be combined into more complex ...
Christoph Lehmann +2 more
wiley +1 more source
Relating Sombor and Euler indices
Introduction/purpose: The Euler-Sombor index (EU) is a new vertexdegree-based graph invariant, obtained by geometric consideration. It is closely related to the Sombor index (SO). The actual form of this relation is established.
Ivan Gutman
doaj +1 more source
Maximum Oriented Forcing Number for Complete Graphs
The \emph{maximum oriented $k$-forcing number} of a simple graph $G$, written $\MOF_k(G)$, is the maximum \emph{directed $k$-forcing number} among all orientations of $G$.
Yair Caro, Ryan Pepper
doaj +1 more source
Classifying Higher Rank Toeplitz Operators. [PDF]
To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core
Cycle Invariant Positional Encoding for Graph Representation Learning [PDF]
Cycles are fundamental elements in graph-structured data and have demonstrated their effectiveness in enhancing graph learning models. To encode such information into a graph learning framework, prior works often extract a summary quantity, ranging from ...
Ma, Tengfei +5 more
core +1 more source
Knowledge‐based atomistic workflows are presented for mechanical and thermodynamic properties. By coupling modular simulations with ontology‐aligned metadata and provenance, Fe case studies on elastic behavior, defects, thermal properties, and Hall–Petch strengthening reveal how FAIR, queryable, and reusable simulation data can be generated. Mechanical
Abril Azócar Guzmán +5 more
wiley +1 more source

