Results 61 to 70 of about 55,177 (267)
Discrete complex analysis on isoradial graphs [PDF]
Advances in Mathematics, 2011 35 pages, 4 figures.
Chelkak Dmitry, Smirnov Stanislav
openaire +4 more sources
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
A Characterization of 2-Tree Probe Interval Graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs ...
Brown David E. +2 more
doaj +1 more source
Average properties of combinatorial problems and thermodynamics of spin models on graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The study of thermodynamic properties of classical spin models on infinite graphs naturally leads to consider the new combinatorial problems of random-walks and percolation on the average.
Alessandro Vezzani +2 more
doaj +1 more source
Graphs and topologies on discrete sets
Discrete Mathematics, 1992 A topology on the vertex set \(V\) of a graph \(G(V,E)\) is said to be compatible if whenever \(x,y\) are distinct elements of \(V\), then \(\{x,y\}\) is topologically connected if and only if \(\{x,y\}\in E\). The main result of Section 2 of this paper is the following: Let \(G(V,E)\) be a graph with a finite number of connected components and of ...
openaire +1 more source
Time‐Dependent Oxidation and Scale Evolution of a Wrought Co/Ni‐Based Superalloy
Advanced Engineering Materials, EarlyView.This study shows how a new wrought Co/Ni‐based superalloy resists oxidation at 800 ∘$^\circ$C. The oxide scale changes from rough, fast‐growing spinel to a dense, protective chromia–alumina layer. Atom probe analysis reveals tiny refractory‐rich bubbles at the interface that mark the transition to long‐term, diffusion‐controlled protection ...
Cameron Crabb +6 more
wiley +1 more source
Conceptual Neighborhood Graphs of Discrete Time Intervals
ISPRS International Journal of Geo-InformationTemporal reasoning is an important part of the field of time geography and spatio-temporal data science. Recent advances in qualitative temporal reasoning have developed a set of 74 relations that apply between discretized time intervals of at least two ...
Matthew P. Dube, Brendan P. Hall
doaj +1 more source
Exterior–interior duality for discrete graphs [PDF]
Journal of Physics A: Mathematical and Theoretical, 2008 The Exterior-Interior duality expresses a deep connection between the Laplace spectrum in bounded and connected domains in $\mathbb{R}^2$, and the scattering matrices in the exterior of the domains. Here, this link is extended to the study of the spectrum of the discrete Laplacian on finite graphs.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.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