Results 131 to 140 of about 13,149,896 (206)
Locating domination in graphs and their complements
A dominating set S of a graph G is called locating-dominating , LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum cardinality are called LD -codes and the
Hernando Martín, María del Carmen +2 more
core
ABSTRACT Objective To evaluate the expression of nine blood RNA biomarkers in a clinical trial based on genes previously identified in an experimental monkey model of stroke for diagnosis feasibility and prognostication. Methods IBIS‐CT1 was a prospective longitudinal study enrolling patients with ischemic stroke (IS) or intracerebral hemorrhage (ICH ...
Salomé Retailleau +11 more
wiley +1 more source
Food waste composition, hotspots and sustainability impacts in an airline catering kitchen. [PDF]
Sundin N +4 more
europepmc +1 more source
ABSTRACT Objective To determine whether myelin‐sensitive quantitative MRI reveals microstructural abnormalities in normal‐appearing cortex (NACtx) in myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD), indicating that conventional MRI underestimates remission residual cortical injury.
Valentina Camera +20 more
wiley +1 more source
Metric, edge-metric, mixed-metric, and fault-tolerant metric dimensions of geometric networks with potential applications. [PDF]
Hayat S +6 more
europepmc +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Revealing the interplay between flow dynamics and cavitation activity in a flow-through sonoreactor. [PDF]
Javidani A +4 more
europepmc +1 more source
Metric-locating-dominating partitions in graphs
A partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other part S j .
Hernando Martín, María del Carmen +2 more
core
Natural Frequencies of Levodopa‐Induced Dyskinesia in Parkinson's Disease
ABSTRACT Objectives Abnormal involuntary movements, known as dyskinesias, are common complications of levodopa treatment in patients with Parkinson's disease and can significantly impair quality of life. The underlying pathophysiology remains unclear, and current therapeutic options are limited.
Ioannis U. Isaias +3 more
wiley +1 more source
Involving Parents in Prevention: A Case Example of Research and Intervention Development to Improve Financial Well-Being Support. [PDF]
Axford N +8 more
europepmc +1 more source

