Results 131 to 140 of about 2,538 (309)

Generalized rough and fuzzy rough automata for semantic computing. [PDF]

open access: yesInt J Mach Learn Cybern, 2022
Yadav S, Tiwari SP, Kumari M, Yadav VK.
europepmc   +1 more source

Dual Action of Dipyridamole in Experimental Rheumatoid Arthritis: Suppression of Joint Inflammation and Upregulation of Muscle Anabolism via Adenosine and AMPK Pathways

open access: yesArthritis &Rheumatology, EarlyView.
Objective Rheumatoid sarcopenia, characterized by the progressive loss of skeletal muscle mass and function, is a frequent comorbidity in rheumatoid arthritis (RA), linked to prolonged, severe systemic inflammation. Purinergic signaling (adenosine, AMP, and ATP) plays a crucial role in inflammation, myogenesis, and muscle hypertrophy.
Miguel Marco‐Bonilla   +13 more
wiley   +1 more source

CS 466/666: Formal Languages and Automata

open access: yes, 2006
This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines).
Thirunarayan, Krishnaprasad
core  

A Pragmatic Trial of a Shared Decision‐Making Intervention to Improve Medication Adherence and Outcomes in Systemic Lupus Erythematosus: The HCQ‐SAFE Study

open access: yesArthritis &Rheumatology, EarlyView.
Objective Hydroxychloroquine (HCQ) nonadherence in systemic lupus erythematosus (SLE) stemming from decision complexities can be improved with shared decision‐making (SDM) tools clarifying benefits and harms. This study aimed to develop and evaluate HCQ‐SAFE, a pictogram‐based SDM tool during SLE visits.
Caroline Packee   +8 more
wiley   +1 more source

Using formal methods to support testing

open access: yes, 2008
Formal methods and testing are two important approaches that assist in the development of high quality software. While traditionally these approaches have been seen as rivals, in recent years a new consensus has developed in which they are seen as ...
Woodward, M   +13 more
core  

Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata

open access: yes, 2017
In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular ...
Pietro Sala   +5 more
core   +1 more source

Development of interactive MRI‐based 3D visualization tools for neuroanatomy education in Latin America

open access: yesAnatomical Sciences Education, EarlyView.
Abstract The study of neuroanatomy is fundamental in many scientific fields. Despite this, it is a challenging subject for students. As technology evolves, it is being increasingly incorporated into educational methods, including the teaching of neuroanatomy. Three‐dimensional (3D) visualizations are well suited for displaying neuroanatomy.
Merlin J. Fair   +5 more
wiley   +1 more source

Some formal methods for analyzing quantum automata

open access: yes, 2005
We survey some formal methods useful in the analysis of (measure-once) 1-way quantum automata (lqfa's). We settle isolated cut point Rabin's theorem in the context of compact monoids; this explains why languages accepted with isolated cut point by ...
B. Palano, A. Bertoni, C. Mereghetti
core  

Show Me the Brain!!: A modern approach to neuroanatomy education

open access: yesAnatomical Sciences Education, EarlyView.
Abstract Show Me the Brain!! (SMtB) is a digital system for interactive graphics that is designed to support instruction in neuroanatomy and neuroscience. It will soon be made open‐source and freely available. SMtB bridges medical and traditional neuroanatomy instruction with the computational systems and representational conventions common in ...
Nicholas C. Hindy   +3 more
wiley   +1 more source

Deciding subset relationship of co-inductively defined set constants

open access: yes, 2005
Static analysis of different non-strict functional programming languages makes use of set constants like Top, Inf, and Bot denoting all expressions, all lists without a last Nil as tail, and all non-terminating programs, respectively.
Sabel, David   +5 more
core  

Home - About - Disclaimer - Privacy