Results 121 to 130 of about 3,086,920 (343)

What Do Large Language Models Know About Materials?

Advanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer, Thomas Wallmersperger, Gianaurelio Cuniberti   +2 more
wiley   +1 more source

Some Inequalities in Distance-Regular Graphs

Journal of Combinatorial Theory, Series B, 1993
For integers \(r\) \((>0)\) and \(a\), let \(n_ r(a)\) denote the following value \[ n_ r(a)= 1+ a+ a(a- 1)+\cdots+ a(a-1)^ i+\cdots+ a(a-1)^ r. \] In this paper, we prove the following theorem and give several corollaries. Theorem. Let \(G\) be a distance-regular graph with girth \(g\) and diameter \(d\).
openaire   +2 more sources

Affecting the Properties of Copper–Graphene Electroconductive Composite by Severe Plastic Deformation

Advanced Engineering Materials, EarlyView.
Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich, Lenka Kunčická, Pavel Czernek, Zifan Wang   +3 more
wiley   +1 more source

The effect of network structure on the dynamics of epidemic propagation in an individual-based model

Electronic Journal of Qualitative Theory of Differential Equations
An individual-based model of SIS epidemic propagation is considered on regular graphs. This model explicitly incorporates the adjacency matrix of the network enabling us to study the effect of network structure on the dynamic of the propagation process ...
Noémi Nagy, Sándor Horváth, Péter Simon   +2 more
doaj   +1 more source

Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization

Advanced Engineering Materials, EarlyView.
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, Moritz Blum, Luana Caron, Alisa Chirkova, Philipp Cimiano, Basil Ell, Inga Ennen, Michael Feige, Maik Gaerner, Thomas Hilbig, Andreas Hütten, Günter Reiss, Tapas Samanta, Sonja Schöning, Christian Schröder, Lennart Schwan, Chris Taake, Martin Wortmann   +17 more
wiley   +1 more source

The Nucleus of a Q-Polynomial Distance-Regular Graph [PDF]

Graphs and Combinatorics
Let Γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Gamma$$\end ...
Paul M. Terwilliger
semanticscholar   +1 more source

Workflow for Design of Experiments‐Based Modeling of Species Transport and Growth Kinetics in GaN Hydride Vapor Phase Epitaxy

Advanced Engineering Materials, EarlyView.
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č, G. Lukin, H. Torkashvand, A. Kerschbaum, M. Müller, S. Besendörfer, J. Heitmann, J. Friedrich   +7 more
wiley   +1 more source

ENUMERATION INTERSECTION ARRAYS OF SHILLA GRAPHS WITH B = 6

Ural Mathematical Journal
Let \(\Gamma\) be a distance-regular graph of diameter \(3\), and let \(\theta_1\) be its second eigenvalue. The graph \(\Gamma\) is called a Shilla graph if \(\theta_1=a_3\). In this case, \(\theta_1={(a_1+\sqrt{a_1^2+4k})}/{2}\), and \(a=a_3\) divides \
Alexander A. Makhnev, Ivan N. Belousov, Mikhail P. Golubyatnikov   +2 more
doaj   +1 more source

Hamiltonian chromatic number of block graphs

Journal of Graph Algorithms and Applications, 2017
Let $G$ be a simple connected graph of order $n$. A hamiltonian coloring $c$ of a graph $G$ is an assignment of colors (non-negative integers) to the vertices of $G$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n - 1$ for every two distinct vertices $u$
Devsi Bantva
doaj   +1 more source

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

Advanced Engineering Materials, EarlyView.
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, Abril Azocar Guzman, Sarath Menon, Stefan Sandfeld, Tilmann Hickel, Markus Stricker   +5 more
wiley   +1 more source