2,089 research outputs found
Complex-linear invariants of biochemical networks
The nonlinearities found in molecular networks usually prevent mathematical
analysis of network behaviour, which has largely been studied by numerical
simulation. This can lead to difficult problems of parameter determination.
However, molecular networks give rise, through mass-action kinetics, to
polynomial dynamical systems, whose steady states are zeros of a set of
polynomial equations. These equations may be analysed by algebraic methods, in
which parameters are treated as symbolic expressions whose numerical values do
not have to be known in advance. For instance, an "invariant" of a network is a
polynomial expression on selected state variables that vanishes in any steady
state. Invariants have been found that encode key network properties and that
discriminate between different network structures. Although invariants may be
calculated by computational algebraic methods, such as Gr\"obner bases, these
become computationally infeasible for biologically realistic networks. Here, we
exploit Chemical Reaction Network Theory (CRNT) to develop an efficient
procedure for calculating invariants that are linear combinations of
"complexes", or the monomials coming from mass action. We show how this
procedure can be used in proving earlier results of Horn and Jackson and of
Shinar and Feinberg for networks of deficiency at most one. We then apply our
method to enzyme bifunctionality, including the bacterial EnvZ/OmpR osmolarity
regulator and the mammalian
6-phosphofructo-2-kinase/fructose-2,6-bisphosphatase glycolytic regulator,
whose networks have deficiencies up to four. We show that bifunctionality leads
to different forms of concentration control that are robust to changes in
initial conditions or total amounts. Finally, we outline a systematic procedure
for using complex-linear invariants to analyse molecular networks of any
deficiency.Comment: 36 pages, 6 figure
The human-computer connection : an overview of brain-computer interfaces
This article introduces the field of brain-computer interfaces (BCI), which allows the control of devices without the generation of any active motor output but directly from the decoding of the user?s brain signals. Here we review the current state of the art in the BCI field, discussing the main components of such an interface and illustrating ongoing research questions and prototypes for controlling a large variety of devices, from virtual keyboards for communication to robotics systems to replace lost motor functions and even clinical interventions for motor rehabilitation after a stroke. The article concludes with some insights into the future of BCI
Recent and upcoming BCI progress: overview, analysis, and recommendations
Brain–computer interfaces (BCIs) are finally moving out of the laboratory and beginning to gain acceptance in real-world situations. As BCIs gain attention with broader groups of users, including persons with different disabilities and healthy users, numerous practical questions gain importance. What are the most practical ways to detect and analyze brain activity in field settings? Which devices and applications are most useful for different people? How can we make BCIs more natural and sensitive, and how can BCI technologies improve usability? What are some general trends and issues, such as combining different BCIs or assessing and comparing performance? This book chapter provides an overview of the different sections of this book, providing a summary of how authors address these and other questions. We also present some predictions and recommendations that ensue from our experience from discussing these and other issues with our authors and other researchers and developers within the BCI community. We conclude that, although some directions are hard to predict, the field is definitely growing and changing rapidly, and will continue doing so in the next several years
Period Stabilization in the Busse-Heikes Model of the Kuppers-Lortz Instability
The Busse-Heikes dynamical model is described in terms of relaxational and
nonrelaxational dynamics. Within this dynamical picture a diverging alternating
period is calculated in a reduced dynamics given by a time-dependent
Hamiltonian with decreasing energy. A mean period is calculated which results
from noise stabilization of a mean energy. The consideration of
spatial-dependent amplitudes leads to vertex formation. The competition of
front motion around the vertices and the Kuppers-Lortz instability in
determining an alternating period is discussed.Comment: 28 pages, 11 figure
Trombo intraventricular izquierdo en un gato con cardiomiopatía dilatada
Describimos el caso de un gato que presentaba un cuadro de disnea y derrame pleural, en el que tras realizar ecocardiografía se diagnosticó una cardiomiopatía dilatada (CMD), asociada a un trombo localizado dentro del ventrículo izquierdo. La localización habitual de estos trombos intracardiacos es el atrio izquierdo. El tromboembolismo es relativamente frecuente en gatos y ocurre principalmente como una complicación de enfermedades subyacentes. Los émbolos están mayoritariamente localizados en la aorta distal y en las arterias ilíacas.
Stability of strict equilibria in best experienced payoff dynamics: Simple formulas and applications
Producción CientíficaWe consider a family of population game dynamics known as Best Experienced Payoff Dynamics. Under these dynamics, when agents are given the opportunity to revise their strategy, they test some of their possible strategies a fixed number of times. Crucially, each strategy is tested against a new randomly drawn set of opponents. The revising agent then chooses the strategy whose total payoff was highest in the test, breaking ties according to a given tie-breaking rule. Strict Nash equilibria are rest points of these dynamics, but need not be stable. We provide some simple formulas and algorithms to determine the stability or instability of strict Nash equilibria.Agencia Estatal de Investigación (project PID2020-118906GB-I00/AEI/10.13039/501100011033)Ministerio de Ciencia, Innovación y Universidades (projects PRX19/00113 and PRX21/00295)Fulbright Program (projects PRX19/00113 and PRX21/00295
Strategy sets closed under payoff sampling
Producción CientíficaWe consider population games played by procedurally rational players who, when revising their current strategy, test each of their available strategies independently in a series of random matches –i.e., a battery of tests–, and then choose the strategy that performed best in this battery of tests. This revision protocol leads to the so-called payoff-sampling dynamics (aka test-all Best Experienced Payoff dynamics).
In this paper we characterize the support of all the rest points of these dynamics in any game and analyze the asymptotic stability of the faces to which they belong. We do this by defining strategy sets closed under payoff sampling, and by proving that the identification of these sets can be made in terms of simple comparisons between some of the payoffs of the game
Combination of DROOL rules and Protégé knowledge bases in the ONTO-H annotation tool
ONTO-H is a semi-automatic collaborative tool for the semantic annotation of documents, built as a Protégé 3.0 tab plug-in. Among its multiple functionalities aimed at easing the document annotation process, ONTO-H uses a rule-based system to create cascading annotations out from a single drag and drop operation from a part of a document into an already existing concept or instance of the domain ontology being used for annotation. It also gives support to the detection of name conflicts and instance duplications in the creation of the annotations. The rule system runs on top of the open source rule engine DROOLS and is connected to the domain ontology used for annotation by means of an ad-hoc programmed Java proxy
- …