Results 101 to 110 of about 147,371 (263)
Objective The objective of this study was to describe the longitudinal disease course and pulmonary outcomes of North American patients with melanoma differentiation–associated protein 5 (MDA5) antibody–associated dermatomyositis (DM). Methods Thirty patients with MDA5 antibody–associated DM were identified in a single‐center longitudinal cohort of 352
Jenice X. Cheah +8 more
wiley +1 more source
A Reduction of the Graph Reconstruction Conjecture
A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In
Monikandan S., Balakumar J.
doaj +1 more source
Purpose The study aimed to identify symptom‐based predictors of dry eye disease (DED) signs in the Sjögrens International Collaborative Clinical Alliance (SICCA) cohort. Methods Retrospective analysis examining 16 ocular symptoms (most graded 0‐4) and artificial tear (AT) use (graded 0‐3) as predictors of DED signs [abnormal ocular surface staining ...
Pragnya R Donthineni +7 more
wiley +1 more source
Polynomial Time Algorithm for Shortest Paths in Interval Temporal Graphs
We develop a polynomial time algorithm for the single-source all destinations shortest paths problem for interval temporal graphs (ITGs). While a polynomial time algorithm for this problem is known for contact sequence temporal graphs (CSGs), no such ...
Anuj Jain, Sartaj Sahni
doaj +1 more source
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
End Simplicial Vertices in Path Graphs
A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Time‐Dependent Oxidation and Scale Evolution of a Wrought Co/Ni‐Based Superalloy
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

