Results 51 to 60 of about 914 (247)
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
Logical Methods in Computer Science, 2013 The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Thomas Colcombet
doaj +1 more source
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT This article examines the evolving role of organizational leadership amidst the rapid advancements in artificial intelligence (AI). It explores a broadly experienced and documented crisis in leadership, due in part to the disruptive nature of AI and emerging technology.
Rachel Wlodarsky, Davin Carr Chellman
wiley +1 more source
Automatic functions, linear time and learning [PDF]
Logical Methods in Computer Science, 2013 The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full
John Case +3 more
doaj +1 more source
Annals 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
Global Rather Than Vertical‐Selective Saccadic Abnormalities in Progressive Supranuclear Palsy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To test whether vertical saccades are preferentially affected in Progressive Supranuclear Palsy (PSP). Methods PSP patients (n = 24) were compared to age‐matched controls (n = 94) and two degenerative groups (Alzheimer's disease, n = 20; Lewy body disease, n = 50).
Duy Duan Nguyen +6 more
wiley +1 more source
Functional Automata - Formal Languages for Computer Science Students [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science.
Marco T. Morazán, Rosario Antunez
openaire +3 more sources
Cognitive Behavioral Therapy for Youth With Childhood‐Onset Lupus: A Randomized Clinical Trial
Arthritis Care &Research, EarlyView.Objective Our objective was to determine the feasibility and acceptability of the Treatment and Education Approach for Childhood‐Onset Lupus (TEACH), a six‐session cognitive behavioral intervention addressing depressive, fatigue, and pain symptoms, delivered remotely to individual youth with lupus by a trained interventionist.
Natoshia R. Cunningham +29 more
wiley +1 more source
Arthritis Care &Research, EarlyView.Objective We developed a novel electronic health record sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk +16 more
wiley +1 more source
Arthritis Care &Research, EarlyView.Objective To support high‐quality, patient‐centered care for systemic lupus erythematosus (SLE), the American College of Rheumatology (ACR) developed evidence‐based measures incorporating clinical and patient‐reported outcome measures (PROMs). Using the Consolidated Framework for Implementation Research (CFIR), we conducted semistructured interviews ...
Catherine Nasrallah +13 more
wiley +1 more source
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source