Results 61 to 70 of about 982,672 (306)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives We aimed to determine the frequency of subclinical optic nerve (ON) lesions using MRI, optical coherence tomography (OCT), and visual evoked potentials (VEP) in radiologically isolated syndrome (RIS), and to assess their diagnostic and prognostic significance.
Christine Lebrun‐Frenay +13 more
wiley +1 more source
Competitive Equilibria in Decentralized Matching with Incomplete Information [PDF]
This paper shows that all perfect Bayesian equilibria of a decentralized dynamic matching market with two-sided incomplete information of independent private values variety converge to competitive equilibria.
Alp E. Atakan
core +2 more sources
Matching Extendabilities of G = Cm ∨ Pn
Mathematics, 2019 A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of
Zhi-hao Hui +3 more
doaj +1 more source
Algebraic Representations of Unique Bipartite Perfect Matching [PDF]
, 2022 We obtain complete characterizations of the Unique Bipartite Perfect Matching function, and of its Boolean dual, using multilinear polynomials over the reals.
Beniamini, Gal
core +1 more source
T1 Over Squared Proton Density Ratio to Characterize Multiple Sclerosis Lesions
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Differentiating remyelinated from demyelinated lesions in MS remains challenging without histological confirmation. This study introduces the T1‐to‐PD2 ratio (TPR) imaging approach and evaluates its ability to characterize MS lesions alongside other quantitative MRI (qMRI) metrics. Methods Thirty individuals with MS (mean age: 47.5 ±
Sarah J. Wright +10 more
wiley +1 more source
Exact Perfect Matching in Complete Graphs
, 2017 A red-blue graph is a graph where every edge is colored either red or blue. The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of red edges. We show that
Rohit Gurjar +3 more
core +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Early risk stratification may support clinical decision‐making in spontaneous intracerebral hemorrhage (ICH). We aimed to develop and internally validate HAGIV, a score integrating frequency of imaging markers (FIM), a time‐adjusted non‐contrast computed tomography (CT) metric of hematoma expansion, with established predictors for 90‐
Lei Song +10 more
wiley +1 more source
Anti-Forcing Spectra of Convex Hexagonal Systems
Mathematics, 2022 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
Characterizing Cutaneous α‐Synuclein Deposition and Seeding Activity in Parkinson's Disease Subtypes
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Cutaneous phosphorylated α‐synuclein (p‐syn) and α‐synuclein seeding activity are promising biomarkers for Parkinson's disease (PD), but their clinical value remains uncertain due to disease heterogeneity. This study evaluates these two biomarkers in PD patients to inform phenotype‐specific diagnosis and disease severity assessment ...
Yuting Jin +8 more
wiley +1 more source
The complexity of the Perfect Matching-Cut problem
, 2020 Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that is an edge cut. We show that this problem is $NP$-complete for planar graphs with maximum degree four, for planar graphs with girth five, for bipartite five ...
Bouquet, Valentin, Picouleau, Christophe
core +1 more source