Results 71 to 80 of about 3,118,294 (254)
We investigate chromatic invariants within commuting graphs associated with block-diagonal matrix rings over finite commutative rings. For a finite commutative ring \(R\) with identity, we analyze the commuting graph \(\Gamma(M(m \oplus m, R))\) whose vertex set consists of non-central block-diagonal matrices \(A \oplus B\) with \(A, B \in M(m, R ...
Eman Almuhur +3 more
openaire +1 more source
Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier +17 more
wiley +1 more source
In graph theory, the Randic index R is a topological graph invariant widely used as a physicochemical descriptor in the mathematical modeling of molecular structures.
Ying Wang +4 more
doaj +1 more source
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch +3 more
wiley +1 more source
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
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
Application of hierarchical self-organizing mapping to invariant recognition of color-texture images [PDF]
In this paper, we present a hierarchical self-organizing map applying to scaling and rotation invariant recognition of a 256×256-pixel color-texture image.
Wong, K.W. +2 more
core
Minimal Permutation-Invariant Qudit Codes from Edge-Colorings of Complete Graphs
We study permutation-invariant quantum codes in the symmetric subspace $\mathrm{Sym}^n(\mathbb{C}^q) $ of $n$ qudits of local dimension $q$. For every integer $q\geq 2$, we construct a permutation-invariant code with parameters $((4,q,2))_q$. Thus four physical qudits suffice to encode one logical qudit with distance two in the symmetric sector for ...
Kubischta, Eric, Teixeira, Ian
openaire +2 more sources
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
B-Edge Differential Measures for Structural Robustness of Certain Graph Classes
The use of graph-theoretic parameters is essential in interpreting the structural robustness, efficiency, and functionality of complex networks. Specifically, edge-based metrics are more useful in interpreting the susceptibility of links and the concept ...
Hafiz Muhammad Afzal Siddiqui +4 more
doaj +1 more source

