Results 211 to 220 of about 1,222,668 (263)

Clinical Outcomes of SEEG‐Guided Radiofrequency Thermocoagulation in Children With Focal Drug‐Resistant Epilepsy: A Multicenter Real‐World Study

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Stereoelectroencephalography‐guided radiofrequency thermocoagulation (SEEG‐RFTC) has emerged as a safe and effective minimally invasive treatment for children with drug‐resistant focal epilepsy. Although evidence from real‐world studies remains limited, numerous pediatric cases have demonstrated promising outcomes. This retrospective
Weitao Chen   +7 more
wiley   +1 more source

Effectiveness of rTMS on Working Memory and Inhibitory Impairments in Patients With Post‐Stroke Executive Deficits

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao   +6 more
wiley   +1 more source

RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu   +21 more
wiley   +1 more source

Oblivious network design

Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
Consider the following network design problem: given a network G = (V, E), source-sink pairs {si, ti} arrive and desire to send a unit of flow between themselves. The cost of the routing is this: if edge e carries a total of fe flow (from all the terminal pairs), the cost is given by Σ el(fe), where l is some concave cost function; the goal is to ...
Anupam Gupta 0001   +2 more
openaire   +2 more sources

Airline Network Design

Operations Research, 1998
The goal of this paper is to understand choices of networks and schedules by a profit maximizing airline. By “network” we mean the routing pattern for planes and by “schedule” we mean the frequency of service between cities and the amount of time put into the schedule to assure on-time arrival. This paper analyzes network and schedule choice using an “
Phillip J. Lederer   +1 more
openaire   +2 more sources

Boolean Network Probabilities and Network Design

IEEE Transactions on Computers, 1978
The correspondence between Boolean network probabilities and the design formalisms of Ledley and Aiken is demonstrated.
Edward J. McCluskey   +2 more
openaire   +2 more sources

Networks for shoot design

Trends in Plant Science, 1999
The intrinsic capacity of the shoot apical meristem for self-regulation and the positional specification of its cells implies the existence of an elaborate and versatile communication network. We propose a model that pictures this network as a system of overlapping signal circuits, which support local tasks as well as coordinating indeterminate shoot ...
van der Schoot, C., Rinne, P.
openaire   +3 more sources

SNA's design for networking

IEEE Network, 1992
Systems Network Architecture (SNA) provides users with services needed in a networking environment: sharing of communication lines, directory services, connection establishment, improved reliability, management services, and an appropriate interface and set of facilities for distributed programming.
Diane Pozefsky   +2 more
openaire   +1 more source

On the design of reliable networks

Networks, 1973
AbstractThis paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no more than n minimum vertex cut‐sets. Frank's results imply that this is an important step in the design of a class of reliable networks.
S. Louis Hakimi, Ashok T. Amin
openaire   +2 more sources

Home - About - Disclaimer - Privacy