Results 91 to 100 of about 6,170,352 (312)

Automata theory for XML researchers [PDF]

ACM SIGMOD Record, 2002
The advent of XML initiated a symbiosis between document research, databases and formal languages (see, e.g., the survey by Vianu [38]). This symbiosis resulted, for instance, in the development of unranked tree automata [3]. In brief, unranked trees are finite labeled trees where nodes can have an arbitrary number of children.
openaire   +2 more sources

Effectiveness and Safety of Baricitinib for Juvenile Idiopathic Arthritis–Associated Uveitis or Chronic Anterior Antinuclear Antibody–Positive Uveitis

Arthritis Care &Research, EarlyView.
Objective To evaluate the efficacy and safety of baricitinib in pediatric patients with active juvenile idiopathic arthritis–associated uveitis (JIA‐U) or chronic anterior antinuclear antibody–positive uveitis, who had an inadequate response to methotrexate (MTX) or biologic disease‐modifying antirheumatic drugs (bDMARDs).
Athimalaipet V. Ramanan, Catherine M. Guly, Gabriele Simonini, Stuart Y. Keller, Priyanka Sen, Thorsten Holzkaemper, Joana Araújo, Pierre Quartier   +7 more
wiley   +1 more source

Reachability resolution for discrete-time hybrid systems with application to automated test generation for Simulink/Stateflow

IET Cyber-Physical Systems, 2017
Simulink/Stateflow is a popular commercial model-based development tool for many industrial domains. For safety and security concerns, verification and testing must be performed on the Simulink/Stateflow designs and the generated code.
Meng Li, Ratnesh Kumar
doaj   +1 more source

Cognitive Behavioral Therapy for Youth with Childhood‐Onset Lupus: A Randomized Clinical Trial

Arthritis Care &Research, Accepted Article.
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, Thea Senger‐Carpenter, Jocelyn Zuckerman, Michelle Adler, Mallet R. Reid, Ashley Danguecan, Luana Flores Pereira, Sarah I. Mossad, Samantha L. Ely, Khalid Abulaban, Elizabeth A. Kessler, Natalie Rosenwasser, Tamar B. Rubinstein, Ekemini A. Ogbu, Emily A. Smitherman, Alaina Miller, Taylor Abounader, Elizabeth Ross, Livie Timmerman, Dhriti Sharma, Jennifer N. Stinson, Stacy Allen, Kabita Nanda, Tala El Tal, Deborah M. Levy, Linda T. Hiraki, Hermine I. Brunner, Mathew Reeves, Steven J. Pierce, Andrea Knight   +29 more
wiley   +1 more source

Finite automata models of quantized systems: conceptual status and outlook [PDF]

, 2002
Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models.
Svozil, Karl
core   +4 more sources

Automata Theory and Formal Languages

Texts in Computer Science, 2021
Zhe Hou
semanticscholar   +1 more source

Evaluation of a novel EHR sidecar application to display RA clinical outcomes during clinic visits: results of a stepped‐wedge cluster randomized pragmatic trial

Arthritis Care &Research, Accepted Article.
Objective We developed a novel EHR 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, Jing Li, Cathy Nasrallah, Cherish Wilson, Alicia Hamblin, Christine Hariz, Cammie Young, Stephen Shiboski, Emma Kersey, Mary Nakamura, Judith F. Ashouri, Mehrdad Matloubian, Andrew J. Gross, Jennifer Barton, Beth Berrean, Jonathan Prugh, Jinoos Yazdany   +16 more
wiley   +1 more source

Computation Theory of Cellular Automata [PDF]

Communications in Mathematical Physics, 1984
Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata. The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages. Many examples are given.
openaire   +3 more sources

Composite Electrospun Fibers Containing Optimized B‐ and Cu‐Doped Bioactive Glass Sol‐Gel Particles for Potential Soft Tissue Engineering Applications

Advanced Engineering Materials, EarlyView.
This article describes the preparation and characterization of poly(ε‐caprolactone) electrospun composite fibers incorporating sol‐gel‐derived bioactive glass particles doped with B and Cu. Scanning electron microscopy, energy‐dispersive X‐ray spectroscopy, Fourier‐transform infrared spectroscopy, contact angle, acellular bioactivity, mechanical and ...
Elisa Piatti, Marta Miola, Liliana Liverani, Paolo Sartori, Enrica Verné, Aldo R. Boccaccini   +5 more
wiley   +1 more source

Recognizable Languages of k-Forcing Automata

Mathematical and Computational Applications
In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen   +3 more
doaj   +1 more source