Results 21 to 30 of about 9,410 (233)
Algorithms, 2018 Long-term heart rate variability (HRV) analysis is useful as a noninvasive technique for autonomic nervous system activity assessment. It provides a method for assessing many physiological and pathological factors that modulate the normal heartbeat.
David Pang, Tomohiko Igasaki
doaj +1 more source
CANA: A Python Package for Quantifying Control and Canalization in Boolean Networks
Frontiers in Physiology, 2018 Logical models offer a simple but powerful means to understand the complex dynamics of biochemical regulation, without the need to estimate kinetic parameters.
Rion B. Correia +6 more
doaj +1 more source
Reliability and Safety of Autonomous Systems Based on Semantic Modelling for Self-Certification
Robotics, 2021 A novel modelling paradigm for online diagnostics and prognostics for autonomous systems is presented. A model for the autonomous system being diagnosed is designed using a logic-based formalism. The model supports the run-time ability to verify that the
Osama Zaki +3 more
doaj +1 more source
Tabularia, 2021 The three large images that adorn folios 4v, 19v and 25v of the 12th-century cartulary have already been extensively studied and commented upon and continue to raise numerous problems of interpretation.
Jacques Le Maho
doaj +1 more source
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Information and Control, 1969 Certain mathematical studies of pattern recognition, evolution theories, and self-reproducing automata motivated the definition of the tessellation automaton which is a mathematical model of an infinite array of uniformly interconnected identical finite-state machines.
Yamada, H., Amoroso, S.
openaire +1 more source
International Journal of Foundations of Computer Science, 2011 The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Rueß. Here, we present some expressiveness properties of a restriction of the deterministic affine PA recently introduced, and use them as a tool to show that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this
Michaël Cadilhac +2 more
openaire +3 more sources
Single Valued Neutrosophic General Machine [PDF]
Neutrosophic Sets and Systems, 2022 In this paper, first of all, considering the notions of single-valued neutrosophic and general fuzzy automata we present the concept of single-valued neutrosophic general machine, to simplicity, SVNGM.
Marzieh Shamsizadeh
doaj +1 more source
Theoretical Computer Science, 2012 Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that feature (string) language acceptors with multiset manipulation as a computing mechanism, and show that reaction ...
Okubo, Fumiya +2 more
openaire +2 more sources
On discovering functions in actin filament automata [PDF]
Royal Society Open Science, 2019 We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state.
Andrew Adamatzky
doaj +1 more source