Results 301 to 310 of about 1,832,436 (388)

Tremor Asymmetry and the Development of Bilateral Phase‐Specific Deep Brain Stimulation for Postural Tremor

open access: yesMovement Disorders, EarlyView.
Abstract Background Tremor phase‐locked deep brain stimulation (DBS) has been shown to modulate symptom severity in postural tremor, including essential and dystonic tremor, with less energy than existing systems. Previous studies focused on unilateral stimulation; it remains unknown how tremor asymmetry interacts with stimulation in the context of ...
Shenghong He   +16 more
wiley   +1 more source

The DRP1 receptor FIS1 is critical to the expansion of triple-negative breast cancer tumor-initiating cells. [PDF]

open access: yesCancer Cell Int
Katrii T   +8 more
europepmc   +1 more source

Video‐Based Data‐Driven Models for Diagnosing Movement Disorders: Review and Future Directions

open access: yesMovement Disorders, EarlyView.
Abstract Movement disorders are abnormal, involuntary movements that can heavily impact a person's quality of life. In clinical practice, diagnosis and severity assessments rely mainly on visual clinical inspections (ie, on subjective expert opinion). With clinical videos commonly acquired as part of examinations, novel data‐driven models have emerged ...
Rafael Martínez‐García‐Peña   +3 more
wiley   +1 more source

Meta-anlaysis of Internet-based Behavior Therapy for Tic Disorder. [PDF]

open access: yesClin Psychopharmacol Neurosci
Jo YD   +9 more
europepmc   +1 more source

Adherence of TiC films on SUS 304 and SUS 321 Stainless Steels

open access: bronze, 1984
Masahiro Tosa   +3 more
openalex   +2 more sources

Tics as a Presenting Symptom in Catatonia

open access: yes
Movement Disorders Clinical Practice, EarlyView.
Lindsey M. Vogt   +3 more
wiley   +1 more source

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

open access: yesNetworks, EarlyView.
ABSTRACT The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
wiley   +1 more source

Home - About - Disclaimer - Privacy