Results 51 to 60 of about 577,160 (277)
Disjoint Dominating Sets with a Perfect Matching
In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided they exist ...
Ayello, Alejandro Angeli +2 more
core +1 more source
Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3
ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende +26 more
wiley +1 more source
We describe an acoustic impedance matching method that permits perfect sound transmission between waveguides of different impedances as set by their cross sectional areas.
William M. Robertson +2 more
doaj +1 more source
ABSTRACT Objective Onasemnogene abeparvovec (OA) is an AAV9‐based gene therapy for spinal muscular atrophy type I (SMA I). Real‐world outcomes show increased response variability compared to clinical trials, and follow‐up data beyond 12–18 months are limited.
Marika Pane +43 more
wiley +1 more source
Process‐Informed Analysis of As‐Built Metal Additive Surface Features
This article introduces a novel method for feature‐based surface texture characterisation directly incorporating manufacturing variables into the feature extraction workflow. This marks a major step towards identifying process‐specific surface properties and their influence on part function and hence a holistic understanding of process–structure ...
Theresa Buchenau +5 more
wiley +1 more source
All Pairs of Pentagons in Leapfrog Fullerenes Are Nice
A subgraph H of a graph G with perfect matching is nice if G−V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs.
Tomislav Došlić
doaj +1 more source
Matchings in 3-uniform hypergraphs
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3.
Kühn, Daniela +2 more
core +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
Anti-Forcing Spectra of Convex Hexagonal Systems
For any perfect matching M of a graph AG, the anti-forcing number of M af(G,M) is the cardinality of a minimum edge subset S⊆E(G)\M such that the graph G−S has only one perfect matching.
Yaxian Zhang, Bo Zhang, Heping Zhang
doaj +1 more source
The study investigates novel semi‐finished products made of unidirectionally arranged hemp or pineapple leaf fiber‐reinforced composites produced from different matrices. The materials are analyzed in terms of their mechanical and interfacial properties and void content.
Nina Graupner +22 more
wiley +1 more source

