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
Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S
2013-06-01
A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.
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.
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.
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)
OSCILLATION OF NONLINEAR DELAY DIFFERENCE EQUATIONS
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
This paper deals with the oscillatory properties of a class of nonlinear difference equations with several delays. Sufficient criteria in the form of infinite sum for the equations to be oscillatory are obtained.
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
Optimal Control for Stochastic Delay Evolution Equations
Energy Technology Data Exchange (ETDEWEB)
Meng, Qingxin, E-mail: mqx@hutc.zj.cn [Huzhou University, Department of Mathematical Sciences (China); Shen, Yang, E-mail: skyshen87@gmail.com [York University, Department of Mathematics and Statistics (Canada)
2016-08-15
In this paper, we investigate a class of infinite-dimensional optimal control problems, where the state equation is given by a stochastic delay evolution equation with random coefficients, and the corresponding adjoint equation is given by an anticipated backward stochastic evolution equation. We first prove the continuous dependence theorems for stochastic delay evolution equations and anticipated backward stochastic evolution equations, and show the existence and uniqueness of solutions to anticipated backward stochastic evolution equations. Then we establish necessary and sufficient conditions for optimality of the control problem in the form of Pontryagin’s maximum principles. To illustrate the theoretical results, we apply stochastic maximum principles to study two examples, an infinite-dimensional linear-quadratic control problem with delay and an optimal control of a Dirichlet problem for a stochastic partial differential equation with delay. Further applications of the two examples to a Cauchy problem for a controlled linear stochastic partial differential equation and an optimal harvesting problem are also considered.
Chaos in the delay logistic equation with discontinuous delays
International Nuclear Information System (INIS)
Sen, Ayan; Mukherjee, Debasis
2009-01-01
This paper analyzes a delay logistic equation which models a feedback control problem. Interval map associated to the system is derived. By calculating Lyapunov exponent, we indicate stable orbit and chaotic phenomenon respectively. The results are verified through computer simulation. We identify the parameter which controls the dynamics.
Third order differential equations with delay
Directory of Open Access Journals (Sweden)
Petr Liška
2015-05-01
Full Text Available In this paper, we study the oscillation and asymptotic properties of solutions of certain nonlinear third order differential equations with delay. In particular, we extend results of I. Mojsej (Nonlinear Analysis 68, 2008 and we improve conditions on the property B of N. Parhi and S. Padhi (Indian J. Pure Appl. Math., 33, 2002.
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.
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.
ALMOST PERIODIC SOLUTIONS TO SOME NONLINEAR DELAY DIFFERENTIAL EQUATION
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The existence of an almost periodic solutions to a nonlinear delay diffierential equation is considered in this paper. A set of sufficient conditions for the existence and uniqueness of almost periodic solutions to some delay diffierential equations is obtained.
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.
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 ...
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.
Energy Technology Data Exchange (ETDEWEB)
Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Bennett, Matthew R. [Department of Biochemistry and Cell Biology, Rice University, Houston, Texas 77204, USA and Institute of Biosciences and Bioengineering, Rice University, Houston, Texas 77005 (United States); Josić, Krešimir [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Department of Biology and Biochemistry, University of Houston, Houston, Texas 77204 (United States)
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.
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
Ye, Weiming; Li, Pengfei; Huang, Xuhui; Xia, Qinzhi; Mi, Yuanyuan; Chen, Runsheng; Hu, Gang
2010-10-01
Exploring the principle and relationship of gene transcriptional regulations (TR) has been becoming a generally researched issue. So far, two major mathematical methods, ordinary differential equation (ODE) method and Boolean map (BM) method have been widely used for these purposes. It is commonly believed that simplified BMs are reasonable approximations of more realistic ODEs, and both methods may reveal qualitatively the same essential features though the dynamical details of both systems may show some differences. In this Letter we exhaustively enumerated all the 3-gene networks and many autonomous randomly constructed TR networks with more genes by using both the ODE and BM methods. In comparison we found that both methods provide practically identical results in most of cases of steady solutions. However, to our great surprise, most of network structures showing periodic cycles with the BM method possess only stationary states in ODE descriptions. These observations strongly suggest that many periodic oscillations and other complicated oscillatory states revealed by the BM rule may be related to the computational errors of variable and time discretizations and rarely have correspondence in realistic biology transcriptional regulatory circuits.
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.
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.
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.
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.
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.
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.
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.
NUMERICAL HOPF BIFURCATION OF DELAY-DIFFERENTIAL EQUATIONS
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper we consider the numerical solution of some delay differential equations undergoing a Hopf bifurcation. We prove that if the delay differential equations have a Hopf bifurcation point atλ=λ*, then the numerical solution of the equation also has a Hopf bifurcation point atλh =λ* + O(h).
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.
Time-delay equation governing electron motion
International Nuclear Information System (INIS)
Cohn, J.
1976-01-01
A previously proposed differential-difference equation governing the motion of the classical radiating electron is considered further. A set of three assumptions is offered, under which the proposed equation yields asymptotically stable acceleration
Unconditionally stable difference methods for delay partial differential equations
Huang, Chengming; Vandewalle, Stefan
2012-01-01
This paper is concerned with the numerical solution of parabolic partial differential equations with time-delay. We focus in particular on the delay dependent stability analysis of difference methods that use a non-constrained mesh, i.e., the time step-size is not required to be a submultiple of the delay. We prove that the fully discrete system unconditionally preserves the delay dependent asymptotic stability of the linear test problem under consideration, when the following discretizati...
Analysis of stability for stochastic delay integro-differential equations.
Zhang, Yu; Li, Longsuo
2018-01-01
In this paper, we concern stability of numerical methods applied to stochastic delay integro-differential equations. For linear stochastic delay integro-differential equations, it is shown that the mean-square stability is derived by the split-step backward Euler method without any restriction on step-size, while the Euler-Maruyama method could reproduce the mean-square stability under a step-size constraint. We also confirm the mean-square stability of the split-step backward Euler method for nonlinear stochastic delay integro-differential equations. The numerical experiments further verify the theoretical results.
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)
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.
ALMOST AUTOMORPHIC MILD SOLUTIONS TO SOME FRACTIONAL DELAY DIFFERENTIAL EQUATIONS
Institute of Scientific and Technical Information of China (English)
无
2012-01-01
In this paper,a new and general existence and uniqueness theorem of almost automorphic mild solutions is obtained for some fractional delay differential equations,using sectorial operators and the Banach contraction principle.
OSCILLATION OF IMPULSIVE HYPERBOLIC PARTIAL DIFFERENTIAL EQUATION WITH DELAY
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, oscillation properties of the solutions of impulsive hyperbolic equation with delay are investigated via the method of differential inequalities. Sufficient conditions for oscillations of the solutions are established.
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
Stability criteria for neutral delay differential-algebraic equations
Directory of Open Access Journals (Sweden)
FAN Ni
2013-10-01
Full Text Available The asymptotic stability of neutral delay differential-algebraic equations is studied in this paper.Two stability criteria described by evaluating a corresponding harmonic function on the boundary of a torus region are presented.
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.
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.
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.
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.
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.
Existence results for impulsive evolution differential equations with state-dependent delay
Eduardo Hernandez M.; Rathinasamy Sakthivel; Sueli Tanaka Aki
2008-01-01
We study the existence of mild solution for impulsive evolution abstract differential equations with state-dependent delay. A concrete application to partial delayed differential equations is considered.
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.
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.
International Conference on Delay Differential and Difference Equations and Applications
Pituk, Mihály; Recent Advances in Delay Differential and Difference Equations
2014-01-01
Delay differential and difference equations serve as models for a range of processes in biology, physics, engineering, and control theory. In this volume, the participants of the International Conference on Delay Differential and Difference Equations and Applications, Balatonfüred, Hungary, July 15-19, 2013 present recent research in this quickly-evolving field. The papers relate to the existence, asymptotic, and oscillatory properties of the solutions; stability theory; numerical approximations; and applications to real world phenomena using deterministic and stochastic discrete and continuous dynamical systems.
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.
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.
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.
STABILITY OF STOCHASTIC DIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In this paper,we obtain suffcient conditions for the stability in p-th moment of the analytical solutions and the mean square stability of a stochastic differential equation with unbounded delay proposed in [6,10] using the explicit Euler method.
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.
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.
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
Delay chemical master equation: direct and closed-form solutions.
Leier, Andre; Marquez-Lago, Tatiana T
2015-07-08
The stochastic simulation algorithm (SSA) describes the time evolution of a discrete nonlinear Markov process. This stochastic process has a probability density function that is the solution of a differential equation, commonly known as the chemical master equation (CME) or forward-Kolmogorov equation. In the same way that the CME gives rise to the SSA, and trajectories of the latter are exact with respect to the former, trajectories obtained from a delay SSA are exact representations of the underlying delay CME (DCME). However, in contrast to the CME, no closed-form solutions have so far been derived for any kind of DCME. In this paper, we describe for the first time direct and closed solutions of the DCME for simple reaction schemes, such as a single-delayed unimolecular reaction as well as chemical reactions for transcription and translation with delayed mRNA maturation. We also discuss the conditions that have to be met such that such solutions can be derived.
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
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.
International Nuclear Information System (INIS)
Korshunov, A D
2003-01-01
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years
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.
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.
Interpolative Boolean Networks
Directory of Open Access Journals (Sweden)
Vladimir Dobrić
2017-01-01
Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and 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.
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.
Explicit Finite Difference Methods for the Delay Pseudoparabolic Equations
Directory of Open Access Journals (Sweden)
I. Amirali
2014-01-01
Full Text Available Finite difference technique is applied to numerical solution of the initial-boundary value problem for the semilinear delay Sobolev or pseudoparabolic equation. By the method of integral identities two-level difference scheme is constructed. For the time integration the implicit rule is being used. Based on the method of energy estimates the fully discrete scheme is shown to be absolutely stable and convergent of order two in space and of order one in time. The error estimates are obtained in the discrete norm. Some numerical results confirming the expected behavior of the method are shown.
A differential delay equation arising from the sieve of Eratosthenes
Cheer, A. Y.; Goldston, D. A.
1990-07-01
The differential delay equation defined by ω (u) = 1/u for 1 ≤ u ≤ 2 and (uω (u))' = ω (u - 1) for u ≥ 2 was introduced by Buchstab in connection with an asymptotic formula for the number of uncanceled terms in the sieve of Eratosthenes. Maier has recently used this result to show there is unexpected irregularity in the distribution of primes in short intervals. The function ω (u) is studied in this paper using numerical and analytical techniques. The results are applied to give some numerical constants in Maier's theorem.
Marzban, Hamid Reza
2018-05-01
In this paper, we are concerned with the parameter identification of linear time-invariant systems containing multiple delays. The approach is based upon a hybrid of block-pulse functions and Legendre's polynomials. The convergence of the proposed procedure is established and an upper error bound with respect to the L2-norm associated with the hybrid functions is derived. The problem under consideration is first transformed into a system of algebraic equations. The least squares technique is then employed for identification of the desired parameters. Several multi-delay systems of varying complexity are investigated to evaluate the performance and capability of the proposed approximation method. It is shown that the proposed approach is also applicable to a class of nonlinear multi-delay systems. It is demonstrated that the suggested procedure provides accurate results for the desired parameters.
Controlled Nonlinear Stochastic Delay Equations: Part I: Modeling and Approximations
International Nuclear Information System (INIS)
Kushner, Harold J.
2012-01-01
This two-part paper deals with “foundational” issues that have not been previously considered in the modeling and numerical optimization of nonlinear stochastic delay systems. There are new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. There are two basic and interconnected themes for these models. The first, dealt with in this part, concerns the definition of admissible control. The classical definition of an admissible control as a nonanticipative relaxed control is inadequate for these models and needs to be extended. This is needed for the convergence proofs of numerical approximations for optimal controls as well as to have a well-defined model. It is shown that the new classes of admissible controls do not enlarge the range of the value functions, is closed (together with the associated paths) under weak convergence, and is approximatable by ordinary controls. The second theme, dealt with in Part II, concerns transportation equation representations, and their role in the development of numerical algorithms with much reduced memory and computational requirements.
ASYMPTOTIC BEHAVIOR OF SOLUTIONS FOR A CLASS OF DELAY DIFFERENCE EQUATION
Institute of Scientific and Technical Information of China (English)
ZhuHuiyan; HuangLihong
2005-01-01
We propose a class of delay difference equation with piecewise constant nonlinearity. Such a delay difference equation can be regarded as the discrete analog of a differential equation. The convergence of solutions and the existence of asymptotically stable periodic solutions are investigated for such a class of difference equation.
Hildreth, Charles R.
1983-01-01
This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)
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.
Explosive attractor solutions to a universal cubic delay equation
Sanz-Orozco, D.; Berk, H. L.
2017-05-01
New explosive attractor solutions have been found in a universal cubic delay equation that has been studied in both the plasma and the fluid mechanics literature. Through computational simulations and analytic approximations, it is found that the oscillatory component of the explosive mode amplitude solutions are described through multi-frequency Fourier expansions with respect to a pseudo-time variable. The spectral dependence of these solutions as a function of a system parameter, ϕ , is studied. The mode amplitude that is described in the explosive regime has two main features: a well-known envelope ( t 0 - t ) - 5 / 2 , with t0 the blow-up time of the amplitude, and a spectrum of discrete oscillations with ever-increasing frequencies, which may give experimental information about the properties of a system's equilibrium.
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.
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
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.
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.
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
In this paper, we consider a one-dimensional nonautonomous neutral differential equation. We obtain sufficient conditions under which the zero solution to this equation with unbounded delay and perturbation is uniformly asymptotically stable.
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.
Probabilistic delay differential equation modeling of event-related potentials.
Ostwald, Dirk; Starke, Ludger
2016-08-01
"Dynamic causal models" (DCMs) are a promising approach in the analysis of functional neuroimaging data due to their biophysical interpretability and their consolidation of functional-segregative and functional-integrative propositions. In this theoretical note we are concerned with the DCM framework for electroencephalographically recorded event-related potentials (ERP-DCM). Intuitively, ERP-DCM combines deterministic dynamical neural mass models with dipole-based EEG forward models to describe the event-related scalp potential time-series over the entire electrode space. Since its inception, ERP-DCM has been successfully employed to capture the neural underpinnings of a wide range of neurocognitive phenomena. However, in spite of its empirical popularity, the technical literature on ERP-DCM remains somewhat patchy. A number of previous communications have detailed certain aspects of the approach, but no unified and coherent documentation exists. With this technical note, we aim to close this gap and to increase the technical accessibility of ERP-DCM. Specifically, this note makes the following novel contributions: firstly, we provide a unified and coherent review of the mathematical machinery of the latent and forward models constituting ERP-DCM by formulating the approach as a probabilistic latent delay differential equation model. Secondly, we emphasize the probabilistic nature of the model and its variational Bayesian inversion scheme by explicitly deriving the variational free energy function in terms of both the likelihood expectation and variance parameters. Thirdly, we detail and validate the estimation of the model with a special focus on the explicit form of the variational free energy function and introduce a conventional nonlinear optimization scheme for its maximization. Finally, we identify and discuss a number of computational issues which may be addressed in the future development of the approach. Copyright © 2016 Elsevier Inc. All rights reserved.
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)
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
Directory of Open Access Journals (Sweden)
Gemechis File
2012-01-01
Full Text Available We have presented a numerical integration method to solve a class of singularly perturbed delay differential equations with small shift. First, we have replaced the second-order singularly perturbed delay differential equation by an asymptotically equivalent first-order delay differential equation. Then, Simpson’s rule and linear interpolation are employed to get the three-term recurrence relation which is solved easily by discrete invariant imbedding algorithm. The method is demonstrated by implementing it on several linear and nonlinear model examples by taking various values for the delay parameter and the perturbation parameter .
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)
Lie group classification of first-order delay ordinary differential equations
Dorodnitsyn, Vladimir A.; Kozlov, Roman; Meleshko, Sergey V.; Winternitz, Pavel
2018-05-01
A group classification of first-order delay ordinary differential equations (DODEs) accompanied by an equation for the delay parameter (delay relation) is presented. A subset of such systems (delay ordinary differential systems or DODSs), which consists of linear DODEs and solution-independent delay relations, have infinite-dimensional symmetry algebras—as do nonlinear ones that are linearizable by an invertible transformation of variables. Genuinely nonlinear DODSs have symmetry algebras of dimension n, . It is shown how exact analytical solutions of invariant DODSs can be obtained using symmetry reduction.
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.
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.
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
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.
Algebraic partial Boolean algebras
International Nuclear Information System (INIS)
Smith, Derek
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 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 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 8
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.
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.
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.
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.
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
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.
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
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.
Institute of Scientific and Technical Information of China (English)
Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA
2004-01-01
In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.
Computational complexity of Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Korshunov, Aleksei D [Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2012-02-28
Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.
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
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 ...
An existence theorem for a type of functional differential equation with infinite delay
Izsak, F.
We prove an existence theorem for a functional differential equation with infinite delay using the Schauder fixpoint theorem. We extend a result in [19] applying the fixed point procedure in an appropriate function space.
EXISTENCE OF SOLUTION TO NONLINEAR SECOND ORDER NEUTRAL STOCHASTIC DIFFERENTIAL EQUATIONS WITH DELAY
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
This paper is concerned with nonlinear second order neutral stochastic differential equations with delay in a Hilbert space. Sufficient conditions for the existence of solution to the system are obtained by Picard iterations.
Stability analysis of Runge-Kutta methods for nonlinear neutral delay integro-differential equations
Institute of Scientific and Technical Information of China (English)
2007-01-01
The sufficient conditions for the stability and asymptotic stability of Runge-Kutta methods for nonlinear neutral delay integro-differential equations are derived. A numerical test that confirms the theoretical results is given in the end.
OSCILLATION FOR NEUTRAL DELAY DIFFERENTIAL EQUATION WITH POSITIVE AND NEGATIVE COEFFICIENTS
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, a new oscillating result is established for the first order neutral delay differential equation with positive and negative coefficients, which improves and generalizes several results in the literatures.
Travelling wavefronts of a generalized Fisher equation with spatio-temporal delay
International Nuclear Information System (INIS)
Jin Chunhua; Yin Jingxue; Wang Yifu
2009-01-01
We discuss a generalized Fisher equation with a convolution term which introduces a time-delay in the nonlinearity. Special attention is paid to the existence and the asymptotic behavior of travelling wavefronts connecting two uniform steady states.
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.
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.
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.
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.
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
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
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.
A dynamic IS-LM business cycle model with two time delays in capital accumulation equation
Zhou, Lujun; Li, Yaqiong
2009-06-01
In this paper, we analyze a augmented IS-LM business cycle model with the capital accumulation equation that two time delays are considered in investment processes according to Kalecki's idea. Applying stability switch criteria and Hopf bifurcation theory, we prove that time delays cause the equilibrium to lose or gain stability and Hopf bifurcation occurs.
Green, K.; Wagenknecht, T.
2010-01-01
This paper deals with the computation of pseudospectra of neutral delay differential equations (NDDEs) with fixed finite delays. This method provides information on the sensitivity of eigenvalues of the system under perturbations of a given size, allowing one to analyse uncertainties in, for
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.
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.
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.
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The present paper deals with the long-time behavior of a class of nonautonomous retarded semilinear parabolic differential equations. When the time delays are small enough and the spectral gap conditions hold, the inertial manifolds of the nonautonomous retard parabolic equations are constructed by using the Lyapunov-Perron method.
A NEW OSCILLATION CRITERION FOR FIRST ORDER NEUTRAL DELAY DIFFERENTIAL EQUATION
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, a new sufficient condition for the oscillation of all solutions of first order neutral delay differential equations is obtained. Secondly, the result can also be extended to a general neutral differential equation, and many known results in the literatures are improved.
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In this paper, by fixed point theorem of Krasnoselskii, we study the positive pe- riodic solution to a class of nonautonomous differential equation with impulses and delay. Firstly, definition of periodic solution and some lemmas are stated. Then some results on the existence of positive periodic solution to the equation are obtained.
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.
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.
Homotopy analysis solutions of point kinetics equations with one delayed precursor group
International Nuclear Information System (INIS)
Zhu Qian; Luo Lei; Chen Zhiyun; Li Haofeng
2010-01-01
Homotopy analysis method is proposed to obtain series solutions of nonlinear differential equations. Homotopy analysis method was applied for the point kinetics equations with one delayed precursor group. Analytic solutions were obtained using homotopy analysis method, and the algorithm was analysed. The results show that the algorithm computation time and precision agree with the engineering requirements. (authors)
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)
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.
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.
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...
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...
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.
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...
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
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.
Stability analysis for a delay differential equations model of a hydraulic turbine speed governor
Halanay, Andrei; Safta, Carmen A.; Dragoi, Constantin; Piraianu, Vlad F.
2017-01-01
The paper aims to study the dynamic behavior of a speed governor for a hydraulic turbine using a mathematical model. The nonlinear mathematical model proposed consists in a system of delay differential equations (DDE) to be compared with already established mathematical models of ordinary differential equations (ODE). A new kind of nonlinearity is introduced as a time delay. The delays can characterize different running conditions of the speed governor. For example, it is considered that spool displacement of hydraulic amplifier might be blocked due to oil impurities in the oil supply system and so the hydraulic amplifier has a time delay in comparison to the time control. Numerical simulations are presented in a comparative manner. A stability analysis of the hydraulic control system is performed, too. Conclusions of the dynamic behavior using the DDE model of a hydraulic turbine speed governor are useful in modeling and controlling hydropower plants.
Razumikhin-Type Stability Criteria for Differential Equations with Delayed Impulses.
Wang, Qing; Zhu, Quanxin
2013-01-01
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.
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.
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
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.
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.
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.
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.
Huang, Rui; Jin, Chunhua; Mei, Ming; Yin, Jingxue
2018-06-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.
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.
Computing preimages of Boolean networks.
Klotz, Johannes; Bossert, Martin; Schober, Steffen
2013-01-01
In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.
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
Existence of Solution of Neutral Fractional Impulsive Diﬀerential Equations with Inﬁnite Delay
Directory of Open Access Journals (Sweden)
K.Hilal
2017-04-01
Full Text Available In this work we deﬁne the solution of the fractional neutral impulsive diﬀerential equation with inﬁnite delay. The results of existence are obtained by using the Banach contraction and Schafer ﬁxed point. Some proprieties of probability density functions and semi-group theory are also used.
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$.
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.
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
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...
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.
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.
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
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.
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.
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
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 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.
Directory of Open Access Journals (Sweden)
V. Vijayakumar
2014-09-01
Full Text Available In this article, we study the existence of mild solutions for nonlocal Cauchy problem for fractional neutral evolution equations with infinite delay. The results are obtained by using the Banach contraction principle. Finally, an application is given to illustrate the theory.
Existence results for impulsive neutral functional differential equations with state-dependent delay
Directory of Open Access Journals (Sweden)
Mani Mallika Arjunan
2009-04-01
Full Text Available In this article, we study the existence of mild solutions for a class of impulsive abstract partial neutral functional differential equations with state-dependent delay. The results are obtained by using Leray-Schauder Alternative fixed point theorem. Example is provided to illustrate the main result.
Multiple periodic solutions for a class of second-order nonlinear neutral delay equations
Directory of Open Access Journals (Sweden)
2006-01-01
Full Text Available By means of a variational structure and Z 2 -group index theory, we obtain multiple periodic solutions to a class of second-order nonlinear neutral delay equations of the form0, au>0$"> x ″ ( t − τ + λ ( t f ( t , x ( t , x ( t − τ , x ( t − 2 τ = x ( t , λ ( t > 0 , τ > 0 .
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.
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
International Nuclear Information System (INIS)
Kushner, Harold J.
2012-01-01
This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.
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.
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
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.
Directory of Open Access Journals (Sweden)
Ali Konuralp
2014-01-01
Full Text Available Application process of variational iteration method is presented in order to solve the Volterra functional integrodifferential equations which have multi terms and vanishing delays where the delay function θ(t vanishes inside the integral limits such that θ(t=qt for 0
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.
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.
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.
Existence and asymptotic stability of a viscoelastic wave equation with a delay
Kirane, Mokhtar; Said-Houari, Belkacem
2011-01-01
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.
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.
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
A model of a fishery with fish stock involving delay equations.
Auger, P; Ducrot, Arnaud
2009-12-13
The aim of this paper is to provide a new mathematical model for a fishery by including a stock variable for the resource. This model takes the form of an infinite delay differential equation. It is mathematically studied and a bifurcation analysis of the steady states is fulfilled. Depending on the different parameters of the problem, we show that Hopf bifurcation may occur leading to oscillating behaviours of the system. The mathematical results are finally discussed.
Well-posedness and exponential stability for a wave equation with nonlocal time-delay condition
Directory of Open Access Journals (Sweden)
Carlos Alberto Raposo
2017-11-01
Full Text Available Well-posedness and exponential stability of nonlocal time-delayed of a wave equation with a integral conditions of the 1st kind forms the center of this work. Through semigroup theory we prove the well-posedness by the Hille-Yosida theorem and the exponential stability exploring the dissipative properties of the linear operator associated to damped model using the Gearhart-Huang-Pruss theorem.
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.
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
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.
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.
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
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
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
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.
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
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.
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.
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.
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.
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.
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.
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.
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
Response of an oscillatory differential delay equation to a single stimulus.
Mackey, Michael C; Tyran-Kamińska, Marta; Walther, Hans-Otto
2017-04-01
Here we analytically examine the response of a limit cycle solution to a simple differential delay equation to a single pulse perturbation of the piecewise linear nonlinearity. We construct the unperturbed limit cycle analytically, and are able to completely characterize the perturbed response to a pulse of positive amplitude and duration with onset at different points in the limit cycle. We determine the perturbed minima and maxima and period of the limit cycle and show how the pulse modifies these from the unperturbed case.
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.
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.
Analytical estimations of limit cycle amplitude for delay-differential equations
Directory of Open Access Journals (Sweden)
Tamás Molnár
2016-09-01
Full Text Available The amplitude of limit cycles arising from Hopf bifurcation is estimated for nonlinear delay-differential equations by means of analytical formulas. An improved analytical estimation is introduced, which allows more accurate quantitative prediction of periodic solutions than the standard approach that formulates the amplitude as a square-root function of the bifurcation parameter. The improved estimation is based on special global properties of the system: the method can be applied if the limit cycle blows up and disappears at a certain value of the bifurcation parameter. As an illustrative example, the improved analytical formula is applied to the problem of stick balancing.
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.
Directory of Open Access Journals (Sweden)
Alexander Domoshnitsky
2014-01-01
Full Text Available The impulsive delay differential equation is considered (Lx(t=x′(t+∑i=1mpi(tx(t-τi(t=f(t, t∈[a,b], x(tj=βjx(tj-0, j=1,…,k, a=t0
Analysis of stability and Hopf bifurcation for a delayed logistic equation
International Nuclear Information System (INIS)
Sun Chengjun; Han Maoan; Lin Yiping
2007-01-01
The dynamics of a logistic equation with discrete delay are investigated, together with the local and global stability of the equilibria. In particular, the conditions under which a sequence of Hopf bifurcations occur at the positive equilibrium are obtained. Explicit algorithm for determining the stability of the bifurcating periodic solutions and the direction of the Hopf bifurcation are derived by using the theory of normal form and center manifold [Hassard B, Kazarino D, Wan Y. Theory and applications of Hopf bifurcation. Cambridge: Cambridge University Press; 1981.]. Global existence of periodic solutions is also established by using a global Hopf bifurcation result of Wu [Symmetric functional differential equations and neural networks with memory. Trans Amer Math Soc 350:1998;4799-38.
Optical programmable Boolean logic unit.
Chattopadhyay, Tanay
2011-11-10
Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.
Boolean gates on actin filaments
International Nuclear Information System (INIS)
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. - 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.
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.
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)
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.
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.
OSCILLATION OF A SECOND-ORDER HALF-LINEAR NEUTRAL DAMPED DIFFERENTIAL EQUATION WITH TIME-DELAY
Institute of Scientific and Technical Information of China (English)
无
2012-01-01
In this paper,the oscillation for a class of second-order half-linear neutral damped differential equation with time-delay is studied.By means of Yang-inequality,the generalized Riccati transformation and a certain function,some new sufficient conditions for the oscillation are given for all solutions to the equation.
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.
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.
Chenciner bubbles and torus break-up in a periodically forced delay differential equation
Keane, A.; Krauskopf, B.
2018-06-01
We study a generic model for the interaction of negative delayed feedback and periodic forcing that was first introduced by Ghil et al (2008 Nonlinear Process. Geophys. 15 417–33) in the context of the El Niño Southern Oscillation climate system. This model takes the form of a delay differential equation and has been shown in previous work to be capable of producing complicated dynamics, which is organised by resonances between the external forcing and dynamics induced by feedback. For certain parameter values, we observe in simulations the sudden disappearance of (two-frequency dynamics on) tori. This can be explained by the folding of invariant tori and their associated resonance tongues. It is known that two smooth tori cannot simply meet and merge; they must actually break up in complicated bifurcation scenarios that are organised within so-called resonance bubbles first studied by Chenciner. We identify and analyse such a Chenciner bubble in order to understand the dynamics at folds of tori. We conduct a bifurcation analysis of the Chenciner bubble by means of continuation software and dedicated simulations, whereby some bifurcations involve tori and are detected in appropriate two-dimensional projections associated with Poincaré sections. We find close agreement between the observed bifurcation structure in the Chenciner bubble and a previously suggested theoretical picture. As far as we are aware, this is the first time the bifurcation structure associated with a Chenciner bubble has been analysed in a delay differential equation and, in fact, for a flow rather than an explicit map. Following our analysis, we briefly discuss the possible role of folding tori and Chenciner bubbles in the context of tipping.
GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS
Ho, Juei-Ling
2009-01-01
Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...
Rational Verification in Iterated Electric Boolean Games
Directory of Open Access Journals (Sweden)
Youssouf Oualhadj
2016-07-01
Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.
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\\.
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.
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.
Directory of Open Access Journals (Sweden)
Ling Zhang
2017-10-01
Full Text Available Abstract 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 1 2 $\\frac{1}{2}$ 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.
Directory of Open Access Journals (Sweden)
Zhenguo Luo
2014-01-01
Full Text Available By using a fixed point theorem of strict-set-contraction, which is different from Gaines and Mawhin's continuation theorem and abstract continuation theory for k-set contraction, we established some new criteria for the existence of positive periodic solution of the following generalized neutral delay functional differential equation with impulse: x'(t=x(t[a(t-f(t,x(t,x(t-τ1(t,x(t,…,x(t-τn(t,x(t,x'(t-γ1(t,x(t,…,x'(t-γm(t,x(t], t≠tk, k∈Z+; x(tk+=x(tk-+θk(x(tk, k∈Z+. As applications of our results, we also give some applications to several Lotka-Volterra models and new results are obtained.
Yaacob, Y.; Yeak, S. H.; Lim, R. S.; Soewono, E.
2015-03-01
Dengue disease has been known as one of widely transmitted vector-borne diseases which potentially affects millions of people throughout the world especially in tropical and sub-tropical countries. One of the main factors contributing in the complication of the transmission process is the mobility of people in which people may get infection in the places far from their home. Here we construct a delay differential equation model for dengue transmission in a closed population where regular visits of people to a mosquito breeding site out of their residency such as traditional market take place daily. Basic reproductive ratio of the system is obtained and depends on the ratio between the outgoing rates of susceptible human and infective human. It is shown that the increase of mobility with different variation of mobility rates may contribute to different level of basic reproductive ratio as well as different level of outbreaks.
Boolean integral calculus for digital systems
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1985-01-01
The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.
On Boolean functions with generalized cryptographic properties
Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.
2004-01-01
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.
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.
Directory of Open Access Journals (Sweden)
Changjin Xu
2014-01-01
Full Text Available This paper deals with a kind of nonlinear Duffing equation with a deviating argument and time-varying delay. By using differential inequality techniques, some very verifiable criteria on the existence and exponential stability of antiperiodic solutions for the equation are obtained. Our results are new and complementary to previously known results. An example is given to illustrate the feasibility and effectiveness of our main results.
Mining TCGA data using Boolean implications.
Directory of Open Access Journals (Sweden)
Subarna Sinha
Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.
Stability of Boolean multilevel networks.
Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir
2012-09-01
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.
Jarlebring, E.; Hochstenbach, M.E.
2009-01-01
Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some similarities between the different types of these so-called
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.
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.
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.
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.
Totally optimal decision trees for Boolean functions
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2016-01-01
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
Random networks of Boolean cellular automata
Energy Technology Data Exchange (ETDEWEB)
Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche
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).
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)
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
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.
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
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.
POSITIVE SOLUTIONS TO TWO TYPES OF NEUTRAL DIFFERENTIAL EQUATIONS WITH DISTRIBUTED DELAY
Institute of Scientific and Technical Information of China (English)
无
2012-01-01
In this paper, we study two types of neutral functional differential equations with finite or unbounded distributed deviating arguments. By Banach contraction princi-ple, we obtain some sufficient conditions for the existence of positive solutions to such equations.
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
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.
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.
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.
Information encryption systems based on Boolean functions
Directory of Open Access Journals (Sweden)
Aureliu Zgureanu
2011-02-01
Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.
TWIN POSITIVE PERIODIC SOLUTIONS OF FUNCTIONAL DIFFERENTIAL EQUATIONS WITH INFINITE DELAY
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this paper, the author studies a class of nonlinear functional differential equation. By using a fixed point theorem in cones, sufficient conditions are established for the existence of twin positive periodic solutions.
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.
Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications
Pan, Chenyun; Naeemi, Azad
2017-01-01
The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...
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...
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
Practical algorithms for linear boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Practical algorithms for linear Boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Noise-induced transitions at a Hopf bifurcation in a first-order delay-differential equation
International Nuclear Information System (INIS)
Longtin, A.
1991-01-01
The influence of colored noise on the Hopf bifurcation in a first-order delay-differential equation (DDE), a model paradigm for nonlinear delayed feedback systems, is considered. First, it is shown, using a stability analysis, how the properties of the DDE depend on the ratio R of system delay to response time. When this ratio is small, the DDE behaves more like a low-dimensional system of ordinary differential equations (ODE's); when R is large, one obtains a singular perturbation limit in which the behavior of the DDE approaches that of a discrete time map. The relative magnitude of the additive and multiplicative noise-induced postponements of the Hopf bifurcation are numerically shown to depend on the ratio R. Although both types of postponements are minute in the large-R limit, they are almost equal due to an equivalence of additive and parametric noise for discrete time maps. When R is small, the multiplicative shift is larger than the additive one at large correlation times, but the shifts are equal for small correlation times. In fact, at constant noise power, the postponement is only slightly affected by the correlation time of the noise, except when the noise becomes white, in which case the postponement drastically decreases. This is a numerical study of the stochastic Hopf bifurcation, in ODE's or DDE's, that looks at the effect of noise correlation time at constant power. Further, it is found that the slope at the fixed point averaged over the stochastic-parameter motion acts, under certain conditions, as a quantitative indicator of oscillation onset in the presence of noise. The problem of how properties of the DDE carry over to ODE's and to maps is discussed, along with the proper theoretical framework in which to study nonequilibrium phase transitions in this class of functional differential equations
Directory of Open Access Journals (Sweden)
D. Olvera
2015-01-01
Full Text Available We expand the application of the enhanced multistage homotopy perturbation method (EMHPM to solve delay differential equations (DDEs with constant and variable coefficients. This EMHPM is based on a sequence of subintervals that provide approximate solutions that require less CPU time than those computed from the dde23 MATLAB numerical integration algorithm solutions. To address the accuracy of our proposed approach, we examine the solutions of several DDEs having constant and variable coefficients, finding predictions with a good match relative to the corresponding numerical integration solutions.
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.
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.
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.
Classical Boolean logic gates with quantum systems
International Nuclear Information System (INIS)
Renaud, N; Joachim, C
2011-01-01
An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.
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.
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...
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.
Oscillation of Nonlinear Delay Differential Equation with Non-Monotone Arguments
Directory of Open Access Journals (Sweden)
Özkan Öcalan
2017-07-01
Full Text Available Consider the first-order nonlinear retarded differential equation $$ x^{\\prime }(t+p(tf\\left( x\\left( \\tau (t\\right \\right =0, t\\geq t_{0} $$ where $p(t$ and $\\tau (t$ are function of positive real numbers such that $%\\tau (t\\leq t$ for$\\ t\\geq t_{0},\\ $and$\\ \\lim_{t\\rightarrow \\infty }\\tau(t=\\infty $. Under the assumption that the retarded argument is non-monotone, new oscillation results are given. An example illustrating the result is also given.
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.
Directory of Open Access Journals (Sweden)
Haiyan Yuan
2013-01-01
Full Text Available This paper introduces the stability and convergence of two-step Runge-Kutta methods with compound quadrature formula for solving nonlinear Volterra delay integro-differential equations. First, the definitions of (k,l-algebraically stable and asymptotically stable are introduced; then the asymptotical stability of a (k,l-algebraically stable two-step Runge-Kutta method with 0
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.
Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard
2014-06-26
A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for
Asymptotic behaviour of solutions of nonlinear delay difference equations in Banach spaces
Directory of Open Access Journals (Sweden)
Anna Kisiolek
2005-10-01
Full Text Available We consider the second-order nonlinear difference equations of the form ÃŽÂ”(rnÃ¢ÂˆÂ’1ÃŽÂ”xnÃ¢ÂˆÂ’1+pnf(xnÃ¢ÂˆÂ’k=hn. We show that there exists a solution (xn, which possesses the asymptotic behaviour Ã¢Â€Â–xnÃ¢ÂˆÂ’aÃ¢ÂˆÂ‘j=0nÃ¢ÂˆÂ’1(1/rj+bÃ¢Â€Â–=o(1, a,bÃ¢ÂˆÂˆÃ¢Â„Â. In this paper, we extend the results of Agarwal (1992, Dawidowski et al. (2001, Drozdowicz and Popenda (1987, M. Migda (2001, and M. Migda and J. Migda (1988. We suppose that f has values in Banach space and satisfies some conditions with respect to the measure of noncompactness and measure of weak noncompactness.
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.
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.
Vector Boolean Functions: applications in symmetric cryptography
Álvarez Cubero, José Antonio
2015-01-01
Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...
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
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 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.
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
Esna-Ashari, Mojgan; Zekri, Maryam; Askari, Masood; Khalili, Noushin
2017-01-01
Because of increasing risk of diabetes, the measurement along with control of blood sugar has been of great importance in recent decades. In type I diabetes, because of the lack of insulin secretion, the cells cannot absorb glucose leading to low level of glucose. To control blood glucose (BG), the insulin must be injected to the body. This paper proposes a method for BG level regulation in type I diabetes. The control strategy is based on nonlinear model predictive control. The aim of the proposed controller optimized with genetics algorithms is to measure BG level each time and predict it for the next time interval. This merit causes a less amount of control effort, which is the rate of insulin delivered to the patient body. Consequently, this method can decrease the risk of hypoglycemia, a lethal phenomenon in regulating BG level in diabetes caused by a low BG level. Two delay differential equation models, namely Wang model and Enhanced Wang model, are applied as controller model and plant, respectively. The simulation results exhibit an acceptable performance of the proposed controller in meal disturbance rejection and robustness against parameter changes. As a result, if the nutrition of the person decreases instantly, the hypoglycemia will not happen. Furthermore, comparing this method with other works, it was shown that the new method outperforms previous studies.
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.
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.
Message passing for quantified Boolean formulas
International Nuclear Information System (INIS)
Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka
2012-01-01
We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers
Synthesizing biomolecule-based Boolean logic gates.
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2013-02-15
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.
Synthesizing Biomolecule-based Boolean Logic Gates
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2012-01-01
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588
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.
Optical reversible programmable Boolean logic unit.
Chattopadhyay, Tanay
2012-07-20
Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.
Boolean Operations with Prism Algebraic Patches
Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi
2009-01-01
In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
International Nuclear Information System (INIS)
Hill, T.R.; Reed, W.H.
1976-01-01
TIMEX solves the time-dependent, one-dimensional multigroup transport equation with delayed neutrons in plane, cylindrical, spherical, and two-angle plane geometries. Both regular and adjoint, inhomogeneous and homogeneous problems subject to vacuum, reflective, periodic, white, albedo or inhomogeneous boundary flux conditions are solved. General anisotropic scattering is allowed and anisotropic inhomogeneous sources are permitted. The discrete ordinates approximation for the angular variable is used with the diamond (central) difference approximation for the angular extrapolation in curved geometries. A linear discontinuous finite element representation for the angular flux in each spatial mesh cell is used. The time variable is differenced by an explicit technique that is unconditionally stable so that arbitrarily large time steps can be taken. Because no iteration is performed the method is exceptionally fast in terms of computing time per time step. Two acceleration methods, exponential extrapolation and rebalance, are utilized to improve the accuracy of the time differencing scheme. Variable dimensioning is used so that any combination of problem parameters leading to a container array less than MAXCOR can be accommodated. The running time for TIMEX is highly problem-dependent, but varies almost linearly with the total number of unknowns and time steps. Provision is made for creation of standard interface output files for angular fluxes and angle-integrated fluxes. Five interface units (use of interface units is optional), five output units, and two system input/output units are required. A large bulk memory is desirable, but may be replaced by disk, drum, or tape storage. 13 tables, 9 figures
Directory of Open Access Journals (Sweden)
George L. Karakostas
2006-08-01
Full Text Available We provide sufficient conditions for the existence of positive solutions of a three-point boundary value problem concerning a second order delay differential equation with damping and forcing term whose the delayed part is an actively bounded function, a meaning introduced in [19]. By writing the damping term as a difference of two factors one can extract more information on the solutions. (For instance, in an application, given in the last section, we can give the exact value of the norm of the solution.
A transition calculus for Boolean functions. [logic circuit analysis
Tucker, J. H.; Bennett, A. W.
1974-01-01
A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
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.
Nonlinear threshold Boolean automata networks and phase transitions
Demongeot, Jacques; Sené, Sylvain
2010-01-01
In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...
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.
Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.
Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence
2012-08-29
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. 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. 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 translated in a set of ordinary differential
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.
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...... 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...
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.
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)
S. A. Kaschenko
2014-01-01
Full Text Available We study the dynamics of finite-difference approximation on spatial variables of a logistic equation with delay and diffusion. It is assumed that the diffusion coefficient is small and the Malthusian coefficient is large. The question of the existence and asymptotic behavior of attractors was studied with special asymptotic methods. It is shown that there is a rich array of different types of attractors in the phase space: leading centers, spiral waves, etc. The main asymptotic characteristics of all solutions from the corresponding attractors are adduced in this work. Typical graphics of wave fronts motion of different structures are represented in the article.
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....
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.
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.
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.
Confluence of an extension of combinatory logic by Boolean constants
DEFF Research Database (Denmark)
Czajka, Łukasz
2017-01-01
We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....
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
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
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
Boolean comparative analysis of qualitative data : a methodological note
Romme, A.G.L.
1995-01-01
This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final
Parallel object-oriented term rewriting : the booleans
Rodenburg, P.H.; Vrancken, J.L.M.
As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism
A Construction of Boolean Functions with Good Cryptographic Properties
2014-01-01
be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...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
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.
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\
Directory of Open Access Journals (Sweden)
Lin Hu
2011-01-01
Full Text Available A class of drift-implicit one-step schemes are proposed for the neutral stochastic delay differential equations (NSDDEs driven by Poisson processes. A general framework for mean-square convergence of the methods is provided. It is shown that under certain conditions global error estimates for a method can be inferred from estimates on its local error. The applicability of the mean-square convergence theory is illustrated by the stochastic θ-methods and the balanced implicit methods. It is derived from Theorem 3.1 that the order of the mean-square convergence of both of them for NSDDEs with jumps is 1/2. Numerical experiments illustrate the theoretical results. It is worth noting that the results of mean-square convergence of the stochastic θ-methods and the balanced implicit methods are also new.
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.
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.
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
Energy Technology Data Exchange (ETDEWEB)
Ryu, Eun Hyun; Song, Yong Mann; Park, Joo Hwan [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2013-05-15
If time-dependent equation is solved with the FEM, the limitation of the input geometry will disappear. It has often been pointed out that the numerical methods implemented in the RFSP code are not state-of-the-art. Although an acceleration method such as the Coarse Mesh Finite Difference (CMFD) for Finite Difference Method (FDM) does not exist for the FEM, one should keep in mind that the number of time steps for the transient simulation is not large. The rigorous formulation in this study will richen the theoretical basis of the FEM and lead to an extension of the dynamics code to deal with a more complicated problem. In this study, the formulation for the 1-D, 1-G Time Dependent Neutron Diffusion Equation (TDNDE) without consideration of the delay neutron will first be done. A problem including one multiplying medium will be solved. Also several conclusions from a comparison between the numerical and analytic solutions, a comparison between solutions with various element orders, and a comparison between solutions with different time differencing will be made to be certain about the formulation and FEM solution. By investigating various cases with different values of albedo, theta, and the order of elements, it can be concluded that the finite element solution is agree well with the analytic solution. The higher the element order used, the higher the accuracy improvements are obtained.
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
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-29
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.
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.
3D Boolean operations in virtual surgical planning.
Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun
2017-10-01
Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.
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.
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate
International Nuclear Information System (INIS)
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-01-01
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. (paper)
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.
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 rel...
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
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
A boolean optimization method for reloading a nuclear reactor
International Nuclear Information System (INIS)
Misse Nseke, Theophile.
1982-04-01
We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr
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.
BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool
Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.
2006-01-01
BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…
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.
Complex network analysis of state spaces for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)
2008-01-15
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.
Complex network analysis of state spaces for random Boolean networks
International Nuclear Information System (INIS)
Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya
2008-01-01
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two
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
Directory of Open Access Journals (Sweden)
Stalin Muñoz
2018-03-01
Full Text Available 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.
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
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...... 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...
Minimum energy control and optimal-satisfactory control of Boolean control network
International Nuclear Information System (INIS)
Li, Fangfei; Lu, Xiwen
2013-01-01
In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.
Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes
Institute of Scientific and Technical Information of China (English)
Hao CHEN; Liang MA; Jianhua LI
2011-01-01
Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.
Mori, Fumito; Mochizuki, Atsushi
2017-07-14
Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.
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)
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....
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.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
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
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.
Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions
2015-01-01
degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis
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.
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
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.
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.
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
Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks
Gong, Xinwei
This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing
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.
Directory of Open Access Journals (Sweden)
Wensheng Guo
Full Text Available 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.
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.
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
International Nuclear Information System (INIS)
Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong
2015-01-01
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations
On the Boolean extension of the Birnbaum importance to non-coherent systems
International Nuclear Information System (INIS)
Aliee, Hananeh; Borgonovo, Emanuele; Glaß, Michael; Teich, Jürgen
2017-01-01
The Birnbaum importance measure plays a central role in reliability analysis. It has initially been introduced for coherent systems, where several of its properties hold and where its computation is straightforward. This work introduces a Boolean expression for the notion of criticality that allows the seamless extension of the Birnbaum importance to non-coherent systems. As a key feature, the novel definition makes the computation and encoding straightforward with well-established techniques such as Binary Decision Diagrams (BDDs) or Fault Trees (FTs). Several examples and a case study illustrate the findings. - Highlights: • We propose a Boolean expression for the notion of criticality in coherent and non-coherent systems. • The notion is connected with the Birnbaum importance measure. • The connection with Andrew's and Beeson extension is discussed. • The Boolean expression allows straightforward encoding in Binary Decision Diagrams.
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
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.
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
International Nuclear Information System (INIS)
Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.
2016-01-01
Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.
Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M
2017-11-25
Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression
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.
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…
Application of fuzzy logic to Boolean models for digital soil assessment
Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.
2011-01-01
Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between
Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics
Jenner, Ronald A.
2002-01-01
A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic
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
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...
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.
Describing the What and Why of Students' Difficulties in Boolean Logic
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
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
Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.
Fox, Edward A.; Winett, Sheila G.
1990-01-01
Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…
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.
Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes
International Nuclear Information System (INIS)
Liu, M; Bassler, K E
2011-01-01
Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2001-01-01
Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics
User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.
Ensor, Pat
1992-01-01
Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…
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
Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C
2016-11-01
Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Exact sampling from conditional Boolean models with applications to maximum likelihood inference
Lieshout, van M.N.M.; Zwet, van E.W.
2001-01-01
We are interested in estimating the intensity parameter of a Boolean model of discs (the bombing model) from a single realization. To do so, we derive the conditional distribution of the points (germs) of the underlying Poisson process. We demonstrate how to apply coupling from the past to generate
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
Xie, Zhengwei; Qiu, Daowen; Cai, Guangya
2018-06-01
Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.
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 ...
Energy Technology Data Exchange (ETDEWEB)
Hatsukawa, Yuichi [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
1997-07-01
Delayed fission is a nuclear decay process that couples {beta} decay and fission. In the delayed fission process, a parent nucleus undergoes {beta} decay and thereby populates excited states in the daughter. If these states are of energies comparable to or greater than the fission barrier of the daughter, then fission may compete with other decay modes of the excited states in the daughter. In this paper, mechanism and some experiments of the delayed fission will be discussed. (author)
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...
A short Boolean derivation of mean failure frequency for any (also non-coherent) system
International Nuclear Information System (INIS)
Schneeweiss, Winfrid G.
2009-01-01
For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.
Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R
2017-01-01
Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.
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.
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek
2015-08-07
The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.
Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask
Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti
2012-01-01
Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.
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
THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM
Directory of Open Access Journals (Sweden)
A. A. Butov
2014-01-01
Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.
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
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
Directory of Open Access Journals (Sweden)
Jens Christian Claussen
2017-06-01
Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
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.
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.
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.
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
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.
... cases, it is due to a combination of physical and psychological concerns. Psychological causes of delayed ejaculation include: Depression, anxiety or other mental health conditions Relationship problems due to stress, poor communication ...
... Slow rate of growth; Retarded growth and development; Growth delay Images Toddler development References Cooke DW, Divall SA, Radovick S. Normal and aberrant growth in children. In: Melmed S, Polonsky KS, Larsen PR, ...
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.
COMPARISON THEOREMS AND APPLICATIONS OF OSCILLATION OF NEUTRAL DIFFERENTIAL EQUATIONS
Institute of Scientific and Technical Information of China (English)
燕居让
1991-01-01
We first establish comparison theorems of the oscillation for a higher-order neutral delaydifferential equation. By these comparison theorems, the criterion of oscillation propertiesof neutral delay differential equation is reduced to that of nonneutral delay differential equa-tion, from which we give a series of oscillation theorems for neutral delay differentialequation.
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
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.
2017-09-01
satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized
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
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
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
International Nuclear Information System (INIS)
Zheng, Jinbin
2014-01-01
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software
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.
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...
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)
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
Strahler, Alan H.; Jupp, David L. B.
1990-01-01
Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
Energy Technology Data Exchange (ETDEWEB)
Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)
2014-10-06
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-04-28
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
Nutrition support is essential for the care of the child with developmental delay. After a thorough evaluation, an individualized intervention plan that accounts for the child’s nutrition status, feeding ability, and medical condition may be determined. Nutrition assessments may be performed at leas...
Energy Technology Data Exchange (ETDEWEB)
Plas, R.
1962-07-01
The author reports a study on kinetics equations for a reactor. He uses the conventional form of these equations but by using a dynamic multiplication factor. Thus, constants related to delayed neutrons are not modified by efficiency factors. The author first describes the theoretic kinetic operation of a reactor and develops the associated equations. He reports the development of equations for multiplication factors.
Boolean logic analysis for flow regime recognition of gas–liquid horizontal flow
International Nuclear Information System (INIS)
Ramskill, Nicholas P; Wang, Mi
2011-01-01
In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime
Feedback topology and XOR-dynamics in Boolean networks with varying input structure
Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
On the number of different dynamics in Boolean networks with deterministic update schedules.
Aracena, J; Demongeot, J; Fanchon, E; Montalva, M
2013-04-01
Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.
Feedback topology and XOR-dynamics in Boolean networks with varying input structure.
Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk
2015-11-01
We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.
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.
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)
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.
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.
DEFF Research Database (Denmark)
Kolby, Nanna; Busch, Alexander Siegfried; Juul, Anders
2017-01-01
. The underlying reasons for the large variation in the age at pubertal onset are not fully established; however, nutritional status and socioeconomic and environmental factors are known to be influencing, and a significant amount of influencing genetic factors have also been identified. The challenges...... optimal in discriminating especially CDGP from HH. Management of the delayed puberty depends on the etiology. For boys with CDGP an observational period will often reveal imminent puberty. If puberty is not progressing spontaneously, sex steroid replacement is effective in stimulating the development...
Fisher information at the edge of chaos in random Boolean networks.
Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail
2011-01-01
We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.
Quantum tests for the linearity and permutation invariance of Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)
2011-12-15
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.
The pseudo-Boolean optimization approach to form the N-version software structure
Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.
2015-10-01
The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.
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