Results 121 to 130 of about 2,298,639 (295)
The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila +3 more
doaj +1 more source
ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou +16 more
wiley +1 more source
Peripheral Neutrophil Activation and Extracellular Trap Formation in Amyotrophic Lateral Sclerosis
Markers of neutrophil activation are increased in plasma during ALS, and markers of NET formation associate with ALS survival. ABSTRACT Objectives Peripheral neutrophil levels in amyotrophic lateral sclerosis (ALS) inversely correlate with survival, suggesting a role for neutrophils in disease progression.
Lillia A. Baird +9 more
wiley +1 more source
ABSTRACT Objective To clarify the clinical relevance of dopamine transporter single‐photon emission computed tomography (DAT‐SPECT) abnormalities in amyotrophic lateral sclerosis (ALS), with a prespecified focus on sex‐stratified associations with disease progression and short‐term prognosis.
Tomoya Kawazoe +7 more
wiley +1 more source
Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis
ABSTRACT Background Low‐grade gliomas (LGG) exhibit significant heterogeneity and recurrence risk. G protein‐coupled receptors (GPCR) contribute to glioma malignant progression, but their prognostic value remains unclear. This work attempts to formulate a GPCR‐based outcome‐predicting model for LGG. Methods Based on TCGA LGG data, the enrichment scores
Jun Yang +4 more
wiley +1 more source
An ETH-Tight Exact Algorithm for Euclidean TSP [PDF]
We study exact algorithms for Euclidean TSP in R d . In the early 1990s algorithms with n O(√n) running time were presented for the planar case, and some years later an algorithm with n O(n1-1/d) running time was presented for any d ≥ 2.
Berg, Mark de +5 more
core +1 more source
Exact and Approximation Algorithms for Linear Arrangement Problems [PDF]
Alain Quiliot, Djamal Rebaine
doaj +1 more source
Exact and approximation algorithms for sensor placement against DDoS attacks [PDF]
Dariusz Nogalski +2 more
doaj +1 more source
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi +17 more
wiley +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

