Results 91 to 100 of about 187,084,903 (250)
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
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 +3 more
wiley +1 more source
On Ramsey (2K2, Wn)-minimal graphs of smallest order
The notation F → (H, G) means that if all edges of F are arbitrarily colored by red or blue, then either the subgraph of F induced by all red edges contains a graph H or the subgraph of F induced by all blue edges contains a graph G.
Muhammad Rafif Fajri +2 more
doaj +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
Synthesis of chemiluminescent biotinyl naphtho[1,8-de][1,2]diazepine-1,4-diones
2512-2522A new chemiluminescent seven membered cyclic peri hydrazide, 6-amino-2,3-dihydronaphtho[1,8-de][1,2]diazepine- 1,4-dione (AH, 4), and five of its biotin conjugates with various spacer groups are synthesized.
Reddy, A Ram, Murthy, N V Krishna
core
On 14-regular distance magic graphs
Let G be a graph with n vertices. By N(v) we denote the set of all vertices adjacent to v. A bijection f : V(G)→{1, 2, …, n} is a distance magic labeling of G if there exists an integer k such that the sum of labels of all vertices adjacent to v is k for
Petr Kovář, Matěj Krbeček
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
Weakly Leveled Planarity with Bounded Span [PDF]
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizontal segment or a strictly y-monotone curve. A graph is s-span weakly leveled
Gupta, Siddharth +15 more
core +1 more source
Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
The neighbor connectivity refers to the minimum number of vertices whose removal, along with their neighbors, causes a previously connected graph to become disconnected. In this paper we focus on Cayley graphs constructed from the symmetric group Sn.
Mohamad Abdallah
doaj +1 more source
This study aims to determine the effect of the use of video tracker on learning guided inquiry-based simple harmonic motion towards graph interpretation skills.
Vinka Raflesiana +2 more
doaj +1 more source

