Results 51 to 60 of about 622 (259)
A simplified thermoplastic pultrusion model is developed to predict thermal fields in glass fiber/polyethylene terephthalate (GF/PET) composites with reduced computational cost. By combining effective material homogenization, validation against literature data, and Gaussian‐process‐based optimization, the study reveals how heating limits, pulling speed,
Elder Soares +3 more
wiley +1 more source
Rook Theory for Perfect Matchings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Haglund, Jeffrey B. Remmel
openaire +1 more source
Karl Popper and the Mechanisms of Hydrogen Embrittlement
Representation of the beginning of loss of ductility rather than embrittlement. Small concentrations of hydrogen in a diffusible form within iron are well‐established to harm the mechanical integrity of steels. There are theories that attempt to explain the pernicious role of hydrogen.
H. K. D. H. Bhadeshia
wiley +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
The hyper-Zagreb index of cacti with perfect matchings
Let be a simple connected graph. The hyper-Zagreb index is defined as . A connected graph is a cacti if all blocks of are either edges or cycles. Let be the set of cacti of order with a perfect matching and cycles. In this paper, we determine sharp upper
Hechao Liu, Zikai Tang
doaj +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
Further results on enumeration of perfect matchings of Cartesian product graphs
Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation ...
Wu Tingzeng, Zeng Xiaolin
doaj +1 more source
All Pairs of Pentagons in Leapfrog Fullerenes Are Nice
A subgraph H of a graph G with perfect matching is nice if G−V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs.
Tomislav Došlić
doaj +1 more source
This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source
Counting and enumerating crossing-free geometric graphs
We describe a framework for constructing data structures which allow fast counting and enumeration of various types of crossing-free geometric graphs on a planar point set.
Manuel Wettstein
doaj +1 more source

