Stabilization of positive linear discrete-time systems by using a Brauer's theorem.
Ontology highlight
ABSTRACT:
SUBMITTER: Canto B
PROVIDER: S-EPMC4144301 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:System biology provides the basis to understand the behavioral properties of complex biological organisms at different levels of abstraction. Traditionally, analysing systems biology based models of various diseases have been carried out by paper-and-pencil based proofs and simulations. However, these methods cannot provide an accurate analysis, which is a serious drawback for the safety-critical domain of human medicine. In order to overcome these limitations, we propose a framework to formally analyze biological networks and pathways. In particular, we formalize the notion of reaction kinetics in higher-order logic and formally verify some of the commonly used reaction based models of biological networks using the HOL Light theorem prover. Furthermore, we have ported our earlier formalization of Zsyntax, i.e., a deductive language for reasoning about biological networks and pathways, from HOL4 to the HOL Light theorem prover to make it compatible with the above-mentioned formalization of reaction kinetics. To illustrate the usefulness of the proposed framework, we present the formal analysis of three case studies, i.e., the pathway leading to TP53 Phosphorylation, the pathway leading to the death of cancer stem cells and the tumor growth based on cancer stem cells, which is used for the prognosis and future drug designs to treat cancer patients.
| S-EPMC5495343 | biostudies-literature
Project description:The time-scales theory provides a powerful theoretical tool for studying differential and difference equations simultaneously. With regard to Herglotz type variational principle, this generalized variational principle can deal with non-conservative or dissipative problems. Combining the two tools, this paper aims to study time-scales Herglotz type Noether theorem for delta derivatives of Birkhoffian systems. We introduce the time-scales Herglotz type variational problem of Birkhoffian systems firstly and give the form of time-scales Pfaff-Herglotz action for delta derivatives. Then, time-scales Herglotz type Birkhoff's equations for delta derivatives are derived by calculating the variation of the action. Furthermore, time-scales Herglotz type Noether symmetry for delta derivatives of Birkhoffian systems are defined. According to this definition, time-scales Herglotz type Noether identity and Noether theorem for delta derivatives of Birkhoffian systems are proposed and proved, which can become the ones for delta derivatives of Hamiltonian systems or Lagrangian systems in some special cases. Therefore, it is shown that the results of Birkhoffian formalism are more universal than Hamiltonian or Lagrangian formalism. Finally, the time-scales damped oscillator and a non-Hamiltonian Birkhoffian system are given to exemplify the superiority of the results.
| S-EPMC6894585 | biostudies-literature
Project description:With the advent of high-throughput profiling methods, interest in reverse engineering the structure and dynamics of biochemical networks is high. Recently an algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is a top-down approach using time discrete dynamical systems. One of its key steps includes the choice of a term order, a technicality imposed by the use of Gröbner-bases calculations. The aim of this paper is to identify minimal requirements on data sets to be used with this algorithm and to characterize optimal data sets. We found minimal requirements on a data set based on how many terms the functions to be reverse engineered display. Furthermore, we identified optimal data sets, which we characterized using a geometric property called "general position". Moreover, we developed a constructive method to generate optimal data sets, provided a codimensional condition is fulfilled. In addition, we present a generalization of their algorithm that does not depend on the choice of a term order. For this method we derived a formula for the probability of finding the correct model, provided the data set used is optimal. We analyzed the asymptotic behavior of the probability formula for a growing number of variables n (i.e. interacting chemicals). Unfortunately, this formula converges to zero as fast as , where and . Therefore, even if an optimal data set is used and the restrictions in using term orders are overcome, the reverse engineering problem remains unfeasible, unless prodigious amounts of data are available. Such large data sets are experimentally impossible to generate with today's technologies.
| S-EPMC2654658 | biostudies-literature
Project description:When simulating molecular systems using deterministic equations of motion (e.g., Newtonian dynamics), such equations are generally numerically integrated according to a well-developed set of algorithms that share commonly agreed-upon desirable properties. However, for stochastic equations of motion (e.g., Langevin dynamics), there is still broad disagreement over which integration algorithms are most appropriate. While multiple desiderata have been proposed throughout the literature, consensus on which criteria are important is absent, and no published integration scheme satisfies all desiderata simultaneously. Additional nontrivial complications stem from simulating systems driven out of equilibrium using existing stochastic integration schemes in conjunction with recently developed nonequilibrium fluctuation theorems. Here, we examine a family of discrete time integration schemes for Langevin dynamics, assessing how each member satisfies a variety of desiderata that have been enumerated in prior efforts to construct suitable Langevin integrators. We show that the incorporation of a novel time step rescaling in the deterministic updates of position and velocity can correct a number of dynamical defects in these integrators. Finally, we identify a particular splitting (related to the velocity Verlet discretization) that has essentially universally appropriate properties for the simulation of Langevin dynamics for molecular systems in equilibrium, nonequilibrium, and path sampling contexts.
| S-EPMC4065221 | biostudies-literature
Project description:ObjectivesPositive predictive values (PPVs) and negative predictive values (NPVs) are frequently reported to put estimates of accuracy of a diagnostic test in clinical context and to obtain risk estimates for a given patient taking into account baseline prevalence in the population. In order to calculate PPV and NPV, tests with ordinally or continuously scaled results are commonly dichotomized at the expense of a loss of information.MethodsExtending the rationale for the calculation of PPV and NPV, Bayesian theorem is used to calculate the probability of disease given the outcome of a continuously or ordinally scaled test. Probabilities of test results conditional on disease status are modeled in a Bayesian framework and subsequently transformed to probabilities of disease status conditional on test result.ResultsUsing publicly available data, probability of a clinical depression diagnosis given PROMIS Depression scores was estimated. Comparison with PPV and NPV based on dichotomized scores shows that a more fine-grained interpretation of test scores is possible.ConclusionsThe proposed method bears the chance to facilitate accurate and meaningful interpretation of test results in clinical settings by avoiding unnecessary dichotomization of test scores.
| S-EPMC8170576 | biostudies-literature
Project description:Cellular physiology is implemented by formidably complex biochemical systems with highly nonlinear dynamics, presenting a challenge for both experiment and theory. Time-scale separation has been one of the few theoretical methods for distilling general principles from such complexity. It has provided essential insights in areas such as enzyme kinetics, allosteric enzymes, G-protein coupled receptors, ion channels, gene regulation and post-translational modification. In each case, internal molecular complexity has been eliminated, leading to rational algebraic expressions among the remaining components. This has yielded familiar formulas such as those of Michaelis-Menten in enzyme kinetics, Monod-Wyman-Changeux in allostery and Ackers-Johnson-Shea in gene regulation. Here we show that these calculations are all instances of a single graph-theoretic framework. Despite the biochemical nonlinearity to which it is applied, this framework is entirely linear, yet requires no approximation. We show that elimination of internal complexity is feasible when the relevant graph is strongly connected. The framework provides a new methodology with the potential to subdue combinatorial explosion at the molecular level.
| S-EPMC3351455 | biostudies-literature
Project description:Discrete time crystals are periodically driven systems characterized by a response with periodicity nT, with T the period of the drive and n > 1. Typically, n is an integer and bounded from above by the dimension of the local (or single particle) Hilbert space, the most prominent example being spin-1/2 systems with n restricted to 2. Here, we show that a clean spin-1/2 system in the presence of long-range interactions and transverse field can sustain a huge variety of different 'higher-order' discrete time crystals with integer and, surprisingly, even fractional n > 2. We characterize these (arguably prethermal) non-equilibrium phases of matter thoroughly using a combination of exact diagonalization, semiclassical methods, and spin-wave approximations, which enable us to establish their stability in the presence of competing long- and short-range interactions. Remarkably, these phases emerge in a model with continous driving and time-independent interactions, convenient for experimental implementations with ultracold atoms or trapped ions.
| S-EPMC8058086 | biostudies-literature
Project description:Almost every biomedical systems analysis requires early decisions regarding the choice of the most suitable representations to be used. De facto the most prevalent choice is a system of ordinary differential equations (ODEs). This framework is very popular because it is flexible and fairly easy to use. It is also supported by an enormous array of stand-alone programs for analysis, including many distinct numerical solvers that are implemented in the main programming languages. Having selected ODEs, the modeler must then choose a mathematical format for the equations. This selection is not trivial as nearly unlimited options exist and there is seldom objective guidance. The typical choices include ad hoc representations, default models like mass-action or Lotka-Volterra equations, and generic approximations. Within the realm of approximations, linear models are typically successful for analyses of engineered systems, but they are not as appropriate for biomedical phenomena, which often display nonlinear features such as saturation, threshold effects or limit cycle oscillations, and possibly even chaos. Power-law approximations are simple but overcome these limitations. They are the key ingredient of Biochemical Systems Theory (BST), which uses ODEs exclusively containing power-law representations for all processes within a model. BST models cover a vast repertoire of nonlinear responses and, at the same time, have structural properties that are advantageous for a wide range of analyses. Nonetheless, as all ODE models, the BST approach has limitations. In particular, it is not always straightforward to account for genuine discreteness, time delays, and stochastic processes. As a new option, we therefore propose here an alternative to BST in the form of discrete Biochemical Systems Theory (dBST). dBST models have the same generality and practicality as their BST-ODE counterparts, but they are readily implemented even in situations where ODEs struggle. As a case study, we illustrate dBST applied to the dynamics of the aryl hydrocarbon receptor (AhR), a signal transduction system that simultaneously involves time delays and stochasticity.
| S-EPMC9116487 | biostudies-literature
Project description:The linear dynamical system (LDS) model is arguably the most commonly used time series model for real-world engineering and financial applications due to its relative simplicity, mathematically predictable behavior, and the fact that exact inference and predictions for the model can be done efficiently. In this work, we propose a new generalized LDS framework, gLDS, for learning LDS models from a collection of multivariate time series (MTS) data based on matrix factorization, which is different from traditional EM learning and spectral learning algorithms. In gLDS, each MTS sequence is factorized as a product of a shared emission matrix and a sequence-specific (hidden) state dynamics, where an individual hidden state sequence is represented with the help of a shared transition matrix. One advantage of our generalized formulation is that various types of constraints can be easily incorporated into the learning process. Furthermore, we propose a novel temporal smoothing regularization approach for learning the LDS model, which stabilizes the model, its learning algorithm and predictions it makes. Experiments on several real-world MTS data show that (1) regular LDS models learned from gLDS are able to achieve better time series predictive performance than other LDS learning algorithms; (2) constraints can be directly integrated into the learning process to achieve special properties such as stability, low-rankness; and (3) the proposed temporal smoothing regularization encourages more stable and accurate predictions.
| S-EPMC5098501 | biostudies-literature
Project description:Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.
| S-EPMC3589727 | biostudies-other