Results 31 to 40 of about 39,835 (307)
Polynomially computable Σ-specifications of hierarchical models of reacting systems
Advanced Engineering Research, 2020 Introduction. Verification packages design and analyze the correctness of parallel and distributed systems within the framework of various classes of temporal logics of linear and branching time. The paper discusses a polynomially realizable class of ∆0T
V. N. Glushkova, K. S. Korovina
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source
Grammar systems in simple splicing [PDF]
, 2013 Splicing systems was first introduced by Head in 1987 as a mathematical model of the generative formalism that initiates the connection between formal language theory and the study of deoxyribonucleic acid (DNA). The mathematical modeling of splicing was
Shukri, Nurul 'Alyaa'
core
Do we need summary and sequential scanning in (Cognitive) grammar? [PDF]
, 2007 Cognitive Grammar postulates two modes of cognitive processing for the structuring of complex scenes, summary scanning and sequential scanning. Generally speaking, the theory is committed to basing grammatical concepts upon more general cognitive ...
W. Hollmann +2 more
core +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
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Erzsébet Csuhaj-Varjú, György Vaszil
doaj +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
High-level methodologies for grammar engineering, introduction to the special issue
Journal of Language Modelling, 2015 Grammar Engineering is the task of designing and implementing linguistically motivated electronic descriptions of natural language (so-called grammars).
Denys Duchier, Yannick Parmentier
doaj +1 more source