Results 101 to 110 of about 116,736 (298)
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
Paths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments.
Jørgen Bang-Jensen, Gregory Gutin
core
Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), and k(p + q) = 2mn for
Jeevadoss Shanmugasundaram +1 more
doaj +1 more source
In the process of development and construction of open-pit mine slope in the high altitude and cold area, freeze-thaw (F-T) cycles have an important impact on rock engineering structure.
Yong-gang Xiao +5 more
doaj +1 more source
The PRIMA Thesaurus for Materials Science and Engineering
The PRIMA Thesaurus is a structured vocabulary designed to improve how materials science data is described and shared. Developed with input from multiple experts, it enables clear documentation of research workflows, data exchange, and reuse across platforms.
Rossella Aversa +8 more
wiley +1 more source
Industry Life Cycles in Dutch Manufacturing [PDF]
Theories and models on product life cycles explain and depict the evolution of an industry''s structural and dynamic properties over its lifetime. Hence, empirically observed intersectoral differences may stem from different evolutionary stages that ...
Dijk,Machiel,van
core
Transversal Hamilton paths and cycles [PDF]
Given a collection $\mathcal{G} =\{G_1,G_2,\dots,G_m\}$ of graphs on the common vertex set $V$ of size $n$, an $m$-edge graph $H$ on the same vertex set $V$ is transversal in $\mathcal{G}$ if there exists a bijection $φ:E(H)\rightarrow [m]$ such that $e \
Cheng, Yangyang +3 more
core +3 more sources
On the Complexity of Stacked Graphs Associated with Paths and Cycles
The complexity of a graph, defined as its number of spanning trees, serves as a key measure of network reliability. Stacked graphs constitute a significant and versatile class of graphs, formed by superimposing multiple copies of a base graph upon a ...
Salama Nagy Daoud, Ahmad Asiri
doaj +1 more source
Identifiable Paths and Cycles in Linear Compartmental Models. [PDF]
Bortner C, Meshkat N.
europepmc +1 more source
Optimization of the Production of Rubber Compounds Using Mathematical Models
Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source

