Results 61 to 70 of about 2,151,737 (304)
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Null decomposition of unicyclic graphs [PDF]
arXiv admin note: text overlap with arXiv:1907 ...
Luiz Emilio Allem +4 more
openaire +2 more sources
Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction
ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park +5 more
wiley +1 more source
Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
The adjacency matrix of a signed graph has +1 or -1 for adjacent vertices, depending on the sign of the connecting edge. According to this concept, an ordinary graph can be interpreted as a signed graph without negative edges.
Zoran Stanić
doaj +1 more source
DECOMPOSITIONS OF THE FREE PRODUCT OF GRAPHS [PDF]
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the conjecture that there exists a product of rooted graphs canonically associated with each notion of ...
ACCARDI, LUIGI +2 more
openaire +4 more sources
A Knowledge‐Based Approach for Understanding and Managing Additive Manufacturing Data
Additive manufacturing processes generate a large amount of data. Effectively managing, understanding, and retrieving information from this data remains a major challenge. Therefore, we propose an ontology‐based approach to integrate heterogeneous data, enable semantic queries, and support decision‐making.
Mina Abd Nikooie Pour +5 more
wiley +1 more source
This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of Kn into copies of G, where G may be a cycle, a path, or just a small graph.
Chris A. Rodger
doaj
Tuck-KGC: based on tensor decomposition for diabetes knowledge graph completion model integrating Chinese and Western medicine [PDF]
The medical knowledge graph is essential for intelligent medical services, encompassing personalized diagnostics, precision therapies, and intelligent consultations, among others.
Jiangtao ZhangSun +4 more
doaj +2 more sources
On the decomposition of a graph into stars
It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into edge disjoint, m-stars [1,2]. In this paper we prove that Kυ can be decomposed into any given sequence of stars Sm1, Sm2,…, Smk if ∑mi=(2υ) and mi⩽1/2υ. Further we generalize this result to the decomposition of not necessarily complete graphs.
openaire +2 more sources
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

