Results 101 to 110 of about 742,132 (325)

Lessons Learned From a Delayed‐Start Trial of Modafinil for Freezing of Gait in Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Freezing of gait (FOG) in people with Parkinson's disease (PwPD) is debilitating and has limited treatments. Modafinil modulates beta/gamma band activity in the pedunculopontine nucleus (PPN), like PPN deep brain stimulation. We therefore tested the hypothesis that Modafinil would improve FOG in PwPD.
Tuhin Virmani   +8 more
wiley   +1 more source

A constant FPT approximation algorithm for hard-capacitated k-means [PDF]

open access: green, 2019
Yicheng Xu   +4 more
openalex   +1 more source

Predicting Epileptogenic Tubers in Patients With Tuberous Sclerosis Complex Using a Fusion Model Integrating Lesion Network Mapping and Machine Learning

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Accurate localization of epileptogenic tubers (ETs) in patients with tuberous sclerosis complex (TSC) is essential but challenging, as these tubers lack distinct pathological or genetic markers to differentiate them from other cortical tubers.
Tinghong Liu   +11 more
wiley   +1 more source

Remote Monitoring in Myasthenia Gravis: Exploring Symptom Variability

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Myasthenia gravis (MG) is a rare, autoimmune disorder characterized by fluctuating muscle weakness and potential life‐threatening crises. While continuous specialized care is essential, access barriers often delay timely interventions. To address this, we developed MyaLink, a telemedical platform for MG patients.
Maike Stein   +13 more
wiley   +1 more source

Set-Valued Approximation—Revisited and Improved

open access: yesMathematics
We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions.
David Levin
doaj   +1 more source

Rank-1 Tensor Approximation Methods and Application to Deflation

open access: yes, 2015
Because of the attractiveness of the canonical polyadic (CP) tensor decomposition in various applications, several algorithms have been designed to compute it, but efficient ones are still lacking.
Comon, Pierre   +2 more
core   +1 more source

Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz   +11 more
wiley   +1 more source

Single Machine Scheduling Problems: Standard Settings and Properties, Polynomially Solvable Cases, Complexity and Approximability

open access: yesAlgorithms
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems have appeared.
Nodari Vakhania   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy