Results 71 to 80 of about 64,345 (264)

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

open access: yesAdvanced 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

Oriented diameter and rainbow connection number of a graph [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Xiaolong Huang   +3 more
doaj   +1 more source

Oriented graph coloring

open access: yesDiscrete Mathematics, 2001
An orientation of a graph \(H\) is a digraph obtained from \(H\) by giving to each edge one of its two possible orientations. A digraph \(G\) is an oriented graph if it is an orientation of some graph \(H\). An oriented \(k\)-coloring of an oriented graph \(G\) is a partition of the vertex set of \(G\) into \(k\) color classes such that no two adjacent
openaire   +2 more sources

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

The hull number of an oriented graph

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2003
We present characterizations of connected graphs G of order n≥2 for which h+(G)=n. It is shown that for every two integers n and m with 1≤n−1≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2≤k≤n, there ...
Gary Chartrand   +2 more
doaj   +1 more source

Colourings of $(m, n)$-coloured mixed graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray   +2 more
doaj   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

open access: yesAdvanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee   +7 more
wiley   +1 more source

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

open access: yesAdvanced 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   +5 more
wiley   +1 more source

Orienting graphs to optimize reachability [PDF]

open access: yesInformation Processing Letters, 1997
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to minimize the number of such pairs. The paper describes a quadratic-time algorithm for the first problem, and a proof
S. Louis Hakimi   +2 more
openaire   +4 more sources

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

open access: yesAdvanced Engineering Materials, EarlyView.
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

Home - About - Disclaimer - Privacy