Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Boolean Differentiation Equations Applicable in Reconfigurable Computational Medium
Directory of Open Access Journals (Sweden)
Shidlovskiy Stanislav
2016-01-01
Full Text Available High performance computing environment synthesis with parallel architecture reconstructing throughout the process itself is described. Synthesized computational medium involving Boolean differential equation calculations so as to function in real-time image processing. Automaton imaging was illustrated involving the rearrangement of every processing medium element to calculate the partial differentials of n-th order in respect to Boolean function variables. The method of obtaining setting codes for each element was also described. An example in calculating 2nd -order Boolean derivative to two differentials in respect to Boolean functions, depending on three arguments within the reconstructible computational medium of 8×8 processing elements was given.
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Directory of Open Access Journals (Sweden)
Gijs Kant
2012-10-01
Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.
Algebraic characteristics and satisfiability threshold of random Boolean equations
Guo, Binghui; Wei, Wei; Sun, Yifan; Zheng, Zhiming
2010-03-01
The satisfiability of a class of random Boolean equations named massive algebraic system septated to linear and nonlinear subproblems is studied in this paper. On one hand, the correlation between the magnetization of generators and the clustering of solutions of the linear subproblem is investigated by analyzing the Gaussian elimination process. On the other hand, the characteristics of maximal elements of solutions of the nonlinear subproblem are studied by introducing the partial order among solutions. Based on the algebraic characteristics of these two subproblems, the upper and lower bounds of satisfiability threshold of massive algebraic system are obtained by unit-clause propagation and leaf-removal process, and coincide as the ratio of nonlinear equations q>0.739 in which analytical values of the satisfiability threshold can be derived. Furthermore, a complete algorithm with heuristic decimation is proposed to observe the approximation of the satisfiability threshold, which performs more efficiently than the classical ones.
Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V
2017-04-01
We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.
Super-transient scaling in time-delay autonomous Boolean network motifs
Energy Technology Data Exchange (ETDEWEB)
D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)
2016-09-15
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
Fractional delayed damped Mathieu equation
Mesbahi, Afshin; Haeri, Mohammad; Nazari, Morad; Butcher, Eric A.
2015-03-01
This paper investigates the dynamical behaviour of the fractional delayed damped Mathieu equation. This system includes three different phenomena (fractional order, time delay, parametric resonance). The method of harmonic balance is employed to achieve approximate expressions for the transition curves in the parameter plane. The n = 0 and n = 1 transition curves (both lower and higher order approximations) are obtained. The dependencies of these curves on the system parameters and fractional orders are determined. Previous results for the transition curves reported for the damped Mathieu equation, delayed second-order oscillator, and fractional Mathieu equation are confirmed as special cases of the results for the current system.
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
Directory of Open Access Journals (Sweden)
Yutaro Nagae
2017-01-01
Full Text Available A parameterised Boolean equation system (PBES is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded as a declarative program defining functions that take a datum and returns a Boolean value. The membership problem of PBESs is a problem to decide whether a given element is in the defined set or not, which corresponds to an execution of the program. This paper introduces reduced proof graphs, and studies a technique to solve the membership problem of PBESs, which is undecidable in general, by transforming it into a reduced proof graph. A vertex X(v in a proof graph represents that the data v is in the set X, if the graph satisfies conditions induced from a given PBES. Proof graphs are, however, infinite in general. Thus we introduce vertices each of which stands for a set of vertices of the original ones, which possibly results in a finite graph. For a subclass of disjunctive PBESs, we clarify some conditions which reduced proof graphs should satisfy. We also show some examples having no finite proof graph except for reduced one. We further propose a reduced dependency space, which contains reduced proof graphs as sub-graphs if a proof graph exists. We provide a procedure to construct finite reduced dependency spaces, and show the soundness and completeness of the procedure.
Algebraic entropy for differential-delay equations
Viallet, Claude M.
2014-01-01
We extend the definition of algebraic entropy to a class of differential-delay equations. The vanishing of the entropy, as a structural property of an equation, signals its integrability. We suggest a simple way to produce differential-delay equations with vanishing entropy from known integrable differential-difference equations.
Direct 'delay' reductions of the Toda equation
International Nuclear Information System (INIS)
Joshi, Nalini
2009-01-01
A new direct method of obtaining reductions of the Toda equation is described. We find a canonical and complete class of all possible reductions under certain assumptions. The resulting equations are ordinary differential-difference equations, sometimes referred to as delay-differential equations. The representative equation of this class is hypothesized to be a new version of one of the classical Painleve equations. The Lax pair associated with this equation is obtained, also by reduction. (fast track communication)
On stochastic differential equations with random delay
International Nuclear Information System (INIS)
Krapivsky, P L; Luck, J M; Mallick, K
2011-01-01
We consider stochastic dynamical systems defined by differential equations with a uniform random time delay. The latter equations are shown to be equivalent to deterministic higher-order differential equations: for an nth-order equation with random delay, the corresponding deterministic equation has order n + 1. We analyze various examples of dynamical systems of this kind, and find a number of unusual behaviors. For instance, for the harmonic oscillator with random delay, the energy grows as exp((3/2) t 2/3 ) in reduced units. We then investigate the effect of introducing a discrete time step ε. At variance with the continuous situation, the discrete random recursion relations thus obtained have intrinsic fluctuations. The crossover between the fluctuating discrete problem and the deterministic continuous one as ε goes to zero is studied in detail on the example of a first-order linear differential equation
A simple chaotic delay differential equation
International Nuclear Information System (INIS)
Sprott, J.C.
2007-01-01
The simplest chaotic delay differential equation with a sinusoidal nonlinearity is described, including the route to chaos, Lyapunov exponent spectrum, and chaotic diffusion. It is prototypical of many other high-dimensional chaotic systems
Double Hopf bifurcation in delay differential equations
Directory of Open Access Journals (Sweden)
Redouane Qesmi
2014-07-01
Full Text Available The paper addresses the computation of elements of double Hopf bifurcation for retarded functional differential equations (FDEs with parameters. We present an efficient method for computing, simultaneously, the coefficients of center manifolds and normal forms, in terms of the original FDEs, associated with the double Hopf singularity up to an arbitrary order. Finally, we apply our results to a nonlinear model with periodic delay. This shows the applicability of the methodology in the study of delay models arising in either natural or technological problems.
Functional differential equations with infinite delay
Hino, Yoshiyuki; Naito, Toshiki
1991-01-01
In the theory of functional differential equations with infinite delay, there are several ways to choose the space of initial functions (phase space); and diverse (duplicated) theories arise, according to the choice of phase space. To unify the theories, an axiomatic approach has been taken since the 1960's. This book is intended as a guide for the axiomatic approach to the theory of equations with infinite delay and a culmination of the results obtained in this way. It can also be used as a textbook for a graduate course. The prerequisite knowledge is foundations of analysis including linear algebra and functional analysis. It is hoped that the book will prepare students for further study of this area, and that will serve as a ready reference to the researchers in applied analysis and engineering sciences.
Approximating chaotic saddles for delay differential equations.
Taylor, S Richard; Campbell, Sue Ann
2007-04-01
Chaotic saddles are unstable invariant sets in the phase space of dynamical systems that exhibit transient chaos. They play a key role in mediating transport processes involving scattering and chaotic transients. Here we present evidence (long chaotic transients and fractal basins of attraction) of transient chaos in a "logistic" delay differential equation. We adapt an existing method (stagger-and-step) to numerically construct the chaotic saddle for this system. This is the first such analysis of transient chaos in an infinite-dimensional dynamical system, and in delay differential equations in particular. Using Poincaré section techniques we illustrate approaches to visualizing the saddle set, and confirm that the saddle has the Cantor-like fractal structure consistent with a chaotic saddle generated by horseshoe-type dynamics.
Approximating chaotic saddles for delay differential equations
Taylor, S. Richard; Campbell, Sue Ann
2007-04-01
Chaotic saddles are unstable invariant sets in the phase space of dynamical systems that exhibit transient chaos. They play a key role in mediating transport processes involving scattering and chaotic transients. Here we present evidence (long chaotic transients and fractal basins of attraction) of transient chaos in a “logistic” delay differential equation. We adapt an existing method (stagger-and-step) to numerically construct the chaotic saddle for this system. This is the first such analysis of transient chaos in an infinite-dimensional dynamical system, and in delay differential equations in particular. Using Poincaré section techniques we illustrate approaches to visualizing the saddle set, and confirm that the saddle has the Cantor-like fractal structure consistent with a chaotic saddle generated by horseshoe-type dynamics.
Bifurcations in stochastic equations with delayed feedback
Gaudreault, Mathieu
The bifurcation diagram of a model stochastic differential equation with delayed feedback is presented. We are motivated by recent research on stochastic effects in models of transcriptional gene regulation. We start from the normal form for a pitchfork bifurcation, and add multiplicative or parametric noise and linear delayed feedback. The latter is sufficient to originate a Hopf bifurcation in that region of parameters in which there is a sufficiently strong negative feedback. We find a sharp bifurcation in parameter space, and define the threshold as the point in which the stationary distribution function p(x) changes from a delta function at the trivial state x = 0 to p( x) ˜ xalpha at small x (with alpha = 1 exactly at threshold). We find that the bifurcation threshold is shifted by fluctuations relative to the deterministic limit by an amount that scales linearly with the noise intensity. Analytical expressions for pitchfork and Hopf bifurcation thresholds are given for the model considered. Our results assume that the delay time tau is small compared to other characteristic time scales, not a significant limitation close to the bifurcation line. A pitchfork bifurcation line is found, the location of which depends on the conditional average , where x(t) is the dynamical variable. This conditional probability incorporates the combined effect of fluctuation correlations and delayed feedback. We also find a Hopf bifurcation line which is obtained by a multiple scale expansion around the oscillatory solution near threshold. We solve the Fokker-Planck equation associated with the slowly varying amplitudes and use it to determine the threshold location. In both cases, the predicted bifurcation lines are in excellent agreement with a direct numerical integration of the governing equations. Contrary to the known case involving no delayed feedback, we show that the stochastic bifurcation lines are shifted relative to the deterministic limit and hence that the
Multivalued stochastic delay differential equations and related ...
African Journals Online (AJOL)
We study the existence and uniqueness of a solution for the multivalued stochastic differential equation with delay (the multivalued term is of subdifferential type):. dX(t) + aφ (X(t))dt ∍ b(t,X(t), Y(t), Z(t)) dt. ⎨ +σ (t, X (t), Y (t), Z (t)) dW (t), t ∈ (s, T). X(t) = ξ (t - s), t ∈ [s - δ, s]. Specify that in this case the coefficients at time t ...
International Nuclear Information System (INIS)
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William; Bennett, Matthew R.; Josić, Krešimir
2014-01-01
Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Bennett, Matthew R; Josić, Krešimir; Ott, William
2014-05-28
Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.
Linear measure functional differential equations with infinite delay
Monteiro, G. (Giselle Antunes); Slavík, A.
2014-01-01
We use the theory of generalized linear ordinary differential equations in Banach spaces to study linear measure functional differential equations with infinite delay. We obtain new results concerning the existence, uniqueness, and continuous dependence of solutions. Even for equations with a finite delay, our results are stronger than the existing ones. Finally, we present an application to functional differential equations with impulses.
Growth of meromorphic solutions of delay differential equations
Halburd, Rod; Korhonen, Risto
2016-01-01
Necessary conditions are obtained for certain types of rational delay differential equations to admit a non-rational meromorphic solution of hyper-order less than one. The equations obtained include delay Painlev\\'e equations and equations solved by elliptic functions.
Climate models with delay differential equations
Keane, Andrew; Krauskopf, Bernd; Postlethwaite, Claire M.
2017-11-01
A fundamental challenge in mathematical modelling is to find a model that embodies the essential underlying physics of a system, while at the same time being simple enough to allow for mathematical analysis. Delay differential equations (DDEs) can often assist in this goal because, in some cases, only the delayed effects of complex processes need to be described and not the processes themselves. This is true for some climate systems, whose dynamics are driven in part by delayed feedback loops associated with transport times of mass or energy from one location of the globe to another. The infinite-dimensional nature of DDEs allows them to be sufficiently complex to reproduce realistic dynamics accurately with a small number of variables and parameters. In this paper, we review how DDEs have been used to model climate systems at a conceptual level. Most studies of DDE climate models have focused on gaining insights into either the global energy balance or the fundamental workings of the El Niño Southern Oscillation (ENSO) system. For example, studies of DDEs have led to proposed mechanisms for the interannual oscillations in sea-surface temperature that is characteristic of ENSO, the irregular behaviour that makes ENSO difficult to forecast and the tendency of El Niño events to occur near Christmas. We also discuss the tools used to analyse such DDE models. In particular, the recent development of continuation software for DDEs makes it possible to explore large regions of parameter space in an efficient manner in order to provide a "global picture" of the possible dynamics. We also point out some directions for future research, including the incorporation of non-constant delays, which we believe could improve the descriptive power of DDE climate models.
Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
State-dependent neutral delay equations from population dynamics.
Barbarossa, M V; Hadeler, K P; Kuttler, C
2014-10-01
A novel class of state-dependent delay equations is derived from the balance laws of age-structured population dynamics, assuming that birth rates and death rates, as functions of age, are piece-wise constant and that the length of the juvenile phase depends on the total adult population size. The resulting class of equations includes also neutral delay equations. All these equations are very different from the standard delay equations with state-dependent delay since the balance laws require non-linear correction factors. These equations can be written as systems for two variables consisting of an ordinary differential equation (ODE) and a generalized shift, a form suitable for numerical calculations. It is shown that the neutral equation (and the corresponding ODE--shift system) is a limiting case of a system of two standard delay equations.
Oscillation criteria for delay difference equations
Directory of Open Access Journals (Sweden)
Jianhua Shen
2001-01-01
Full Text Available This paper is concerned with the oscillation of all solutions of the delay difference equation $$ x_{n+1}-x_n+p_nx_{n-k}=0, quad n=0,1,2,dots $$ where ${p_n}$ is a sequence of nonnegative real numbers and $k$ is a positive integer. Some new oscillation conditions are established. These conditions concern the case when none of the well-known oscillation conditions $$ limsup_{no infty}sum_{i=0}^kp_{n-i}>1 quad{ m and}quad liminf_{no infty}frac{1}{k}sum_{i=1}^kp_{n-i}>frac{k^k}{(k+1^{k+1}} $$ is satisfied.
Electrocardiogram classification using delay differential equations.
Lainscsek, Claudia; Sejnowski, Terrence J
2013-06-01
Time series analysis with nonlinear delay differential equations (DDEs) reveals nonlinear as well as spectral properties of the underlying dynamical system. Here, global DDE models were used to analyze 5 min data segments of electrocardiographic (ECG) recordings in order to capture distinguishing features for different heart conditions such as normal heart beat, congestive heart failure, and atrial fibrillation. The number of terms and delays in the model as well as the order of nonlinearity of the model have to be selected that are the most discriminative. The DDE model form that best separates the three classes of data was chosen by exhaustive search up to third order polynomials. Such an approach can provide deep insight into the nature of the data since linear terms of a DDE correspond to the main time-scales in the signal and the nonlinear terms in the DDE are related to nonlinear couplings between the harmonic signal parts. The DDEs were able to detect atrial fibrillation with an accuracy of 72%, congestive heart failure with an accuracy of 88%, and normal heart beat with an accuracy of 97% from 5 min of ECG, a much shorter time interval than required to achieve comparable performance with other methods.
Analytical Solution of Pantograph Equation with Incommensurate Delay
Patade, Jayvant; Bhalekar, Sachin
2017-08-01
Pantograph equation is a delay differential equation (DDE) arising in electrodynamics. This paper studies the pantograph equation with two delays. The existence, uniqueness, stability and convergence results for DDEs are presented. The series solution of the proposed equation is obtained by using Daftardar-Gejji and Jafari method and given in terms of a special function. This new special function has several properties and relations with other functions. Further, we generalize the proposed equation to fractional-order case and obtain its solution.
Caglar, Mehmet Umut; Pal, Ranadip
2011-03-01
Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.
Analysis of a first-order delay differential-delay equation containing two delays
Marriott, C.; Vallée, R.; Delisle, C.
1989-09-01
An experimental and numerical analysis of the behavior of a two-delay differential equation is presented. It is shown that much of the system's behavior can be related to the stability behavior of the underlying linearized modes. A new phenomenon, mode crossing, is explored.
Breda, D.; Diekmann, O.; Gyllenberg, M.; Scarabel, F.; Vermiglio, R.
2016-01-01
We apply the pseudospectral discretization approach to nonlinear delay models described by delay differential equations, renewal equations, or systems of coupled renewal equations and delay differential equations. The aim is to derive ordinary differential equations and to investigate the stability
Neutral delay equations from and for population dynamics
Directory of Open Access Journals (Sweden)
K. P. Hadeler
2008-07-01
Full Text Available For a certain class of neutral differential equations it is shown that these equations can serve as population models in the sense that they can be interpreted as special cases or caricatures of the standard Gurtin-MacCamy model for a population structured by age with birth and death rate depending on the total adult population. The delayed logistic equation does not belong to this class but the blowfly equation does. These neutral delay equations can be written as forward systems of an ordinary differential equation and a shift map. There are several quite distinct ways to perform the transformation to a system, either following a method of Hale or following more closely the renewal process. Similarly to the delayed logistic equation, the neutral equation (and the blowfly equation as a special case exhibit periodic solutions, although only for a restricted range of parameters.
Semigroups on Frechet spaces and equations with infinite delays
Indian Academy of Sciences (India)
to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions. Keywords. Functional differential equation; infinite delay; semigroup; Frechet space. 1. Introduction and preliminaries. In this paper we study linear functional differential equations with infinite delay. Consider.
Applications of the g-Drazin Inverse to the Heat Equation and a Delay Differential Equation
Directory of Open Access Journals (Sweden)
Alrazi Abdeljabbar
2017-01-01
Full Text Available We consider applications of the g-Drazin inverse to some classes of abstract Cauchy problems, namely, the heat equation with operator coefficient and delay differential equations in Banach space.
Queues with Choice via Delay Differential Equations
Pender, Jamol; Rand, Richard H.; Wesson, Elizabeth
Delay or queue length information has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze two two-dimensional deterministic fluid models that incorporate customer choice behavior based on delayed queue length information. In the first fluid model, customers join each queue according to a Multinomial Logit Model, however, the queue length information the customer receives is delayed by a constant Δ. We show that the delay can cause oscillations or asynchronous behavior in the model based on the value of Δ. In the second model, customers receive information about the queue length through a moving average of the queue length. Although it has been shown empirically that giving patients moving average information causes oscillations and asynchronous behavior to occur in U.S. hospitals, we analytically and mathematically show for the first time that the moving average fluid model can exhibit oscillations and determine their dependence on the moving average window. Thus, our analysis provides new insight on how operators of service systems should report queue length information to customers and how delayed information can produce unwanted system dynamics.
A system of abstract measure delay differential equations
Directory of Open Access Journals (Sweden)
Bapurao Dhage
2003-01-01
Full Text Available In this paper existence and uniqueness results for an abstract measure delay differential equation are proved, by using Leray-Schauder nonlinear alternative, under Carathéodory conditions.
Oscillation criteria for fourth-order nonlinear delay dynamic equations
Directory of Open Access Journals (Sweden)
Yunsong Qi
2013-03-01
Full Text Available We obtain criteria for the oscillation of all solutions to a fourth-order nonlinear delay dynamic equation on a time scale that is unbounded from above. The results obtained are illustrated with examples
Periodic solutions and bifurcations of delay-differential equations
International Nuclear Information System (INIS)
He Jihuan
2005-01-01
In this Letter a simple but effective iteration method is proposed to search for limit cycles or bifurcation curves of delay-differential equations. An example is given to illustrate its convenience and effectiveness
Delay differential equations recent advances and new directions
Balachandran, Balakumar; Gilsinn, David E
2009-01-01
This is a cohesive set of contributions from leading experts on the theory and applications of functional and delay differential equations. The book focuses on theory, symbolic, and numerical methods, which show the practical applications of the concepts.
Approximate Method for Solving the Linear Fuzzy Delay Differential Equations
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.
Numerical Analysis for Stochastic Partial Differential Delay Equations with Jumps
Li, Yan; Hu, Junhao
2013-01-01
We investigate the convergence rate of Euler-Maruyama method for a class of stochastic partial differential delay equations driven by both Brownian motion and Poisson point processes. We discretize in space by a Galerkin method and in time by using a stochastic exponential integrator. We generalize some results of Bao et al. (2011) and Jacob et al. (2009) in finite dimensions to a class of stochastic partial differential delay equations with jumps in infinite dimensions.
Deterministic Brownian motion generated from differential delay equations.
Lei, Jinzhi; Mackey, Michael C
2011-10-01
This paper addresses the question of how Brownian-like motion can arise from the solution of a deterministic differential delay equation. To study this we analytically study the bifurcation properties of an apparently simple differential delay equation and then numerically investigate the probabilistic properties of chaotic solutions of the same equation. Our results show that solutions of the deterministic equation with randomly selected initial conditions display a Gaussian-like density for long time, but the densities are supported on an interval of finite measure. Using these chaotic solutions as velocities, we are able to produce Brownian-like motions, which show statistical properties akin to those of a classical Brownian motion over both short and long time scales. Several conjectures are formulated for the probabilistic properties of the solution of the differential delay equation. Numerical studies suggest that these conjectures could be "universal" for similar types of "chaotic" dynamics, but we have been unable to prove this.
The numerical simulation of convection delayed dominated diffusion equation
Directory of Open Access Journals (Sweden)
Mohan Kumar P. Murali
2016-01-01
Full Text Available In this paper, we propose a fitted numerical method for solving convection delayed dominated diffusion equation. A fitting factor is introduced and the model equation is discretized by cubic spline method. The error analysis is analyzed for the consider problem. The numerical examples are solved using the present method and compared the result with the exact solution.
Solving the Linear 1D Thermoelasticity Equations with Pure Delay
Directory of Open Access Journals (Sweden)
Denys Ya. Khusainov
2015-01-01
Full Text Available We propose a system of partial differential equations with a single constant delay τ>0 describing the behavior of a one-dimensional thermoelastic solid occupying a bounded interval of R1. For an initial-boundary value problem associated with this system, we prove a well-posedness result in a certain topology under appropriate regularity conditions on the data. Further, we show the solution of our delayed model to converge to the solution of the classical equations of thermoelasticity as τ→0. Finally, we deduce an explicit solution representation for the delay problem.
Delay-differential equations and the Painlevé transcendents
Grammaticos, B.; Ramani, A.; Moreira, I. C.
1993-07-01
We apply the recently proposed integrability criterion for differential-difference systems (that blends the classical Painlevé analysis with singularity confinement for discrete systems) to a class of first-order differential-delay equations. Our analysis singles out the family of bi-Riccati equations, as integrability candidates. Among these equations that pass the test some are integrable in a straightforward way (usually by reduction to a standard Riccati equation for some transformed variable) while the remaining ones define new hysterodifferential forms of the Painlevé transcendental equations.
Exponential Stability of Stochastic Differential Equation with Mixed Delay
Directory of Open Access Journals (Sweden)
Wenli Zhu
2014-01-01
Full Text Available This paper focuses on a class of stochastic differential equations with mixed delay based on Lyapunov stability theory, Itô formula, stochastic analysis, and inequality technique. A sufficient condition for existence and uniqueness of the adapted solution to such systems is established by employing fixed point theorem. Some sufficient conditions of exponential stability and corollaries for such systems are obtained by using Lyapunov function. By utilizing Doob’s martingale inequality and Borel-Cantelli lemma, it is shown that the exponentially stable in the mean square of such systems implies the almost surely exponentially stable. In particular, our theoretical results show that if stochastic differential equation is exponentially stable and the time delay is sufficiently small, then the corresponding stochastic differential equation with mixed delay will remain exponentially stable. Moreover, time delay upper limit is solved by using our theoretical results when the system is exponentially stable, and they are more easily verified and applied in practice.
Reliable dynamics in Boolean and continuous networks
International Nuclear Information System (INIS)
Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P
2012-01-01
We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)
Asymptotic Behavior of Solutions of Delayed Difference Equations
Directory of Open Access Journals (Sweden)
J. Diblík
2011-01-01
Full Text Available This contribution is devoted to the investigation of the asymptotic behavior of delayed difference equations with an integer delay. We prove that under appropriate conditions there exists at least one solution with its graph staying in a prescribed domain. This is achieved by the application of a more general theorem which deals with systems of first-order difference equations. In the proof of this theorem we show that a good way is to connect two techniques—the so-called retract-type technique and Liapunov-type approach. In the end, we study a special class of delayed discrete equations and we show that there exists a positive and vanishing solution of such equations.
Local bifurcations in differential equations with state-dependent delay
Sieber, Jan
2017-11-01
A common task when analysing dynamical systems is the determination of normal forms near local bifurcations of equilibria. As most of these normal forms have been classified and analysed, finding which particular class of normal form one encounters in a numerical bifurcation study guides follow-up computations. This paper builds on normal form algorithms for equilibria of delay differential equations with constant delay that were developed and implemented in DDE-Biftool recently. We show how one can extend these methods to delay-differential equations with state-dependent delay (sd-DDEs). Since higher degrees of regularity of local center manifolds are still open for sd-DDEs, we give an independent (still only partial) argument which phenomena from the truncated normal must persist in the full sd-DDE. In particular, we show that all invariant manifolds with a sufficient degree of normal hyperbolicity predicted by the normal form exist also in the full sd-DDE.
The generalized Burgers equation with and without a time delay
Directory of Open Access Journals (Sweden)
Nejib Smaoui
2004-01-01
Full Text Available We consider the generalized Burgers equation with and without a time delay when the boundary conditions are periodic with period 2π. For the generalized Burgers equation without a time delay, that is, ut=vuxx−uux+u+h(x, 0
Analytical approach for the Floquet theory of delay differential equations.
Simmendinger, C; Wunderlin, A; Pelster, A
1999-05-01
We present an analytical approach to deal with nonlinear delay differential equations close to instabilities of time periodic reference states. To this end we start with approximately determining such reference states by extending the Poincaré-Lindstedt and the Shohat expansions, which were originally developed for ordinary differential equations. Then we systematically elaborate a linear stability analysis around a time periodic reference state. This allows us to approximately calculate the Floquet eigenvalues and their corresponding eigensolutions by using matrix valued continued fractions.
Stability Conditions of Second Order Integrodifferential Equations with Variable Delay
Directory of Open Access Journals (Sweden)
Dingheng Pi
2014-01-01
Full Text Available We investigate integrodifferential functional differential equations ẍ+f(t,x,ẋẋ+∫t-r(tta(t,sg(x(sds=0 with variable delay. By using the fixed point theory, we obtain conditions which ensure that the zero solution of this equation is stable under an exponentially weighted metric. Then we establish necessary and sufficient conditions ensuring that the zero solution is asymptotically stable. We will give an example to apply our results.
Modeling of delays in PKPD: classical approaches and a tutorial for delay differential equations.
Koch, Gilbert; Krzyzanski, Wojciech; Pérez-Ruixo, Juan Jose; Schropp, Johannes
2014-08-01
In pharmacokinetics/pharmacodynamics (PKPD) the measured response is often delayed relative to drug administration, individuals in a population have a certain lifespan until they maturate or the change of biomarkers does not immediately affects the primary endpoint. The classical approach in PKPD is to apply transit compartment models (TCM) based on ordinary differential equations to handle such delays. However, an alternative approach to deal with delays are delay differential equations (DDE). DDEs feature additional flexibility and properties, realize more complex dynamics and can complementary be used together with TCMs. We introduce several delay based PKPD models and investigate mathematical properties of general DDE based models, which serve as subunits in order to build larger PKPD models. Finally, we review current PKPD software with respect to the implementation of DDEs for PKPD analysis.
RANDOM FUNCTIONAL EVOLUTION EQUATIONS WITH STATE-DEPENDENT DELAY
Directory of Open Access Journals (Sweden)
Amel Benaissa
2017-12-01
Full Text Available Our aim in this work is to study the existence of mild solutions of a functional differential equation with delay and random effects. We use a random fixed point theorem with stochastic domain to show the existence of mild random solutions.
Oscillation of second order neutral dynamic equations with distributed delay
Directory of Open Access Journals (Sweden)
Qiaoshun Yang
2016-06-01
Full Text Available In this paper, we establish new oscillation criteria for second order neutral dynamic equations with distributed delay by employing the generalized Riccati transformation. The obtained theorems essentially improve the oscillation results in the literature. And two examples are provided to illustrate to the versatility of our main results.
Hopf bifurcation formula for first order differential-delay equations
Rand, Richard; Verdugo, Anael
2007-09-01
This work presents an explicit formula for determining the radius of a limit cycle which is born in a Hopf bifurcation in a class of first order constant coefficient differential-delay equations. The derivation is accomplished using Lindstedt's perturbation method.
Semigroups on Frechet Spaces and Equations with Infinite Delays
Indian Academy of Sciences (India)
In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.
Stability Criteria for Differential Equations with Variable Time Delays
Schley, D.; Shail, R.; Gourley, S. A.
2002-01-01
Time delays are an important aspect of mathematical modelling, but often result in highly complicated equations which are difficult to treat analytically. In this paper it is shown how careful application of certain undergraduate tools such as the Method of Steps and the Principle of the Argument can yield significant results. Certain delay…
Stability analysis of a class of fractional delay differential equations
Indian Academy of Sciences (India)
In this paper we analyse stability of nonlinear fractional order delay differential equations of the form D y ( t ) = a f ( y ( t − ) ) − by ( t ) , where D is a Caputo fractional derivative of order 0 < ≤ 1. We describe stability regions using critical curves. To explain the proposed theory, we discuss fractional order logistic ...
About Global Stable of Solutions of Logistic Equation with Delay
Kaschenko, S. A.; Loginov, D. O.
2017-12-01
The article is devoted to the definition of all the arguments for which all positive solutions of logistic equation with delay tend to zero for t → ∞. The authors have proved the acquainted Wright’s conjecture on evaluation of a multitude of such arguments. An approach that enables subsequent refinement of this evaluation has been developed.
Semigroups on Frechet spaces and equations with infinite delays
Indian Academy of Sciences (India)
In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.
Isochronous bifurcations in second-order delay differential equations
Directory of Open Access Journals (Sweden)
Andrea Bel
2014-07-01
Full Text Available In this article we consider a special type of second-order delay differential equations. More precisely, we take an equation of a conservative mechanical system in one dimension with an added term that is a function of the difference between the value of the position at time $t$ minus the position at the delayed time $t-\\tau$. For this system, we show that, under certain conditions of non-degeneration and of convergence of the periodic solutions obtained by the Homotopy Analysis Method, bifurcation branches appearing in a neighbourhood of Hopf bifurcation due to the delay are isochronous; i.e., all the emerging cycles have the same frequency.
Khan, Sami Ullah; Ali, Ishtiaq
2018-03-01
Explicit solutions to delay differential equation (DDE) and stochastic delay differential equation (SDDE) can rarely be obtained, therefore numerical methods are adopted to solve these DDE and SDDE. While on the other hand due to unstable nature of both DDE and SDDE numerical solutions are also not straight forward and required more attention. In this study, we derive an efficient numerical scheme for DDE and SDDE based on Legendre spectral-collocation method, which proved to be numerical methods that can significantly speed up the computation. The method transforms the given differential equation into a matrix equation by means of Legendre collocation points which correspond to a system of algebraic equations with unknown Legendre coefficients. The efficiency of the proposed method is confirmed by some numerical examples. We found that our numerical technique has a very good agreement with other methods with less computational effort.
Periodic Solutions of a System of Delay Differential Equations for a Small Delay
Directory of Open Access Journals (Sweden)
Adu A.M. Wasike
2002-06-01
Full Text Available We prove the existence of an asymptotically stable periodic solution of a system of delay differential equations with a small time delay t > 0. To achieve this, we transform the system of equations into a system of perturbed ordinary differential equations and then use perturbation results to show the existence of an asymptotically stable periodic solution. This approach is contingent on the fact that the system of equations with t = 0 has a stable limit cycle. We also provide a comparative study of the solutions of the original system and the perturbed system. This comparison lays the ground for proving the existence of periodic solutions of the original system by Schauder's fixed point theorem.
Period doubling phenomenon in a class of time delay equations
International Nuclear Information System (INIS)
Oliveira, C.R. de; Malta, C.P.
1985-01-01
The properties of the solution of a nonlinear time delayed differential equation (infinite dimension) as function of two parameters: the time delay tau and another parameter A (nonlinearity) are investigated. After a Hopf bifurcation period doubling may occur and is characterized by Feigenbaum's delta. A strange atractor is obtained after the period doubling cascade and the largest Lyapunov exponent is calculated indicating that the attractor has low dimension. The behaviour of this Liapunov exponent as function of tau is different from its behaviour as function of A. (Author) [pt
Free Boolean Topological Groups
Directory of Open Access Journals (Sweden)
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
A class of neutral-type delay differential equations that are effectively retarded
Stoorvogel, Antonie Arij; Roy, Sandip; Wan, Yan; Saberi, Ali
We demonstrate that some delay-differential equations of neutral type are, up to basis transformation, equivalent to retarded delay differential equations. In particular, for two classes of neutral delay differential equation models, we use state transformations to show that delayed derivatives can
Functional differential equations with unbounded delay in extrapolation spaces
Directory of Open Access Journals (Sweden)
Mostafa Adimy
2014-08-01
Full Text Available We study the existence, regularity and stability of solutions for nonlinear partial neutral functional differential equations with unbounded delay and a Hille-Yosida operator on a Banach space X. We consider two nonlinear perturbations: the first one is a function taking its values in X and the second one is a function belonging to a space larger than X, an extrapolated space. We use the extrapolation techniques to prove the existence and regularity of solutions and we establish a linearization principle for the stability of the equilibria of our equation.
Alternans promotion in cardiac electrophysiology models by delay differential equations
Gomes, Johnny M.; dos Santos, Rodrigo Weber; Cherry, Elizabeth M.
2017-09-01
Cardiac electrical alternans is a state of alternation between long and short action potentials and is frequently associated with harmful cardiac conditions. Different dynamic mechanisms can give rise to alternans; however, many cardiac models based on ordinary differential equations are not able to reproduce this phenomenon. A previous study showed that alternans can be induced by the introduction of delay differential equations (DDEs) in the formulations of the ion channel gating variables of a canine myocyte model. The present work demonstrates that this technique is not model-specific by successfully promoting alternans using DDEs for five cardiac electrophysiology models that describe different types of myocytes, with varying degrees of complexity. By analyzing results across the different models, we observe two potential requirements for alternans promotion via DDEs for ionic gates: (i) the gate must have a significant influence on the action potential duration and (ii) a delay must significantly impair the gate's recovery between consecutive action potentials.
Alternans promotion in cardiac electrophysiology models by delay differential equations.
Gomes, Johnny M; Dos Santos, Rodrigo Weber; Cherry, Elizabeth M
2017-09-01
Cardiac electrical alternans is a state of alternation between long and short action potentials and is frequently associated with harmful cardiac conditions. Different dynamic mechanisms can give rise to alternans; however, many cardiac models based on ordinary differential equations are not able to reproduce this phenomenon. A previous study showed that alternans can be induced by the introduction of delay differential equations (DDEs) in the formulations of the ion channel gating variables of a canine myocyte model. The present work demonstrates that this technique is not model-specific by successfully promoting alternans using DDEs for five cardiac electrophysiology models that describe different types of myocytes, with varying degrees of complexity. By analyzing results across the different models, we observe two potential requirements for alternans promotion via DDEs for ionic gates: (i) the gate must have a significant influence on the action potential duration and (ii) a delay must significantly impair the gate's recovery between consecutive action potentials.
A Parameter Robust Method for Singularly Perturbed Delay Differential Equations
Directory of Open Access Journals (Sweden)
Erdogan Fevzi
2010-01-01
Full Text Available Uniform finite difference methods are constructed via nonstandard finite difference methods for the numerical solution of singularly perturbed quasilinear initial value problem for delay differential equations. A numerical method is constructed for this problem which involves the appropriate Bakhvalov meshes on each time subinterval. The method is shown to be uniformly convergent with respect to the perturbation parameter. A numerical example is solved using the presented method, and the computed result is compared with exact solution of the problem.
Delay differential equations for mode-locked semiconductor lasers.
Vladimirov, Andrei G; Turaev, Dmitry; Kozyreff, Gregory
2004-06-01
We propose a new model for passive mode locking that is a set of ordinary delay differential equations. We assume a ring-cavity geometry and Lorentzian spectral filtering of the pulses but do not use small gain and loss and weak saturation approximations. By means of a continuation method, we study mode-locking solutions and their stability. We find that stable mode locking can exist even when the nonlasing state between pulses becomes unstable.
A differential delay equation arising from the sieve of Eratosthenes
Cheer, A. Y.; Goldston, D. A.
1990-01-01
Consideration is given to the differential delay equation introduced by Buchstab (1937) in connection with an asymptotic formula for the uncanceled terms in the sieve of Eratosthenes. Maier (1985) used this result to show there is unexpected irreqularity in the distribution of primes in short intervals. The function omega(u) is studied in this paper using numerical and analytical techniques. The results are applied to give some numerical constants in Maier's theorem.
Solomon, Alan D
2012-01-01
REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean
International Nuclear Information System (INIS)
Marczynski, Slawomir
2011-01-01
The integro-differential Berk-Breizman (BB) equation, describing the evolution of particle-driven wave mode is transformed into a simple delayed differential equation form ν∂a(τ)/∂τ=a(τ) -a 2 (τ- 1) a(τ- 2). This transformation is also applied to the two modes extension of the BB theory. The obtained solutions are presented together with the derived asymptotic analytical solutions and the numerical results.
Approximate Solutions of Delay Parabolic Equations with the Dirichlet Condition
Directory of Open Access Journals (Sweden)
Deniz Agirseven
2012-01-01
Full Text Available Finite difference and homotopy analysis methods are used for the approximate solution of the initial-boundary value problem for the delay parabolic partial differential equation with the Dirichlet condition. The convergence estimates for the solution of first and second orders of difference schemes in Hölder norms are obtained. A procedure of modified Gauss elimination method is used for the solution of these difference schemes. Homotopy analysis method is applied. Comparison of finite difference and homotopy analysis methods is given on the problem.
Necessary and sufficient conditions for Hopf bifurcation in tri-neuron equation with a delay
International Nuclear Information System (INIS)
Liu Xiaoming; Liao Xiaofeng
2009-01-01
In this paper, we consider the delayed differential equations modeling three-neuron equations with only a time delay. Using the time delay as a bifurcation parameter, necessary and sufficient conditions for Hopf bifurcation to occur are derived. Numerical results indicate that for this model, Hopf bifurcation is likely to occur at suitable delay parameter values.
Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne
1988-01-01
The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.
Properties of Boolean orthoposets
Tkadlec, Josef
1993-10-01
A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.
Kashchenko, Sergey A.
2016-12-01
The dynamics of second-order equations with nonlinear delayed feedback and a large coefficient of a delayed equation is investigated using asymptotic methods. Based on special methods of quasi-normal forms, a new construction is elaborated for obtaining the main terms of asymptotic expansions of asymptotic residual solutions. It is shown that the dynamical properties of the above equations are determined mostly by the behavior of the solutions of some special families of parabolic boundary value problems. A comparative analysis of the dynamics of equations with the delayed feedback of three types is carried out.
Forced synchronization of autonomous dynamical Boolean networks
International Nuclear Information System (INIS)
Rivera-Durón, R. R.; Campos-Cantón, E.; Campos-Cantón, I.; Gauthier, Daniel J.
2015-01-01
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics
Forced synchronization of autonomous dynamical Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx [División de Matemáticas Aplicadas, Instituto Potosino de Investigación Científica y Tecnológica A. C., Camino a la Presa San José 2055, Col. Lomas 4 Sección, C.P. 78216, San Luis Potosí, S.L.P. (Mexico); Campos-Cantón, I. [Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Álvaro Obregón 64, C.P. 78000, San Luis Potosí, S.L.P. (Mexico); Gauthier, Daniel J. [Department of Physics and Center for Nonlinear and Complex Systems, Duke University, Box 90305, Durham, North Carolina 27708 (United States)
2015-08-15
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.
Delay Differential Equation Models of Normal and Diseased Electrocardiograms
Lainscsek, Claudia; Sejnowski, Terrence J.
Time series analysis with nonlinear delay differential equations (DDEs) is a powerful tool since it reveals spectral as well as nonlinear properties of the underlying dynamical system. Here global DDE models are used to analyze electrocardiography recordings (ECGs) in order to capture distinguishing features for different heart conditions such as normal heart beat, congestive heart failure, and atrial fibrillation. To capture distinguishing features of the different data types the number of terms and delays in the model as well as the order of nonlinearity of the DDE model have to be selected. The DDE structure selection is done in a supervised way by selecting the DDE that best separates different data types. We analyzed 24 h of data from 15 young healthy subjects in normal sinus rhythm (NSR) of 15 congestive heart failure (CHF) patients as well as of 15 subjects suffering from atrial fibrillation (AF) selected from the Physionet database. For the analysis presented here we used 5 min non-overlapping data windows on the raw data without any artifact removal. For classification performance we used the Cohen Kappa coefficient computed directly from the confusion matrix. The overall classification performance of the three groups was around 72-99 % on the 5 min windows for the different approaches. For 2 h data windows the classification for all three groups was above 95%.
INTERVAL STATE ESTIMATION FOR SINGULAR DIFFERENTIAL EQUATION SYSTEMS WITH DELAYS
Directory of Open Access Journals (Sweden)
T. A. Kharkovskaia
2016-07-01
Full Text Available The paper deals with linear differential equation systems with algebraic restrictions (singular systems and a method of interval observer design for this kind of systems. The systems contain constant time delay, measurement noise and disturbances. Interval observer synthesis is based on monotone and cooperative systems technique, linear matrix inequations, Lyapunov function theory and interval arithmetic. The set of conditions that gives the possibility for interval observer synthesis is proposed. Results of synthesized observer operation are shown on the example of dynamical interindustry balance model. The advantages of proposed method are that it is adapted to observer design for uncertain systems, if the intervals of admissible values for uncertain parameters are given. The designed observer is capable to provide asymptotically definite limits on the estimation accuracy, since the interval of admissible values for the object state is defined at every instant. The obtained result provides an opportunity to develop the interval estimation theory for complex systems that contain parametric uncertainty, varying delay and nonlinear elements. Interval observers increasingly find applications in economics, electrical engineering, mechanical systems with constraints and optimal flow control.
Stable Numerical Approach for Fractional Delay Differential Equations
Singh, Harendra; Pandey, Rajesh K.; Baleanu, D.
2017-12-01
In this paper, we present a new stable numerical approach based on the operational matrix of integration of Jacobi polynomials for solving fractional delay differential equations (FDDEs). The operational matrix approach converts the FDDE into a system of linear equations, and hence the numerical solution is obtained by solving the linear system. The error analysis of the proposed method is also established. Further, a comparative study of the approximate solutions is provided for the test examples of the FDDE by varying the values of the parameters in the Jacobi polynomials. As in special case, the Jacobi polynomials reduce to the well-known polynomials such as (1) Legendre polynomial, (2) Chebyshev polynomial of second kind, (3) Chebyshev polynomial of third and (4) Chebyshev polynomial of fourth kind respectively. Maximum absolute error and root mean square error are calculated for the illustrated examples and presented in form of tables for the comparison purpose. Numerical stability of the presented method with respect to all four kind of polynomials are discussed. Further, the obtained numerical results are compared with some known methods from the literature and it is observed that obtained results from the proposed method is better than these methods.
A delay differential equation model of follicle waves in women.
Panza, Nicole M; Wright, Andrew A; Selgrade, James F
2016-01-01
This article presents a mathematical model for hormonal regulation of the menstrual cycle which predicts the occurrence of follicle waves in normally cycling women. Several follicles of ovulatory size that develop sequentially during one menstrual cycle are referred to as follicle waves. The model consists of 13 nonlinear, delay differential equations with 51 parameters. Model simulations exhibit a unique stable periodic cycle and this menstrual cycle accurately approximates blood levels of ovarian and pituitary hormones found in the biological literature. Numerical experiments illustrate that the number of follicle waves corresponds to the number of rises in pituitary follicle stimulating hormone. Modifications of the model equations result in simulations which predict the possibility of two ovulations at different times during the same menstrual cycle and, hence, the occurrence of dizygotic twins via a phenomenon referred to as superfecundation. Sensitive parameters are identified and bifurcations in model behaviour with respect to parameter changes are discussed. Studying follicle waves may be helpful for improving female fertility and for understanding some aspects of female reproductive ageing.
Stable Numerical Approach for Fractional Delay Differential Equations
International Nuclear Information System (INIS)
Singh, Harendra; Pandey, Rajesh K.; Baleanu, D.
2017-01-01
In this paper, we present a new stable numerical approach based on the operational matrix of integration of Jacobi polynomials for solving fractional delay differential equations (FDDEs). The operational matrix approach converts the FDDE into a system of linear equations, and hence the numerical solution is obtained by solving the linear system. The error analysis of the proposed method is also established. Further, a comparative study of the approximate solutions is provided for the test examples of the FDDE by varying the values of the parameters in the Jacobi polynomials. As in special case, the Jacobi polynomials reduce to the well-known polynomials such as (1) Legendre polynomial, (2) Chebyshev polynomial of second kind, (3) Chebyshev polynomial of third and (4) Chebyshev polynomial of fourth kind respectively. Maximum absolute error and root mean square error are calculated for the illustrated examples and presented in form of tables for the comparison purpose. Numerical stability of the presented method with respect to all four kind of polynomials are discussed. Further, the obtained numerical results are compared with some known methods from the literature and it is observed that obtained results from the proposed method is better than these methods. (author)
Analysis of an Nth-order nonlinear differential-delay equation
Vallée, Réal; Marriott, Christopher
1989-01-01
The problem of a nonlinear dynamical system with delay and an overall response time which is distributed among N individual components is analyzed. Such a system can generally be modeled by an Nth-order nonlinear differential delay equation. A linear-stability analysis as well as a numerical simulation of that equation are performed and a comparison is made with the experimental results. Finally, a parallel is established between the first-order differential equation with delay and the Nth-order differential equation without delay.
Polyanin, A. D.; Sorokin, V. G.
2017-12-01
The paper deals with nonlinear reaction-diffusion equations with one or several delays. We formulate theorems that allow constructing exact solutions for some classes of these equations, which depend on several arbitrary functions. Examples of application of these theorems for obtaining new exact solutions in elementary functions are provided. We state basic principles of construction, selection, and use of test problems for nonlinear partial differential equations with delay. Some test problems which can be suitable for estimating accuracy of approximate analytical and numerical methods of solving reaction-diffusion equations with delay are presented. Some examples of numerical solutions of nonlinear test problems with delay are considered.
International Nuclear Information System (INIS)
Dimitrova, M. B.; Donev, V. I.
2008-01-01
This paper is dealing with the oscillatory properties of first order neutral delay impulsive differential equations and corresponding to them inequalities with constant coefficients. The established sufficient conditions ensure the oscillation of every solution of this type of equations.
Brunner, Hermann
2009-06-01
The numerical analysis of Volterra functional integro-differential equations with vanishing delays has to overcome a number of challenges that are not encountered when solving [`]classical' delay differential equations with non-vanishing delays. In this paper I shall describe recent results in the analysis of optimal (global and local) superconvergence orders in collocation methods for such evolutionary problems. Following a brief survey of results for equations containing Volterra integral operators with non-vanishing delays, the discussion will focus on pantograph-type Volterra integro-differential equations with (linear and nonlinear) vanishing delays. The paper concludes with a section on open problems; these include the asymptotic stability of collocation solutions uh on uniform meshes for pantograph-type functional equations, and the analysis of collocation methods for pantograph-type functional equations with advanced arguments.
Study of the dynamics of an equation with two large different-order delays
International Nuclear Information System (INIS)
Kashchenko, I.S.
2016-01-01
The case where the larger delay is proportional to the square of the smaller delay is studied in detail. Regions of stability and instability of the equilibrium state and critical cases are found. In all critical cases, special evolutionary equations (quasinormal forms) are constructed. Their non-local dynamics determines the local behavior of solutions of the original equation [ru
Travelling Solitary Wave Solutions for Generalized Time-delayed Burgers-Fisher Equation
International Nuclear Information System (INIS)
Deng Xijun; Han Libo; Li Xi
2009-01-01
In this paper, travelling wave solutions for the generalized time-delayed Burgers-Fisher equation are studied. By using the first-integral method, which is based on the ring theory of commutative algebra, we obtain a class of travelling solitary wave solutions for the generalized time-delayed Burgers-Fisher equation. A minor error in the previous article is clarified. (general)
Zúñiga-Aguilar, C. J.; Coronel-Escamilla, A.; Gómez-Aguilar, J. F.; Alvarado-Martínez, V. M.; Romero-Ugalde, H. M.
2018-02-01
In this paper, we approximate the solution of fractional differential equations with delay using a new approach based on artificial neural networks. We consider fractional differential equations of variable order with the Mittag-Leffler kernel in the Liouville-Caputo sense. With this new neural network approach, an approximate solution of the fractional delay differential equation is obtained. Synaptic weights are optimized using the Levenberg-Marquardt algorithm. The neural network effectiveness and applicability were validated by solving different types of fractional delay differential equations, linear systems with delay, nonlinear systems with delay and a system of differential equations, for instance, the Newton-Leipnik oscillator. The solution of the neural network was compared with the analytical solutions and the numerical simulations obtained through the Adams-Bashforth-Moulton method. To show the effectiveness of the proposed neural network, different performance indices were calculated.
International Nuclear Information System (INIS)
Frank, T D
2005-01-01
Stationary distributions of processes are derived that involve a time delay and are defined by a linear stochastic neutral delay differential equation. The distributions are Gaussian distributions. The variances of the Gaussian distributions are either monotonically increasing or decreasing functions of the time delays. The variances become infinite when fixed points of corresponding deterministic processes become unstable. (letter to the editor)
Intermittently chaotic oscillations for a differential-delay equation with Gaussian nonlinearity
Hamilton, Ian
1992-01-01
For a differential-delay equation the time dependence of the variable is a function of the variable at a previous time. We consider a differential-delay equation with Gaussian nonlinearity that displays intermittent chaos. Although not the first example of a differential-delay equation that displays such behavior, for this example the intermittency is classified as type III, and the origin of the intermittent chaos may be qualitatively understood from the limiting forms of the equation for large and small variable magnitudes.
Oscillation criteria for third order delay nonlinear differential equations
Directory of Open Access Journals (Sweden)
E. M. Elabbasy
2012-01-01
via comparison with some first differential equations whose oscillatory characters are known. Our results generalize and improve some known results for oscillation of third order nonlinear differential equations. Some examples are given to illustrate the main results.
Travelling wave solutions for some time-delayed equations through factorizations
International Nuclear Information System (INIS)
Fahmy, E.S.
2008-01-01
In this work, we use factorization method to find explicit particular travelling wave solutions for the following important nonlinear second-order partial differential equations: The generalized time-delayed Burgers-Huxley, time-delayed convective Fishers, and the generalized time-delayed Burgers-Fisher. Using the particular solutions for these equations we find the general solutions, two-parameter solution, as special cases
Thandapani, Ethiraju; Kannan, Manju; Pinelas, Sandra
2016-01-01
In this paper, we present some sufficient conditions for the oscillation of all solutions of a second order forced impulsive delay differential equation with damping term. Three factors-impulse, delay and damping that affect the interval qualitative properties of solutions of equations are taken into account together. The results obtained in this paper extend and generalize some of the the known results for forced impulsive differential equations. An example is provided to illustrate the main result.
Energy Technology Data Exchange (ETDEWEB)
Smith, H.L. (Arizona State Univ., Tempe (United States))
1993-01-01
It is shown by way of a simple example that certain structured population models lead naturally to differential delay equations of the threshold type and that these equations can be transformed in a natural way to functional differential equations. The model examined can be viewed as a model of competition between adults and juveniles of a single population. The results indicate the possibility that this competition leads to instability. 28 refs., 2 figs.
Stability of plane wave solutions in complex Ginzburg-Landau equation with delayed feedback
Puzyrev, D.; Yanchuk, S.; Vladimirov, A. G.; Gurevich, S. V.
2013-01-01
We perform bifurcation analysis of plane wave solutions in one-dimensional cubic-quintic Ginzburg-Landau equation with delayed feedback. Our study reveals how multistability and snaking behavior of plane waves emerge as time delay is introduced. For intermediate values of the delay, bifurcation diagrams are obtained by a combination of analytical and numerical methods. For large delays, using an asymptotic approach we classify plane wave solutions into strongly unstable, weakly unstable, and ...
Renardy, M.
1981-10-01
A semigroup approach to differential-delay equations is developed which seems more suitable for certain partial integro-differential equations than the standard theory. On a formal level, it is demonstrated that the stretching of filaments of viscoelastic liquids can be described by an equation of this form.
Domoshnitsky, Alexander; Maghakyan, Abraham; Berezansky, Leonid
2017-01-01
In this paper a method for studying stability of the equation [Formula: see text] not including explicitly the first derivative is proposed. We demonstrate that although the corresponding ordinary differential equation [Formula: see text] is not exponentially stable, the delay equation can be exponentially stable.
Directly Solving Special Second Order Delay Differential Equations Using Runge-Kutta-Nyström Method
Directory of Open Access Journals (Sweden)
M. Mechee
2013-01-01
Full Text Available Runge-Kutta-Nyström (RKN method is adapted for solving the special second order delay differential equations (DDEs. The stability polynomial is obtained when this method is used for solving linear second order delay differential equation. A standard set of test problems is solved using the method together with a cubic interpolation for evaluating the delay terms. The same set of problems is reduced to a system of first order delay differential equations and then solved using the existing Runge-Kutta (RK method. Numerical results show that the RKN method is more efficient in terms of accuracy and computational time when compared to RK method. The methods are applied to a well-known problem involving delay differential equations, that is, the Mathieu problem. The numerical comparison shows that both methods are in a good agreement.
Long-time behavior for suspension bridge equations with time delay
Park, Sun-Hye
2018-04-01
In this paper, we consider suspension bridge equations with time delay of the form u_{tt}(x,t) + Δ ^2 u (x,t) + k u^+ (x,t) + a_0 u_t (x,t) + a_1 u_t (x, t- τ ) + f(u(x,t)) = g(x). Many researchers have studied well-posedness, decay rates of energy, and existence of attractors for suspension bridge equations without delay effects. But, as far as we know, there is no work about suspension equations with time delay. In addition, there are not many studies on attractors for other delayed systems. Thus we first provide well-posedness for suspension equations with time delay. And then show the existence of global attractors and the finite dimensionality of the attractors by establishing energy functionals which are related to the norm of the phase space to our problem.
Murphy, K. A.
1990-01-01
A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.
Perturbations of linear delay differential equations at the verge of instability.
Lingala, N; Namachchivaya, N Sri
2016-06-01
The characteristic equation for a linear delay differential equation (DDE) has countably infinite roots on the complex plane. This paper considers linear DDEs that are on the verge of instability, i.e., a pair of roots of the characteristic equation lies on the imaginary axis of the complex plane and all other roots have negative real parts. It is shown that when small noise perturbations are present, the probability distribution of the dynamics can be approximated by the probability distribution of a certain one-dimensional stochastic differential equation (SDE) without delay. This is advantageous because equations without delay are easier to simulate and one-dimensional SDEs are analytically tractable. When the perturbations are also linear, it is shown that the stability depends on a specific complex number. The theory is applied to study oscillators with delayed feedback. Some errors in other articles that use multiscale approach are pointed out.
Periodic solutions in reaction–diffusion equations with time delay
International Nuclear Information System (INIS)
Li, Li
2015-01-01
Spatial diffusion and time delay are two main factors in biological and chemical systems. However, the combined effects of them on diffusion systems are not well studied. As a result, we investigate a nonlinear diffusion system with delay and obtain the existence of the periodic solutions using coincidence degree theory. Moreover, two numerical examples confirm our theoretical results. The obtained results can also be applied in other related fields
Linear measure functional differential equations with infinite delay
Czech Academy of Sciences Publication Activity Database
Monteiro, Giselle Antunes; Slavík, A.
2014-01-01
Roč. 287, 11-12 (2014), s. 1363-1382 ISSN 0025-584X Institutional support: RVO:67985840 Keywords : measure functional differential equations * generalized ordinary differential equations * Kurzweil-Stieltjes integral Subject RIV: BA - General Mathematics Impact factor: 0.683, year: 2014 http://onlinelibrary.wiley.com/doi/10.1002/mana.201300048/abstract
Algebraic partial Boolean algebras
Smith, D
2003-01-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial...
Numerical Hopf bifurcation of Runge-Kutta methods for a class of delay differential equations
International Nuclear Information System (INIS)
Wang Qiubao; Li Dongsong; Liu, M.Z.
2009-01-01
In this paper, we consider the discretization of parameter-dependent delay differential equation of the form y ' (t)=f(y(t),y(t-1),τ),τ≥0,y element of R d . It is shown that if the delay differential equation undergoes a Hopf bifurcation at τ=τ * , then the discrete scheme undergoes a Hopf bifurcation at τ(h)=τ * +O(h p ) for sufficiently small step size h, where p≥1 is the order of the Runge-Kutta method applied. The direction of numerical Hopf bifurcation and stability of bifurcating invariant curve are the same as that of delay differential equation.
The Oscillation of a Class of the Fractional-Order Delay Differential Equations
Directory of Open Access Journals (Sweden)
Qianli Lu
2014-01-01
Full Text Available Several oscillation results are proposed including necessary and sufficient conditions for the oscillation of fractional-order delay differential equations with constant coefficients, the sufficient or necessary and sufficient conditions for the oscillation of fractional-order delay differential equations by analysis method, and the sufficient or necessary and sufficient conditions for the oscillation of delay partial differential equation with three different boundary conditions. For this, α-exponential function which is a kind of functions that play the same role of the classical exponential functions of fractional-order derivatives is used.
Algebraic partial Boolean algebras
Smith, Derek
2003-04-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space Script H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E8.
Algebraic partial Boolean algebras
Energy Technology Data Exchange (ETDEWEB)
Smith, Derek [Math Department, Lafayette College, Easton, PA 18042 (United States)
2003-04-04
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A{sub 5} sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E{sub 8}.
Cox, S.G.
2012-01-01
The thesis deals with various aspects of the study of stochastic partial differential equations driven by Gaussian noise. The approach taken is functional analytic rather than probabilistic: the stochastic partial differential equation is interpreted as an ordinary stochastic differential equation
Stability, bifurcation and a new chaos in the logistic differential equation with delay
International Nuclear Information System (INIS)
Jiang Minghui; Shen Yi; Jian Jigui; Liao Xiaoxin
2006-01-01
This Letter is concerned with bifurcation and chaos in the logistic delay differential equation with a parameter r. The linear stability of the logistic equation is investigated by analyzing the associated characteristic transcendental equation. Based on the normal form approach and the center manifold theory, the formula for determining the direction of Hopf bifurcation and the stability of bifurcation periodic solution in the first bifurcation values is obtained. By theoretical analysis and numerical simulation, we found a new chaos in the logistic delay differential equation
Non-Fickian delay reaction-diffusion equations: theoretical and numerical study
Ferreira, J. A.; Branco, J. R.; Silva, P. da
2007-01-01
The Fisher’s equation is established combining the Fick’s law for the flux and the mass conservation law. Assuming that the reaction term depends on the solution at some past time, a delay parameter is introduced and the delay Fisher’s equation is obtained. Modifying the Fick’s law for the flux considering a temporal memory term, integro-differential equations of Volterra type were introduced in the literature. In these paper we study reaction-diffusion equations obtained co...
Stability analysis of a class of fractional delay differential equations
Indian Academy of Sciences (India)
Abstract. In this paper we analyse stability of nonlinear fractional order delay differential equa- tions of the form Dα y(t) = af (y(t − τ )) − by(t), where Dα is a Caputo fractional derivative of order 0 < α ≤ 1. We describe stability regions using critical curves. To explain the proposed theory, we discuss fractional order logistic ...
Renardy, M.
A semigroup approach to differential-delay equations is developed which reduces such equations to ordinary differential equations on a Banach space of histories and seems more suitable for certain partial integro-differential equations than the standard theory. The method is applied to prove a local-time existence theorem for equations of the form utt = g( uxt, uxt) x, where {∂g}/{∂u xt} > 0 . On a formal level, it is demonstrated that the stretching of filaments of viscoelastic liquids can be described by an equation of this form.
Liang, G.; Wu, J. A.
2003-06-01
In this paper, we consider the growth dynamics of a single-species population with two age classes and a fixed maturation period living in a spatial transport field. A Reaction Advection Diffusion Equation (RADE) model with time delay and nonlocal effect is derived if the mature death and diffusion rates are age independent. We discuss the existence of travelling waves for the delay model with three birth functions which appeared in the well-known Nicholson's blowflies equation, and we consider and analyze numerical solutions of the travelling wavefronts from the wave equations for the problems with nonlocal temporally delayed effects. In particular, we report our numerical observations about the change of the monotonicity and the possible occurrence of multihump waves. The stability of the travelling wavefront is numerically considered by computing the full time-dependent partial differential equations with nonlocal delay.
Variational iteration method for solving the multi-pantograph delay equation
International Nuclear Information System (INIS)
Yu Zhanhua
2008-01-01
In this Letter, the variational iteration method is applied to solve the multi-pantograph delay equation. Sufficient conditions are given to assure the convergence of the method. Examples show that the method is effective
Stability of the Simplest Periodic Solutions in the Stuart–Landau Equation with Large Delay
Directory of Open Access Journals (Sweden)
A. A. Kashchenko
2012-01-01
Full Text Available We study the local dynamics of the Stuart–Landau equation with large delay in the neibourhood of periodic solutions. We find sufficient conditions of instability of periodic solutions and sufficient conditions of their stability.
Gas-evolution oscillators. 10. A model based on a delay equation
Energy Technology Data Exchange (ETDEWEB)
Bar-Eli, K.; Noyes, R.M. [Univ. of Oregon, Eugene, OR (United States)
1992-09-17
This paper develops a simplified method to model the behavior of a gas-evolution oscillator with two differential delay equations in two unknowns consisting of the population of dissolved molecules in solution and the pressure of the gas.
Gas-evolution oscillators. 10. A model based on a delay equation
International Nuclear Information System (INIS)
Bar-Eli, K.; Noyes, R.M.
1992-01-01
This paper develops a simplified method to model the behavior of a gas-evolution oscillator with two differential delay equations in two unknowns consisting of the population of dissolved molecules in solution and the pressure of the gas
Oscillation of solutions to neutral nonlinear impulsive hyperbolic equations with several delays
Directory of Open Access Journals (Sweden)
Jichen Yang
2013-01-01
Full Text Available In this article, we study oscillatory properties of solutions to neutral nonlinear impulsive hyperbolic partial differential equations with several delays. We establish sufficient conditions for oscillation of all solutions.
Auto-Bäcklund transformations for a differential-delay equation
Gordoa, Pilar R.; Pickering, Andrew
2013-03-01
Discrete Painlevé equations have, over recent years, generated much interest. One property of such equations that is considered to be particularly important is the existence of auto-Bäcklund transformations, that is, mappings between solutions of the equation in question, usually involving changes in the values of parameters appearing as coefficients. We have recently presented extensions of discrete Painlevé equations to equations involving derivatives as well as shifts in the independent variable. Here we show how auto-Bäcklund transformations can also be constructed for such differential-delay equations. We emphasise that this is the first time that an auto-Bäcklund transformation has been given for a differential-delay equation.
Analysis for a special first order characteristic equation with delay dependent parameters
Energy Technology Data Exchange (ETDEWEB)
Sun Chengjun [Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240 (China)]. E-mail: cjsun@sjtu.edu.cn; Lin Yiping [Department of Mathematics, Kunming University of Science and Technology, Kunming, Yunnan 650093 (China); Han Maoan [Department of Mathematics, Shanghai Normal University, Shanghai 200234 (China); Tang Shoupeng [School of Materials Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240 (China)
2007-07-15
In this paper, the characteristic equation a({tau}){lambda} + b({tau}) + c({tau}) e{sup -{lambda}}{sup {tau}} + d({tau}) e{sup -2{lambda}}{sup {tau}} = 0 with delay {tau} dependent parameters is investigated. Sufficient and necessary conditions for the existence of a pair of purely imaginary roots are obtained by introducing the auxiliary equations. The crossing directions of eigenvalue curves through the imaginary axis as the delay {tau} increases are determined by the formulae.
Exponential p-stability of impulsive stochastic differential equations with delays
International Nuclear Information System (INIS)
Yang Zhiguo; Xu Daoyi; Xiang Li
2006-01-01
In this Letter, we establish a method to study the exponential p-stability of the zero solution of impulsive stochastic differential equations with delays. By establishing an L-operator inequality and using the properties of M-cone and stochastic analysis technique, we obtain some new conditions ensuring the exponential p-stability of the zero solution of impulsive stochastic differential equations with delays. Two illustrative examples have been provided to show the effectiveness of our results
Integration Processes of Delay Differential Equation Based on Modified Laguerre Functions
Directory of Open Access Journals (Sweden)
Yeguo Sun
2012-01-01
Full Text Available We propose long-time convergent numerical integration processes for delay differential equations. We first construct an integration process based on modified Laguerre functions. Then we establish its global convergence in certain weighted Sobolev space. The proposed numerical integration processes can also be used for systems of delay differential equations. We also developed a technique for refinement of modified Laguerre-Radau interpolations. Lastly, numerical results demonstrate the spectral accuracy of the proposed method and coincide well with analysis.
Analytical approximate solutions for a general class of nonlinear delay differential equations.
Căruntu, Bogdan; Bota, Constantin
2014-01-01
We use the polynomial least squares method (PLSM), which allows us to compute analytical approximate polynomial solutions for a very general class of strongly nonlinear delay differential equations. The method is tested by computing approximate solutions for several applications including the pantograph equations and a nonlinear time-delay model from biology. The accuracy of the method is illustrated by a comparison with approximate solutions previously computed using other methods.
A note on Burgers' equation with time delay: Instability via finite-time blow-up
International Nuclear Information System (INIS)
Jordan, P.M.
2008-01-01
Burgers' equation with time delay is considered. Using the Cole-Hopf transformation, the exact solution of this nonlinear partial differential equation (PDE) is determined in the context of a (seemingly) well-posed initial-boundary value problem (IBVP) involving homogeneous Dirichlet data. The solution obtained, however, is shown to exhibit a delay-induced instability, suffering blow-up in finite-time
Numerical bifurcation analysis of delay differential equations arising from physiological modeling.
Engelborghs, K; Lemaire, V; Bélair, J; Roose, D
2001-04-01
This paper has a dual purpose. First, we describe numerical methods for continuation and bifurcation analysis of steady state solutions and periodic solutions of systems of delay differential equations with an arbitrary number of fixed, discrete delays. Second, we demonstrate how these methods can be used to obtain insight into complex biological regulatory systems in which interactions occur with time delays: for this, we consider a system of two equations for the plasma glucose and insulin concentrations in a diabetic patient subject to a system of external assistance. The model has two delays: the technological delay of the external system, and the physiological delay of the patient's liver. We compute stability of the steady state solution as a function of two parameters, compare with analytical results and compute several branches of periodic solutions and their stability. These numerical results allow to infer two categories of diabetic patients for which the external system has different efficiency.
Stability analysis of a class of fractional delay differential equations
Indian Academy of Sciences (India)
equation (8) satisfy. Re(λi ) < 0, ∀i. (9). Let λ = u + ıv, u,v ∈ . A change in stability can occur only when the value of λ crosses the imaginary axis at λ = ıv and the characteristic equation becomes. (ıv)α + b = af (y. ∗) exp(−ıvτ). (10). Using ıv = v exp(ıπ/2), v ∈ and separating real and imaginary parts in (10) we get b + vα cos. (.
Directory of Open Access Journals (Sweden)
Xu Liguang
2009-01-01
Full Text Available The exponential stability of singularly perturbed impulsive delay integrodifferential equations (SPIDIDEs is concerned. By establishing an impulsive delay integrodifferential inequality (IDIDI, some sufficient conditions ensuring the exponentially stable of any solution of SPIDIDEs for sufficiently small are obtained. A numerical example shows the effectiveness of our theoretical results.
Directory of Open Access Journals (Sweden)
Hajnalka Péics
2016-08-01
Full Text Available The asymptotic behavior of solutions of the system of difference equations with continuous time and lag function between two known real functions is studied. The cases when the lag function is between two linear delay functions, between two power delay functions and between two constant delay functions are observed and illustrated by examples. The asymptotic estimates of solutions of the considered system are obtained.
Directory of Open Access Journals (Sweden)
Mervan Pašić
2014-01-01
Full Text Available We study oscillatory behaviour of a large class of second-order functional differential equations with three freedom real nonnegative parameters. According to a new oscillation criterion, we show that if at least one of these three parameters is large enough, then the main equation must be oscillatory. As an application, we study a class of Duffing type quasilinear equations with nonlinear time delayed feedback and their oscillations excited by the control gain parameter or amplitude of forcing term. Finally, some open questions and comments are given for the purpose of further study on this topic.
Asymptotic behavior and stability of second order neutral delay differential equations
Chen, G.L.; van Gaans, O.W.; Verduyn Lunel, Sjoerd
2014-01-01
We study the asymptotic behavior of a class of second order neutral delay differential equations by both a spectral projection method and an ordinary differential equation method approach. We discuss the relation of these two methods and illustrate some features using examples. Furthermore, a fixed
Directory of Open Access Journals (Sweden)
Dandan Guo
2017-08-01
Full Text Available In this article we consider the boundary stabilization of a wave equation with variable coefficients. This equation has an acceleration term and a delayed velocity term on the boundary. Under suitable geometric conditions, we obtain the exponential decay for the solutions. Our proof relies on the geometric multiplier method and the Lyapunov approach.
On solutions of neutral stochastic delay Volterra equations with singular kernels
Directory of Open Access Journals (Sweden)
Xiaotai Wu
2012-08-01
Full Text Available In this paper, existence, uniqueness and continuity of the adapted solutions for neutral stochastic delay Volterra equations with singular kernels are discussed. In addition, continuous dependence on the initial date is also investigated. Finally, stochastic Volterra equation with the kernel of fractional Brownian motion is studied to illustrate the effectiveness of our results.
Domoshnitsky, Alexander; Volinsky, Irina
2014-01-01
The impulsive delay differential equation is considered (Lx)(t) = x'(t) + ∑(i=1)(m) p(i)(t)x(t - τ(i) (t)) = f(t), t ∈ [a, b], x(t j) = β(j)x(t(j - 0)), j = 1,…, k, a = t0 equation are obtained.
On the Controllability of a Differential Equation with Delayed and Advanced Arguments
Directory of Open Access Journals (Sweden)
Raúl Manzanilla
2010-01-01
Full Text Available A semigroup theory for a differential equation with delayed and advanced arguments is developed, with a detailed description of the infinitesimal generator. This in turn allows to study the exact controllability of the equation, by rewriting it as a classical Cauchy problem.
Nonlinear Delay Discrete Inequalities and Their Applications to Volterra Type Difference Equations
Directory of Open Access Journals (Sweden)
Yu Wu
2010-01-01
Full Text Available Delay discrete inequalities with more than one nonlinear term are discussed, which generalize some known results and can be used in the analysis of various problems in the theory of certain classes of discrete equations. Application examples to show boundedness and uniqueness of solutions of a Volterra type difference equation are also given.
Stability and bifurcation analysis of a generalized scalar delay differential equation.
Bhalekar, Sachin
2016-08-01
This paper deals with the stability and bifurcation analysis of a general form of equation D(α)x(t)=g(x(t),x(t-τ)) involving the derivative of order α ∈ (0, 1] and a constant delay τ ≥ 0. The stability of equilibrium points is presented in terms of the stability regions and critical surfaces. We provide a necessary condition to exist chaos in the system also. A wide range of delay differential equations involving a constant delay can be analyzed using the results proposed in this paper. The illustrative examples are provided to explain the theory.
Geometric methods of global attraction in systems of delay differential equations
El-Morshedy, Hassan A.; Ruiz-Herrera, Alfonso
2017-11-01
In this paper we deduce criteria of global attraction in systems of delay differential equations. Our methodology is new and consists in "dominating" the nonlinear terms of the system by a scalar function and then studying some dynamical properties of that function. One of the crucial benefits of our approach is that we obtain delay-dependent results of global attraction that cover the best delay-independent conditions. We apply our results in a gene regulatory model and the classical Nicholson's blowfly equation with patch structure.
Equation and test of possible delay time of Newton force
Directory of Open Access Journals (Sweden)
Diósi Lajos
2014-01-01
Full Text Available Recently, a simple heuristic modification of the Newton potential with a nonzero delay-time τG has been proposed. Our modification is largely suppressed for purely gravitational interactions, it becomes relevant under non-gravitational accelerations of the sources. We illustrate how the choice τG ~ 1 ms may already influence the 5th digit of G determined by Cavendish experiments. Re-evaluation of old Cavendish experiments and implementing slightly modified new ones may confirm the proposal or, at least, put a stronger upper limit on τG.
Directory of Open Access Journals (Sweden)
Şuayip Yüzbaşı
2017-03-01
Full Text Available In this paper, we suggest a matrix method for obtaining the approximate solutions of the delay linear Fredholm integro-differential equations with constant coefficients using the shifted Legendre polynomials. The problem is considered with mixed conditions. Using the required matrix operations, the delay linear Fredholm integro-differential equation is transformed into a matrix equation. Additionally, error analysis for the method is presented using the residual function. Illustrative examples are given to demonstrate the efficiency of the method. The results obtained in this study are compared with the known results.
On the existence of solutions to some nonlinear integrodifferential equations with delays
Directory of Open Access Journals (Sweden)
Ioannis Purnaras
2007-10-01
Full Text Available Existence of solutions to some nonlinear integral equations with variable delays are obtained by the use of a fixed point theorem due to Dhage. As applications of the main results, existence results to some initial value problems concerning differential equations of higher order as well as integro-differential equations are derived. The case of Lipschitz-type conditions is also considered. Our results improve and generalize, in several ways, existence results already appeared in the literature.
Directory of Open Access Journals (Sweden)
Leonid Berezansky
2003-02-01
Full Text Available We study a scalar delay differential equation with a bounded distributed delay, $$ dot{x}(t+ int_{h(t}^t x(s,d_s R(t,s - int_{g(t}^t x(s,d_s T(t,s=0, $$ where $R(t,s$, $T(t,s$ are nonnegative nondecreasing in $s$ for any $t$, $$ R(t,h(t=T(t,g(t=0, quad R(t,s geq T(t,s. $$ We establish a connection between non-oscillation of this differential equation and the corresponding differential inequalities, and between positiveness of the fundamental function and the existence of a nonnegative solution for a nonlinear integral inequality that constructed explicitly. We also present comparison theorems, and explicit non-oscillation and oscillation results. In a separate publication (part II, we will consider applications of this theory to differential equations with several concentrated delays, integrodifferential, and mixed equations.
International Nuclear Information System (INIS)
Brett, Tobias; Galla, Tobias
2014-01-01
We present a heuristic derivation of Gaussian approximations for stochastic chemical reaction systems with distributed delay. In particular, we derive the corresponding chemical Langevin equation. Due to the non-Markovian character of the underlying dynamics, these equations are integro-differential equations, and the noise in the Gaussian approximation is coloured. Following on from the chemical Langevin equation, a further reduction leads to the linear-noise approximation. We apply the formalism to a delay variant of the celebrated Brusselator model, and show how it can be used to characterise noise-driven quasi-cycles, as well as noise-triggered spiking. We find surprisingly intricate dependence of the typical frequency of quasi-cycles on the delay period
Brett, Tobias; Galla, Tobias
2014-03-28
We present a heuristic derivation of Gaussian approximations for stochastic chemical reaction systems with distributed delay. In particular, we derive the corresponding chemical Langevin equation. Due to the non-Markovian character of the underlying dynamics, these equations are integro-differential equations, and the noise in the Gaussian approximation is coloured. Following on from the chemical Langevin equation, a further reduction leads to the linear-noise approximation. We apply the formalism to a delay variant of the celebrated Brusselator model, and show how it can be used to characterise noise-driven quasi-cycles, as well as noise-triggered spiking. We find surprisingly intricate dependence of the typical frequency of quasi-cycles on the delay period.
Traveling waves in lattice differential equations with distributed maturation delay
Directory of Open Access Journals (Sweden)
Hui-Ling Niu
2013-07-01
Full Text Available In this paper we derive a lattice model with infinite distributed delay to describe the growth of a single-species population in a 2D patchy environment with infinite number of patches connected locally by diffusion and global interaction. We consider the existence of traveling wave solutions when the birth rate is large enough that each patch can sustain a positive equilibrium. When the birth function is monotone, we prove that there exists a traveling wave solution connecting two equilibria with wave speed $c>c^*(\\theta$ by using the monotone iterative method and super and subsolution technique, where $\\theta\\in [0,2\\pi]$ is any fixed direction of propagation. When the birth function is non-monotone, we prove the existence of non-trivial traveling wave solutions by constructing two auxiliary systems satisfying quasi-monotonicity.
Zero singularities of codimension two and three in delay differential equations
International Nuclear Information System (INIS)
Campbell, Sue Ann; Yuan Yuan
2008-01-01
We give conditions under which a general class of delay differential equations has a point of Bogdanov–Takens or a triple zero bifurcation. We show how a centre manifold projection of the delay equations reduces the dynamics to two- or three-dimensional systems of ordinary differential equations. We put these equations in normal form and determine how the coefficients of the normal forms depend on the original parameters in the model. Finally we apply our results to two neural models and compare the predictions of the theory with numerical bifurcation analysis of the full equations. One model involves a transcritical bifurcation, hence we derive and analyse the appropriate unfoldings for this case
Integrodifferential equations and delay models in population dynamics
Cushing, Jim M
1977-01-01
These notes are, for the most part, the result of a course I taught at the University of Arizona during the Spring of 1977. Their main purpose is to inves tigate the effect that delays (of Volterra integral type) have when placed in the differential models of mathematical ecology, as far as stability of equilibria and the nature of oscillations of species densities are concerned. A secondary pur pose of the course out of which they evolved was to give students an (at least elementary) introduction to some mathematical modeling in ecology as well as to some purely mathematical subjects, such as stability theory for integrodifferentia1 systems, bifurcation theory, and some simple topics in perturbation theory. The choice of topics of course reflects my personal interests; and while these notes were not meant to exhaust the topics covered, I think they and the list of refer ences come close to covering the literature to date, as far as integrodifferentia1 models in ecology are concerned. I would like to th...
Li, Xiaodi; Shen, Jianhua; Akca, Haydar; Rakkiyappan, R.
2018-04-01
We introduce the Razumikhin technique to comparison principle and establish some comparison results for impulsive functional differential equations (IFDEs) with infinite delays, where the infinite delays may be infinite time-varying delays or infinite distributed delays. The idea is, under the help of Razumikhin technique, to reduce the study of IFDEs with infinite delays to the study of scalar impulsive differential equations (IDEs) in which the solutions are easy to deal with. Based on the comparison principle, we study the qualitative properties of IFDEs with infinite delays , which include stability, asymptotic stability, exponential stability, practical stability, boundedness, etc. It should be mentioned that the developed results in this paper can be applied to IFDEs with not only infinite delays but also persistent impulsive perturbations. Moreover, even for the special cases of non-impulsive effects or/and finite delays, the criteria prove to be simpler and less conservative than some existing results. Finally, two examples are given to illustrate the effectiveness and advantages of the proposed results.
Approximate Reasoning with Fuzzy Booleans
van den Broek, P.M.; Noppen, J.A.R.
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp
Razumikhin-type stability criteria for differential equations with delayed impulses
Directory of Open Access Journals (Sweden)
Qing Wang
2013-01-01
Full Text Available This paper studies stability problems of general impulsive differential equations where time delays occur in both differential and difference equations. Based on the method of Lyapunov functions, Razumikhin technique and mathematical induction, several stability criteria are obtained for differential equations with delayed impulses. Our results show that some systems with delayed impulses may be exponentially stabilized by impulses even if the system matrices are unstable. Some less restrictive sufficient conditions are also given to keep the good stability property of systems subject to certain type of impulsive perturbations. Examples with numerical simulations are discussed to illustrate the theorems. Our results may be applied to complex problems where impulses depend on both current and past states.
Oscillation criteria for third order nonlinear delay differential equations with damping
Directory of Open Access Journals (Sweden)
Said R. Grace
2015-01-01
Full Text Available This note is concerned with the oscillation of third order nonlinear delay differential equations of the form \\[\\label{*} \\left( r_{2}(t\\left( r_{1}(ty^{\\prime}(t\\right^{\\prime}\\right^{\\prime}+p(ty^{\\prime}(t+q(tf(y(g(t=0.\\tag{\\(\\ast\\}\\] In the papers [A. Tiryaki, M. F. Aktas, Oscillation criteria of a certain class of third order nonlinear delay differential equations with damping, J. Math. Anal. Appl. 325 (2007, 54-68] and [M. F. Aktas, A. Tiryaki, A. Zafer, Oscillation criteria for third order nonlinear functional differential equations, Applied Math. Letters 23 (2010, 756-762], the authors established some sufficient conditions which insure that any solution of equation (\\(\\ast\\ oscillates or converges to zero, provided that the second order equation \\[\\left( r_{2}(tz^{\\prime }(t\\right^{\\prime}+\\left(p(t/r_{1}(t\\right z(t=0\\tag{\\(\\ast\\ast\\}\\] is nonoscillatory. Here, we shall improve and unify the results given in the above mentioned papers and present some new sufficient conditions which insure that any solution of equation (\\(\\ast\\ oscillates if equation (\\(\\ast\\ast\\ is nonoscillatory. We also establish results for the oscillation of equation (\\(\\ast\\ when equation (\\(\\ast\\ast\\ is oscillatory.
Estimation of delays and other parameters in nonlinear functional differential equations
Banks, H. T.; Lamm, P. K. D.
1983-01-01
A spline-based approximation scheme for nonlinear nonautonomous delay differential equations is discussed. Convergence results (using dissipative type estimates on the underlying nonlinear operators) are given in the context of parameter estimation problems which include estimation of multiple delays and initial data as well as the usual coefficient-type parameters. A brief summary of some of the related numerical findings is also given.
Rebenda, Josef; Šmarda, Zdeněk
2017-07-01
In the paper, we propose a correct and efficient semi-analytical approach to solve initial value problem for systems of functional differential equations with delay. The idea is to combine the method of steps and differential transformation method (DTM). In the latter, formulas for proportional arguments and nonlinear terms are used. An example of using this technique for a system with constant and proportional delays is presented.
Cracking chaos-based encryption systems ruled by nonlinear time delay differential equations
International Nuclear Information System (INIS)
Udaltsov, Vladimir S.; Goedgebuer, Jean-Pierre; Larger, Laurent; Cuenot, Jean-Baptiste; Levy, Pascal; Rhodes, William T.
2003-01-01
We report that signal encoding with high-dimensional chaos produced by delayed feedback systems with a strong nonlinearity can be broken. We describe the procedure and illustrate the method with chaotic waveforms obtained from a strongly nonlinear optical system that we used previously to demonstrate signal encryption/decryption with chaos in wavelength. The method can be extended to any systems ruled by nonlinear time-delayed differential equations
One-dimensional unstable eigenfunction and manifold computations in delay differential equations
International Nuclear Information System (INIS)
Green, Kirk; Krauskopf, Bernd; Engelborghs, Koen
2004-01-01
In this paper we present a new numerical technique for computing the unstable eigenfunctions of a saddle periodic orbit in a delay differential equation. This is used to obtain the necessary starting data for an established algorithm for computing one-dimensional (1D) unstable manifolds of an associated saddle fixed point of a suitable Poincare map. To illustrate our method, we investigate an intermittent transition to chaos in a delay system describing a semiconductor laser subject to phase-conjugate feedback
Geometric Operators on Boolean Functions
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
Huang, Rui; Jin, Chunhua; Mei, Ming; Yin, Jingxue
2018-01-01
This paper deals with the existence and stability of traveling wave solutions for a degenerate reaction-diffusion equation with time delay. The degeneracy of spatial diffusion together with the effect of time delay causes us the essential difficulty for the existence of the traveling waves and their stabilities. In order to treat this case, we first show the existence of smooth- and sharp-type traveling wave solutions in the case of c≥c^* for the degenerate reaction-diffusion equation without delay, where c^*>0 is the critical wave speed of smooth traveling waves. Then, as a small perturbation, we obtain the existence of the smooth non-critical traveling waves for the degenerate diffusion equation with small time delay τ >0 . Furthermore, we prove the global existence and uniqueness of C^{α ,β } -solution to the time-delayed degenerate reaction-diffusion equation via compactness analysis. Finally, by the weighted energy method, we prove that the smooth non-critical traveling wave is globally stable in the weighted L^1 -space. The exponential convergence rate is also derived.
Iterative method for obtaining the prompt and delayed alpha-modes of the diffusion equation
International Nuclear Information System (INIS)
Singh, K.P.; Degweker, S.B.; Modak, R.S.; Singh, Kanchhi
2011-01-01
Highlights: → A method for obtaining α-modes of the neutron diffusion equation has been developed. → The difference between the prompt and delayed modes is more pronounced for the higher modes. → Prompt and delayed modes differ more in reflector region. - Abstract: Higher modes of the neutron diffusion equation are required in some applications such as second order perturbation theory, and modal kinetics. In an earlier paper we had discussed a method for computing the α-modes of the diffusion equation. The discussion assumed that all neutrons are prompt. The present paper describes an extension of the method for finding the α-modes of diffusion equation with the inclusion of delayed neutrons. Such modes are particularly suitable for expanding the time dependent flux in a reactor for describing transients in a reactor. The method is illustrated by applying it to a three dimensional heavy water reactor model problem. The problem is solved in two and three neutron energy groups and with one and six delayed neutron groups. The results show that while the delayed α-modes are similar to λ-modes they are quite different from prompt modes. The difference gets progressively larger as we go to higher modes.
Gaudreault, Mathieu; Drolet, François; Viñals, Jorge
2010-11-01
Analytical expressions for pitchfork and Hopf bifurcation thresholds are given for a nonlinear stochastic differential delay equation with feedback. Our results assume that the delay time τ is small compared to other characteristic time scales, not a significant limitation close to the bifurcation line. A pitchfork bifurcation line is found, the location of which depends on the conditional average , where x(t) is the dynamical variable. This conditional probability incorporates the combined effect of fluctuation correlations and delayed feedback. We also find a Hopf bifurcation line which is obtained by a multiple scale expansion around the oscillatory solution near threshold. We solve the Fokker-Planck equation associated with the slowly varying amplitudes and use it to determine the threshold location. In both cases, the predicted bifurcation lines are in excellent agreement with a direct numerical integration of the governing equations. Contrary to the known case involving no delayed feedback, we show that the stochastic bifurcation lines are shifted relative to the deterministic limit and hence that the interaction between fluctuation correlations and delay affect the stability of the solutions of the model equation studied.
Singular Hopf bifurcation in a differential equation with large state-dependent delay.
Kozyreff, G; Erneux, T
2014-02-08
We study the onset of sustained oscillations in a classical state-dependent delay (SDD) differential equation inspired by control theory. Owing to the large delays considered, the Hopf bifurcation is singular and the oscillations rapidly acquire a sawtooth profile past the instability threshold. Using asymptotic techniques, we explicitly capture the gradual change from nearly sinusoidal to sawtooth oscillations. The dependence of the delay on the solution can be either linear or nonlinear, with at least quadratic dependence. In the former case, an asymptotic connection is made with the Rayleigh oscillator. In the latter, van der Pol's equation is derived for the small-amplitude oscillations. SDD differential equations are currently the subject of intense research in order to establish or amend general theorems valid for constant-delay differential equation, but explicit analytical construction of solutions are rare. This paper illustrates the use of singular perturbation techniques and the unusual way in which solvability conditions can arise for SDD problems with large delays.
Modeling the Synchrotron: An Exploration of Delay-Coupled Nonlinear Mathieu Equations
Bernstein, Alexander
A synchrotron is a circular particle accelerator where beams of electrons are maintained at high velocity. Each beam contains clusters of electrons called "bunches," and we model the vertical displacement of each bunch as simple harmonic motion with parametric excitation, i.e. the Mathieu equation. Different types of coupling are accounted for, including one that only takes effect after one orbit, which we model using delay terms; the resulting model is a system of delay-differential equations. Nonlinear and damping terms are also included to make the model more realistic and the dynamics more rich. Variations of this core model are examined using perturbation methods and checked against numerical integration.
A modified van der Pol equation with delay in a description of the heart action
Directory of Open Access Journals (Sweden)
Zduniak Beata
2014-12-01
Full Text Available In this paper, a modified van der Pol equation is considered as a description of the heart action. This model has a number of interesting properties allowing reconstruction of phenomena observed in physiological experiments as well as in Holter electrocardiographic recordings. Our aim is to study periodic solutions of the modified van der Pol equation and take into consideration the influence of feedback and delay which occur in the normal heart action mode as well as in pathological modes. Usage of certain values for feedback and delay parameters allows simulating the heart action when an accessory conducting pathway is present (Wolff-Parkinson-White syndrome.
On Delay-Independent Criteria for Oscillation of Higher-Order Functional Differential Equations
Directory of Open Access Journals (Sweden)
Yuangong Sun
2011-01-01
Full Text Available We investigate the oscillation of the following higher-order functional differential equation: x(n(t+q(t|x(t-τ|λ-1x(t-τ=e(t, where q(t and e(t are continuous functions on [t0,∞, 1>λ>0 and τ≠0 are constants. Unlike most of delay-dependent oscillation results in the literature, two delay-independent oscillation criteria for the equation are established in both the case τ>0 and the case τ<0 under the assumption that the potentials q(t and e(t change signs on [t0,∞.
Boundary layer phenomena for differential-delay equations with state-dependent time lags: III
Mallet-Paret, John; Nussbaum, Roger D.
We consider a class of singularly perturbed delay-differential equations of the form ɛ ẋ(t)=f(x(t),x(t-r)), where r= r( x( t)) is a state-dependent delay. We study the asymptotic shape, as ɛ→0, of slowly oscillating periodic solutions. In particular, we show that the limiting shape of such solutions can be explicitly described by the solution of a pair of so-called max-plus equations. We are able thereby to characterize both the regular parts of the solution graph and the internal transition layers arising from the singular perturbation structure.
Global dynamics of a nonlocal delayed reaction-diffusion equation on a half plane
Hu, Wenjie; Duan, Yueliang
2018-04-01
We consider a delayed reaction-diffusion equation with spatial nonlocality on a half plane that describes population dynamics of a two-stage species living in a semi-infinite environment. A Neumann boundary condition is imposed accounting for an isolated domain. To describe the global dynamics, we first establish some a priori estimate for nontrivial solutions after investigating asymptotic properties of the nonlocal delayed effect and the diffusion operator, which enables us to show the permanence of the equation with respect to the compact open topology. We then employ standard dynamical system arguments to establish the global attractivity of the nontrivial equilibrium. The main results are illustrated by the diffusive Nicholson's blowfly equation and the diffusive Mackey-Glass equation.
A modified van der Pol equation with delay in a description of the heart action
Zduniak Beata; Bodnar Marek; Foryś Urszula
2014-01-01
In this paper, a modified van der Pol equation is considered as a description of the heart action. This model has a number of interesting properties allowing reconstruction of phenomena observed in physiological experiments as well as in Holter electrocardiographic recordings. Our aim is to study periodic solutions of the modified van der Pol equation and take into consideration the influence of feedback and delay which occur in the normal heart action mode as well as in pathological modes. U...
Semigroup Approach to Semilinear Partial Functional Differential Equations with Infinite Delay
Directory of Open Access Journals (Sweden)
Hassane Bouzahir
2007-02-01
Full Text Available We describe a semigroup of abstract semilinear functional differential equations with infinite delay by the use of the Crandall Liggett theorem. We suppose that the linear part is not necessarily densely defined but satisfies the resolvent estimates of the Hille-Yosida theorem. We clarify the properties of the phase space ensuring equivalence between the equation under investigation and the nonlinear semigroup.
Boundary layer phenomena for differential-delay equations with state-dependent time lags, I.
Mallet-Paret, John; Nussbaum, Roger D.
1992-11-01
In this paper we begin a study of the differential-delay equation \\varepsilon x'(t) = - x(t) + f(x(t - r)), r = r(x(t)) . We prove the existence of periodic solutions for 0equations. In a companion paper these results will be used to investigate the limiting profile and corresponding boundary layer phenomena for periodic solutions as ɛ approaches zero.
On the method of solution of the differential-delay Toda equation
Villarroel, Javier; Ablowitz, Mark J.
1993-09-01
The method of solution of the Toda differential-delay equation, which is a reduction of the Toda equation in 2+1 dimensions, is described. An important feature of the solution process is to obtain and study a novel Riemann-Hilbert problem. The latter problem requires factorization across an infinite number of strips with a suitable branching structure. Explicit soliton solutions are given.
Directory of Open Access Journals (Sweden)
Hua Yang
2012-01-01
Full Text Available We are concerned with the stochastic differential delay equations with Poisson jump and Markovian switching (SDDEsPJMSs. Most SDDEsPJMSs cannot be solved explicitly as stochastic differential equations. Therefore, numerical solutions have become an important issue in the study of SDDEsPJMSs. The key contribution of this paper is to investigate the strong convergence between the true solutions and the numerical solutions to SDDEsPJMSs when the drift and diffusion coefficients are Taylor approximations.
International Nuclear Information System (INIS)
Klosek, M.M.
2004-01-01
We study effects of noisy and deterministic perturbations on oscillatory solutions to delay differential equations. We develop the multiscale technique and derive amplitude equations for noisy oscillations near a critical delay. We investigate effects of additive and multiplicative noise. We show that if the magnitudes of noise and deterministic perturbations are balanced, then the oscillatory behavior persists for long times being sustained by the noise. We illustrate the technique and its results on linear and logistic delay equations. (author)
An accurate solution of point reactor neutron kinetics equations of multi-group of delayed neutrons
International Nuclear Information System (INIS)
Yamoah, S.; Akaho, E.H.K.; Nyarko, B.J.B.
2013-01-01
Highlights: ► Analytical solution is proposed to solve the point reactor kinetics equations (PRKE). ► The method is based on formulating a coefficient matrix of the PRKE. ► The method was applied to solve the PRKE for six groups of delayed neutrons. ► Results shows good agreement with other traditional methods in literature. ► The method is accurate and efficient for solving the point reactor kinetics equations. - Abstract: The understanding of the time-dependent behaviour of the neutron population in a nuclear reactor in response to either a planned or unplanned change in the reactor conditions is of great importance to the safe and reliable operation of the reactor. In this study, an accurate analytical solution of point reactor kinetics equations with multi-group of delayed neutrons for specified reactivity changes is proposed to calculate the change in neutron density. The method is based on formulating a coefficient matrix of the homogenous differential equations of the point reactor kinetics equations and calculating the eigenvalues and the corresponding eigenvectors of the coefficient matrix. A small time interval is chosen within which reactivity relatively stays constant. The analytical method was applied to solve the point reactor kinetics equations with six-groups delayed neutrons for a representative thermal reactor. The problems of step, ramp and temperature feedback reactivities are computed and the results compared with other traditional methods. The comparison shows that the method presented in this study is accurate and efficient for solving the point reactor kinetics equations of multi-group of delayed neutrons
Directory of Open Access Journals (Sweden)
Rong Cheng
2010-01-01
Full Text Available The existence of multiple periodic solutions of the following differential delay equation (=−((− is established by applying variational approaches directly, where ∈ℝ, ∈(ℝ,ℝ and >0 is a given constant. This means that we do not need to use Kaplan and Yorke's reduction technique to reduce the existence problem of the above equation to an existence problem for a related coupled system. Such a reduction method introduced first by Kaplan and Yorke in (1974 is often employed in previous papers to study the existence of periodic solutions for the above equation and its similar ones by variational approaches.
Stabilization of the Wave Equation with Boundary Time-Varying Delay
Directory of Open Access Journals (Sweden)
Hao Li
2014-01-01
Full Text Available We study the stabilization of the wave equation with variable coefficients in a bounded domain and a time-varying delay term in the time-varying, weakly nonlinear boundary feedbacks. By the Riemannian geometry methods and a suitable assumption of nonlinearity, we obtain the uniform decay of the energy of the closed loop system.
Semilinear functional differential equations of fractional order with state-dependent delay
Mohamed Abdalla Darwish; Sotiris K. Ntouyas
2009-01-01
In this paper we study the existence of solutions for the initial value problem for semilinear functional differential equations of fractional order with state-dependent delay. The nonlinear alternative of Leray-Schauder type is the main tool in our analysis.
Semilinear functional differential equations of fractional order with state-dependent delay
Directory of Open Access Journals (Sweden)
Mohamed Abdalla Darwish
2009-03-01
Full Text Available In this paper we study the existence of solutions for the initial value problem for semilinear functional differential equations of fractional order with state-dependent delay. The nonlinear alternative of Leray-Schauder type is the main tool in our analysis.
Energy Technology Data Exchange (ETDEWEB)
Cui Jing [College of Information Science and Technology, Donghua University, 2999 North Renmin Rd, Songjiang, Shanghai 201620 (China); Yan Litan, E-mail: jcui123@126.com, E-mail: litanyan@hotmail.com [Department of Mathematics, College of Science, Donghua University, 2999 North Renmin Rd, Songjiang, Shanghai 201620 (China)
2011-08-19
This paper is concerned with the existence of mild solutions for a class of fractional neutral stochastic integro-differential equations with infinite delay in Hilbert spaces. A sufficient condition for the existence is obtained under non-Lipschitz conditions by means of Sadovskii's fixed point theorem. An example is given to illustrate the theory.
Directory of Open Access Journals (Sweden)
Selma Baghli
2009-02-01
Full Text Available In this paper sufficient conditions are given ensuring the controllability of mild solutions defined on a bounded interval for two classes of first order semilinear functional and neutral functional differential equations involving evolution operators when the delay is infinite using the nonlinear alternative of Leray-Schauder type.
Directory of Open Access Journals (Sweden)
Mouffak Benchohra
2008-05-01
Full Text Available This article shows sufficient conditions for the existence of mild solutions, on the positive half-line, for two classes of first-order functional and neutral functional perturbed differential evolution equations with infinite delay. Our main tools are: the nonlinear alternative proved by Avramescu for the sum of contractions and completely continuous maps in Frechet spaces, and the semigroup theory.
Integral equations of fractional order with multiple time delays in Banach spaces
Directory of Open Access Journals (Sweden)
Mouffak Benchohra
2012-04-01
Full Text Available In this article, we give sufficient conditions for the existence of solutions for an integral equation of fractional order with multiple time delays in Banach spaces. Our main tool is a fixed point theorem of Monch type associated with measures of noncompactness. Our results are illustrated by an example.
FUNCTIONAL DIFFERENTIAL EQUATIONS WITH STATE-DEPENDENT DELAY AND RANDOM EFFECTS
Directory of Open Access Journals (Sweden)
AMEL BENAISSA
2015-07-01
Full Text Available In this work we study the existence of mild solutions of a functional differential equation with delay and random effects. We use a random fixed point theorem with stochastic domain to show the existence of mild random solutions.
Some Properties of Solutions of a Functional-Differential Equation of Second Order with Delay
Directory of Open Access Journals (Sweden)
Veronica Ana Ilea
2014-01-01
Full Text Available Existence, uniqueness, data dependence (monotony, continuity, and differentiability with respect to parameter, and Ulam-Hyers stability results for the solutions of a system of functional-differential equations with delays are proved. The techniques used are Perov’s fixed point theorem and weakly Picard operator theory.
Existence of periodic solutions for Rayleigh equations with state-dependent delay
Directory of Open Access Journals (Sweden)
Jehad O. Alzabut
2012-05-01
Full Text Available We establish sufficient conditions for the existence of periodic solutions for a Rayleigh-type equation with state-dependent delay. Our approach is based on the continuation theorem in degree theory, and some analysis techniques. An example illustrates that our approach to this problem is new.
Myshkis type oscillation criteria for second-order linear delay differential equations
Czech Academy of Sciences Publication Activity Database
Opluštil, Z.; Šremr, Jiří
2015-01-01
Roč. 178, č. 1 (2015), s. 143-161 ISSN 0026-9255 Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillation criteria Subject RIV: BA - General Mathematics Impact factor: 0.664, year: 2015 http://link.springer.com/article/10.1007%2Fs00605-014-0719-y
Oscillation and asymptotic stability of a delay differential equation with Richard's nonlinearity
Directory of Open Access Journals (Sweden)
Leonid Berezansky
2005-04-01
Full Text Available We obtain sufficient conditions for oscillation of solutions, and for asymptotical stability of the positive equilibrium, of the scalar nonlinear delay differential equation $$ frac{dN}{dt} = r(tN(tBig[a-Big(sum_{k=1}^m b_k N(g_k(tBig^{gamma}Big], $$ where $ g_k(tleq t$.
New stability and boundedness results to Volterra integro-differential equations with delay
Directory of Open Access Journals (Sweden)
Cemil Tunç
2016-04-01
Full Text Available In this paper, we consider a certain non-linear Volterra integro-differential equations with delay. We study stability and boundedness of solutions. The technique of proof involves defining suitable Lyapunov functionals. Our results improve and extend the results obtained in literature.
Oscillation Criteria of First Order Neutral Delay Differential Equations with Variable Coefficients
Directory of Open Access Journals (Sweden)
Fatima N. Ahmed
2013-01-01
Full Text Available Some new oscillation criteria are given for first order neutral delay differential equations with variable coefficients. Our results generalize and extend some of the well-known results in the literature. Some examples are considered to illustrate the main results.
Directory of Open Access Journals (Sweden)
Azizollah Babakhani
2010-01-01
Full Text Available We investigate the existence and uniqueness of positive solution for system of nonlinear fractional differential equations in two dimensions with delay. Our analysis relies on a nonlinear alternative of Leray-Schauder type and Krasnoselskii's fixed point theorem in a cone.
Directory of Open Access Journals (Sweden)
Erdal Korkmaz
2017-06-01
Full Text Available Abstract In this paper, we give sufficient conditions for the boundedness, uniform asymptotic stability and square integrability of the solutions to a certain fourth order non-autonomous differential equations with delay by using Lyapunov’s second method. The results obtained essentially improve, include and complement the results in the literature.
Yousef, Hamood Mohammed; Ismail, Ahmad Izani
2017-11-01
In this paper, Laplace Adomian decomposition method (LADM) was applied to solve Delay differential equations with Boundary Value Problems. The solution is in the form of a convergent series which is easy to compute. This approach is tested on two test problem. The findings obtained exhibit the reliability and efficiency of the proposed method.
Sun, Leping
2016-01-01
This paper is concerned with the backward differential formula or BDF methods for a class of nonlinear 2-delay differential algebraic equations. We obtain two sufficient conditions under which the methods are stable and asymptotically stable. At last, examples show that our methods are true.
Korkmaz, Erdal
2017-01-01
In this paper, we give sufficient conditions for the boundedness, uniform asymptotic stability and square integrability of the solutions to a certain fourth order non-autonomous differential equations with delay by using Lyapunov's second method. The results obtained essentially improve, include and complement the results in the literature.
Some properties of solutions of a functional-differential equation of second order with delay.
Ilea, Veronica Ana; Otrocol, Diana
2014-01-01
Existence, uniqueness, data dependence (monotony, continuity, and differentiability with respect to parameter), and Ulam-Hyers stability results for the solutions of a system of functional-differential equations with delays are proved. The techniques used are Perov's fixed point theorem and weakly Picard operator theory.
One-dimensional unstable eigenfunction and manifold computations in delay differential equations
Green, K.; Krauskopf, B.; Engelborghs, K.
2004-01-01
In this paper we present a new numerical technique for computing the unstable eigenfunctions of a saddle periodic orbit in a delay differential equation. This is used to obtain the necessary starting data for an established algorithm for computing one-dimensional (1D) unstable manifolds of an
International Nuclear Information System (INIS)
Agarwal, Ravi P.; Baghli, Selma; Benchohra, Mouffak
2009-01-01
The controllability of mild solutions defined on the semi-infinite positive real interval for two classes of first order semilinear functional and neutral functional differential evolution equations with infinite delay is studied in this paper. Our results are obtained using a recent nonlinear alternative due to Avramescu for sum of compact and contraction operators in Frechet spaces, combined with the semigroup theory
Fixed Points and Stability in Neutral Stochastic Differential Equations with Variable Delays
Directory of Open Access Journals (Sweden)
Chang-Wen Zhao
2008-07-01
Full Text Available We consider the mean square asymptotic stability of a generalized linear neutral stochastic differential equation with variable delays by using the fixed point theory. An asymptotic mean square stability theorem with a necessary and sufficient condition is proved, which improves and generalizes some results due to Burton, Zhang and Luo. Two examples are also given to illustrate our results.
Chen, Guiling
2013-01-01
This thesis studies asymptotic behavior and stability of determinsitic and stochastic delay differential equations. The approach used in this thesis is based on fixed point theory, which does not resort to any Liapunov function or Liapunov functional. The main contribution of this thesis is to study
Some oscillation criteria for the second-order linear delay differential equation
Czech Academy of Sciences Publication Activity Database
Opluštil, Z.; Šremr, Jiří
2011-01-01
Roč. 136, č. 2 (2011), s. 195-204 ISSN 0862-7959 Institutional research plan: CEZ:AV0Z10190503 Keywords : second-order linear differential equation with a delay * oscillatory solution Subject RIV: BA - General Mathematics http://www.dml.cz/handle/10338.dmlcz/141582
Statistical inference for discrete-time samples from affine stochastic delay differential equations
DEFF Research Database (Denmark)
Küchler, Uwe; Sørensen, Michael
2013-01-01
Statistical inference for discrete time observations of an affine stochastic delay differential equation is considered. The main focus is on maximum pseudo-likelihood estimators, which are easy to calculate in practice. A more general class of prediction-based estimating functions is investigated...
Stability and oscillation of two coupled Duffing equations with time delay state feedback
International Nuclear Information System (INIS)
El-Bassiouny, A F
2006-01-01
This paper presents an analytical study of the simultaneous principal parametric resonances of two coupled Duffing equations with time delay state feedback. The concept of an equivalent damping related to the delay feedback is proposed and the appropriate choice of the feedback gains and the time delay is discussed from the viewpoint of vibration control. The method of multiple scales is used to determine a set of ordinary differential equations governing the modulation of the amplitudes and phases of the two modes. The first order approximation of the resonances are derived and the effect of time delay on the resonances is investigated. The fixed points correspond to a periodic motion for the starting system and we show the frequency-response curves. We analyse the effect of time delay and the other different parameters on these oscillations. The stability of the fixed points is examined by using the variational method. Numerical solutions are carried out and graphical representations of the results are presented and discussed. Increasing in the time delay τ given decreasing and increasing in the regions of definition and stability respectively and the first mode has decreased magnitudes. The multivalued solutions disappear when decreasing the coefficients of cubic nonlinearities of the second mode α 3 and the detuning parameter σ 2 respectively. Both modes shift to the left for increasing linear feedback gain v 1 and the coefficient of parametric excitation f 1 respectively
Tweten, Dennis J.; Lipp, Genevieve M.; Khasawneh, Firas A.; Mann, Brian P.
2012-08-01
This paper provides the first comparison of the semi-discretization, spectral element, and Legendre collocation methods. Each method is a technique for solving delay differential equations (DDEs) as well as determining regions of stability in the DDE parameter space. We present the necessary concepts, assumptions, and equations required to implement each method. To compare the relative performance between the methods, the convergence rate and computational time for each method is compared in three numerical studies consisting of a ship stability example, the delayed damped Mathieu equation, and a helicopter rotor control problem. For each study, we present one or more stability diagrams in the parameter space and one or more convergence plots. The spectral element method is demonstrated to have the quickest convergence rate while the Legendre collocation method requires the least computational time. The semi-discretization method on the other hand has both the slowest convergence rate and requires the most computational time.
Dynamics of a delay differential equation model of hepatitis B virus infection.
Gourley, Stephen A; Kuang, Yang; Nagy, John D
2008-04-01
We formulate and systematically study the global dynamics of a simple model of hepatitis B virus in terms of delay differential equations. This model has two important and novel features compared to the well-known basic virus model in the literature. Specifically, it makes use of the more realistic standard incidence function and explicitly incorporates a time delay in virus production. As a result, the infection reproduction number is no longer dependent on the patient liver size (number of initial healthy liver cells). For this model, the existence and the component values of the endemic steady state are explicitly dependent on the time delay. In certain biologically interesting limiting scenarios, a globally attractive endemic equilibrium can exist regardless of the time delay length.
Analyses of glass transition phenomena by solving differential equation with delay effect
International Nuclear Information System (INIS)
Takeuchi, A.; Inoue, A.
2007-01-01
A linear differential equation for the analyses of glass transition phenomena has been proposed by taking into account the delay effect due to the change in transportation of atoms near the glass transition temperature (T g ). Under the condition maintaining the order of the differential equation as the second, the non-linear differential equation proposed by Van Den Beukel and Sietsma is modified to obtain the analytic solution for a linear equation by introducing the following points: the delay effect which is described with a term of Mackey-Glass model, a concept of effective free volume (x fe eff ) and its concentration expression (C fe eff ) which correspond to the equilibrium, and an additional term associated with C fe eff . In analyzing the linear equation, Doyle's p-function was used for the integral of reaction rate with respect to temperature (T). It is found that the linear equation proposed in the present study can describe the changes in free volume (x) with increasing temperature in the dx/dT-T chart, the sharp increase in free volume at T g , and over shooting phenomena of free volume slightly above the T g , as experimentally in thermal analyses for metallic glasses. The linear solution obtained in the present study is of great importance for the analyses of the glass transition because the change in free volume with increasing temperature on heating is described with fundamental functions
International Nuclear Information System (INIS)
Frank, T.D.
2007-01-01
We present a generalized Kramers-Moyal expansion for stochastic differential equations with single and multiple delays. In particular, we show that the delay Fokker-Planck equation derived earlier in the literature is a special case of the proposed Kramers-Moyal expansion. Applications for bond pricing and a self-inhibitory neuron model are discussed
Second-order differential-delay equation to describe a hybrid bistable device
Vallee, R.; Dubois, P.; Cote, M.; Delisle, C.
1987-08-01
The problem of a dynamical system with delayed feedback, a hybrid bistable device, characterized by n response times and described by an nth-order differential-delay equation (DDE) is discussed. Starting from a linear-stability analysis of the DDE, the effects of the second-order differential terms on the position of the first bifurcation and on the frequency of the resulting self-oscillation are shown. The effects of the third-order differential terms on the first bifurcation are also considered. Experimental results are shown to support the linear analysis.
Wu, Jie; Zhan, Xi-Sheng; Zhang, Xian-He; Gao, Hong-Liang
2012-05-01
A kind of discrete logistic model with distributed delays obtained by the Euler method is investigated, where the discrete delay τ is regarded as a parameter. By analyzing the associated characteristic equation, it is found that the stability of the positive equilibrium and Hopf occurs when τ crosses some critical value. Then the explicit formulae which determine the stability, direction and other properties of the bifurcating periodic solution are derived by using the theory of normal form and center manifold. Finally, numerical simulations are performed to verify and illustrate the analytical results.
Stability with respect to initial time difference for generalized delay differential equations
Directory of Open Access Journals (Sweden)
Ravi Agarwal
2015-02-01
Full Text Available Stability with initial data difference for nonlinear delay differential equations is introduced. This type of stability generalizes the known concept of stability in the literature. It gives us the opportunity to compare the behavior of two nonzero solutions when both initial values and initial intervals are different. Several sufficient conditions for stability and for asymptotic stability with initial time difference are obtained. Lyapunov functions as well as comparison results for scalar ordinary differential equations are employed. Several examples are given to illustrate the theory.
Khader, M M
2013-10-01
In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.
SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis
International Nuclear Information System (INIS)
Worrell, R.B.
1985-01-01
Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully
Finite-dimensional global attractors for parabolic nonlinear equations with state-dependent delay
Czech Academy of Sciences Publication Activity Database
Chueshov, I.; Rezunenko, Oleksandr
2015-01-01
Roč. 14, č. 5 (2015), s. 1685-1704 ISSN 1534-0392 R&D Projects: GA ČR GAP103/12/2431 Institutional support: RVO:67985556 Keywords : Parabolic evolution equations * state-dependent delay * global attractor * finite-dimension * exponential attractor Subject RIV: BC - Control Systems Theory Impact factor: 0.926, year: 2015 http://library.utia.cas.cz/separaty/2015/AS/rezunenko-0444705.pdf
Dynamics of second order in time evolution equations with state-dependent delay
Czech Academy of Sciences Publication Activity Database
Chueshov, I.; Rezunenko, Oleksandr
123-124, č. 1 (2015), s. 126-149 ISSN 0362-546X R&D Projects: GA ČR GAP103/12/2431 Institutional support: RVO:67985556 Keywords : Second order evolution equations * State dependent delay * Nonlinear plate * Finite-dimensional attractor Subject RIV: BD - Theory of Information Impact factor: 1.125, year: 2015 http://library.utia.cas.cz/separaty/2015/AS/rezunenko-0444708.pdf
On oscillations of solutions to second-order linear delay differential equations
Czech Academy of Sciences Publication Activity Database
Opluštil, Z.; Šremr, Jiří
2013-01-01
Roč. 20, č. 1 (2013), s. 65-94 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillatory solution Subject RIV: BA - General Mathematics Impact factor: 0.340, year: 2013 http://www.degruyter.com/view/j/gmj.2013.20.issue-1/gmj-2013-0001/gmj-2013-0001. xml ?format=INT
Periodic Solutions for Duffing Type p-Laplacian Equation with Multiple Constant Delays
Directory of Open Access Journals (Sweden)
Hong Zhang
2012-01-01
Full Text Available Using inequality techniques and coincidence degree theory, new results are provided concerning the existence and uniqueness of periodic solutions for the Duffing type p-Laplacian equation with multiple constant delays of the form (φp(x′(t′+Cx′(t+g0(t,x(t+∑k=1ngk(t,x(t-τk=e(t. Moreover, an example is provided to illustrate the effectiveness of the results in this paper.
A numerical solution for a class of time fractional diffusion equations with delay
Directory of Open Access Journals (Sweden)
Pimenov Vladimir G.
2017-09-01
Full Text Available This paper describes a numerical scheme for a class of fractional diffusion equations with fixed time delay. The study focuses on the uniqueness, convergence and stability of the resulting numerical solution by means of the discrete energy method. The derivation of a linearized difference scheme with convergence order O(τ2−α+ h4 in L∞-norm is the main purpose of this study. Numerical experiments are carried out to support the obtained theoretical results.
Numerical solution of neutral functional-differential equations with proportional delays
Directory of Open Access Journals (Sweden)
Mehmet Giyas Sakar
2017-07-01
Full Text Available In this paper, homotopy analysis method is improved with optimal determination of auxiliary parameter by use of residual error function for solving neutral functional-differential equations (NFDEs with proportional delays. Convergence analysis and error estimate of method are given. Some numerical examples are solved and comparisons are made with the existing results. The numerical results show that the homotopy analysis method with residual error function is very effective and simple.
On oscillations of solutions to second-order linear delay differential equations
Czech Academy of Sciences Publication Activity Database
Opluštil, Z.; Šremr, Jiří
2013-01-01
Roč. 20, č. 1 (2013), s. 65-94 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : linear second-order delay differential equation * oscillatory solution Subject RIV: BA - General Mathematics Impact factor: 0.340, year: 2013 http://www.degruyter.com/view/j/gmj.2013.20.issue-1/gmj-2013-0001/gmj-2013-0001.xml?format=INT
Directory of Open Access Journals (Sweden)
Xiaolin Zhu
2014-01-01
Full Text Available This paper studies the T-stability of the Heun method and balanced method for solving stochastic differential delay equations (SDDEs. Two T-stable conditions of the Heun method are obtained for two kinds of linear SDDEs. Moreover, two conditions under which the balanced method is T-stable are obtained for two kinds of linear SDDEs. Some numerical examples verify the theoretical results proposed.
On time transformations for differential equations with state-dependent delay
Czech Academy of Sciences Publication Activity Database
Rezunenko, Oleksandr
2014-01-01
Roč. 12, č. 2 (2014), s. 298-307 ISSN 1895-1074 R&D Projects: GA ČR GAP103/12/2431 Institutional support: RVO:67985556 Keywords : differential equations * state-dependent delay * time transformations Subject RIV: BD - Theory of Information Impact factor: 0.578, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/rezunenko-0429130.pdf
Czech Academy of Sciences Publication Activity Database
Krisztin, T.; Rezunenko, Oleksandr
2016-01-01
Roč. 260, č. 5 (2016), s. 4454-4472 ISSN 0022-0396 R&D Projects: GA ČR GAP103/12/2431 Institutional support: RVO:67985556 Keywords : Parabolic partial differential equations * State dependent delay * Solution manifold Subject RIV: BC - Control Systems Theory Impact factor: 1.988, year: 2016 http://library.utia.cas.cz/separaty/2016/AS/rezunenko-0457879.pdf
Frank, T D; Beek, P J
2001-08-01
Recently, Küchler and Mensch [Stochastics Stochastics Rep. 40, 23 (1992)] derived exact stationary probability densities for linear stochastic delay differential equations. This paper presents an alternative derivation of these solutions by means of the Fokker-Planck approach introduced by Guillouzic [Phys. Rev. E 59, 3970 (1999); 61, 4906 (2000)]. Applications of this approach, which is argued to have greater generality, are discussed in the context of stochastic models for population growth and tracking movements.
Mono-implicit Runge Kutta schemes for singularly perturbed delay differential equations
Rihan, Fathalla A.; Al-Salti, Nasser S.
2017-09-01
In this paper, we adapt Mono-Implicit Runge-Kutta schemes for numerical approximations of singularly perturbed delay differential equations. The schemes are developed to reduce the computational cost of the fully implicit method which combine the accuracy of implicit method and efficient implementation. Numerical stability properties of the schemes are investigated. Numerical simulations are provided to show the effectiveness of the method for both stiff and non-stiff initial value problems.
International Nuclear Information System (INIS)
Kharatishvili, G L; Tadumadze, T A
2005-01-01
Variation formulae are proved for solutions of non-linear differential equations with variable delays and discontinuous initial conditions. The discontinuity of the initial condition means that at the initial moment of time the values of the initial function and the trajectory, generally speaking, do not coincide. The formulae obtained contain a new summand connected with the discontinuity of the initial condition and the variation of the initial moment.
Yousef, Hamood. M.; Ismail, A. I. B. MD.
2017-08-01
Many attempts have been presented to solve the system of Delay Differential Equations (DDE) with Initial Value Problem. As a result, it has shown difficulties when getting the solution or cannot be solved. In this paper, a Variational Iteration Method is employed to find out an approximate solution for the system of DDE with initial value problems. The example illustrates convenient and an efficiency comparison with the exact solution.
Existence and asymptotic stability of a viscoelastic wave equation with a delay
Kirane, Mokhtar
2011-07-07
In this paper, we consider the viscoelastic wave equation with a delay term in internal feedbacks; namely, we investigate the following problem, together with initial conditions and boundary conditions of Dirichlet type. Here (x, t) ∈ Ω × (0, ∞), g is a positive real valued decreasing function and μ1, μ2 are positive constants. Under an hypothesis between the weight of the delay term in the feedback and the weight of the term without delay, using the Faedo-Galerkin approximations together with some energy estimates, we prove the global existence of the solutions. Under the same assumptions, general decay results of the energy are established via suitable Lyapunov functionals. © 2011 Springer Basel AG.
High Quality Test Pattern Generation and Boolean Satisfiability
Eggersglüß, Stephan
2012-01-01
This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT). A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects. The aim of the techniques and methodologies presented in this book is to improve SAT-based ATPG, in order to make it applicable in industrial practice. Readers will learn to improve the performance and robustness of the overall test generation process, so that the ATPG algorithm reliably will generate test patterns for most targeted faults in acceptable run time to meet the high fault coverage demands of industry. The techniques and improvements presented in this book provide the following advantages: Provides a comprehensive introduction to test generation and Boolean Satisfiability (SAT); Describes a...
Barbarossa, Maria Vittoria; Kuttler, Christina; Zinsl, Jonathan
2012-04-01
In this work we present a mathematical model for tumor growth based on the biology of the cell cycle. For an appropriate description of the effects of phase-specific drugs, it is necessary to look at the cell cycle and its phases. Our model reproduces the dynamics of three different tumor cell populations: quiescent cells, cells during the interphase and mitotic cells. Starting from a partial differential equations (PDEs) setting, a delay differential equations (DDE) model is derived for an easier and more realistic approach. Our equations also include interactions of tumor cells with immune system effectors. We investigate the model both from the analytical and the numerical point of view, give conditions for positivity of solutions and focus on the stability of the cancer-free equilibrium. Different immunotherapeutic strategies and their effects on the tumor growth are considered, as well.
Development of Boolean calculus and its application
Tapia, M. A.
1979-01-01
Formal procedures for synthesis of asynchronous sequential system using commercially available edge-sensitive flip-flops are developed. Boolean differential is defined. The exact number of compatible integrals of a Boolean differential were calculated.
Directory of Open Access Journals (Sweden)
Diem Dang Huan
2015-12-01
Full Text Available The current paper is concerned with the controllability of nonlocal second-order impulsive neutral stochastic functional integro-differential equations with infinite delay and Poisson jumps in Hilbert spaces. Using the theory of a strongly continuous cosine family of bounded linear operators, stochastic analysis theory and with the help of the Banach fixed point theorem, we derive a new set of sufficient conditions for the controllability of nonlocal second-order impulsive neutral stochastic functional integro-differential equations with infinite delay and Poisson jumps. Finally, an application to the stochastic nonlinear wave equation with infinite delay and Poisson jumps is given.
A mathematical model of a crocodilian population using delay-differential equations.
Gallegos, Angela; Plummer, Tenecia; Uminsky, David; Vega, Cinthia; Wickman, Clare; Zawoiski, Michael
2008-11-01
The crocodilia have multiple interesting characteristics that affect their population dynamics. They are among several reptile species which exhibit temperature-dependent sex determination (TSD) in which the temperature of egg incubation determines the sex of the hatchlings. Their life parameters, specifically birth and death rates, exhibit strong age-dependence. We develop delay-differential equation (DDE) models describing the evolution of a crocodilian population. In using the delay formulation, we are able to account for both the TSD and the age-dependence of the life parameters while maintaining some analytical tractability. In our single-delay model we also find an equilibrium point and prove its local asymptotic stability. We numerically solve the different models and investigate the effects of multiple delays on the age structure of the population as well as the sex ratio of the population. For all models we obtain very strong agreement with the age structure of crocodilian population data as reported in Smith and Webb (Aust. Wild. Res. 12, 541-554, 1985). We also obtain reasonable values for the sex ratio of the simulated population.
Delay Mitigation in the Malaysian Housing Industry: A Structural Equation Modelling Approach
Directory of Open Access Journals (Sweden)
Chang Saar Chai
2015-01-01
Full Text Available The housing industry is one of the major contributors to the economy in Malaysia due to the constantly high housing demand. The housing demand has increased due to the rapid growth in population and urbanisation in the country. One of the major challenges in the housing industry is the late delivery of housing supply, which in some instances leads to sick and abandoned housing projects. Despite being extensively investigated, th in a negative impact, there is a strong need to review the housing delay mitigation measures practised in Malaysia. This paper aims to evaluate the current delay mitigation measures and its main objective is to explore the relationship between the mitigation measures and delay in housing via a Structural Equation Modelling (SEM approach. A questionnaire survey through an online survey tool was conducted across 13 states and three Federal Territories in Malaysia. The target respondents are the local authorities, developers, consultants (principal submitting persons and contractors. The findings show that 17 predictive, preventive, organisational or corrective. This paper demonstrates that preventive measures are the most influential mitigation measures for housing delivery delay.
Stability of linear delay differential equations a numerical approach with Matlab
Breda, Dimitri; Vermiglio, Rossana
2015-01-01
This book presents the authors' recent work on the numerical methods for the stability analysis of linear autonomous and periodic delay differential equations, which consist in applying pseudospectral techniques to discretize either the solution operator or the infinitesimal generator and in using the eigenvalues of the resulting matrices to approximate the exact spectra. The purpose of the book is to provide a complete and self-contained treatment, which includes the basic underlying mathematics and numerics, examples from population dynamics and engineering applications, and Matlab programs implementing the proposed numerical methods. A number of proofs is given to furnish a solid foundation, but the emphasis is on the (unifying) idea of the pseudospectral technique for the stability analysis of DDEs. It is aimed at advanced students and researchers in applied mathematics, in dynamical systems and in various fields of science and engineering, concerned with delay systems. A relevant feature of the book is t...
Multifractal chaotic attractors in a system of delay-differential equations modeling road traffic.
Safonov, Leonid A.; Tomer, Elad; Strygin, Vadim V.; Ashkenazy, Yosef; Havlin, Shlomo
2002-12-01
We study a system of delay-differential equations modeling single-lane road traffic. The cars move in a closed circuit and the system's variables are each car's velocity and the distance to the car ahead. For low and high values of traffic density the system has a stable equilibrium solution, corresponding to the uniform flow. Gradually decreasing the density from high to intermediate values we observe a sequence of supercritical Hopf bifurcations forming multistable limit cycles, corresponding to flow regimes with periodically moving traffic jams. Using an asymptotic technique we find approximately small limit cycles born at Hopf bifurcations and numerically preform their global continuations with decreasing density. For sufficiently large delay the system passes to chaos following the Ruelle-Takens-Newhouse scenario (limit cycles-two-tori-three-tori-chaotic attractors). We find that chaotic and nonchaotic attractors coexist for the same parameter values and that chaotic attractors have a broad multifractal spectrum. (c) 2002 American Institute of Physics.
Directory of Open Access Journals (Sweden)
Xue-Lian Jin
2017-01-01
Full Text Available The exponential stability of the monotubular heat exchanger equation with boundary observation possessing a time delay and inner control was investigated. Firstly, the close-loop system was translated into an abstract Cauchy problem in the suitable state space. A uniformly bounded C0-semigroup generated by the close-loop system, which implies that the unique solution of the system exists, was shown. Secondly, the spectrum configuration of the closed-loop system was analyzed and the eventual differentiability and the eventual compactness of the semigroup were shown by the resolvent estimates on some resolvent sets. This implies that the spectrum-determined growth assumption holds. Finally, a sufficient condition, which is related to the physical parameters in the system and is independent of the time delay, of the exponential stability of the closed-loop system was given.
Energy Technology Data Exchange (ETDEWEB)
Balanov, A.G.; Janson, N.B. E-mail: n.janson@lancaster.ac.uk; McClintock, P.V.E.; Tucker, R.W.; Wang, C.H.T
2003-01-01
Using techniques from dynamical systems analysis we explore numerically the solution space, under parametric variation, of a neutral differential delay equation that arises naturally in the Cosserat description of torsional waves on a driven drill-string.
International Nuclear Information System (INIS)
Balanov, A.G.; Janson, N.B.; McClintock, P.V.E.; Tucker, R.W.; Wang, C.H.T.
2003-01-01
Using techniques from dynamical systems analysis we explore numerically the solution space, under parametric variation, of a neutral differential delay equation that arises naturally in the Cosserat description of torsional waves on a driven drill-string
Boolean-Valued Belief Functions
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2002-01-01
Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002
Modular Decomposition of Boolean Functions
J.C. Bioch (Cor)
2002-01-01
textabstractModular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we give a uni_ed treatment of modular
2–stage stochastic Runge–Kutta for stochastic delay differential equations
Energy Technology Data Exchange (ETDEWEB)
Rosli, Norhayati; Jusoh Awang, Rahimah [Faculty of Industrial Science and Technology, Universiti Malaysia Pahang, Lebuhraya Tun Razak, 26300, Gambang, Pahang (Malaysia); Bahar, Arifah; Yeak, S. H. [Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor (Malaysia)
2015-05-15
This paper proposes a newly developed one-step derivative-free method, that is 2-stage stochastic Runge-Kutta (SRK2) to approximate the solution of stochastic delay differential equations (SDDEs) with a constant time lag, r > 0. General formulation of stochastic Runge-Kutta for SDDEs is introduced and Stratonovich Taylor series expansion for numerical solution of SRK2 is presented. Local truncation error of SRK2 is measured by comparing the Stratonovich Taylor expansion of the exact solution with the computed solution. Numerical experiment is performed to assure the validity of the method in simulating the strong solution of SDDEs.
Global existence of solutions of integral equations with delay: progressive contractions
Directory of Open Access Journals (Sweden)
Theodore Burton
2017-06-01
with initial function $\\omega$ with $\\omega (0 =L(0$ defined by $ t\\leq 0 \\implies x(t =\\omega (t$ is studied on an interval $[0,E]$ with $r(t \\geq \\alpha >0$. The interval $[0,E]$ is divided into parts by $0=T_00$ on $[0,\\infty$ we obtain a unique solution on that interval as follows. As we let $E= 1,2,\\dots$ we obtain a sequence of solutions on $[0,n]$ which we extend to $[0,\\infty$ by a horizontal line, thereby obtaining functions converging uniformly on compact sets to a solution on $[0,\\infty$. Lemma 2.1 extends progressive contractions to delay equations
Directory of Open Access Journals (Sweden)
Qi Wang
2012-01-01
Full Text Available This paper deals with the oscillations of numerical solutions for the nonlinear delay differential equations in physiological control systems. The exponential θ-method is applied to p′(t=β0ωμp(t−τ/(ωμ+pμ(t−τ−γp(t and it is shown that the exponential θ-method has the same order of convergence as that of the classical θ-method. Several conditions under which the numerical solutions oscillate are derived. Moreover, it is proven that every nonoscillatory numerical solution tends to positive equilibrium of the continuous system. Finally, the main results are illustrated with numerical examples.
A Note on a Semilinear Fractional Differential Equation of Neutral Type with Infinite Delay
Directory of Open Access Journals (Sweden)
Gisle M. Mophou
2010-01-01
Full Text Available We deal in this paper with the mild solution for the semilinear fractional differential equation of neutral type with infinite delay: Dαx(t+Ax(t=f(t,xt, t∈[0,T], x(t=ϕ(t, t∈]−∞,0], with T>0 and 0<α<1. We prove the existence (and uniqueness of solutions, assuming that −A is a linear closed operator which generates an analytic semigroup (T(tt≥0 on a Banach space 𝕏 by means of the Banach's fixed point theorem. This generalizes some recent results.
Ito, K.
1983-01-01
Approximation schemes based on Legendre-tau approximation are developed for application to parameter identification problem for delay and partial differential equations. The tau method is based on representing the approximate solution as a truncated series of orthonormal functions. The characteristic feature of the Legendre-tau approach is that when the solution to a problem is infinitely differentiable, the rate of convergence is faster than any finite power of 1/N; higher accuracy is thus achieved, making the approach suitable for small N.
Directory of Open Access Journals (Sweden)
Zhonghai Guo
2012-01-01
Full Text Available We study the following second order mixed nonlinear impulsive differential equations with delay (r(tΦα(x′(t′+p0(tΦα(x(t+∑i=1npi(tΦβi(x(t-σ=e(t, t≥t0, t≠τk,x(τk+=akx(τk, x'(τk+=bkx'(τk, k=1,2,…, where Φ*(u=|u|*-1u, σ is a nonnegative constant, {τk} denotes the impulsive moments sequence, and τk+1-τk>σ. Some sufficient conditions for the interval oscillation criteria of the equations are obtained. The results obtained generalize and improve earlier ones. Two examples are considered to illustrate the main results.
Multipath Detection Using Boolean Satisfiability Techniques
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
Solving delay differential equations in S-ADAPT by method of steps.
Bauer, Robert J; Mo, Gary; Krzyzanski, Wojciech
2013-09-01
S-ADAPT is a version of the ADAPT program that contains additional simulation and optimization abilities such as parametric population analysis. S-ADAPT utilizes LSODA to solve ordinary differential equations (ODEs), an algorithm designed for large dimension non-stiff and stiff problems. However, S-ADAPT does not have a solver for delay differential equations (DDEs). Our objective was to implement in S-ADAPT a DDE solver using the methods of steps. The method of steps allows one to solve virtually any DDE system by transforming it to an ODE system. The solver was validated for scalar linear DDEs with one delay and bolus and infusion inputs for which explicit analytic solutions were derived. Solutions of nonlinear DDE problems coded in S-ADAPT were validated by comparing them with ones obtained by the MATLAB DDE solver dde23. The estimation of parameters was tested on the MATLB simulated population pharmacodynamics data. The comparison of S-ADAPT generated solutions for DDE problems with the explicit solutions as well as MATLAB produced solutions which agreed to at least 7 significant digits. The population parameter estimates from using importance sampling expectation-maximization in S-ADAPT agreed with ones used to generate the data. Published by Elsevier Ireland Ltd.
Using delay differential equations to induce alternans in a model of cardiac electrophysiology.
Eastman, Justin; Sass, Julian; Gomes, Johnny M; Dos Santos, Rodrigo Weber; Cherry, Elizabeth M
2016-09-07
Cardiac electrical alternans is a period-2 dynamical behavior with alternating long and short action potential durations (APD) that often precedes dangerous arrhythmias associated with cardiac arrest. Despite the importance of alternans, many current ordinary differential equations models of cardiac electrophysiology do not produce alternans, thereby limiting the use of these models for studying the mechanisms that underlie this condition. Because delay differential equations (DDEs) commonly induce complex dynamics in other biological systems, we investigate whether incorporating DDEs can lead to alternans development in cardiac models by studying the Fox et al. canine ventricular action potential model. After suppressing the alternans in the original model, we show that alternans can be obtained by introducing DDEs in the model gating variables, and we quantitatively compare the DDE-induced alternans with the alternans present in the original model. We analyze the behavior of the voltage, currents, and gating variables of the model to study the effects of the delays and to determine how alternans develops in that setting, and we discuss the mathematical and physiological implications of our findings. In future work, we aim to apply our approach to induce alternans in models that do not naturally exhibit such dynamics. Copyright © 2016 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Youliang Fu
2016-01-01
Full Text Available This paper is concerned with the asymptotic properties of solutions to a third-order nonlinear neutral delay differential equation with distributed deviating arguments. Several new theorems are obtained which ensure that every solution to this equation either is oscillatory or tends to zero. Two illustrative examples are included.
Pitchfork and Hopf bifurcation thresholds in stochastic equations with delayed feedback
Gaudreault, Mathieu; Lépine, Françoise; Viñals, Jorge
2009-12-01
The bifurcation diagram of a model stochastic differential equation with delayed feedback is presented. We are motivated by recent research on stochastic effects in models of transcriptional gene regulation. We start from the normal form for a pitchfork bifurcation, and add multiplicative or parametric noise and linear delayed feedback. The latter is sufficient to originate a Hopf bifurcation in that region of parameters in which there is a sufficiently strong negative feedback. We find a sharp bifurcation in parameter space, and define the threshold as the point in which the stationary distribution function p(x) changes from a delta function at the trivial state x=0 to p(x)˜xα at small x (with α=-1 exactly at threshold). We find that the bifurcation threshold is shifted by fluctuations relative to the deterministic limit by an amount that scales linearly with the noise intensity. Analytic calculations of the bifurcation threshold are also presented in the limit of small delay τ→0 that compare quite favorably with the numerical solutions even for moderate values of τ .
Delay differential equations and the dose-time dependence of early radiotherapy reactions
International Nuclear Information System (INIS)
Fenwick, John D.
2006-01-01
The dose-time dependence of early radiotherapy reactions impacts on the design of accelerated fractionation schedules--oral mucositis, for example, can be dose limiting for short treatments designed to avoid tumor repopulation. In this paper a framework for modeling early reaction dose-time dependence is developed. Variation of stem cell number with time after the start of a radiation schedule is modeled using a first-order delay differential equation (DDE), motivated by experimental observations linking the speed of compensatory proliferation in early reacting tissues to the degree of tissue damage. The modeling suggests that two types of early reaction radiation response are possible, stem cell numbers either monotonically approaching equilibrium plateau levels or overshooting before returning to equilibrium. Several formulas have been derived from the delay differential equation, predicting changes in isoeffective total radiation dose with schedule duration for different types of fractionation scheme. The formulas have been fitted to a wide range of published animal early reaction data, the fits all implying a degree of overshoot. Results are presented illustrating the scope of the delay differential model: most of the data are fitted well, although the model struggles with a few datasets measured for schedules with distinctive dose-time patterns. Ways of extending the current model to cope with these particular dose-time patterns are briefly discussed. The DDE approach is conceptually more complex than earlier descriptive dose-time models but potentially more powerful. It can be used to study issues not addressed by simpler models, such as the likely effects of increasing or decreasing the dose-per-day over time, or of splitting radiation courses into intense segments separated by gaps. It may also prove useful for modeling the effects of chemoirradiation
Delay differential equations and the dose-time dependence of early radiotherapy reactions.
Fenwick, John D
2006-09-01
The dose-time dependence of early radiotherapy reactions impacts on the design of accelerated fractionation schedules--oral mucositis, for example, can be dose limiting for short treatments designed to avoid tumor repopulation. In this paper a framework for modeling early reaction dose-time dependence is developed. Variation of stem cell number with time after the start of a radiation schedule is modeled using a first-order delay differential equation (DDE), motivated by experimental observations linking the speed of compensatory proliferation in early reacting tissues to the degree of tissue damage. The modeling suggests that two types of early reaction radiation response are possible, stem cell numbers either monotonically approaching equilibrium plateau levels or overshooting before returning to equilibrium. Several formulas have been derived from the delay differential equation, predicting changes in isoeffective total radiation dose with schedule duration for different types of fractionation scheme. The formulas have been fitted to a wide range of published animal early reaction data, the fits all implying a degree of overshoot. Results are presented illustrating the scope of the delay differential model: most of the data are fitted well, although the model struggles with a few datasets measured for schedules with distinctive dose-time patterns. Ways of extending the current model to cope with these particular dose-time patterns are briefly discussed. The DDE approach is conceptually more complex than earlier descriptive dose-time models but potentially more powerful. It can be used to study issues not addressed by simpler models, such as the likely effects of increasing or decreasing the dose-per-day over time, or of splitting radiation courses into intense segments separated by gaps. It may also prove useful for modeling the effects of chemoirradiation.
International Nuclear Information System (INIS)
Sathiyasheela, T.
2009-01-01
Point kinetics equations (P. K. E) are system of differential equations, which is solved simultaneously to get the neutron density as a function of time for a given reactivity input. P. K. E are stiff differential equations, computational solution through the conventional explicit method will give a stable consistent result only for smaller time steps. Analytical solutions are available either with step or ramp reactivity insertion without considering the source power contribution. When a reactor operates at low power, the neutron source gives a considerable contribution to the net reactor power. Similarly, when the reactor is brought to delayed critical with the presence of external source, the sub critical reactor kinetics studies with source power are important to understand the power behavior as a function of reactivity insertion rate with respect to the initial reactivity. In the present work, P.K.E with one group delayed neutron are solved analytically to determine the reactor power as a function of reactivity insertion rate in the presence of neutron source. The analytical solution is a combination of converging two infinite series. Truncated infinite series is the analytical solution of P.K E. A general formulation is made by Combining both the ramp reactivity and step reactivity solution. So that the analytical solution could be useful in analyzing either step and ramp reactivity insertion exclusively or the combination of both. This general formulation could be useful in analyzing many reactor operations, like the air bubble passing through the core, stuck rod conditions, uncontrolled withdrawal of controlled rod, discontinuous lifting of control rod, lowering of rod and etc. Results of analytical solutions are compared against the results of numerical solution which is developed based on Cohen's method. The comparisons are found to be good for all kind of positive and negative ramp reactivity insertions, with or without the combination of step reactivity
About sign-constancy of Green's functions for impulsive second order delay equations
Directory of Open Access Journals (Sweden)
Alexander Domoshnitsky
2014-01-01
Full Text Available We consider the following second order differential equation with delay \\[\\begin{cases} (Lx(t\\equiv{x''(t+\\sum_{j=1}^p {b_{j}(tx(t-\\theta_{j}(t}}=f(t, \\quad t\\in[0,\\omega],\\\\ x(t_j=\\gamma_{j}x(t_j-0, x'(t_j=\\delta_{j}x'(t_j-0, \\quad j=1,2,\\ldots,r. \\end{cases}\\] In this paper we find necessary and sufficient conditions of positivity of Green's functions for this impulsive equation coupled with one or two-point boundary conditions in the form of theorems about differential inequalities. By choosing the test function in these theorems, we obtain simple sufficient conditions. For example, the inequality \\(\\sum_{i=1}^p{b_i(t\\left(\\frac{1}{4}+r\\right}\\lt \\frac{2}{\\omega^2}\\ is a basic one, implying negativity of Green's function of two-point problem for this impulsive equation in the case \\(0\\lt \\gamma_i\\leq{1}\\, \\(0\\lt \\delta_i\\leq{1}\\ for \\(i=1,\\ldots ,p\\.
Boolean modeling in systems biology: an overview of methodology and applications
International Nuclear Information System (INIS)
Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh
2012-01-01
Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)
Boolean gates on actin filaments
Energy Technology Data Exchange (ETDEWEB)
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Global dynamics of delay equations for populations with competition among immature individuals
Liz, Eduardo; Ruiz-Herrera, Alfonso
2016-04-01
We analyze a population model for two age-structured species allowing for inter- and intra-specific competition at immature life stages. The dynamics is governed by a system of Delay Differential Equations (DDEs) recently introduced by Gourley and Liu. The analysis of this model presents serious difficulties because the right-hand sides of the DDEs depend on the solutions of a system of nonlinear ODEs, and generally cannot be solved explicitly. Using the notion of strong attractor, we reduce the study of the attracting properties of the equilibria of the DDEs to the analysis of a related two-dimensional discrete system. Then, we combine some tools for monotone planar maps and planar competing Lotka-Volterra systems to describe the dynamics of the model with three different birth rate functions. We give easily verifiable conditions for global extinction of one or the two species, and for global convergence of the positive solutions to a coexistence state.
Ezzinbi, Khalil; Ndambomve, Patrice
2016-01-01
In this work, we consider the control system governed by some partial functional integrodifferential equations with finite delay in Banach spaces. We assume that the undelayed part admits a resolvent operator in the sense of Grimmer. Firstly, some suitable conditions are established to guarantee the existence and uniqueness of mild solutions for a broad class of partial functional integrodifferential infinite dimensional control systems. Secondly, it is proved that, under generally mild conditions of cost functional, the associated Lagrange problem has an optimal solution, and that for each optimal solution there is a minimizing sequence of the problem that converges to the optimal solution with respect to the trajectory, the control, and the functional in appropriate topologies. Our results extend and complement many other important results in the literature. Finally, a concrete example of application is given to illustrate the effectiveness of our main results.
Interval Oscillation Criteria for Super-Half-Linear Impulsive Differential Equations with Delay
Directory of Open Access Journals (Sweden)
Zhonghai Guo
2012-01-01
Full Text Available We study the following second-order super-half-linear impulsive differential equations with delay [r(tφγ(x′(t]′+p(tφγ(x(t-σ+q(tf(x(t-σ=e(t, t≠τk, x(t+=akx(t, x′(t+=bkx′(t, t=τk, where t≥t0∈ℝ, φ*(u=|u|*-1u, σ is a nonnegative constant, {τk} denotes the impulsive moments sequence with τ1σ. By some classical inequalities, Riccati transformation, and two classes of functions, we give several interval oscillation criteria which generalize and improve some known results. Moreover, we also give two examples to illustrate the effectiveness and nonemptiness of our results.
Zhang, Ling
2017-01-01
The main purpose of this paper is to investigate the strong convergence and exponential stability in mean square of the exponential Euler method to semi-linear stochastic delay differential equations (SLSDDEs). It is proved that the exponential Euler approximation solution converges to the analytic solution with the strong order [Formula: see text] to SLSDDEs. On the one hand, the classical stability theorem to SLSDDEs is given by the Lyapunov functions. However, in this paper we study the exponential stability in mean square of the exact solution to SLSDDEs by using the definition of logarithmic norm. On the other hand, the implicit Euler scheme to SLSDDEs is known to be exponentially stable in mean square for any step size. However, in this article we propose an explicit method to show that the exponential Euler method to SLSDDEs is proved to share the same stability for any step size by the property of logarithmic norm.
Quantum algorithms for testing Boolean functions
Directory of Open Access Journals (Sweden)
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
Epstein, Irving R.; Luo, Yin
1991-07-01
Delayed feedback plays a key role in most, if not all chemical oscillators. We derive general results useful in the linear stability analysis of models that explicitly incorporate delay by using differential delay equations. Two models of nonlinear chemical oscillators, the cross-shaped phase diagram model of Boissonade and De Kepper and the Oregonator, are modified by deleting a feedback species and mimicking its effect by a delay in the kinetics of another variable. With an appropriate choice of the delay time, the reduced models behave very much like the full systems. It should be possible to carry out similar reductions on more complex mechanisms of oscillating reactions, thereby providing insight into the role of delayed feedback in these systems.
Testing Properties of Boolean Functions
2012-01-01
The JUNTATEST algorithm is based on two simple but powerful ideas. The first idea, initially presented by Fischer et al. [52], is that there is a very...Computer and System Sciences, 61(3):428 – 456, 2000. 12 [75] Subhash Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symposium on...Sharpness of KKL on Schreier graphs, 2009. Manuscript. 6.4 [84] Michal Parnas, Dana Ron, and Alex Samorodnitsky. Testing basic boolean formu- lae . SIAM J
International Nuclear Information System (INIS)
Hao, Lijie; Yang, Zhuoqin; Lei, Jinzhi
2015-01-01
Highlights: • A delay differentiation equation model for CREB regulation is developed. • Increasing the time delay can generate various bifurcations. • Increasing the time delay can induce chaos by two routes. - Abstract: The ability to form long-term memories is an important function for the nervous system, and the formation process is dynamically regulated through various transcription factors, including CREB proteins. In this paper, we investigate the dynamics of a delay differential equation model for CREB protein activities, which involves two positive and two negative feedbacks in the regulatory network. We discuss the dynamical mechanisms underlying the induction of long-term memory, in which bistability is essential for the formation of long-term memory, while long time delay can destabilize the high level steady state to inhibit the long-term memory formation. The model displays rich dynamical response to stimuli, including monostability, bistability, and oscillations, and can transit between different states by varying the negative feedback strength. Introduction of a time delay to the model can generate various bifurcations such as Hopf bifurcation, fold limit cycle bifurcation, Neimark–Sacker bifurcation of cycles, and period-doubling bifurcation, etc. Increasing the time delay can induce chaos by two routes: quasi-periodic route and period-doubling cascade.
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as
Boolean gates on actin filaments
Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew
2016-01-01
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications.
Directory of Open Access Journals (Sweden)
Wang Li
2008-01-01
Full Text Available We investigate the existence of almost-periodic weak solutions of second-order neutral delay-differential equations with piecewise constant argument of the form , where denotes the greatest integer function, is a real nonzero constant, and is almost periodic.
Yi, Sun; Nelson, Patrick W; Ulsoy, A Galip
2007-04-01
In a turning process modeled using delay differential equations (DDEs), we investigate the stability of the regenerative machine tool chatter problem. An approach using the matrix Lambert W function for the analytical solution to systems of delay differential equations is applied to this problem and compared with the result obtained using a bifurcation analysis. The Lambert W function, known to be useful for solving scalar first-order DDEs, has recently been extended to a matrix Lambert W function approach to solve systems of DDEs. The essential advantages of the matrix Lambert W approach are not only the similarity to the concept of the state transition matrix in lin ear ordinary differential equations, enabling its use for general classes of linear delay differential equations, but also the observation that we need only the principal branch among an infinite number of roots to determine the stability of a system of DDEs. The bifurcation method combined with Sturm sequences provides an algorithm for determining the stability of DDEs without restrictive geometric analysis. With this approach, one can obtain the critical values of delay, which determine the stability of a system and hence the preferred operating spindle speed without chatter. We apply both the matrix Lambert W function and the bifurcation analysis approach to the problem of chatter stability in turning, and compare the results obtained to existing methods. The two new approaches show excellent accuracy and certain other advantages, when compared to traditional graphical, computational and approximate methods.
Directory of Open Access Journals (Sweden)
Tomasz Człapiński
2014-01-01
Full Text Available We consider the Darboux problem for the hyperbolic partial functional differential equation with infinite delay. We deal with generalized (in the "almost everywhere" sense solutions of this problem. We prove a theorem on the global convergence of successive approximations to a unique solution of the Darboux problem.
Positioning in a flat two-dimensional space-time: The delay master equation
International Nuclear Information System (INIS)
Coll, Bartolome; Ferrando, Joan Josep; Morales-Lladosa, Juan Antonio
2010-01-01
The basic theory on relativistic positioning systems in a two-dimensional space-time has been presented in two previous papers [B. Coll, J. J. Ferrando, and J. A. Morales, Phys. Rev. D 73, 084017 (2006); ibid.74, 104003 (2006)], where the possibility of making relativistic gravimetry with these systems has been analyzed by considering specific examples. Here, generic relativistic positioning systems in the Minkowski plane are studied. The information that can be obtained from the data received by a user of the positioning system is analyzed in detail. In particular, it is shown that the accelerations of the emitters and of the user along their trajectories are determined by the sole knowledge of the emitter positioning data and of the acceleration of only one of the emitters. Moreover, as a consequence of the so-called master delay equation, the knowledge of this acceleration is only required during an echo interval, i.e., the interval between the emission time of a signal by an emitter and its reception time after being reflected by the other emitter. These results are illustrated with the obtention of the dynamics of the emitters and of the user from specific sets of data received by the user.
Lainscsek, C; Rowat, P; Schettino, L; Lee, D; Song, D; Letellier, C; Poizner, H
2012-03-01
Parkinson's disease is a degenerative condition whose severity is assessed by clinical observations of motor behaviors. These are performed by a neurological specialist through subjective ratings of a variety of movements including 10-s bouts of repetitive finger-tapping movements. We present here an algorithmic rating of these movements which may be beneficial for uniformly assessing the progression of the disease. Finger-tapping movements were digitally recorded from Parkinson's patients and controls, obtaining one time series for every 10 s bout. A nonlinear delay differential equation, whose structure was selected using a genetic algorithm, was fitted to each time series and its coefficients were used as a six-dimensional numerical descriptor. The algorithm was applied to time-series from two different groups of Parkinson's patients and controls. The algorithmic scores compared favorably with the unified Parkinson's disease rating scale scores, at least when the latter adequately matched with ratings from the Hoehn and Yahr scale. Moreover, when the two sets of mean scores for all patients are compared, there is a strong (r = 0.785) and significant (p<0.0015) correlation between them.
Modeling endocrine regulation of the menstrual cycle using delay differential equations.
Harris, Leona A; Selgrade, James F
2014-11-01
This article reviews an effective mathematical procedure for modeling hormonal regulation of the menstrual cycle of adult women. The procedure captures the effects of hormones secreted by several glands over multiple time scales. The specific model described here consists of 13 nonlinear, delay, differential equations with 44 parameters and correctly predicts blood levels of ovarian and pituitary hormones found in the biological literature for normally cycling women. In addition to this normal cycle, the model exhibits another stable cycle which may describe a biologically feasible "abnormal" condition such as polycystic ovarian syndrome. Model simulations illustrate how one cycle can be perturbed to the other cycle. Perturbations due to the exogenous administration of each ovarian hormone are examined. This model may be used to test the effects of hormone therapies on abnormally cycling women as well as the effects of exogenous compounds on normally cycling women. Sensitive parameters are identified and bifurcations in model behavior with respect to parameter changes are discussed. Modeling various aspects of menstrual cycle regulation should be helpful in predicting successful hormone therapies, in studying the phenomenon of cycle synchronization and in understanding many factors affecting the aging of the female reproductive endocrine system. Copyright © 2014 Elsevier Inc. All rights reserved.
Huang, Mugen; Luo, Jiaowan; Hu, Linchao; Zheng, Bo; Yu, Jianshe
2017-12-14
To suppress wild population of Aedes mosquitoes, the primary transmission vector of life-threatening diseases such as dengue, malaria, and Zika, an innovative strategy is to release male mosquitoes carrying the bacterium Wolbachia into natural areas to drive female sterility by cytoplasmic incompatibility. We develop a model of delay differential equations, incorporating the strong density restriction in the larval stage, to assess the delicate impact of life table parameters on suppression efficiency. Through mathematical analysis, we find the sufficient and necessary condition for global stability of the complete suppression state. This condition, combined with the experimental data for Aedes albopictus population in Guangzhou, helps us predict a large range of releasing intensities for suppression success. In particular, we find that if the number of released infected males is no less than four times the number of mosquitoes in wild areas, then the mosquito density in the peak season can be reduced by 95%. We introduce an index to quantify the dependence of suppression efficiency on parameters. The invariance of some quantitative properties of the index values under various perturbations of the same parameter justifies the applicability of this index, and the robustness of our modeling approach. The index yields a ranking of the sensitivity of all parameters, among which the adult mortality has the highest sensitivity and is considerably more sensitive than the natural larvae mortality. Copyright © 2017 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Boubendir, Yassine; Mendez, Vicenc; Rotstein, Horacio G.
2010-01-01
We study the evolution of fronts in a bistable equation with time-delayed global feedback in the fast reaction and slow diffusion regime. This equation generalizes the Hodgkin-Grafstein and Allen-Cahn equations. We derive a nonlinear equation governing the motion of fronts, which includes a term with delay. In the one-dimensional case this equation is linear. We study the motion of one- and two-dimensional fronts, finding a much richer dynamics than for the previously studied cases (without time-delayed global feedback). We explain the mechanism by which localized fronts created by inhibitory global coupling loose stability in a Hopf bifurcation as the delay time increases. We show that for certain delay times, the prevailing phase is different from that corresponding to the system in the absence of global coupling. Numerical simulations of the partial differential equation are in agreement with the analytical predictions.
Gourley, Stephen A.; Kuang, Yang
We present a global study on the stability of the equilibria in a nonlinear autonomous neutral delay differential population model formulated by Bocharov and Hadeler. This model may be suitable for describing the intriguing dynamics of an insect population with long larval and short adult phases such as the periodical cicada. We circumvent the usual difficulties associated with the study of the stability of a nonlinear neutral delay differential model by transforming it to an appropriate non-neutral nonautonomous delay differential equation with unbounded delay. In the case that no juveniles give birth, we establish the positivity and boundedness of solutions by ad hoc methods and global stability of the extinction and positive equilibria by the method of iteration. We also show that if the time adjusted instantaneous birth rate at the time of maturation is greater than 1, then the population will grow without bound, regardless of the population death process.
Directory of Open Access Journals (Sweden)
Zhihong Zhao
2007-01-01
Full Text Available We consider the diffusive single species growth in a plug flow reactor model with distributed delay. For small delay, existence and uniqueness of such wavefronts are proved when the convolution kernel assumes the strong generic delay kernel. The approaches used in this paper are geometric singular perturbation theory and the center manifold theorem.
Directory of Open Access Journals (Sweden)
M. De la Sen
2009-01-01
Full Text Available This paper investigates the relations between the particular eigensolutions of a limiting functional differential equation of any order, which is the nominal (unperturbed linear autonomous differential equations, and the associate ones of the corresponding perturbed functional differential equation. Both differential equations involve point and distributed delayed dynamics including Volterra class dynamics. The proofs are based on a Perron-type theorem for functional equations so that the comparison is governed by the real part of a dominant zero of the characteristic equation of the nominal differential equation. The obtained results are also applied to investigate the global stability of the perturbed equation based on that of its corresponding limiting equation.
Fu, Guifang; Wang, Zhong; Li, Jiahan; Wu, Rongling
2011-11-21
All biological phenomena occurring at different levels of organization from cells to organisms can be modeled as a dynamic system, in which the underlying components interact dynamically to comprehend its biological function. Such a systems modeling approach facilitates the use of biochemically and biophysically detailed mathematical models to describe and quantify "living cells," leading to an in-depth and precise understanding of the behavior, development and function of a biological system. Here, we illustrate how this approach can be used to map genes or quantitative trait loci (QTLs) that control a complex trait using the example of the circadian rhythm system which has been at the forefront of analytical mathematical modeling for many years. We integrate a system of biologically meaningful delay differential equations (DDEs) into functional mapping, a statistical model designed to map dynamic QTLs involved in biological processes. The DDEs model the ability of circadian rhythm to generate autonomously sustained oscillations with a period close to 24h, in terms of time-varying mRNA and protein abundances. By incorporating the Runge-Kutta fourth order algorithm within the likelihood-based context of functional mapping, we estimated the genetic parameters that define the periodic pattern of QTL effects on time-varying mRNA and protein abundances and their dynamic association as well as the linkage disequilibrium of the QTL and a marker. We prove theorems about how to choose appropriate parameters to guarantee periodic oscillations. We further used simulation studies to investigate how a QTL influences the period and the amplitude of circadian oscillations through changing model parameters. The model provides a quantitative framework for assessing the interplay between genetic effects of QTLs and rhythmic responses. Copyright © 2011 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Tang, X H; Zou, Xingfu
2009-01-01
By employing Schauder's fixed point theorem and a non-Liapunov method (matrix theory, inequality analysis), we obtain some new criteria that ensure existence and global exponential stability of a periodic solution to a class of functional differential equations. Applying these criteria to a cellular neural network with time delays (delayed cellular neural network, DCNN) under a periodic environment leads to some new results that improve and generalize many existing ones we know on this topic. These results are of great significance in designs and applications of globally stable periodic DCNNs
Boolean Dependence Logic and Partially-Ordered Connectives
Ebbing, Johannes; Hella, Lauri; Lohmann, Peter; Virtema, Jonni
2014-01-01
We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\\alpha), where \\alpha is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of Boolean dependence logic to dependence logic and first-order logic enriched by partially-ordered connec...
Banks, H Thomas; Robbins, Danielle; Sutton, Karyn L
2013-01-01
In this paper we present new results for differentiability of delay systems with respect to initial conditions and delays. After motivating our results with a wide range of delay examples arising in biology applications, we further note the need for sensitivity functions (both traditional and generalized sensitivity functions), especially in control and estimation problems. We summarize general existence and uniqueness results before turning to our main results on differentiation with respect to delays, etc. Finally we discuss use of our results in the context of estimation problems.
International Nuclear Information System (INIS)
Ding Xiaohua; Su Huan; Liu Mingzhu
2008-01-01
The paper analyzes a discrete second-order, nonlinear delay differential equation with negative feedback. The characteristic equation of linear stability is solved, as a function of two parameters describing the strength of the feedback and the damping in the autonomous system. The existence of local Hopf bifurcations is investigated, and the direction and stability of periodic solutions bifurcating from the Hopf bifurcation of the discrete model are determined by the Hopf bifurcation theory of discrete system. Finally, some numerical simulations are performed to illustrate the analytical results found
Random networks of Boolean cellular automata
International Nuclear Information System (INIS)
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
Benhammouda, Brahim; Vazquez-Leal, Hector
2016-01-01
This work presents an analytical solution of some nonlinear delay differential equations (DDEs) with variable delays. Such DDEs are difficult to treat numerically and cannot be solved by existing general purpose codes. A new method of steps combined with the differential transform method (DTM) is proposed as a powerful tool to solve these DDEs. This method reduces the DDEs to ordinary differential equations that are then solved by the DTM. Furthermore, we show that the solutions can be improved by Laplace-Padé resummation method. Two examples are presented to show the efficiency of the proposed technique. The main advantage of this technique is that it possesses a simple procedure based on a few straight forward steps and can be combined with any analytical method, other than the DTM, like the homotopy perturbation method.
Faria, Teresa
2017-07-01
For a family of n-dimensional periodic delay differential equations which encompasses a broad set of models used in structured population dynamics, the existence of a positive periodic solution is obtained under very mild conditions. The proof uses the Schauder fixed point theorem and relies on the permanence of the system. A general criterion for the existence of a positive periodic solution for Nicholson's blowflies periodic systems (with both distributed and discrete time-varying delays) is derived as a simple application of our main result, generalizing the few existing results concerning multi-dimensional Nicholson models. In the case of a Nicholson system with discrete delays all multiples of the period, the global attractivity of the positive periodic solution is further analyzed, improving results in recent literature.
Rebenda, Josef; Šmarda, Zdeněk
2017-07-01
In the paper an efficient semi-analytical approach based on the method of steps and the differential transformation is proposed for numerical approximation of solutions of functional differential models of delayed and neutral type on a finite interval of arbitrary length, including models with several constant delays. Algorithms for both commensurate and non-commensurate delays are described, applications are shown in examples. Validity and efficiency of the presented algorithms is compared with the variational iteration method, the Adomian decomposition method and the polynomial least squares method numerically. Matlab package DDE23 is used to produce reference numerical values.
Digital clocks: simple Boolean models can quantitatively describe circadian systems.
Akman, Ozgur E; Watterson, Steven; Parton, Andrew; Binns, Nigel; Millar, Andrew J; Ghazal, Peter
2012-09-07
The gene networks that comprise the circadian clock modulate biological function across a range of scales, from gene expression to performance and adaptive behaviour. The clock functions by generating endogenous rhythms that can be entrained to the external 24-h day-night cycle, enabling organisms to optimally time biochemical processes relative to dawn and dusk. In recent years, computational models based on differential equations have become useful tools for dissecting and quantifying the complex regulatory relationships underlying the clock's oscillatory dynamics. However, optimizing the large parameter sets characteristic of these models places intense demands on both computational and experimental resources, limiting the scope of in silico studies. Here, we develop an approach based on Boolean logic that dramatically reduces the parametrization, making the state and parameter spaces finite and tractable. We introduce efficient methods for fitting Boolean models to molecular data, successfully demonstrating their application to synthetic time courses generated by a number of established clock models, as well as experimental expression levels measured using luciferase imaging. Our results indicate that despite their relative simplicity, logic models can (i) simulate circadian oscillations with the correct, experimentally observed phase relationships among genes and (ii) flexibly entrain to light stimuli, reproducing the complex responses to variations in daylength generated by more detailed differential equation formulations. Our work also demonstrates that logic models have sufficient predictive power to identify optimal regulatory structures from experimental data. By presenting the first Boolean models of circadian circuits together with general techniques for their optimization, we hope to establish a new framework for the systematic modelling of more complex clocks, as well as other circuits with different qualitative dynamics. In particular, we anticipate
Digital clocks: simple Boolean models can quantitatively describe circadian systems
Akman, Ozgur E.; Watterson, Steven; Parton, Andrew; Binns, Nigel; Millar, Andrew J.; Ghazal, Peter
2012-01-01
The gene networks that comprise the circadian clock modulate biological function across a range of scales, from gene expression to performance and adaptive behaviour. The clock functions by generating endogenous rhythms that can be entrained to the external 24-h day–night cycle, enabling organisms to optimally time biochemical processes relative to dawn and dusk. In recent years, computational models based on differential equations have become useful tools for dissecting and quantifying the complex regulatory relationships underlying the clock's oscillatory dynamics. However, optimizing the large parameter sets characteristic of these models places intense demands on both computational and experimental resources, limiting the scope of in silico studies. Here, we develop an approach based on Boolean logic that dramatically reduces the parametrization, making the state and parameter spaces finite and tractable. We introduce efficient methods for fitting Boolean models to molecular data, successfully demonstrating their application to synthetic time courses generated by a number of established clock models, as well as experimental expression levels measured using luciferase imaging. Our results indicate that despite their relative simplicity, logic models can (i) simulate circadian oscillations with the correct, experimentally observed phase relationships among genes and (ii) flexibly entrain to light stimuli, reproducing the complex responses to variations in daylength generated by more detailed differential equation formulations. Our work also demonstrates that logic models have sufficient predictive power to identify optimal regulatory structures from experimental data. By presenting the first Boolean models of circadian circuits together with general techniques for their optimization, we hope to establish a new framework for the systematic modelling of more complex clocks, as well as other circuits with different qualitative dynamics. In particular, we
The spruce budworm and forest: a qualitative comparison of ODE and Boolean models
Directory of Open Access Journals (Sweden)
Raina Robeva
2016-01-01
Full Text Available Boolean and polynomial models of biological systems have emerged recently as viable companions to differential equations models. It is not immediately clear however whether such models are capable of capturing the multi-stable behaviour of certain biological systems: this behaviour is often sensitive to changes in the values of the model parameters, while Boolean and polynomial models are qualitative in nature. In the past few years, Boolean models of gene regulatory systems have been shown to capture multi-stability at the molecular level, confirming that such models can be used to obtain information about the system’s qualitative dynamics when precise information regarding its parameters may not be available. In this paper, we examine Boolean approximations of a classical ODE model of budworm outbreaks in a forest and show that these models exhibit a qualitative behaviour consistent with that derived from the ODE models. In particular, we demonstrate that these models can capture the bistable nature of insect population outbreaks, thus showing that Boolean models can be successfully utilized beyond the molecular level.
Thakar, Juilee; Albert, Réka
The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References
Directory of Open Access Journals (Sweden)
Shao Yuan Huang
2013-07-01
Full Text Available Monotonicity of solutions is an important property in the investigation of oscillatory behaviors of differential equations. A number of papers provide some existence criteria for eventually positive increasing solutions. However, relatively little attention is paid to eventually positive solutions that are also eventually decreasing solutions. For this reason, we establish several new and sharp oscillatory criteria for impulsive functional differential equations from this viewpoint.
Adam, A. M. A.; Bashier, E. B. M.; Hashim, M. H. A.; Patidar, K. C.
2017-07-01
In this work, we design and analyze a fitted numerical method to solve a reaction-diffusion model with time delay, namely, a delayed version of a population model which is an extension of the logistic growth (LG) equation for a food-limited population proposed by Smith [F.E. Smith, Population dynamics in Daphnia magna and a new model for population growth, Ecology 44 (1963) 651-663]. Seeing that the analytical solution (in closed form) is hard to obtain, we seek for a robust numerical method. The method consists of a Fourier-pseudospectral semi-discretization in space and a fitted operator implicit-explicit scheme in temporal direction. The proposed method is analyzed for convergence and we found that it is unconditionally stable. Illustrative numerical results will be presented at the conference.
Energy Technology Data Exchange (ETDEWEB)
Jia Junguo [Department of Applied Mathematics, Xi' an Jiaotong University, Xi' an 710049 (China) and Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450001 (China)]. E-mail: jungjia2@zzu.edu.cn; Wang Miansen [Department of Applied Mathematics, Xi' an Jiaotong University, Xi' an 710049 (China); Li Meili [Department of Applied Mathematics, Xi' an Jiaotong University, Xi' an 710049 (China)
2007-05-15
In this paper, a two-dimensional non-autonomous system with impulse that arises in plankton allelopathy involving discrete time delays and periodic environmental factors is studied. By the theory of the coincidence degree we obtain the conditions for the existence of periodic solution of this system.
Patterns in a nonlocal time-delayed reaction-diffusion equation
Guo, Shangjiang
2018-02-01
In this paper, the existence, stability, and multiplicity of nontrivial (spatially homogeneous or nonhomogeneous) steady-state solution and periodic solutions for a reaction-diffusion model with nonlocal delay effect and Dirichlet/Neumann boundary condition are investigated by using Lyapunov-Schmidt reduction. Moreover, we illustrate our general results by applications to population models with one-dimensional spatial domain.
Directory of Open Access Journals (Sweden)
Chuanyi Zhang
2008-06-01
Full Text Available We investigate the existence of almost-periodic weak solutions of second-order neutral delay-differential equations with piecewise constant argument of the form (x(t+x(tÃ¢ÂˆÂ’1Ã¢Â€Â²Ã¢Â€Â²=qx(2[(t+1/2]+f(t, where [Ã¢Â‹Â…] denotes the greatest integer function, q is a real nonzero constant, and f(t is almost periodic.
A New Calculation for Boolean Derivative Using Cheng Product
Directory of Open Access Journals (Sweden)
Hao Chen
2012-01-01
Full Text Available The matrix expression and relationships among several definitions of Boolean derivatives are given by using the Cheng product. We introduce several definitions of Boolean derivatives. By using the Cheng product, the matrix expressions of Boolean derivative are given, respectively. Furthermore, the relationships among different definitions are presented. The logical calculation is converted into matrix product. This helps to extend the application of Boolean derivative. At last, an example is given to illustrate the main results.
The Permeability of Boolean Sets of Cylinders
Directory of Open Access Journals (Sweden)
Willot F.
2016-07-01
Full Text Available Numerical and analytical results on the permeability of Boolean models of randomly-oriented cylinders with circular cross-section are reported. The present work investigates cylinders of prolate (highly-elongated and oblate (nearly flat types. The fluid flows either inside or outside of the cylinders. The Stokes flow is solved using full-fields Fourier-based computations on 3D binarized microstructures. The permeability is given for varying volume fractions of pores. A new upper-bound is derived for the permeability of the Boolean model of oblate cylinders. The behavior of the permeability in the dilute limit is discussed.
Directory of Open Access Journals (Sweden)
Veronika Novotná
2013-10-01
Full Text Available Purpose of the article: The article deals with a formulation of the dynamic model which expresses the relationship between the rate of inflation and the rate of unemployment more accurately and which has become to be known as the Phillips curve. Methodology/methods: The economic theory in question, which is an essential basis of all economic models (Phillips curve, hysteresis of unemployment,... is sufficiently explained in the introductory chapters and serves as the basis for formulating relationships of the economic quantities which are being explored. Here, there are applied methods of analysis, synthesis, dynamic modelling and differential equations. Scientific aim: The classic model is limited to relations and mutual connections in time t only and eliminates the influence of factors from periods preceding time t. Mathematically, the model leads to a system of common differential equations. The aim of submitted the article is elimination of the simplifications by constructing a more realistic model, which takes into consideration the data from previous periods, and create a new model expressed by a system of two delay differential equations. Findings: The new model can be solved (under various circumstances and constructed even on the above mentioned more complex conditions and the impact of particular parameters of the model on its solution can be observed. Conclusions: The original classic model of the relationship between the rate of inflation and the rate of unemployment which led to the Phillips curve has been replaced in this article by a new model expressing the real economic situation more precisely while respecting the influence of the history of the factors taken into account using so-called delay differential equations.
Jasim Mohammed, M; Ibrahim, Rabha W; Ahmad, M Z
2017-03-01
In this paper, we consider a low initial population model. Our aim is to study the periodicity computation of this model by using neutral differential equations, which are recognized in various studies including biology. We generalize the neutral Rayleigh equation for the third-order by exploiting the model of fractional calculus, in particular the Riemann-Liouville differential operator. We establish the existence and uniqueness of a periodic computational outcome. The technique depends on the continuation theorem of the coincidence degree theory. Besides, an example is presented to demonstrate the finding.
Gil', M. I.
2005-08-01
We consider a class of nonautonomous functional-differential equations in a Banach space with unbounded nonlinear history-responsive operators, which have the local Lipshitz property. Conditions for the boundedness of solutions, Lyapunov stability, absolute stability and input-output one are established. Our approach is based on a combined usage of properties of sectorial operators and spectral properties of commuting operators.
New exponential stability conditions for linear delayed systems of differential equations
Directory of Open Access Journals (Sweden)
Leonid Berezansky
2016-08-01
where $t\\ge 0$, $m$ and $r_{ij}$, $i,j=1,\\dots,m$ are natural numbers, $a_{ij}^{k}\\colon [0,\\infty\\to\\mathbb{R}$ are measurable coefficients, and $h_{ij}^{k}\\colon [0,\\infty\\to\\mathbb{R}$ are measurable delays. The progress was achieved by using a new technique making it possible to replace the constant $1$ by the constant $1+{1}/{\\mathrm{e}}$ on the right-hand sides of crucial inequalities ensuring exponential stability.
Dorodnitsyn, Vladimir A.; Kozlov, Roman; Meleshko, Sergey V.; Winternitz, Pavel
2018-05-01
A recent article was devoted to an analysis of the symmetry properties of a class of first-order delay ordinary differential systems (DODSs). Here we concentrate on linear DODSs, which have infinite-dimensional Lie point symmetry groups due to the linear superposition principle. Their symmetry algebra always contains a two-dimensional subalgebra realized by linearly connected vector fields. We identify all classes of linear first-order DODSs that have additional symmetries, not due to linearity alone, and we present representatives of each class. These additional symmetries are then used to construct exact analytical particular solutions using symmetry reduction.
Evolutionary Algorithms for Boolean Queries Optimization
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.
2006-01-01
Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics
Boolean Queries Optimization by Genetic Algorithms
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav
2005-01-01
Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research
Monostable traveling waves for a time-periodic and delayed nonlocal reaction-diffusion equation
Li, Panxiao; Wu, Shi-Liang
2018-04-01
This paper is concerned with a time-periodic and delayed nonlocal reaction-diffusion population model with monostable nonlinearity. Under quasi-monotone or non-quasi-monotone assumptions, it is known that there exists a critical wave speed c_*>0 such that a periodic traveling wave exists if and only if the wave speed is above c_*. In this paper, we first prove the uniqueness of non-critical periodic traveling waves regardless of whether the model is quasi-monotone or not. Further, in the quasi-monotone case, we establish the exponential stability of non-critical periodic traveling fronts. Finally, we illustrate the main results by discussing two types of death and birth functions arising from population biology.
Positive Solutions for a Higher-Order Nonlinear Neutral Delay Differential Equation
Directory of Open Access Journals (Sweden)
Zeqing Liu
2011-01-01
pi,τi,βj,g∈C([to,+∞,ℝ, αj∈Cn−1([to,+∞,ℝ, f∈Cn−1([to,+∞×ℝk,ℝ, h∈C([to,+∞×ℝk,ℝ, and limt→+∞τi(t=limt→+∞αj(t=limt→+∞βj(t=+∞, i∈{1,2,…,m}, j∈{1,2,…,k}. By making use of the Leray-Schauder nonlinear alterative theorem, we establish the existence of uncountably many bounded positive solutions for the above equation. Our results improve and generalize some corresponding results in the field. Three examples are given which illustrate the advantages of the results presented in this paper.
Rouz, Omid Farkhondeh; Ahmadian, Davood; Milev, Mariyan
2017-12-01
This paper establishes exponential mean square stability of two classes of theta Milstein methods, namely split-step theta Milstein (SSTM) method and stochastic theta Milstein (STM) method, for stochastic differential delay equations (SDDEs). We consider the SDDEs problem under a coupled monotone condition on drift and diffusion coefficients, as well as a necessary linear growth condition on the last term of theta Milstein method. It is proved that the SSTM method with θ ∈ [0, ½] can recover the exponential mean square stability of the exact solution with some restrictive conditions on stepsize, but for θ ∈ (½, 1], we proved that the stability results hold for any stepsize. Then, based on the stability results of SSTM method, we examine the exponential mean square stability of the STM method and obtain the similar stability results to that of the SSTM method. In the numerical section the figures show thevalidity of our claims.
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
Sakdanupaph, Werapong; Moore, Elvin J.
2009-08-01
Dengue Fever is a dangerous viral disease that is transmitted by female Aedes mosquitoes and is common in more than 100 countries in the world and in all countries of South-East Asia. Mathematical models of Dengue Fever transmission are useful for studying the causes of the spread of the disease and to try to develop methods for reducing the spread of the disease. In this paper, a mathematical model for Dengue fever is analyzed consisting of a system of four nonlinear differential equations with two time delays. The model includes infected humans, infectious humans, infected mosquitoes and infectious mosquitoes. The model has disease-free and endemic equilibrium points. The asymptotic stability of the equilibrium points are studied analytically. The Matlab computer program is used to obtain numerical solutions of the model for both zero and nonzero time delays for a range of parameter values. It is found that for some reasonable estimates of parameter values the endemic equilibrium point is asymptotically stable, but the approach to equilibrium is very slow, suggesting that this equilibrium point may not be of practical importance for these parameter values. Some comparisons are made between the model results and the actual data for Dengue Fever in Thailand, Malaysia and Singapore.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Quotients of Boolean algebras and regular subalgebras
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Pazák, Tomáš
2010-01-01
Roč. 49, č. 3 (2010), s. 329-342 ISSN 1432-0665 R&D Projects: GA AV ČR IAA100190509; GA MŠk MEB060909 Institutional research plan: CEZ:AV0Z10190503; CEZ:AV0Z10750506 Keywords : Boolean algebra * sequential topology * ZFC extension * ideal Subject RIV: BA - General Mathematics Impact factor: 0.414, year: 2010 http://link.springer.com/article/10.1007%2Fs00153-010-0174-y
Optimal stabilization of Boolean networks through collective influence
Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming
2018-03-01
Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.
The Number of Monotone and Self-Dual Boolean Functions
Directory of Open Access Journals (Sweden)
Haviarova L.
2014-12-01
Full Text Available In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Singular Perturbation Analysis and Gene Regulatory Networks with Delay
Shlykova, Irina; Ponosov, Arcady
2009-09-01
There are different ways of how to model gene regulatory networks. Differential equations allow for a detailed description of the network's dynamics and provide an explicit model of the gene concentration changes over time. Production and relative degradation rate functions used in such models depend on the vector of steeply sloped threshold functions which characterize the activity of genes. The most popular example of the threshold functions comes from the Boolean network approach, where the threshold functions are given by step functions. The system of differential equations becomes then piecewise linear. The dynamics of this system can be described very easily between the thresholds, but not in the switching domains. For instance this approach fails to analyze stationary points of the system and to define continuous solutions in the switching domains. These problems were studied in [2], [3], but the proposed model did not take into account a time delay in cellular systems. However, analysis of real gene expression data shows a considerable number of time-delayed interactions suggesting that time delay is essential in gene regulation. Therefore, delays may have a great effect on the dynamics of the system presenting one of the critical factors that should be considered in reconstruction of gene regulatory networks. The goal of this work is to apply the singular perturbation analysis to certain systems with delay and to obtain an analog of Tikhonov's theorem, which provides sufficient conditions for constracting the limit system in the delay case.
Stumpf, Eugen
2016-01-01
This work is concerned with the study of a scalar delay differential equation \\begin{equation*} z^{\\prime\\prime}(t)=h^2\\,V(z(t-1)-z(t))+h\\,z^\\prime(t) \\end{equation*} motivated by a simple car-following model on an unbounded straight line. Here, the positive real $h$ denotes some parameter, and $V$ is a so-called \\textit{optimal velocity function} of the traffic model involved. We analyze the existence and local stability properties of solutions $z(t)=c\\,t+d$, $t\\in\\mathbb{R}$, with $c,d\\in\\m...
Large Sets in Boolean and Non-Boolean Groups and Topology
Directory of Open Access Journals (Sweden)
Ol’ga V. Sipacheva
2017-10-01
Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.
A complexity theory based on Boolean algebra
DEFF Research Database (Denmark)
Skyum, Sven; Valiant, Leslie
1985-01-01
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...... relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Finer distinctions about the computational relationships among natural problems can be made than in previous formulations and some negative results are proved....
The Boolean algebra and central Galois algebras
Directory of Open Access Journals (Sweden)
George Szeto
2001-01-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
Boolean Factor Analysis by Attractor Neural Network
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2007-01-01
Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007
An adaptable Boolean net trainable to control a computing robot
International Nuclear Information System (INIS)
Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.
1999-01-01
We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits
Boolean orthoposets and two-valued states on them
Tkadlec, Josef
1992-06-01
A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.
Directory of Open Access Journals (Sweden)
Sufia Zulfa Ahmad
2016-01-01
Full Text Available We derived a two-step, four-stage, and fifth-order semi-implicit hybrid method which can be used for solving special second-order ordinary differential equations. The method is then trigonometrically fitted so that it is suitable for solving problems which are oscillatory in nature. The methods are then used for solving oscillatory delay differential equations. Numerical results clearly show the efficiency of the new method when compared to the existing explicit and implicit methods in the scientific literature.
Stötzel, Claudia; Röblitz, Susanna; Siebert, Heike
2015-01-01
In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs) into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Intervention in Context-Sensitive Probabilistic Boolean Networks Revisited
Directory of Open Access Journals (Sweden)
Faryabi Babak
2009-01-01
Full Text Available An approximate representation for the state space of a context-sensitive probabilistic Boolean network has previously been proposed and utilized to devise therapeutic intervention strategies. Whereas the full state of a context-sensitive probabilistic Boolean network is specified by an ordered pair composed of a network context and a gene-activity profile, this approximate representation collapses the state space onto the gene-activity profiles alone. This reduction yields an approximate transition probability matrix, absent of context, for the Markov chain associated with the context-sensitive probabilistic Boolean network. As with many approximation methods, a price must be paid for using a reduced model representation, namely, some loss of optimality relative to using the full state space. This paper examines the effects on intervention performance caused by the reduction with respect to various values of the model parameters. This task is performed using a new derivation for the transition probability matrix of the context-sensitive probabilistic Boolean network. This expression of transition probability distributions is in concert with the original definition of context-sensitive probabilistic Boolean network. The performance of optimal and approximate therapeutic strategies is compared for both synthetic networks and a real case study. It is observed that the approximate representation describes the dynamics of the context-sensitive probabilistic Boolean network through the instantaneously random probabilistic Boolean network with similar parameters.
Boolean networks with robust and reliable trajectories
International Nuclear Information System (INIS)
Schmal, Christoph; Peixoto, Tiago P; Drossel, Barbara
2010-01-01
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.
The Boolean algebra of Galois algebras
Directory of Open Access Journals (Sweden)
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
Theory reduction and non-Boolean theories.
Primas, H
1977-07-19
It is suggested that biological theories should be embedded into the family of non-Boolean theories based on an orthomodular propositional calculus. The structure of universal theories that include quantal phenomena is investigated and it is shown that their subtheories form a directed set which cannot be totally orders. A precise definition of theory reduction is given; it turns out that hierarchically different descriptive levels are not related by a homomorphic map. A subtheory that is reducible to a more general theory can be associated with the emergence of novel concepts and is in general subject to a wider empirical clissification scheme than the reducing theory. The implications of these results for reductionism, holism, emergence, and their conceptual unification are discussed.
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...
A full bayesian approach for boolean genetic network inference.
Directory of Open Access Journals (Sweden)
Shengtong Han
Full Text Available Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.
Attractor Transformation by Impulsive Control in Boolean Control Network
Directory of Open Access Journals (Sweden)
Bo Gao
2013-01-01
Full Text Available Boolean control networks have recently been attracting considerable interests as computational models for genetic regulatory networks. In this paper, we present an approach of impulsive control for attractor transitions in Boolean control networks based on the recent developed matrix semitensor product theory. The reachability of attractors is estimated, and the controller is also obtained. The general derivation proposed here is exemplified with a kind of gene model, which is the protein-nucleic acid interactions network, on numerical simulations.
Synchronization in an array of coupled Boolean networks
International Nuclear Information System (INIS)
Li, Rui; Chu, Tianguang
2012-01-01
This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.
Burgess, D E; Hundley, J C; Li, S G; Randall, D C; Brown, D R
1997-12-01
We have described a 0.4-Hz rhythm in renal sympathetic nerve activity (SNA) that is tightly coupled to 0.4-Hz oscillations in blood pressure in the unanesthetized rat. In previous work, the relationship between SNA and fluctuations in mean arterial blood pressure (MAP) was described by a set of two first-order differential equations. We have now modified our earlier model to test the feasibility that the 0.4-Hz rhythm can be explained by the baroreflex without requiring a neural oscillator. In this baroreflex model, a linear feedback term replaces the sympathetic drive to the cardiovascular system. The time delay in the feedback loop is set equal to the time delay on the efferent side, approximately 0.5 s (as determined in the initial model), plus a time delay of 0.2 s on the afferent side for a total time delay of approximately 0.7 s. A stability analysis of this new model yields feedback resonant frequencies close to 0.4 Hz. Because of the time delay in the feedback loop, the proportional gain may not exceed a value on the order of 10 to maintain stability. The addition of a derivative feedback term increases the system's stability for a positive range of derivative gains. We conclude that the known physiological time delay for the sympathetic portion of the baroreflex can account for the observed 0.4-Hz rhythm in rat MAP and that the sensitivity of the baroreceptors to the rate of change in blood pressure, as well as average blood pressure, would enhance the natural stability of the baroreflex.
Continuous time boolean modeling for biological signaling: application of Gillespie algorithm
Directory of Open Access Journals (Sweden)
Stoll Gautier
2012-08-01
Full Text Available Abstract Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. Background There exist two major types of mathematical modeling approaches: (1 quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2 and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Results Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be
Violon, D
2012-12-01
To develop a multicompartment model of only essential human body components that predicts the contrast medium concentration vs time curve in a chosen compartment after an intravenous injection. Also to show that the model can be used to time adequately contrast-enhanced CT series. A system of linked time delay instead of ordinary differential equations described the model and was solved with a Matlab program (Matlab v. 6.5; The Mathworks, Inc., Natick, MA). All the injection and physiological parameters were modified to cope with normal or pathological situations. In vivo time-concentration curves from the literature were recalculated to validate the model. The recalculated contrast medium time-concentration curves and parameters are given. The results of the statistical analysis of the study findings are expressed as the median prediction error and the median absolute prediction error values for both the time delay and ordinary differential equation systems; these are situated well below the generally accepted maximum 20% limit. The presented program correctly predicts the time-concentration curve of an intravenous contrast medium injection and, consequently, allows an individually tailored approach of CT examinations with optimised use of the injected contrast medium volume, as long as time delay instead of ordinary differential equations are used. The presented program offers good preliminary knowledge of the time-contrast medium concentration curve after any intravenous injection, allowing adequate timing of a CT examination, required by the short scan time of present-day scanners. The injected volume of contrast medium can be tailored to the individual patient with no more contrast medium than is strictly needed.
Directory of Open Access Journals (Sweden)
WANG Na
2016-06-01
Full Text Available We consider the singularly perturbed delayed systems of Tichonov′s type with fast and slow variables in a fast bimolecular reaction model. By means of the boundary layer function method, sewing connection and the implicit function theorem, we prove the existence of the solutions of our problems near the degenerate solution for a sufficiently small µ and determine its asymptotic behavior in µ. Meanwhile, the asymptotic expression of the systems is also constructed.
The stability of Boolean network with transmission sensitivity
Wang, Jiannan; Guo, Binghui; Wei, Wei; Mi, Zhilong; Yin, Ziqiao; Zheng, Zhiming
2017-09-01
Boolean network has been widely used in modeling biological systems and one of the key problems is its stability in response to small perturbations. Based on the hypothesis that the states of all nodes are homogenously updated, great progress has been made in previous works. In real biological networks, however, the updates of genes typically show much heterogeneity. To address such conditions, we introduce transmission sensitivity into Boolean network model. By the method of semi-annealed approximation, we illustrate that in a homogenous network, the critical condition of stability has no connection with its transmission sensitivity. As for heterogeneous networks, it reveals that correlations between network topology and transmission sensitivity can have profound effects on the its stability. This result shows a new mechanism that affects the stability of Boolean network, which could be used to control the dynamics in real biological systems.
A comparison of hypertext and Boolean access to biomedical information.
Friedman, C P; Wildemuth, B M; Muriuki, M; Gant, S P; Downs, S M; Twarog, R G; de Bliek, R
1996-01-01
This study explored which of two modes of access to a biomedical database better supported problem solving in bacteriology. Boolean access, which allowed subjects to frame their queries as combinations of keywords, was compared to hypertext access, which allowed subjects to navigate from one database node to another. The accessible biomedical data were identical across systems. Data were collected from 42 first year medical students, each randomized to the Boolean or hypertext system, before and after their bacteriology course. Subjects worked eight clinical case problems, first using only their personal knowledge and, subsequently, with aid from the database. Database retrievals enabled students to answer questions they could not answer based on personal knowledge only. This effect was greater when personal knowledge of bacteriology was lower. The results also suggest that hypertext was superior to Boolean access in helping subjects identify possible infectious agents in these clinical case problems.
Dynamic Network-Based Epistasis Analysis: Boolean Examples
Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.
2011-01-01
In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and
Koch, Gilbert; Wagner, Thomas; Plater-Zyberk, Christine; Lahu, Gezim; Schropp, Johannes
2012-02-01
Collagen-induced arthritis (CIA) in mice is an experimental model for rheumatoid arthritis, a human chronic inflammatory destructive disease. The therapeutic effect of neutralizing the cytokine granulocyte-macrophage colony-stimulating factor (GM-CSF) by an antibody was examined in the mouse disease in a view of deriving a pharmacokinetic/pharmacodynamic (PKPD) model. In CIA mice the development of disease is measured by a total arthritic score (TAS) and an ankylosis score (AKS). We present a multi-response PKPD model which describes the time course of the unperturbed and perturbed TAS and AKS. The antibody acts directly on GM-CSF by binding to it. Therefore, a compartment for the cytokine GM-CSF is an essential component of the mathematical model. This compartment drives the disease development in the PKPD model. Different known properties of arthritis development in the CIA model are included in the PKPD model. Firstly, the inflammation, driven by GM-CSF, dominates at the beginning of the disease and decreases after some time. Secondly, a destructive (ankylosis) part evolves in the TAS that is delayed in time. In order to model these two properties a delay differential equation was used. The PKPD model was applied to different experiments with doses ranging from 0.1 to 100 mg/kg. The influence of the drug was modeled by a non-linear approach. The final mathematical model consists of three differential equations representing the compartments for GM-CSF, inflammation and destruction. Our mathematical model described well all available dosing schedules by a simultaneous fit. We also present an equivalent and easy reformulation as ordinary differential equation which grants the use of standard PKPD software.
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...
A Boolean Approach to Airline Business Model Innovation
DEFF Research Database (Denmark)
Hvass, Kristian Anders
Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2017-02-01
Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.
On Kolmogorov's superpositions and Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-31
The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Zakarias, Sarah Nouhad Haddad
We present a protocol for securely computing a Boolean circuit $C$ in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming access to a preprocessing functionality that is not given the inputs to compute on. For a large number of players the work done by...... with an additional multiplication property. We also show a new algorithm for verifying the product of Boolean matrices in quadratic time with exponentially small error probability, where previous methods would only give a constant error....
Bistability and Asynchrony in a Boolean Model of the L-arabinose Operon in Escherichia coli.
Jenkins, Andy; Macauley, Matthew
2017-08-01
The lactose operon in Escherichia coli was the first known gene regulatory network, and it is frequently used as a prototype for new modeling paradigms. Historically, many of these modeling frameworks use differential equations. More recently, Stigler and Veliz-Cuba proposed a Boolean model that captures the bistability of the system and all of the biological steady states. In this paper, we model the well-known arabinose operon in E. coli with a Boolean network. This has several complex features not found in the lac operon, such as a protein that is both an activator and repressor, a DNA looping mechanism for gene repression, and the lack of inducer exclusion by glucose. For 11 out of 12 choices of initial conditions, we use computational algebra and Sage to verify that the state space contains a single fixed point that correctly matches the biology. The final initial condition, medium levels of arabinose and no glucose, successfully predicts the system's bistability. Finally, we compare the state space under synchronous and asynchronous update and see that the former has several artificial cycles that go away under a general asynchronous update.
Two-dimensional product-type systems of difference equations of delay-type (2,2,1,2
Directory of Open Access Journals (Sweden)
Stevo Stevic
2017-06-01
Full Text Available We prove that the following class of systems of difference equations is solvable in closed form: $$ z_{n+1}=\\alpha z_{n-1}^aw_n^b,\\quad w_{n+1}=\\beta w_{n-1}^cz_{n-1}^d,\\quad n\\in\\mathbb{N}_0, $$ where $a, b, c, d\\in\\mathbb{Z}$, $\\alpha, \\beta, z_{-1}, z_0, w_{-1}, w_0\\in\\mathbb{C}\\setminus\\{0\\}$. We present formulas for its solutions in all the cases. The most complex formulas are presented in terms of the zeros of three different associated polynomials to the systems corresponding to the cases a=0, c=0 and $abcd\
Document Ranking in E-Extended Boolean Logic
Czech Academy of Sciences Publication Activity Database
Holub, M.; Húsek, Dušan; Pokorný, J.
1996-01-01
Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic
On the Road to Genetic Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.
2007-01-01
Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007
Free Boolean algebras over unions of two well orderings
Czech Academy of Sciences Publication Activity Database
Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw
2009-01-01
Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009
Complexity of Identification and Dualization of Positive Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
1995-01-01
textabstractWe consider in this paper the problem of identifying min T(f{hook}) and max F(f{hook}) of a positive (i.e., monotone) Boolean function f{hook}, by using membership queries only, where min T(f{hook}) (max F(f{hook})) denotes the set of minimal true vectors (maximal false vectors) of
Development of Boolean calculus and its applications. [digital systems design
Tapia, M. A.
1980-01-01
The development of Boolean calculus for its application to developing digital system design methodologies that would reduce system complexity, size, cost, speed, power requirements, etc., is discussed. Synthesis procedures for logic circuits are examined particularly asynchronous circuits using clock triggered flip flops.
Learning restricted Boolean network model by time-series data.
Ouyang, Hongjia; Fang, Jie; Shen, Liangzhong; Dougherty, Edward R; Liu, Wenbin
2014-01-01
Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance [Formula: see text], the normalized Hamming distance of state transition [Formula: see text], and the steady-state distribution distance μ (ssd). Results show that the proposed algorithm outperforms the others according to both [Formula: see text] and [Formula: see text], whereas its performance according to μ (ssd) is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.
Kimizuka, M; Munakata, T; Rosinberg, M L
2010-10-01
We consider a network of N noisy bistable elements with global time-delayed couplings. In a two-state description, where elements are represented by Ising spins, the collective dynamics is described by an infinite hierarchy of coupled master equations which was solved at the mean-field level in the thermodynamic limit. When the number of elements is finite, as is the case in actual laser networks, an analytical description was deemed so far intractable and numerical studies seemed to be necessary. In this paper we consider the case of two interacting elements and show that a partial analytical description of the stationary state is possible if the stochastic process is time symmetric. This requires some relationship between the transition rates to be satisfied.
Ramezanpour, H R; Setayeshi, S; Akbari, M E
2011-01-01
Determining the optimal and effective scheme for administrating the chemotherapy agents in breast cancer is the main goal of this scientific research. The most important issue here is the amount of drug or radiation administrated in chemotherapy and radiotherapy for increasing patient's survival. This is because in these cases, the therapy not only kills the tumor cells, but also kills some of the healthy tissues and causes serious damages. In this paper we investigate optimal drug scheduling effect for breast cancer model which consist of nonlinear ordinary differential time-delay equations. In this paper, a mathematical model of breast cancer tumors is discussed and then optimal control theory is applied to find out the optimal drug adjustment as an input control of system. Finally we use Sensitivity Approach (SA) to solve the optimal control problem. The goal of this paper is to determine optimal and effective scheme for administering the chemotherapy agent, so that the tumor is eradicated, while the immune systems remains above a suitable level. Simulation results confirm the effectiveness of our proposed procedure. In this paper a new scheme is proposed to design a therapy protocol for chemotherapy in Breast Cancer. In contrast to traditional pulse drug delivery, a continuous process is offered and optimized, according to the optimal control theory for time-delay systems.
Dynamic network-based epistasis analysis: Boolean examples
Directory of Open Access Journals (Sweden)
Eugenio eAzpeitia
2011-12-01
Full Text Available In this review we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the topologies of gene interactions infered. This has been acknowledged in several previous papers and reviews, but here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson (herein, classical epistasis, defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus. Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct gene interaction topologies are hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our review complements previous accounts, not
Directory of Open Access Journals (Sweden)
Chao Luo
Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.
Noisy random Boolean formulae: a statistical physics perspective.
Mozeika, Alexander; Saad, David; Raymond, Jack
2010-10-01
Properties of computing Boolean circuits composed of noisy logical gates are studied using the statistical physics methodology. A formula-growth model that gives rise to random Boolean functions is mapped onto a spin system, which facilitates the study of their typical behavior in the presence of noise. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding macroscopic phase transitions. The framework is employed for deriving results on error-rates at various function-depths and function sensitivity, and their dependence on the gate-type and noise model used. These are difficult to obtain via the traditional methods used in this field.
Mapping knowledge to boolean dynamic systems in Bateson's epistemology.
Malloy, Thomas E; Jensen, Gary C; Song, Timothy
2005-01-01
Gregory Bateson (1972, 1979) established an epistemology that integrates mind and nature as a necessary unity, a unity in which learning and evolution share fundamental principles and in which criteria for mental process are explicitly specified. E42 is a suite of freely available Java applets that constitute an online research lab for creating and interacting with simulations of the Boolean systems developed by Kauffman (1993) in his study of evolution where he proposed that self-organization and natural selection are co-principles "weaving the tapestry of life." This paper maps Boolean systems, developed in the study of evolution, onto Bateson's epistemology in general and onto his criteria of mental process in particular.
Boolean Functions with a Simple Certificate for CNF Complexity
Czech Academy of Sciences Publication Activity Database
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Elements of Boolean-Valued Dempster-Shafer Theory
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2000-01-01
Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics
Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.
Klarner, Hannes; Siebert, Heike
2015-01-01
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Boolean models can explain bistability in the lac operon.
Veliz-Cuba, Alan; Stigler, Brandilyn
2011-06-01
The lac operon in Escherichia coli has been studied extensively and is one of the earliest gene systems found to undergo both positive and negative control. The lac operon is known to exhibit bistability, in the sense that the operon is either induced or uninduced. Many dynamical models have been proposed to capture this phenomenon. While most are based on complex mathematical formulations, it has been suggested that for other gene systems network topology is sufficient to produce the desired dynamical behavior. We present a Boolean network as a discrete model for the lac operon. Our model includes the two main glucose control mechanisms of catabolite repression and inducer exclusion. We show that this Boolean model is capable of predicting the ON and OFF steady states and bistability. Further, we present a reduced model which shows that lac mRNA and lactose form the core of the lac operon, and that this reduced model exhibits the same dynamics. This work suggests that the key to model qualitative dynamics of gene systems is the topology of the network and Boolean models are well suited for this purpose.
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
Approximating attractors of Boolean networks by iterative CTL model checking
Directory of Open Access Journals (Sweden)
Hannes eKlarner
2015-09-01
Full Text Available This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: faithfulness which requires that the oscillating variables of all attractors in a trapspace correspond to their dimensions, univocality which requires that there is a unique attractor in each trap space and completeness which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal and complete which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Boolean Models of Biological Processes Explain Cascade-Like Behavior
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-01
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either “on” or “off” and along with the molecules interact with each other, their individual status changes from “on” to “off” or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes. PMID:26821940
Binary higher order neural networks for realizing Boolean functions.
Zhang, Chao; Yang, Jie; Wu, Wei
2011-05-01
In order to more efficiently realize Boolean functions by using neural networks, we propose a binary product-unit neural network (BPUNN) and a binary π-ς neural network (BPSNN). The network weights can be determined by one-step training. It is shown that the addition " σ," the multiplication " π," and two kinds of special weighting operations in BPUNN and BPSNN can implement the logical operators " ∨," " ∧," and " ¬" on Boolean algebra 〈Z(2),∨,∧,¬,0,1〉 (Z(2)={0,1}), respectively. The proposed two neural networks enjoy the following advantages over the existing networks: 1) for a complete truth table of N variables with both truth and false assignments, the corresponding Boolean function can be realized by accordingly choosing a BPUNN or a BPSNN such that at most 2(N-1) hidden nodes are needed, while O(2(N)), precisely 2(N) or at most 2(N), hidden nodes are needed by existing networks; 2) a new network BPUPS based on a collaboration of BPUNN and BPSNN can be defined to deal with incomplete truth tables, while the existing networks can only deal with complete truth tables; and 3) the values of the weights are all simply -1 or 1, while the weights of all the existing networks are real numbers. Supporting numerical experiments are provided as well. Finally, we present the risk bounds of BPUNN, BPSNN, and BPUPS, and then analyze their probably approximately correct learnability.
On the Computation of Comprehensive Boolean Gröbner Bases
Inoue, Shutaro
We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.
Kim, Peter S; Lee, Peter P
2012-01-01
A next generation approach to cancer envisions developing preventative vaccinations to stimulate a person's immune cells, particularly cytotoxic T lymphocytes (CTLs), to eliminate incipient tumors before clinical detection. The purpose of our study is to quantitatively assess whether such an approach would be feasible, and if so, how many anti-cancer CTLs would have to be primed against tumor antigen to provide significant protection. To understand the relevant dynamics, we develop a two-compartment model of tumor-immune interactions at the tumor site and the draining lymph node. We model interactions at the tumor site using an agent-based model (ABM) and dynamics in the lymph node using a system of delay differential equations (DDEs). We combine the models into a hybrid ABM-DDE system and investigate dynamics over a wide range of parameters, including cell proliferation rates, tumor antigenicity, CTL recruitment times, and initial memory CTL populations. Our results indicate that an anti-cancer memory CTL pool of 3% or less can successfully eradicate a tumor population over a wide range of model parameters, implying that a vaccination approach is feasible. In addition, sensitivity analysis of our model reveals conditions that will result in rapid tumor destruction, oscillation, and polynomial rather than exponential decline in the tumor population due to tumor geometry.
On the Equational Definition of the Least Prefixed Point
DEFF Research Database (Denmark)
Santocanale, Luigi
2003-01-01
We propose a method to axiomatize by equations the least prefixed point of an order preserving function. We discuss its domain of application and show that the Boolean modal μ-calculus has a complete equational axiomatization. The method relies on the existence of a “closed structure” and its...
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-08-28
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
Order-to-chaos transition in the hardness of random Boolean satisfiability problems
Varga, Melinda; Sumi, Róbert; Toroczkai, Zoltán; Ercsey-Ravasz, Mária
2016-05-01
Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical systems as diverse as fluids, chemical reactions, and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of constraint satisfaction problems that include scheduling, circuit design, routing, database problems, and even Sudoku. In particular, we present a study of the emergence of hardness in Boolean satisfiability (k -SAT), a canonical class of constraint satisfaction problems, by using an analog deterministic algorithm based on a system of ordinary differential equations. Problem hardness is defined through the escape rate κ , an invariant measure of transient chaos of the dynamical system corresponding to the analog algorithm, and it expresses the rate at which the trajectory approaches a solution. We show that for a given density of constraints and fixed number of Boolean variables N , the hardness of formulas in random k -SAT ensembles has a wide variation, approximable by a lognormal distribution. We also show that when increasing the density of constraints α , hardness appears through a second-order phase transition at αχ in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic. A similar behavior is found in 4-SAT as well, however, such a transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter κ ˜NB |α - αχ|1-γ with 0 <γ <1 . We demonstrate that the transition is generated by the appearance of metastable basins in the solution space as the density of constraints α is increased.
An Association Rule Mining Algorithm Based on a Boolean Matrix
Directory of Open Access Journals (Sweden)
Hanbing Liu
2007-09-01
Full Text Available Association rule mining is a very important research topic in the field of data mining. Discovering frequent itemsets is the key process in association rule mining. Traditional association rule algorithms adopt an iterative method to discovery, which requires very large calculations and a complicated transaction process. Because of this, a new association rule algorithm called ABBM is proposed in this paper. This new algorithm adopts a Boolean vector "relational calculus" method to discovering frequent itemsets. Experimental results show that this algorithm can quickly discover frequent itemsets and effectively mine potential association rules.
A Construction of Boolean Functions with Good Cryptographic Properties
2014-01-01
over Fn2 defined by Wf (u) = ∑ x∈Fn2 (−1)f(x)+u·x, where u ∈ Fn2 and u · x is an inner product , for instance, u · x = u1x1 + u2x3 + · · · + unxn, where u...later on for all these classes. We mention also the paper of Pasalic [27], which introduces the notion of high degree product (HDP) to mea- sure the...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum
A Boolean Approach to Airline Business Model Innovation
DEFF Research Database (Denmark)
Hvass, Kristian Anders
Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
Complexity classifications for different equivalence and audit problems for Boolean circuits
BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
2010-01-01
We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.
Proposed method to construct Boolean functions with maximum possible annihilator immunity
Goyal, Rajni; Panigrahi, Anupama; Bansal, Rohit
2017-07-01
Nonlinearity and Algebraic(annihilator) immunity are two core properties of a Boolean function because optimum values of Annihilator Immunity and nonlinearity are required to resist fast algebraic attack and differential cryptanalysis respectively. For a secure cypher system, Boolean function(S-Boxes) should resist maximum number of attacks. It is possible if a Boolean function has optimal trade-off among its properties. Before constructing Boolean functions, we fixed the criteria of our constructions based on its properties. In present work, our construction is based on annihilator immunity and nonlinearity. While keeping above facts in mind,, we have developed a multi-objective evolutionary approach based on NSGA-II and got the optimum value of annihilator immunity with good bound of nonlinearity. We have constructed balanced Boolean functions having the best trade-off among balancedness, Annihilator immunity and nonlinearity for 5, 6 and 7 variables by the proposed method.
Chemical Visualization of Boolean Functions: A Simple Chemical Computer
Blittersdorf, R.; Müller, J.; Schneider, F. W.
1995-08-01
We present a chemical realization of the Boolean functions AND, OR, NAND, and NOR with a neutralization reaction carried out in three coupled continuous flow stirred tank reactors (CSTR). Two of these CSTR's are used as input reactors, the third reactor marks the output. The chemical reaction is the neutralization of hydrochloric acid (HCl) with sodium hydroxide (NaOH) in the presence of phenolphtalein as an indicator, which is red in alkaline solutions and colorless in acidic solutions representing the two binary states 1 and 0, respectively. The time required for a "chemical computation" is determined by the flow rate of reactant solutions into the reactors since the neutralization reaction itself is very fast. While the acid flow to all reactors is equal and constant, the flow rate of NaOH solution controls the states of the input reactors. The connectivities between the input and output reactors determine the flow rate of NaOH solution into the output reactor, according to the chosen Boolean function. Thus the state of the output reactor depends on the states of the input reactors.
Boolean models of biosurfactants production in Pseudomonas fluorescens.
Directory of Open Access Journals (Sweden)
Adrien Richard
Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
Evolution of a designless nanoparticle network into reconfigurable Boolean logic.
Bose, S K; Lawrence, C P; Liu, Z; Makarenko, K S; van Damme, R M J; Broersma, H J; van der Wiel, W G
2015-12-01
Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures.
Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.
Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde
2015-08-28
In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.
Adapted Boolean network models for extracellular matrix formation
Directory of Open Access Journals (Sweden)
Wollbold Johannes
2009-07-01
Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF
Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles
Directory of Open Access Journals (Sweden)
Shah Imran
2011-07-01
Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Muñoz, Stalin; Carrillo, Miguel; Azpeitia, Eugenio; Rosenblueth, David A.
2018-01-01
Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic) attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin. PMID:29559993
International Nuclear Information System (INIS)
Adamovich, L.A.; Azarov, V.V.
1999-01-01
Time dependent core power behavior in a nuclear reactor is described with well-known neutron kinetics equations. At the same time, two portions are distinguished in energy released from uranium nuclei fission; one released directly at fission and another delayed (residual) portion produced during radioactive decay of fission products. While prompt power is definitely described with kinetics equations, the delayed power presentation still remains outstanding. Since in operation the delayed power part is relatively small (about 6%) operation, it can be neglected for small reactivity disturbances assuming that entire power obeys neutron kinetics equations. In case of a high negative reactivity rapidly inserted in core (e.g. reactor scram initiation) the prompt and delayed components can be calculated separately with practically no impact on each other, employing kinetics equations for prompt power and known approximation formulas for delayed portion, named residual in this specific case. Under substantial disturbances the prompt component in the dynamic process becomes commensurable with delayed portion, thus making necessary to take into account their cross impact. A system of differential equations to describe time-dependent behavior of delayed power is presented. Specific NPP analysis shows a way to significantly simplify the task formulation. (author)
Reconfigurable Boolean logic using magnetic single-electron transistors.
Directory of Open Access Journals (Sweden)
M Fernando Gonzalez-Zalba
Full Text Available We propose a novel hybrid single-electron device for reprogrammable low-power logic operations, the magnetic single-electron transistor (MSET. The device consists of an aluminium single-electron transistor with a GaMnAs magnetic back-gate. Changing between different logic gate functions is realized by reorienting the magnetic moments of the magnetic layer, which induces a voltage shift on the Coulomb blockade oscillations of the MSET. We show that we can arbitrarily reprogram the function of the device from an n-type SET for in-plane magnetization of the GaMnAs layer to p-type SET for out-of-plane magnetization orientation. Moreover, we demonstrate a set of reprogrammable Boolean gates and its logical complement at the single device level. Finally, we propose two sets of reconfigurable binary gates using combinations of two MSETs in a pull-down network.
Reconfigurable Boolean Logic Using Magnetic Single-Electron Transistors
Gonzalez-Zalba, M. Fernando; Ciccarelli, Chiara; Zarbo, Liviu P.; Irvine, Andrew C.; Campion, Richard C.; Gallagher, Bryan L.; Jungwirth, Tomas; Ferguson, Andrew J.; Wunderlich, Joerg
2015-01-01
We propose a novel hybrid single-electron device for reprogrammable low-power logic operations, the magnetic single-electron transistor (MSET). The device consists of an aluminium single-electron transistor with a GaMnAs magnetic back-gate. Changing between different logic gate functions is realized by reorienting the magnetic moments of the magnetic layer, which induces a voltage shift on the Coulomb blockade oscillations of the MSET. We show that we can arbitrarily reprogram the function of the device from an n-type SET for in-plane magnetization of the GaMnAs layer to p-type SET for out-of-plane magnetization orientation. Moreover, we demonstrate a set of reprogrammable Boolean gates and its logical complement at the single device level. Finally, we propose two sets of reconfigurable binary gates using combinations of two MSETs in a pull-down network. PMID:25923789
Identification of Boolean Networks Using Premined Network Topology Information.
Zhang, Xiaohua; Han, Huaxiang; Zhang, Weidong
2017-02-01
This brief aims to reduce the data requirement for the identification of Boolean networks (BNs) by using the premined network topology information. First, a matching table is created and used for sifting the true from the false dependences among the nodes in the BNs. Then, a dynamic extension to matching table is developed to enable the dynamic locating of matching pairs to start as soon as possible. Next, based on the pseudocommutative property of the semitensor product, a position-transform mining is carried out to further improve data utilization. Combining the above, the topology of the BNs can be premined for the subsequent identification. Examples are given to illustrate the efficiency of reducing the data requirement. Some excellent features, such as the online and parallel processing ability, are also demonstrated.
ZKBoo: Faster Zero-Knowledge for Boolean Circuits
DEFF Research Database (Denmark)
Giacomelli, Irene; Madsen, Jesper; Orlandi, Claudio
2016-01-01
variants of IKOS, which highlights their pros and cons for practically rele- vant soundness parameters; ◦ A generalization and simplification of their approach, which leads to faster Σ-protocols (that can be made non-interactive using the Fiat-Shamir heuristic) for state- ments of the form “I know x...... such that y = φ (x)” (where φ is a circuit and y a public value); ◦ A case study, where we provide explicit protocols, implementations and benchmarking of zero-knowledge protocols for the SHA-1 and SHA-256 circuits.......In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-of- concept implementation. As an highlight, we can generate (resp. verify) a non-interactive proof for the SHA-1 circuit in approximately 13...
Boolean Algebra Application in Analysis of Flight Accidents
Directory of Open Access Journals (Sweden)
Casandra Venera BALAN
2015-12-01
Full Text Available Fault tree analysis is a deductive approach for resolving an undesired event into its causes, identifying the causes of a failure and providing a framework for a qualitative and quantitative evaluation of the top event. An alternative approach to fault tree analysis methods calculus goes to logical expressions and it is based on a graphical representation of the data structure for a logic - based binary decision diagram representation. In this analysis, such sites will be reduced to a minimal size and arranged in the sense that the variables appear in the same order in each path. An event can be defined as a statement that can be true or false. Therefore, Boolean algebra rules allow restructuring of a Fault Tree into one equivalent to it, but simpler.
Unlimited multistability and Boolean logic in microbial signalling
DEFF Research Database (Denmark)
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca
2015-01-01
reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two......-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger...
Functional equations with causal operators
Corduneanu, C
2003-01-01
Functional equations encompass most of the equations used in applied science and engineering: ordinary differential equations, integral equations of the Volterra type, equations with delayed argument, and integro-differential equations of the Volterra type. The basic theory of functional equations includes functional differential equations with causal operators. Functional Equations with Causal Operators explains the connection between equations with causal operators and the classical types of functional equations encountered by mathematicians and engineers. It details the fundamentals of linear equations and stability theory and provides several applications and examples.
Boolean and advanced searching for EDGAR data on www.sec.gov
Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
Directory of Open Access Journals (Sweden)
Vladimir A. Emelichev
2002-11-01
Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained.
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
Dubrova, Elena; Teslenko, Maxim
2011-01-01
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.
Constructivizability of the Boolean algebra B(ω) with a distinguished automorphism
Czech Academy of Sciences Publication Activity Database
Bazhenov, N. A.; Tukhbatullina, Regina
2012-01-01
Roč. 51, č. 5 (2012), s. 384-403 ISSN 0002-5232 Institutional support: PRVOUK-P23 Keywords : Boolean algebra * constructivizability * degree spectra of structures Subject RIV: AH - Economics Impact factor: 0.493, year: 2012
A novel generalized design methodology and realization of Boolean operations using DNA.
Zoraida, B S E; Arock, Michael; Ronald, B S M; Ponalagusamy, R
2009-09-01
The biological deoxyribonucleic acid (DNA) strand has been increasingly seen as a promising computing unit. A new algorithm is formulated in this paper to design any DNA Boolean operator with molecular beacons (MBs) as its input. Boolean operators realized using the proposed design methodology is presented. The developed operators adopt a uniform representation for logical 0 and 1 for any Boolean operator. The Boolean operators designed in this work employ only a hybridization operation at each stage. Further, this paper for the first time brings out the realization of a binary adder and subtractor using molecular beacons. Simulation results of the DNA-based binary adder and subtractor are given to validate the design.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions
DEFF Research Database (Denmark)
Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne
2005-01-01
We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic.......We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....
2017-09-01
duties due to Sailors, across the globe, who stand the watch. As Winston Churchill once said, “we sleep safely at night because rough men stand ready...Chapter 2 contains definitions and preliminary generalized Boolean function material. This is followed by Chapters 3–5, which contain the bulk of the...Generalized Boolean Functions Sic Parvis Magna Sir Francis DrakeA In this chapter we begin by covering some basic definitions and properties which we will make
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
Delayed Stochastic Linear-Quadratic Control Problem and Related Applications
Directory of Open Access Journals (Sweden)
Li Chen
2012-01-01
stochastic differential equations (FBSDEs with Itô’s stochastic delay equations as forward equations and anticipated backward stochastic differential equations as backward equations. Especially, we present the optimal feedback regulator for the time delay system via a new type of Riccati equations and also apply to a population optimal control problem.
Graphene-based non-Boolean logic circuits
Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.
2013-10-01
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.
Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.
Dallidis, Stylianos E; Karafyllidis, Ioannis G
2014-09-01
To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.
Directory of Open Access Journals (Sweden)
Emmanuel K. Essel
2014-01-01
Full Text Available We prove that the totally nonlinear second-order neutral differential equation \\[\\frac{d^2}{dt^2}x(t+p(t\\frac{d}{dt}x(t+q(th(x(t\\] \\[=\\frac{d}{dt}c(t,x(t-\\tau(t+f(t,\\rho(x(t,g(x(t-\\tau(t\\] has positive periodic solutions by employing the Krasnoselskii-Burton hybrid fixed point theorem.
Modeling integrated cellular machinery using hybrid Petri-Boolean networks.
Directory of Open Access Journals (Sweden)
Natalie Berestovsky
Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them
Unlimited multistability and Boolean logic in microbial signalling.
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca; Soyer, Orkun S
2015-07-06
The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and allow their engineering through synthetic biology.
Structures and Boolean Dynamics in Gene Regulatory Networks
Szedlak, Anthony
This dissertation discusses the topological and dynamical properties of GRNs in cancer, and is divided into four main chapters. First, the basic tools of modern complex network theory are introduced. These traditional tools as well as those developed by myself (set efficiency, interset efficiency, and nested communities) are crucial for understanding the intricate topological properties of GRNs, and later chapters recall these concepts. Second, the biology of gene regulation is discussed, and a method for disease-specific GRN reconstruction developed by our collaboration is presented. This complements the traditional exhaustive experimental approach of building GRNs edge-by-edge by quickly inferring the existence of as of yet undiscovered edges using correlations across sets of gene expression data. This method also provides insight into the distribution of common mutations across GRNs. Third, I demonstrate that the structures present in these reconstructed networks are strongly related to the evolutionary histories of their constituent genes. Investigation of how the forces of evolution shaped the topology of GRNs in multicellular organisms by growing outward from a core of ancient, conserved genes can shed light upon the ''reverse evolution'' of normal cells into unicellular-like cancer states. Next, I simulate the dynamics of the GRNs of cancer cells using the Hopfield model, an infinite range spin-glass model designed with the ability to encode Boolean data as attractor states. This attractor-driven approach facilitates the integration of gene expression data into predictive mathematical models. Perturbations representing therapeutic interventions are applied to sets of genes, and the resulting deviations from their attractor states are recorded, suggesting new potential drug targets for experimentation. Finally, I extend the Hopfield model to modular networks, cyclic attractors, and complex attractors, and apply these concepts to simulations of the cell cycle
Guo, Wensheng; Yang, Guowu; Wu, Wei; He, Lei; Sun, Mingyu
2014-01-01
In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
Anticipated backward stochastic differential equations
Peng, Shige; Yang, Zhe
2007-01-01
In this paper we discuss new types of differential equations which we call anticipated backward stochastic differential equations (anticipated BSDEs). In these equations the generator includes not only the values of solutions of the present but also the future. We show that these anticipated BSDEs have unique solutions, a comparison theorem for their solutions, and a duality between them and stochastic differential delay equations.
Directory of Open Access Journals (Sweden)
Tomáš Mrkvička
2011-03-01
Full Text Available Methods for testing the Boolean model assumption from binary images are briefly reviewed. Two hundred binary images of mammary cancer tissue and 200 images of mastopathic tissue were tested individually on the Boolean model assumption. In a previous paper, it had been found that a Monte Carlo method based on the approximation of the envelopes by a multi-normal distribution with the normalized intrinsic volume densities of parallel sets as a summary statistics had the highest power for this purpose. Hence, this method was used here as its first application to real biomedical data. It was found that mastopathic tissue deviates from the Boolean model significantly more strongly than mammary cancer tissue does.
Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2010-01-01
Full Text Available In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.
Mechanical system reliability analysis using a combination of graph theory and Boolean function
International Nuclear Information System (INIS)
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
Sartabanov, Zhaishylyk A.
2017-09-01
A new approach to the study of periodic by all independent variables system of equations with a differentiation operator solutions along the direction of the main diagonal and with delayed arguments is proposed. The essence of the approach is to reduce the study of the multi-periodic solution of a linear inhomogeneous system to the construction of a solution of a simpler linear differential-difference system on the basis of the method of variating arbitrary constants of the complete integral of a homogeneous system. An integral representation of the unique multiperiodic solution of an inhomogeneous system is presented, expressed by a functional series of terms given by multiple repeated integrals. An estimate is given for the norm of a multi-periodic solution.
Improving the quantum cost of reversible Boolean functions using reorder algorithm
Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf
2018-05-01
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Le Yu
2007-05-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into Ã‚Â“pureÃ‚Â” subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm
Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix
Directory of Open Access Journals (Sweden)
Chip-Hong Chang
2002-01-01
Full Text Available In this article, we have shown, by means of the EXOR Ternary Decision Diagram that the number of literals and product terms of the Fixed Polarity Reed–Muller (FPRM expansions can be used to fully classify all Boolean functions in NP equivalent class and NPN equivalent class, respectively. Efficient graph based algorithms to compute the complete weight vectors have been presented. The proof and computation method has led to the derivation of a set of characteristic signatures that has low probability of aliasing when used as the Boolean matching filters in library mapping.
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Xiao Yufei
2007-01-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into "pure" subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm, this paper
Fractional variational principles with delay
International Nuclear Information System (INIS)
Baleanu, Dumitru; Abdeljawad, Thabet Maaraba; Jarad, Fahd
2008-01-01
The fractional variational principles within Riemann-Liouville fractional derivatives in the presence of delay are analyzed. The corresponding Euler-Lagrange equations are obtained and one example is analyzed in detail
Lag synchronization of chaotic systems with time-delayed linear ...
Indian Academy of Sciences (India)
delayed linear terms via impulsive control is investigated. Based on the stability theory of impulsive delayed differen- tial equations, some sufficient conditions are obtained guaranteeing the synchronized behaviours between two delayed chaotic ...
Directory of Open Access Journals (Sweden)
Ivana Dragović
2015-01-01
Full Text Available Fuzzy inference systems (FIS enable automated assessment and reasoning in a logically consistent manner akin to the way in which humans reason. However, since no conventional fuzzy set theory is in the Boolean frame, it is proposed that Boolean consistent fuzzy logic should be used in the evaluation of rules. The main distinction of this approach is that it requires the execution of a set of structural transformations before the actual values can be introduced, which can, in certain cases, lead to different results. While a Boolean consistent FIS could be used for establishing the diagnostic criteria for any given disease, in this paper it is applied for determining the likelihood of peritonitis, as the leading complication of peritoneal dialysis (PD. Given that patients could be located far away from healthcare institutions (as peritoneal dialysis is a form of home dialysis the proposed Boolean consistent FIS would enable patients to easily estimate the likelihood of them having peritonitis (where a high likelihood would suggest that prompt treatment is indicated, when medical experts are not close at hand.
Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...
Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type
Matoušek, Milan; Pták, Pavel
2015-12-01
Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.
Yes/No/Maybe: A Boolean attempt at feedback | Louw | Journal for ...
African Journals Online (AJOL)
This paper describes an experiment in which Boolean feedback (a kind of checklist) was used to provide feedback on the paragraph structures of first year students in an Academic Literacy course. We begin by introducing the major problems with feedback on L2 writing and establishing why a focus on paragraph structures ...
The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students
Tomaszewski, Robert
2016-01-01
Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…
GBL-2D Version 1.0: a 2D geometry boolean library.
Energy Technology Data Exchange (ETDEWEB)
McBride, Cory L. (Elemental Technologies, American Fort, UT); Schmidt, Rodney Cannon; Yarberry, Victor R.; Meyers, Ray J. (Elemental Technologies, American Fort, UT)
2006-11-01
This report describes version 1.0 of GBL-2D, a geometric Boolean library for 2D objects. The library is written in C++ and consists of a set of classes and routines. The classes primarily represent geometric data and relationships. Classes are provided for 2D points, lines, arcs, edge uses, loops, surfaces and mask sets. The routines contain algorithms for geometric Boolean operations and utility functions. Routines are provided that incorporate the Boolean operations: Union(OR), XOR, Intersection and Difference. A variety of additional analytical geometry routines and routines for importing and exporting the data in various file formats are also provided. The GBL-2D library was originally developed as a geometric modeling engine for use with a separate software tool, called SummitView [1], that manipulates the 2D mask sets created by designers of Micro-Electro-Mechanical Systems (MEMS). However, many other practical applications for this type of software can be envisioned because the need to perform 2D Boolean operations can arise in many contexts.
Computable categoricity of the Boolean algebra B(omega) with a distinguished automorphism
Czech Academy of Sciences Publication Activity Database
Bazhenov, N. A.; Tukhbatullina, Regina
2013-01-01
Roč. 52, č. 2 (2013), s. 89-97 ISSN 0002-5232 Institutional support: PRVOUK-P23 Keywords : Boolean algebra with distinguished automorphism * computable categoricity * categoricity spectrum Subject RIV: BA - General Mathematics Impact factor: 0.488, year: 2013
An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Comparison of Detection and Classification Algorithms Using Boolean and Fuzzy Techniques
Directory of Open Access Journals (Sweden)
Rahul Dixit
2012-01-01
Full Text Available Modern military ranging, tracking, and classification systems are capable of generating large quantities of data. Conventional “brute-force” computational techniques, even with Moore’s law for processors, present a prohibitive computational challenge, and often, the system either fails to “lock onto” a target of interest within the available duty cycle, or the data stream is simply discarded because the system runs out of processing power or time. In searching for high-fidelity convergence, researchers have experimented with various reduction techniques, often using logic diagrams to make inferences from related signal data. Conventional Boolean and fuzzy logic systems generate a very large number of rules, which often are difficult to handle due to limitations in the processors. Published research has shown that reasonable approximations of the target are preferred over incomplete computations. This paper gives a figure of merit for comparing various logic analysis methods and presents results for a hypothetical target classification scenario. Novel multiquantization Boolean approaches also reduce the complexity of these multivariate analyses, making it possible to better use the available data to approximate target classification. This paper shows how such preprocessing can reasonably preserve result confidence and compares the results between Boolean, multi-quantization Boolean, and fuzzy techniques.
DEFF Research Database (Denmark)
Kolby, Nanna; Busch, Alexander Siegfried; Juul, Anders
2017-01-01
Delayed puberty can be a source of great concern and anxiety, although it usually is caused by a self-limiting variant of the normal physiological timing named constitutional delay of growth and puberty (CDGP). Delayed puberty can, however, also be the first presentation of a permanent condition ...... mineral density) and psychological (e.g., low self-esteem) and underline the importance of careful clinical assessment of the patients....
Nonlinear integrodifferential equations as discrete systems
Tamizhmani, K. M.; Satsuma, J.; Grammaticos, B.; Ramani, A.
1999-06-01
We analyse a class of integrodifferential equations of the `intermediate long wave' (ILW) type. We show that these equations can be formally interpreted as discrete, differential-difference systems. This allows us to link equations of this type with previous results of ours involving differential-delay equations and, on the basis of this, propose new integrable equations of ILW type. Finally, we extend this approach to pure difference equations and propose ILW forms for the discrete lattice KdV equation.
Derivation and computation of discrete-delay and continuous-delay SDEs in mathematical biology.
Allen, Edward J
2014-06-01
Stochastic versions of several discrete-delay and continuous-delay differential equations, useful in mathematical biology, are derived from basic principles carefully taking into account the demographic, environmental, or physiological randomness in the dynamic processes. In particular, stochastic delay differential equation (SDDE) models are derived and studied for Nicholson's blowflies equation, Hutchinson's equation, an SIS epidemic model with delay, bacteria/phage dynamics, and glucose/insulin levels. Computational methods for approximating the SDDE models are described. Comparisons between computational solutions of the SDDEs and independently formulated Monte Carlo calculations support the accuracy of the derivations and of the computational methods.
On the Equational Definition of the Least Prefixed Point
DEFF Research Database (Denmark)
Santocanale, Luigi
2001-01-01
We show how to axiomatize by equations the least prexed point of an order preserving function and discuss the domain of application of the proposed method. Thus, we generalize the well known equational axiomatization of Propositional Dynamic Logic to a complete equational axiomatization of the Bo......We show how to axiomatize by equations the least prexed point of an order preserving function and discuss the domain of application of the proposed method. Thus, we generalize the well known equational axiomatization of Propositional Dynamic Logic to a complete equational axiomatization...... of the Boolean Modal -Calculus. We show on the other hand that the existence of a term which does not preserve the order is an essential condition for the least prexed point to be denable by equations....
Modelling delays in pharmacokinetics
International Nuclear Information System (INIS)
Farooqi, Z.H.; Lambrecht, R.M.
1990-01-01
Linear system analysis has come to form the backbone of pharmacokinetics. Natural systems usually involve time delays, thus models incorporating them would be an order closer approximation to the real world compared to those that do not. Delays may be modelled in several ways. The approach considered in this study is to have a discrete-time delay dependent rate with the delay respresenting the duration between the entry of a drug into a compartment and its release in some form (may be as a metabolite) from the compartment. Such a delay may be because of one or more of several physiological reasons, like, formation of a reservoir, slow metabolism, or receptor binding. The mathematical structure this gives rise to is a system of delay-differential equations. Examples are given of simple one and two compartment systems with drugs like bumetanide, carbamazepine, and quinolone-caffeine interaction. In these examples generally a good fit is obtained and the suggested models form a good approximation. 21 refs., 6 figs
Cordón García, Oscar; Moya Anegón, Félix de; Zarco Fernández, Carmen
2000-01-01
[ES] Although the fuzzy retrieval model constitutes a powerful extension of the boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered t...
CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS
Directory of Open Access Journals (Sweden)
P. N. Bibilo
2016-01-01
Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
DEFF Research Database (Denmark)
Gutin, Gregory; Yeo, Anders
2012-01-01
A function f: -1,1n→R is called pseudo-Boolean. It is well-known that each pseudo-Boolean function f can be written as f(x)=∑ I∈Ff̂(I) χI(x), where F⊆I:I⊆[n], [n]=1,2,...,n, χI(x)= ∏ i∈I xi and f̂(I) are non-zero reals. The degree of f is max|I|:I∈F and the width of f is the minimum integer ρ suc...... for each q>papplications, we prove a stronger inequality: || f||4≤( 2ρ+1)14|| f||2....
Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
Czech Academy of Sciences Publication Activity Database
Kainen, P.C.; Kůrková, Věra; Sanguineti, M.
2005-01-01
Roč. 4, č. 4 (2005), s. 355-368 ISSN 1570-1166 R&D Projects: GA ČR GA201/02/0428; GA ČR GA201/05/0557 Grant - others:Area MC 6(EU) Project 22 Institutional research plan: CEZ:AV0Z10300504 Keywords : high-dimensional optimization * minimizing sequences * Boolean decision functions * decision tree Subject RIV: BA - General Mathematics
Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2009-01-01
Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Representations and Rates of Approximation of Real-Valued Boolean Functions by Neural Networks
Czech Academy of Sciences Publication Activity Database
Kůrková, Věra; Savický, Petr; Hlaváčková, Kateřina
1998-01-01
Roč. 11, č. 4 (1998), s. 651-659 ISSN 0893-6080 R&D Projects: GA AV ČR IAA2030602; GA AV ČR IAA2075606; GA ČR GA201/95/0976 Keywords : real-valued Boolean function * percepron network * rate of approximation * variation with respect to half-spaces * decision tree * Hadamard communication matrix Subject RIV: BA - General Mathematics Impact factor: 1.017, year: 1998
Completely positive matrices over Boolean algebras and their CP-rank
Directory of Open Access Journals (Sweden)
Mohindru Preeti
2015-04-01
Full Text Available Drew, Johnson and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n2/4]. In this paper, we prove this conjecture for n × n completely positive matrices over Boolean algebras (finite or infinite. In addition,we formulate various CP-rank inequalities of completely positive matrices over special semirings using semiring homomorphisms.
Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.
2015-01-01
We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572
Reverse engineering Boolean networks: from Bernoulli mixture models to rule based systems.
Directory of Open Access Journals (Sweden)
Mehreen Saeed
Full Text Available A Boolean network is a graphical model for representing and analyzing the behavior of gene regulatory networks (GRN. In this context, the accurate and efficient reconstruction of a Boolean network is essential for understanding the gene regulation mechanism and the complex relations that exist therein. In this paper we introduce an elegant and efficient algorithm for the reverse engineering of Boolean networks from a time series of multivariate binary data corresponding to gene expression data. We call our method ReBMM, i.e., reverse engineering based on Bernoulli mixture models. The time complexity of most of the existing reverse engineering techniques is quite high and depends upon the indegree of a node in the network. Due to the high complexity of these methods, they can only be applied to sparsely connected networks of small sizes. ReBMM has a time complexity factor, which is independent of the indegree of a node and is quadratic in the number of nodes in the network, a big improvement over other techniques and yet there is little or no compromise in accuracy. We have tested ReBMM on a number of artificial datasets along with simulated data derived from a plant signaling network. We also used this method to reconstruct a network from real experimental observations of microarray data of the yeast cell cycle. Our method provides a natural framework for generating rules from a probabilistic model. It is simple, intuitive and illustrates excellent empirical results.
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.
Directory of Open Access Journals (Sweden)
Liam G Fearnley
Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.
PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE
Directory of Open Access Journals (Sweden)
Maria Angeles Gallego
2014-11-01
Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.
Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.
Directory of Open Access Journals (Sweden)
Maria Simak
Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.
... of stress Delayed ejaculation Symptoms & causes Diagnosis & treatment Advertisement Mayo Clinic does not endorse companies or products. ... a Job Site Map About This Site Twitter Facebook Google YouTube Pinterest Mayo Clinic is a not- ...
... the penis Psychological causes of delayed ejaculation include: Depression, anxiety or other mental health conditions Relationship problems due to stress, poor communication or other concerns Anxiety about performance Poor body image Cultural or religious taboos Differences between the reality ...
Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya
2014-01-01
In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Directory of Open Access Journals (Sweden)
Liang Jinghang
2012-08-01
Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a
Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik
2015-01-01
Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The
Variances as order parameter and complexity measure for random Boolean networks
International Nuclear Information System (INIS)
Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel
2005-01-01
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
International Nuclear Information System (INIS)
Yoo, Seokwon; Lee, Jinhyoung; Bang, Jeongho; Lee, Changhyoup
2014-01-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)
A new separation algorithm for the Boolean quadric and cut polytopes
DEFF Research Database (Denmark)
Sørensen, Michael Malmros; Letchford, Adam N.
2014-01-01
present a new algorithm, which separates over a class of valid inequalities that includes all odd bicycle wheel inequalities and (2p+1,2)(2p+1,2)-circulant inequalities. It exploits, in a non-trivial way, three known results in the literature: one on the separation of View the MathML source{0,12}-cuts......A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...
Approximating the Influence of a monotone Boolean function in O(\\sqrt{n}) query complexity
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri
2011-01-01
The {\\em Total Influence} ({\\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \\ifnum\\plusminus=1 $f: \\{\\pm1\\}^n \\longrightarrow \\{\\pm1\\}$, \\else $f: \\bitset^n \\to \\bitset$, \\fi which we denote by $I[f]$. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of $(1\\pm \\eps)$ by performing $O(\\frac{\\sqrt{n}\\log...
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method
International Nuclear Information System (INIS)
EI-Shanshoury, A.I.
2011-01-01
This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian
2018-04-01
Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.
Construction of a fuzzy and all Boolean logic gates based on DNA
DEFF Research Database (Denmark)
M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse
2015-01-01
to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....
Variances as order parameter and complexity measure for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)
2005-02-04
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
The role of delay in the dynamics of nuclear reactors
International Nuclear Information System (INIS)
Svitra, D.; Bucys, K.
1999-01-01
The stability of nuclear reactors based on nonlinear models of reactor dynamics including the action of delayed neutrons is analysed. The point model of reactor dynamics with the system of seven nonlinear simple differential equations was changed to the system of two nonlinear differential equations including the action of delay. The method of the theory of bifurcations for nonlinear differential equations with delay is used. (author)
Baccelli, François; Błaszczyszyn, Bartłomiej
2001-01-01
Projet MCR; We define and analyze a random coverage process of the $d$-dimensional Euclidian space which allows one to describe a continuous spectrum that ranges from the Boolean model to the Poisson-Voronoi tessellation to the Johnson-Mehl model. Like for the Boolean model, the minimal stochastic setting consists of a Poisson point process on this Euclidian space and a sequence of real valued random variables considered as marks of this point process. In this coverage process, the cell attac...
Chen, Xi; Akutsu, Tatsuya; Tamura, Takeyuki; Ching, Wai-Ki
2013-01-01
Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs) are studied in this paper from the viewpoint of control problems. For BN CONTROL, by applying external control, we propose to derive the network to the desired state within a few time steps. For PBN CONTROL, we propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, we propose to minimise the maximum cost of the terminal state to which the network will enter. We also present a hardness result suggesting that PBN CONTROL is harder than BN CONTROL.
Impulsive fractional differential inclusions with infinite delay
Directory of Open Access Journals (Sweden)
Khalida Aissani
2013-11-01
Full Text Available In this article, we apply Bohnenblust-Karlin's fixed point theorem to prove the existence of mild solutions for a class of impulsive fractional equations inclusions with infinite delay. An example is given to illustrate the theory.
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Directory of Open Access Journals (Sweden)
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
Synchronization in networks with heterogeneous coupling delays
Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor
2018-01-01
Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.
Stability investigation of quadratic systems with delay
Directory of Open Access Journals (Sweden)
Vladimir Davydov
2000-01-01
Full Text Available Systems of differential equations with quadratic right-hand sides with delay are considered in the paper. Compact matrix notation form is proposed for the systems of such type. Stability investigations are performed by Lyapunov's second method with functions of quadratic form. Stability conditions of quadratic systems with delay, uniformly by argument deviation, and with delay depending on the system's parameters are derived. A guaranteed radius of the ball of asymptotic stability region for zero solution is obtained.
Directory of Open Access Journals (Sweden)
Yih-Lon Lin
2013-01-01
Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.
Long, Feng-Shan; Karnbanjong, Adisak; Suriyawichitseranee, Amornrat; Grigoriev, Yurii N.; Meleshko, Sergey V.
2017-07-01
This paper proposes an algorithm for group classification of a nonhomogeneous equation using the group analysis provided for the corresponding homogeneous equation. The approach is illustrated by a partial differential equation, an integro-differential equation, and a delay partial differential equation.
Quasi-Hyperbolicity and Delay Semigroups
Directory of Open Access Journals (Sweden)
Shard Rastogi
2016-01-01
Full Text Available We study quasi-hyperbolicity of the delay semigroup associated with the equation u′(t=Bu(t+Φut, where ut is the history function and (B,D(B is the generator of a quasi-hyperbolic semigroup. We give conditions under which the associated solution semigroup of this equation generates a quasi-hyperbolic semigroup.
Lima, Ricardo
2016-06-16
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
The universal magnetic tunnel junction logic gates representing 16 binary Boolean logic operations
Lee, Junwoo; Suh, Dong Ik; Park, Wanjun
2015-05-01
The novel devices are expected to shift the paradigm of a logic operation by their own nature, replacing the conventional devices. In this study, the nature of our fabricated magnetic tunnel junction (MTJ) that responds to the two external inputs, magnetic field and voltage bias, demonstrated seven basic logic operations. The seven operations were obtained by the electric-field-assisted switching characteristics, where the surface magnetoelectric effect occurs due to a sufficiently thin free layer. The MTJ was transformed as a universal logic gate combined with three supplementary circuits: A multiplexer (MUX), a Wheatstone bridge, and a comparator. With these circuits, the universal logic gates demonstrated 16 binary Boolean logic operations in one logic stage. A possible further approach is parallel computations through a complimentary of MUX and comparator, capable of driving multiple logic gates. A reconfigurable property can also be realized when different logic operations are produced from different level of voltages applying to the same configuration of the logic gate.
Ones and zeros understanding Boolean algebra digital circuits and the logic of sets
Gregg, John
1998-01-01
"Ones and Zeros explains, in lay terms, Boolean algebra, the suprisingly simple system of mathematical logic used in digital computer circuitry. Ones and Zeros follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. Readers will learn about the interesting history of the development of symbolic logic in particular, and the often misunderstood process of mathematical invention and scientific discovery, in general. Ones and Zeros also features practical exercises with answers, real-world examples of digital circuit design, and a reading list." "Ones and Zeros will be of particular interest to software engineers who want to gain a comprehensive understanding of computer hardware." "Outstanding features include: a history of mathematical logic, an explanation of the logic of digital circuits, and hands-on exercises and examples."--Jacket.
Integer programming-based method for observability of singleton attractors in Boolean networks.
Cheng, Xiaoqing; Qiu, Yushan; Hou, Wenpin; Ching, Wai-Ki
2017-02-01
Boolean network (BN) is a popular mathematical model for revealing the behaviour of a genetic regulatory network. Furthermore, observability, an important network feature, plays a significant role in understanding the underlying network. Several studies have been done on analysis of observability of BNs and complex networks. However, the observability of attractor cycles, which can serve as biomarker detection, has not yet been addressed in the literature. This is an important, interesting and challenging problem that deserves a detailed study. In this study, a novel problem was first proposed on attractor observability in BNs. Identification of the minimum set of consecutive nodes can be used to discriminate different attractors. Furthermore, it can serve as a biomarker for different disease types (represented as different attractor cycles). Then a novel integer programming method was developed to identify the desired set of nodes. The proposed approach is demonstrated and verified by numerical examples. The computational results further illustrates that the proposed model is effective and efficient.
Tran, Van; McCall, Matthew N; McMurray, Helene R; Almudevar, Anthony
2013-01-01
Boolean networks (BoN) are relatively simple and interpretable models of gene regulatory networks. Specifying these models with fewer parameters while retaining their ability to describe complex regulatory relationships is an ongoing methodological challenge. Additionally, extending these models to incorporate variable gene decay rates, asynchronous gene response, and synergistic regulation while maintaining their Markovian nature increases the applicability of these models to genetic regulatory networks (GRN). We explore a previously-proposed class of BoNs characterized by linear threshold functions, which we refer to as threshold Boolean networks (TBN). Compared to traditional BoNs with unconstrained transition functions, these models require far fewer parameters and offer a more direct interpretation. However, the functional form of a TBN does result in a reduction in the regulatory relationships which can be modeled. We show that TBNs can be readily extended to permit self-degradation, with explicitly modeled degradation rates. We note that the introduction of variable degradation compromises the Markovian property fundamental to BoN models but show that a simple state augmentation procedure restores their Markovian nature. Next, we study the effect of assumptions regarding self-degradation on the set of possible steady states. Our findings are captured in two theorems relating self-degradation and regulatory feedback to the steady state behavior of a TBN. Finally, we explore assumptions of synchronous gene response and asynergistic regulation and show that TBNs can be easily extended to relax these assumptions. Applying our methods to the budding yeast cell-cycle network revealed that although the network is complex, its steady state is simplified by the presence of self-degradation and lack of purely positive regulatory cycles.
Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.
Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu
2009-07-01
The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
Neutron stochastic transport theory with delayed neutrons
International Nuclear Information System (INIS)
Munoz-Cobo, J.L.; Verdu, G.
1987-01-01
From the stochastic transport theory with delayed neutrons, the Boltzmann transport equation with delayed neutrons for the average flux emerges in a natural way without recourse to any approximation. From this theory a general expression is obtained for the Feynman Y-function when delayed neutrons are included. The single mode approximation for the particular case of a subcritical assembly is developed, and it is shown that Y-function reduces to the familiar expression quoted in many books, when delayed neutrons are not considered, and spatial and source effects are not included. (author)
Analytical applications for delayed neutrons
International Nuclear Information System (INIS)
Eccleston, G.W.
1983-01-01
Analytical formulations that describe the time dependence of neutron populations in nuclear materials contain delayed-neutron dependent terms. These terms are important because the delayed neutrons, even though their yields in fission are small, permit control of the fission chain reaction process. Analytical applications that use delayed neutrons range from simple problems that can be solved with the point reactor kinetics equations to complex problems that can only be solved with large codes that couple fluid calculations with the neutron dynamics. Reactor safety codes, such as SIMMER, model transients of the entire reactor core using coupled space-time neutronics and comprehensive thermal-fluid dynamics. Nondestructive delayed-neutron assay instruments are designed and modeled using a three-dimensional continuous-energy Monte Carlo code. Calculations on high-burnup spent fuels and other materials that contain a mix of uranium and plutonium isotopes require accurate and complete information on the delayed-neutron periods, yields, and energy spectra. A continuing need exists for delayed-neutron parameters for all the fissioning isotopes
Lag synchronization of chaotic systems with time-delayed linear ...
Indian Academy of Sciences (India)
In this paper, the lag synchronization of chaotic systems with time-delayed linear terms via impulsive control is investigated. Based on the stability theory of impulsive delayed differential equations, some sufficient conditions are obtained guaranteeing the synchronized behaviours between two delayed chaotic systems.
Lag synchronization of chaotic systems with time-delayed linear
Indian Academy of Sciences (India)
In this paper, the lag synchronization of chaotic systems with time-delayed linear terms via impulsive control is investigated. Based on the stability theory of impulsive delayed differential equations, some sufficient conditions are obtained guaranteeing the synchronized behaviours between two delayed chaotic systems.
Collective dynamics of delay-coupled limit cycle oscillators
Indian Academy of Sciences (India)
We present a brief overview of the effect of time-delayed coupling on the collective dynamics of such coupled systems. Simple model equations describing two oscillators with a discrete time-delayed coupling as well as those describing linear arrays of a large number of oscillators with time-delayed global or local couplings ...
Energy Technology Data Exchange (ETDEWEB)
Young, C.W. [Applied Research Associates, Inc., Albuquerque, NM (United States)
1997-10-01
In 1967, Sandia National Laboratories published empirical equations to predict penetration into natural earth materials and concrete. Since that time there have been several small changes to the basic equations, and several more additions to the overall technique for predicting penetration into soil, rock, concrete, ice, and frozen soil. The most recent update to the equations was published in 1988, and since that time there have been changes in the equations to better match the expanding data base, especially in concrete penetration. This is a standalone report documenting the latest version of the Young/Sandia penetration equations and related analytical techniques to predict penetration into natural earth materials and concrete. 11 refs., 6 tabs.
A stability criterion for HNFDE with non-uniform delays
International Nuclear Information System (INIS)
Liu Xingwen; Zhong Shouming; Zhang Fengli
2005-01-01
Stability of functional differential equations (FDE) is an increasingly important problem in both science and engineering. Delays, whether uniform or non-uniform, play an important role in the dynamics of a system. Since non-uniform delay is more general and less focused than uniform delay, this paper concentrates on the stability of high-order neutral functional differential equations (HNFDE) with non-uniform delay, and proposes a sufficient condition for it. This result may be widely helpful, thanks to the frequent emergence of a HNFDE with non-uniform delay in various fields. Its effectiveness is illustrated by some examples
Communication key using delay times in time-delayed chaos synchronization
International Nuclear Information System (INIS)
Kim, Chil-Min; Kye, Won-Ho; Rim, Sunghwan; Lee, Soo-Young
2004-01-01
We propose an efficient key scheme, which can generate a great number of communication keys, for communication using chaos synchronization. We have attained the keys from delay times of time-delay coupled chaotic systems. We explain the scheme and the efficiency by coupling Henon and logistic maps and illustrate them by coupling Navier-Stokes and Lorenz equations as a continuous system
Tricomi, FG
2013-01-01
Based on his extensive experience as an educator, F. G. Tricomi wrote this practical and concise teaching text to offer a clear idea of the problems and methods of the theory of differential equations. The treatment is geared toward advanced undergraduates and graduate students and addresses only questions that can be resolved with rigor and simplicity.Starting with a consideration of the existence and uniqueness theorem, the text advances to the behavior of the characteristics of a first-order equation, boundary problems for second-order linear equations, asymptotic methods, and diff