A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks.

PubMed

Laomettachit, Teeraphan; Chen, Katherine C; Baumann, William T; Tyson, John J

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a "standard component" modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with "standard components" can capture in quantitative detail many essential properties of cell cycle control in budding yeast.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks

PubMed Central

Laomettachit, Teeraphan; Chen, Katherine C.; Baumann, William T.

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a “standard component” modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with “standard components” can capture in quantitative detail many essential properties of cell cycle control in budding yeast. PMID:27187804

Stochastic model simulation using Kronecker product analysis and Zassenhaus formula approximation.

PubMed

Caglar, Mehmet Umut; Pal, Ranadip

2013-01-01

Probabilistic Models are regularly applied in Genetic Regulatory Network modeling to capture the stochastic behavior observed in the generation of biological entities such as mRNA or proteins. Several approaches including Stochastic Master Equations and Probabilistic Boolean Networks have been proposed to model the stochastic behavior in genetic regulatory networks. It is generally accepted that Stochastic Master Equation is a fundamental model that can describe the system being investigated in fine detail, but the application of this model is computationally enormously expensive. On the other hand, Probabilistic Boolean Network captures only the coarse-scale stochastic properties of the system without modeling the detailed interactions. We propose a new approximation of the stochastic master equation model that is able to capture the finer details of the modeled system including bistabilities and oscillatory behavior, and yet has a significantly lower computational complexity. In this new method, we represent the system using tensors and derive an identity to exploit the sparse connectivity of regulatory targets for complexity reduction. The algorithm involves an approximation based on Zassenhaus formula to represent the exponential of a sum of matrices as product of matrices. We derive upper bounds on the expected error of the proposed model distribution as compared to the stochastic master equation model distribution. Simulation results of the application of the model to four different biological benchmark systems illustrate performance comparable to detailed stochastic master equation models but with considerably lower computational complexity. The results also demonstrate the reduced complexity of the new approach as compared to commonly used Stochastic Simulation Algorithm for equivalent accuracy.

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D.; Lohmann, Johannes

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 delaysmore » 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.« less

Sequential, progressive, equal-power, reflective beam-splitter arrays

NASA Astrophysics Data System (ADS)

Manhart, Paul K.

2017-11-01

The equations to calculate equal-power reflectivity of a sequential series of beam splitters is presented. Non-sequential optical design examples are offered for uniform illumination using diode lasers. Objects created using Boolean operators and Swept Surfaces can create objects capable of reflecting light into predefined elevation and azimuth angles. Analysis of the illumination patterns for the array are also presented.

Comparison of stationary and oscillatory dynamics described by differential equations and Boolean maps in transcriptional regulatory circuits

NASA Astrophysics Data System (ADS)

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.

Boolean Networks in Inference and Dynamic Modeling of Biological Systems at the Molecular and Physiological Level

NASA Astrophysics Data System (ADS)

Thakar, Juilee; Albert, Réka

The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References

Lattice Theory, Measures and Probability

NASA Astrophysics Data System (ADS)

Knuth, Kevin H.

2007-11-01

In this tutorial, I will discuss the concepts behind generalizing ordering to measuring and apply these ideas to the derivation of probability theory. The fundamental concept is that anything that can be ordered can be measured. Since we are in the business of making statements about the world around us, we focus on ordering logical statements according to implication. This results in a Boolean lattice, which is related to the fact that the corresponding logical operations form a Boolean algebra. The concept of logical implication can be generalized to degrees of implication by generalizing the zeta function of the lattice. The rules of probability theory arise naturally as a set of constraint equations. Through this construction we are able to neatly connect the concepts of order, structure, algebra, and calculus. The meaning of probability is inherited from the meaning of the ordering relation, implication, rather than being imposed in an ad hoc manner at the start.

State feedback control design for Boolean networks.

PubMed

Liu, Rongjie; Qian, Chunjiang; Liu, Shuqian; Jin, Yu-Fang

2016-08-26

Driving Boolean networks to desired states is of paramount significance toward our ultimate goal of controlling the progression of biological pathways and regulatory networks. Despite recent computational development of controllability of general complex networks and structural controllability of Boolean networks, there is still a lack of bridging the mathematical condition on controllability to real boolean operations in a network. Further, no realtime control strategy has been proposed to drive a Boolean network. In this study, we applied semi-tensor product to represent boolean functions in a network and explored controllability of a boolean network based on the transition matrix and time transition diagram. We determined the necessary and sufficient condition for a controllable Boolean network and mapped this requirement in transition matrix to real boolean functions and structure property of a network. An efficient tool is offered to assess controllability of an arbitrary Boolean network and to determine all reachable and non-reachable states. We found six simplest forms of controllable 2-node Boolean networks and explored the consistency of transition matrices while extending these six forms to controllable networks with more nodes. Importantly, we proposed the first state feedback control strategy to drive the network based on the status of all nodes in the network. Finally, we applied our reachability condition to the major switch of P53 pathway to predict the progression of the pathway and validate the prediction with published experimental results. This control strategy allowed us to apply realtime control to drive Boolean networks, which could not be achieved by the current control strategy for Boolean networks. Our results enabled a more comprehensive understanding of the evolution of Boolean networks and might be extended to output feedback control design.

Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling

PubMed Central

Wittmann, Dominik M; Krumsiek, Jan; Saez-Rodriguez, Julio; Lauffenburger, Douglas A; Klamt, Steffen; Theis, Fabian J

2009-01-01

Background The understanding of regulatory and signaling networks has long been a core objective in Systems Biology. Knowledge about these networks is mainly of qualitative nature, which allows the construction of Boolean models, where the state of a component is either 'off' or 'on'. While often able to capture the essential behavior of a network, these models can never reproduce detailed time courses of concentration levels. Nowadays however, experiments yield more and more quantitative data. An obvious question therefore is how qualitative models can be used to explain and predict the outcome of these experiments. Results In this contribution we present a canonical way of transforming Boolean into continuous models, where the use of multivariate polynomial interpolation allows transformation of logic operations into a system of ordinary differential equations (ODE). The method is standardized and can readily be applied to large networks. Other, more limited approaches to this task are briefly reviewed and compared. Moreover, we discuss and generalize existing theoretical results on the relation between Boolean and continuous models. As a test case a logical model is transformed into an extensive continuous ODE model describing the activation of T-cells. We discuss how parameters for this model can be determined such that quantitative experimental results are explained and predicted, including time-courses for multiple ligand concentrations and binding affinities of different ligands. This shows that from the continuous model we may obtain biological insights not evident from the discrete one. Conclusion The presented approach will facilitate the interaction between modeling and experiments. Moreover, it provides a straightforward way to apply quantitative analysis methods to qualitatively described systems. PMID:19785753

The Boolean Is Dead, Long Live the Boolean! Natural Language versus Boolean Searching in Introductory Undergraduate Instruction

ERIC Educational Resources Information Center

Lowe, M. Sara; Maxson, Bronwen K.; Stone, Sean M.; Miller, Willie; Snajdr, Eric; Hanna, Kathleen

2018-01-01

Boolean logic can be a difficult concept for first-year, introductory students to grasp. This paper compares the results of Boolean and natural language searching across several databases with searches created from student research questions. Performance differences between databases varied. Overall, natural search language is at least as good as…

Computational complexity of Boolean functions

NASA Astrophysics Data System (ADS)

Korshunov, Aleksei D.

2012-02-01

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.

Cryptographic Boolean Functions with Biased Inputs

DTIC Science & Technology

2015-07-31

theory of random graphs developed by Erdős and Rényi [2]. The graph properties in a random graph expressed as such Boolean functions are used by...distributed Bernoulli variates with the parameter p. Since our scope is within the area of cryptography , we initiate an analysis of cryptographic...Boolean functions with biased inputs, which we refer to as µp-Boolean functions, is a common generalization of Boolean functions which stems from the

Floral Morphogenesis: Stochastic Explorations of a Gene Network Epigenetic Landscape

PubMed Central

Aldana, Maximino; Benítez, Mariana; Cortes-Poza, Yuriria; Espinosa-Soto, Carlos; Hartasánchez, Diego A.; Lotto, R. Beau; Malkin, David; Escalera Santos, Gerardo J.; Padilla-Longoria, Pablo

2008-01-01

In contrast to the classical view of development as a preprogrammed and deterministic process, recent studies have demonstrated that stochastic perturbations of highly non-linear systems may underlie the emergence and stability of biological patterns. Herein, we address the question of whether noise contributes to the generation of the stereotypical temporal pattern in gene expression during flower development. We modeled the regulatory network of organ identity genes in the Arabidopsis thaliana flower as a stochastic system. This network has previously been shown to converge to ten fixed-point attractors, each with gene expression arrays that characterize inflorescence cells and primordial cells of sepals, petals, stamens, and carpels. The network used is binary, and the logical rules that govern its dynamics are grounded in experimental evidence. We introduced different levels of uncertainty in the updating rules of the network. Interestingly, for a level of noise of around 0.5–10%, the system exhibited a sequence of transitions among attractors that mimics the sequence of gene activation configurations observed in real flowers. We also implemented the gene regulatory network as a continuous system using the Glass model of differential equations, that can be considered as a first approximation of kinetic-reaction equations, but which are not necessarily equivalent to the Boolean model. Interestingly, the Glass dynamics recover a temporal sequence of attractors, that is qualitatively similar, although not identical, to that obtained using the Boolean model. Thus, time ordering in the emergence of cell-fate patterns is not an artifact of synchronous updating in the Boolean model. Therefore, our model provides a novel explanation for the emergence and robustness of the ubiquitous temporal pattern of floral organ specification. It also constitutes a new approach to understanding morphogenesis, providing predictions on the population dynamics of cells with different genetic configurations during development. PMID:18978941

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

PubMed

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.

A Simple Blueprint for Automatic Boolean Query Processing.

ERIC Educational Resources Information Center

Salton, G.

1988-01-01

Describes a new Boolean retrieval environment in which an extended soft Boolean logic is used to automatically construct queries from original natural language formulations provided by users. Experimental results that compare the retrieval effectiveness of this method to conventional Boolean and vector processing are discussed. (27 references)…

Optimal stabilization of Boolean networks through collective influence

NASA Astrophysics Data System (ADS)

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.

Effect of memory in non-Markovian Boolean networks illustrated with a case study: A cell cycling process

NASA Astrophysics Data System (ADS)

Ebadi, H.; Saeedian, M.; Ausloos, M.; Jafari, G. R.

2016-11-01

The Boolean network is one successful model to investigate discrete complex systems such as the gene interacting phenomenon. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self-organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function —one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of the yeast cell cycle network, we discover a power-law-like memory with a more robust dynamics than the Markovian dynamics.

On the Computation of Comprehensive Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

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.

Mining TCGA Data Using Boolean Implications

PubMed Central

Sinha, Subarna; Tsang, Emily K.; Zeng, Haoyang; Meister, Michela; Dill, David L.

2014-01-01

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/. PMID:25054200

Synchronization of coupled large-scale Boolean networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Fangfei, E-mail: li-fangfei@163.com

2014-03-15

This paper investigates the complete synchronization and partial synchronization of two large-scale Boolean networks. First, the aggregation algorithm towards large-scale Boolean network is reviewed. Second, the aggregation algorithm is applied to study the complete synchronization and partial synchronization of large-scale Boolean networks. Finally, an illustrative example is presented to show the efficiency of the proposed results.

The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.

PubMed

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.

BoolFilter: an R package for estimation and identification of partially-observed Boolean dynamical systems.

PubMed

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 technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays.

Development of Boolean calculus and its application

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1979-01-01

Formal procedures for synthesis of asynchronous sequential system using commercially available edge-sensitive flip-flops are developed. Boolean differential is defined. The exact number of compatible integrals of a Boolean differential were calculated.

Boolean integral calculus

NASA Technical Reports Server (NTRS)

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.

Modeling the Normal and Neoplastic Cell Cycle with 'Realistic Boolean Genetic Networks': Their Application for Understanding Carcinogenesis and Assessing Therapeutic Strategies

NASA Technical Reports Server (NTRS)

Szallasi, Zoltan; Liang, Shoudan

2000-01-01

In this paper we show how Boolean genetic networks could be used to address complex problems in cancer biology. First, we describe a general strategy to generate Boolean genetic networks that incorporate all relevant biochemical and physiological parameters and cover all of their regulatory interactions in a deterministic manner. Second, we introduce 'realistic Boolean genetic networks' that produce time series measurements very similar to those detected in actual biological systems. Third, we outline a series of essential questions related to cancer biology and cancer therapy that could be addressed by the use of 'realistic Boolean genetic network' modeling.

Automatic query formulations in information retrieval.

PubMed

Salton, G; Buckley, C; Fox, E A

1983-07-01

Modern information retrieval systems are designed to supply relevant information in response to requests received from the user population. In most retrieval environments the search requests consist of keywords, or index terms, interrelated by appropriate Boolean operators. Since it is difficult for untrained users to generate effective Boolean search requests, trained search intermediaries are normally used to translate original statements of user need into useful Boolean search formulations. Methods are introduced in this study which reduce the role of the search intermediaries by making it possible to generate Boolean search formulations completely automatically from natural language statements provided by the system patrons. Frequency considerations are used automatically to generate appropriate term combinations as well as Boolean connectives relating the terms. Methods are covered to produce automatic query formulations both in a standard Boolean logic system, as well as in an extended Boolean system in which the strict interpretation of the connectives is relaxed. Experimental results are supplied to evaluate the effectiveness of the automatic query formulation process, and methods are described for applying the automatic query formulation process in practice.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

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

Proposed method to construct Boolean functions with maximum possible annihilator immunity

NASA Astrophysics Data System (ADS)

Goyal, Rajni; Panigrahi, Anupama; Bansal, Rohit

2017-07-01

Nonlinearity and Algebraic(annihilator) immunity are two core properties of a Boolean function because optimum values of Annihilator Immunity and nonlinearity are required to resist fast algebraic attack and differential cryptanalysis respectively. For a secure cypher system, Boolean function(S-Boxes) should resist maximum number of attacks. It is possible if a Boolean function has optimal trade-off among its properties. Before constructing Boolean functions, we fixed the criteria of our constructions based on its properties. In present work, our construction is based on annihilator immunity and nonlinearity. While keeping above facts in mind,, we have developed a multi-objective evolutionary approach based on NSGA-II and got the optimum value of annihilator immunity with good bound of nonlinearity. We have constructed balanced Boolean functions having the best trade-off among balancedness, Annihilator immunity and nonlinearity for 5, 6 and 7 variables by the proposed method.

Derivation and computation of discrete-delay and continuous-delay SDEs in mathematical biology.

PubMed

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.

Optimal Control for Stochastic Delay Evolution Equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meng, Qingxin, E-mail: mqx@hutc.zj.cn; Shen, Yang, E-mail: skyshen87@gmail.com

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 applymore » 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.« less

To Boolean or Not To Boolean.

ERIC Educational Resources Information Center

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)

Minimum energy control and optimal-satisfactory control of Boolean control network

NASA Astrophysics Data System (ADS)

Li, Fangfei; Lu, Xiwen

2013-12-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.

Identifying a Probabilistic Boolean Threshold Network From Samples.

PubMed

Melkman, Avraham A; Cheng, Xiaoqing; Ching, Wai-Ki; Akutsu, Tatsuya

2018-04-01

This paper studies the problem of exactly identifying the structure of a probabilistic Boolean network (PBN) from a given set of samples, where PBNs are probabilistic extensions of Boolean networks. Cheng et al. studied the problem while focusing on PBNs consisting of pairs of AND/OR functions. This paper considers PBNs consisting of Boolean threshold functions while focusing on those threshold functions that have unit coefficients. The treatment of Boolean threshold functions, and triplets and -tuplets of such functions, necessitates a deepening of the theoretical analyses. It is shown that wide classes of PBNs with such threshold functions can be exactly identified from samples under reasonable constraints, which include: 1) PBNs in which any number of threshold functions can be assigned provided that all have the same number of input variables and 2) PBNs consisting of pairs of threshold functions with different numbers of input variables. It is also shown that the problem of deciding the equivalence of two Boolean threshold functions is solvable in pseudopolynomial time but remains co-NP complete.

Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks.

PubMed

Muñoz, Stalin; Carrillo, Miguel; Azpeitia, Eugenio; Rosenblueth, David A

2018-01-01

Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined "regulation" graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic) attractors. We describe Griffin , a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ "symbolic" techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as "clause learning" considerably increasing Griffin 's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.

On the Run-Time Optimization of the Boolean Logic of a Program.

ERIC Educational Resources Information Center

Cadolino, C.; Guazzo, M.

1982-01-01

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Boolean integral calculus for digital systems

NASA Technical Reports Server (NTRS)

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.

Long-time behavior for suspension bridge equations with time delay

NASA Astrophysics Data System (ADS)

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.

A Comparison of Two Methods for Boolean Query Relevancy Feedback.

ERIC Educational Resources Information Center

Salton, G.; And Others

1984-01-01

Evaluates and compares two recently proposed automatic methods for relevance feedback of Boolean queries (Dillon method, which uses probabilistic approach as basis, and disjunctive normal form method). Conclusions are drawn concerning the use of effective feedback methods in a Boolean query environment. Nineteen references are included. (EJS)

Lie group classification of first-order delay ordinary differential equations

NASA Astrophysics Data System (ADS)

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.

Boolean Classes and Qualitative Inquiry. WCER Working Paper No. 2006-3

ERIC Educational Resources Information Center

Nathan, Mitchell J.; Jackson, Kristi

2006-01-01

The prominent role of Boolean classes in qualitative data analysis software is viewed by some as an encroachment of logical positivism on qualitative research methodology. The authors articulate an embodiment perspective, in which Boolean classes are viewed as conceptual metaphors for apprehending and manipulating data, concepts, and categories in…

Perturbations of linear delay differential equations at the verge of instability.

PubMed

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.

Hierarchy of models: From qualitative to quantitative analysis of circadian rhythms in cyanobacteria

NASA Astrophysics Data System (ADS)

Chaves, M.; Preto, M.

2013-06-01

A hierarchy of models, ranging from high to lower levels of abstraction, is proposed to construct "minimal" but predictive and explanatory models of biological systems. Three hierarchical levels will be considered: Boolean networks, piecewise affine differential (PWA) equations, and a class of continuous, ordinary, differential equations' models derived from the PWA model. This hierarchy provides different levels of approximation of the biological system and, crucially, allows the use of theoretical tools to more exactly analyze and understand the mechanisms of the system. The Kai ABC oscillator, which is at the core of the cyanobacterial circadian rhythm, is analyzed as a case study, showing how several fundamental properties—order of oscillations, synchronization when mixing oscillating samples, structural robustness, and entrainment by external cues—can be obtained from basic mechanisms.

Dynamics of one- and two-dimensional fronts in a bistable equation with time-delayed global feedback: Propagation failure and control mechanisms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boubendir, Yassine; Mendez, Vicenc; Rotstein, Horacio G.

2010-09-15

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 delaymore » 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.« less

Algebraic model checking for Boolean gene regulatory networks.

PubMed

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.

Analysis of stability for stochastic delay integro-differential equations.

PubMed

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.

E-Referencer: Transforming Boolean OPACs to Web Search Engines.

ERIC Educational Resources Information Center

Khoo, Christopher S. G.; Poo, Danny C. C.; Toh, Teck-Kang; Hong, Glenn

E-Referencer is an expert intermediary system for searching library online public access catalogs (OPACs) on the World Wide Web. It is implemented as a proxy server that mediates the interaction between the user and Boolean OPACs. It transforms a Boolean OPAC into a retrieval system with many of the search capabilities of Web search engines.…

Estimation of time- and state-dependent delays and other parameters in functional differential equations

NASA Technical Reports Server (NTRS)

Murphy, K. A.

1988-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.

Estimation of time- and state-dependent delays and other parameters in functional differential equations

NASA Technical Reports Server (NTRS)

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.

Selective monitoring

NASA Astrophysics Data System (ADS)

Homem-de-Mello, Luiz S.

1992-04-01

While in NASA's earlier space missions such as Voyager the number of sensors was in the hundreds, future platforms such as the Space Station Freedom will have tens of thousands sensors. For these planned missions it will be impossible to use the comprehensive monitoring strategy that was used in the past in which human operators monitored all sensors all the time. A selective monitoring strategy must be substituted for the current comprehensive strategy. This selective monitoring strategy uses computer tools to preprocess the incoming data and direct the operators' attention to the most critical parts of the physical system at any given time. There are several techniques that can be used to preprocess the incoming information. This paper presents an approach to using diagnostic reasoning techniques to preprocess the sensor data and detect which parts of the physical system require more attention because components have failed or are most likely to have failed. Given the sensor readings and a model of the physical system, a number of assertions are generated and expressed as Boolean equations. The resulting system of Boolean equations is solved symbolically. Using a priori probabilities of component failure and Bayes' rule, revised probabilities of failure can be computed. These will indicate what components have failed or are the most likely to have failed. This approach is suitable for systems that are well understood and for which the correctness of the assertions can be guaranteed. Also, the system must be such that assertions can be made from instantaneous measurements. And the system must be such that changes are slow enough to allow the computation.

Oscillation criteria for a class of second-order Emden-Fowler delay dynamic equations on time scales

NASA Astrophysics Data System (ADS)

Han, Zhenlai; Sun, Shurong; Shi, Bao

2007-10-01

By means of Riccati transformation technique, we establish some new oscillation criteria for the second-order Emden-Fowler delay dynamic equationsx[Delta][Delta](t)+p(t)x[gamma]([tau](t))=0 on a time scale ; here [gamma] is a quotient of odd positive integers with p(t) real-valued positive rd-continuous functions defined on . To the best of our knowledge nothing is known regarding the qualitative behavior of these equations on time scales. Our results in this paper not only extend the results given in [R.P. Agarwal, M. Bohner, S.H. Saker, Oscillation of second-order delay dynamic equations, Can. Appl. Math. Q. 13 (1) (2005) 1-18] but also unify the oscillation of the second-order Emden-Fowler delay differential equation and the second-order Emden-Fowler delay difference equation.

Singular Hopf bifurcation in a differential equation with large state-dependent delay

PubMed Central

Kozyreff, G.; Erneux, T.

2014-01-01

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. PMID:24511255

Singular Hopf bifurcation in a differential equation with large state-dependent delay.

PubMed

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.

BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool

ERIC Educational Resources Information Center

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…

Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.

PubMed

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.

Monotone Boolean approximation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hulme, B.L.

1982-12-01

This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application formore » the analysis of noncoherent fault trees and event tree sequences.« less

On spectral techniques in analysis of Boolean networks

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-06-01

In this work we present results that can be used for analysis of Boolean networks. The results utilize Fourier spectra of the functions in the network. An accurate formula is given for Derrida plots of networks of finite size N based on a result on Boolean functions presented in another context. Derrida plots are widely used to examine the stability issues of Boolean networks. For the limit N→∞, we give a computationally simple form that can be used as a good approximation for rather small networks as well. A formula for Derrida plots of random Boolean networks (RBNs) presented earlier in the literature is given an alternative derivation. It is shown that the information contained in the Derrida plot is equal to the average Fourier spectrum of the functions in the network. In the case of random networks the mean Derrida plot can be obtained from the mean spectrum of the functions. The method is applied to real data by using the Boolean functions found in genetic regulatory networks of eukaryotic cells in an earlier study. Conventionally, Derrida plots and stability analysis have been computed with statistical sampling resulting in poorer accuracy.

Automatic Screening for Perturbations in Boolean Networks.

PubMed

Schwab, Julian D; Kestler, Hans A

2018-01-01

A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology. Boolean network models allow simulating the qualitative behavior of the modeled processes. A central objective in the simulation of Boolean networks is the computation of their long-term behavior-so-called attractors. These attractors are of special interest as they can often be linked to biologically relevant behaviors. Changing internal and external conditions can influence the long-term behavior of the Boolean network model. Perturbation of a Boolean network by stripping a component of the system or simulating a surplus of another element can lead to different attractors. Apparently, the number of possible perturbations and combinations of perturbations increases exponentially with the size of the network. Manually screening a set of possible components for combinations that have a desired effect on the long-term behavior can be very time consuming if not impossible. We developed a method to automatically screen for perturbations that lead to a user-specified change in the network's functioning. This method is implemented in the visual simulation framework ViSiBool utilizing satisfiability (SAT) solvers for fast exhaustive attractor search.

Approximate controllability of a system of parabolic equations with delay

NASA Astrophysics Data System (ADS)

Carrasco, Alexander; Leiva, Hugo

2008-09-01

In this paper we give necessary and sufficient conditions for the approximate controllability of the following system of parabolic equations with delay: where [Omega] is a bounded domain in , D is an n×n nondiagonal matrix whose eigenvalues are semi-simple with nonnegative real part, the control and B[set membership, variant]L(U,Z) with , . The standard notation zt(x) defines a function from [-[tau],0] to (with x fixed) by zt(x)(s)=z(t+s,x), -[tau][less-than-or-equals, slant]s[less-than-or-equals, slant]0. Here [tau][greater-or-equal, slanted]0 is the maximum delay, which is supposed to be finite. We assume that the operator is linear and bounded, and [phi]0[set membership, variant]Z, [phi][set membership, variant]L2([-[tau],0];Z). To this end: First, we reformulate this system into a standard first-order delay equation. Secondly, the semigroup associated with the first-order delay equation on an appropriate product space is expressed as a series of strongly continuous semigroups and orthogonal projections related with the eigenvalues of the Laplacian operator (); this representation allows us to reduce the controllability of this partial differential equation with delay to a family of ordinary delay equations. Finally, we use the well-known result on the rank condition for the approximate controllability of delay system to derive our main result.

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines

DTIC Science & Technology

1989-09-01

Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Srinivas Devadas and Kurt Keutzer F ( Abstract In this...Projects Agency under contract number N00014-87-K-0825. Author Information Devadas : Department of Electrical Engineering and Computer Science, Room 36...MA 02139; (617) 253-0292. 0 * Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines Siivas Devadas

Time-delayed reaction-diffusion fronts

NASA Astrophysics Data System (ADS)

Isern, Neus; Fort, Joaquim

2009-11-01

A time-delayed second-order approximation for the front speed in reaction-dispersion systems was obtained by Fort and Méndez [Phys. Rev. Lett. 82, 867 (1999)]. Here we show that taking proper care of the effect of the time delay on the reactive process yields a different evolution equation and, therefore, an alternate equation for the front speed. We apply the new equation to the Neolithic transition. For this application the new equation yields speeds about 10% slower than the previous one.

Interval oscillation criteria for second-order forced impulsive delay differential equations with damping term.

PubMed

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.

On the inherent competition between valid and spurious inductive inferences in Boolean data

NASA Astrophysics Data System (ADS)

Andrecut, M.

Inductive inference is the process of extracting general rules from specific observations. This problem also arises in the analysis of biological networks, such as genetic regulatory networks, where the interactions are complex and the observations are incomplete. A typical task in these problems is to extract general interaction rules as combinations of Boolean covariates, that explain a measured response variable. The inductive inference process can be considered as an incompletely specified Boolean function synthesis problem. This incompleteness of the problem will also generate spurious inferences, which are a serious threat to valid inductive inference rules. Using random Boolean data as a null model, here we attempt to measure the competition between valid and spurious inductive inference rules from a given data set. We formulate two greedy search algorithms, which synthesize a given Boolean response variable in a sparse disjunct normal form, and respectively a sparse generalized algebraic normal form of the variables from the observation data, and we evaluate numerically their performance.

Constructing Hopf bifurcation lines for the stability of nonlinear systems with two time delays

NASA Astrophysics Data System (ADS)

Nguimdo, Romain Modeste

2018-03-01

Although the plethora real-life systems modeled by nonlinear systems with two independent time delays, the algebraic expressions for determining the stability of their fixed points remain the Achilles' heel. Typically, the approach for studying the stability of delay systems consists in finding the bifurcation lines separating the stable and unstable parameter regions. This work deals with the parametric construction of algebraic expressions and their use for the determination of the stability boundaries of fixed points in nonlinear systems with two independent time delays. In particular, we concentrate on the cases for which the stability of the fixed points can be ascertained from a characteristic equation corresponding to that of scalar two-delay differential equations, one-component dual-delay feedback, or nonscalar differential equations with two delays for which the characteristic equation for the stability analysis can be reduced to that of a scalar case. Then, we apply our obtained algebraic expressions to identify either the parameter regions of stable microwaves generated by dual-delay optoelectronic oscillators or the regions of amplitude death in identical coupled oscillators.

W-transform for exponential stability of second order delay differential equations without damping terms.

PubMed

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.

Existence and Stability of Traveling Waves for Degenerate Reaction-Diffusion Equation with Time Delay

NASA Astrophysics Data System (ADS)

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.

Existence and Stability of Traveling Waves for Degenerate Reaction-Diffusion Equation with Time Delay

NASA Astrophysics Data System (ADS)

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.

Inference of combinatorial Boolean rules of synergistic gene sets from cancer microarray datasets.

PubMed

Park, Inho; Lee, Kwang H; Lee, Doheon

2010-06-15

Gene set analysis has become an important tool for the functional interpretation of high-throughput gene expression datasets. Moreover, pattern analyses based on inferred gene set activities of individual samples have shown the ability to identify more robust disease signatures than individual gene-based pattern analyses. Although a number of approaches have been proposed for gene set-based pattern analysis, the combinatorial influence of deregulated gene sets on disease phenotype classification has not been studied sufficiently. We propose a new approach for inferring combinatorial Boolean rules of gene sets for a better understanding of cancer transcriptome and cancer classification. To reduce the search space of the possible Boolean rules, we identify small groups of gene sets that synergistically contribute to the classification of samples into their corresponding phenotypic groups (such as normal and cancer). We then measure the significance of the candidate Boolean rules derived from each group of gene sets; the level of significance is based on the class entropy of the samples selected in accordance with the rules. By applying the present approach to publicly available prostate cancer datasets, we identified 72 significant Boolean rules. Finally, we discuss several identified Boolean rules, such as the rule of glutathione metabolism (down) and prostaglandin synthesis regulation (down), which are consistent with known prostate cancer biology. Scripts written in Python and R are available at http://biosoft.kaist.ac.kr/~ihpark/. The refined gene sets and the full list of the identified Boolean rules are provided in the Supplementary Material. Supplementary data are available at Bioinformatics online.

Modeling delay in genetic networks: From delay birth-death processes to delay stochastic differential equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gupta, Chinmaya; López, José Manuel; Azencott, Robert

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 chemicalmore » 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.« less

Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks

NASA Astrophysics Data System (ADS)

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 complexity values for networks in the ordered and critical phases and for highly disordered networks, peaking somewhere in the disordered phase. Individual nodes with high complexity have, on average, a larger influence on the system dynamics. Lastly, a semi-annealed approximation that preserves the correlation between states at neighboring nodes is introduced to study a social game-inspired network model in which all links are bidirectional and all nodes have a self-input. The technique developed here is shown to yield accurate predictions of distribution of players' states, and accounts for some nontrivial collective behavior of game theoretic interest.

Systematic derivation of reaction-diffusion equations with distributed delays and relations to fractional reaction-diffusion equations and hyperbolic transport equations: application to the theory of Neolithic transition.

PubMed

Vlad, Marcel Ovidiu; Ross, John

2002-12-01

We introduce a general method for the systematic derivation of nonlinear reaction-diffusion equations with distributed delays. We study the interactions among different types of moving individuals (atoms, molecules, quasiparticles, biological organisms, etc). The motion of each species is described by the continuous time random walk theory, analyzed in the literature for transport problems, whereas the interactions among the species are described by a set of transformation rates, which are nonlinear functions of the local concentrations of the different types of individuals. We use the time interval between two jumps (the transition time) as an additional state variable and obtain a set of evolution equations, which are local in time. In order to make a connection with the transport models used in the literature, we make transformations which eliminate the transition time and derive a set of nonlocal equations which are nonlinear generalizations of the so-called generalized master equations. The method leads under different specified conditions to various types of nonlocal transport equations including a nonlinear generalization of fractional diffusion equations, hyperbolic reaction-diffusion equations, and delay-differential reaction-diffusion equations. Thus in the analysis of a given problem we can fit to the data the type of reaction-diffusion equation and the corresponding physical and kinetic parameters. The method is illustrated, as a test case, by the study of the neolithic transition. We introduce a set of assumptions which makes it possible to describe the transition from hunting and gathering to agriculture economics by a differential delay reaction-diffusion equation for the population density. We derive a delay evolution equation for the rate of advance of agriculture, which illustrates an application of our analysis.

Razumikhin-Type Stability Criteria for Differential Equations with Delayed Impulses.

PubMed

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.

Computing preimages of Boolean networks.

PubMed

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.

Quasi-Newton methods for parameter estimation in functional differential equations

NASA Technical Reports Server (NTRS)

Brewer, Dennis W.

1988-01-01

A state-space approach to parameter estimation in linear functional differential equations is developed using the theory of linear evolution equations. A locally convergent quasi-Newton type algorithm is applied to distributed systems with particular emphasis on parameters that induce unbounded perturbations of the state. The algorithm is computationally implemented on several functional differential equations, including coefficient and delay estimation in linear delay-differential equations.

Modeling of delays in PKPD: classical approaches and a tutorial for delay differential equations.

PubMed

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.

Comparison principle for impulsive functional differential equations with infinite delays and applications

NASA Astrophysics Data System (ADS)

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.

A Boolean Consistent Fuzzy Inference System for Diagnosing Diseases and Its Application for Determining Peritonitis Likelihood

PubMed Central

Dragović, Ivana; Turajlić, Nina; Pilčević, Dejan; Petrović, Bratislav; Radojević, Dragan

2015-01-01

Fuzzy inference systems (FIS) enable automated assessment and reasoning in a logically consistent manner akin to the way in which humans reason. However, since no conventional fuzzy set theory is in the Boolean frame, it is proposed that Boolean consistent fuzzy logic should be used in the evaluation of rules. The main distinction of this approach is that it requires the execution of a set of structural transformations before the actual values can be introduced, which can, in certain cases, lead to different results. While a Boolean consistent FIS could be used for establishing the diagnostic criteria for any given disease, in this paper it is applied for determining the likelihood of peritonitis, as the leading complication of peritoneal dialysis (PD). Given that patients could be located far away from healthcare institutions (as peritoneal dialysis is a form of home dialysis) the proposed Boolean consistent FIS would enable patients to easily estimate the likelihood of them having peritonitis (where a high likelihood would suggest that prompt treatment is indicated), when medical experts are not close at hand. PMID:27069500

Analytical approximate solutions for a general class of nonlinear delay differential equations.

PubMed

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.

Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

PubMed

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.

Network dynamics and systems biology

NASA Astrophysics Data System (ADS)

Norrell, Johannes A.

The physics of complex systems has grown considerably as a field in recent decades, largely due to improved computational technology and increased availability of systems level data. One area in which physics is of growing relevance is molecular biology. A new field, systems biology, investigates features of biological systems as a whole, a strategy of particular importance for understanding emergent properties that result from a complex network of interactions. Due to the complicated nature of the systems under study, the physics of complex systems has a significant role to play in elucidating the collective behavior. In this dissertation, we explore three problems in the physics of complex systems, motivated in part by systems biology. The first of these concerns the applicability of Boolean models as an approximation of continuous systems. Studies of gene regulatory networks have employed both continuous and Boolean models to analyze the system dynamics, and the two have been found produce similar results in the cases analyzed. We ask whether or not Boolean models can generically reproduce the qualitative attractor dynamics of networks of continuously valued elements. Using a combination of analytical techniques and numerical simulations, we find that continuous networks exhibit two effects---an asymmetry between on and off states, and a decaying memory of events in each element's inputs---that are absent from synchronously updated Boolean models. We show that in simple loops these effects produce exactly the attractors that one would predict with an analysis of the stability of Boolean attractors, but in slightly more complicated topologies, they can destabilize solutions that are stable in the Boolean approximation, and can stabilize new attractors. Second, we investigate ensembles of large, random networks. Of particular interest is the transition between ordered and disordered dynamics, which is well characterized in Boolean systems. Networks at the transition point, called critical, exhibit many of the features of regulatory networks, and recent studies suggest that some specific regulatory networks are indeed near-critical. We ask whether certain statistical measures of the ensemble behavior of large continuous networks are reproduced by Boolean models. We find that, in spite of the lack of correspondence between attractors observed in smaller systems, the statistical characterization given by the continuous and Boolean models show close agreement, and the transition between order and disorder known in Boolean systems can occur in continuous systems as well. One effect that is not present in Boolean systems, the failure of information to propagate down chains of elements of arbitrary length, is present in a class of continuous networks. In these systems, a modified Boolean theory that takes into account the collective effect of propagation failure on chains throughout the network gives a good description of the observed behavior. We find that propagation failure pushes the system toward greater order, resulting in a partial or complete suppression of the disordered phase. Finally, we explore a dynamical process of direct biological relevance: asymmetric cell division in A. thaliana. The long term goal is to develop a model for the process that accurately accounts for both wild type and mutant behavior. To contribute to this endeavor, we use confocal microscopy to image roots in a SHORT-ROOT inducible mutant. We compute correlation functions between the locations of asymmetrically divided cells, and we construct stochastic models based on a few simple assumptions that accurately predict the non-zero correlations. Our result shows that intracellular processes alone cannot be responsible for the observed divisions, and that an intercell signaling mechanism could account for the measured correlations.

An algorithmic approach to solving polynomial equations associated with quantum circuits

NASA Astrophysics Data System (ADS)

Gerdt, V. P.; Zinin, M. V.

2009-12-01

In this paper we present two algorithms for reducing systems of multivariate polynomial equations over the finite field F 2 to the canonical triangular form called lexicographical Gröbner basis. This triangular form is the most appropriate for finding solutions of the system. On the other hand, the system of polynomials over F 2 whose variables also take values in F 2 (Boolean polynomials) completely describes the unitary matrix generated by a quantum circuit. In particular, the matrix itself can be computed by counting the number of solutions (roots) of the associated polynomial system. Thereby, efficient construction of the lexicographical Gröbner bases over F 2 associated with quantum circuits gives a method for computing their circuit matrices that is alternative to the direct numerical method based on linear algebra. We compare our implementation of both algorithms with some other software packages available for computing Gröbner bases over F 2.

On the Number of Periodic Solutions of Delay Differential Equations

NASA Astrophysics Data System (ADS)

Han, Maoan; Xu, Bing; Tian, Huanhuan; Bai, Yuzhen

In this paper, we consider the existence and number of periodic solutions for a class of delay differential equations of the form ẋ(t) = bx(t ‑ 1) + 𝜀f(x(t),x(t ‑ 1),𝜀), based on the Kaplan-Yorke method. Especially, we consider a kind of delay differential equations with f as a polynomial having parameters and find the number of periodic solutions with period 4 4k+1 or 4 4k+3.

"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis

PubMed Central

2011-01-01

Background In Thomas' formalism for modeling gene regulatory networks (GRNs), branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a) asynchrony, (b) incompletely specified behavior, and (c) interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/), a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary model checkers (e.g., NuSMV) cannot. This additional expressiveness is achieved by employing a logic extending the standard Computation-Tree Logic (CTL) with hybrid-logic operators. Conclusions We illustrate the advantages of Antelope when (a) modeling incomplete networks and environment interaction, (b) exhibiting the set of all states having a given property, and (c) representing Boolean GRN properties with hybrid CTL. PMID:22192526

The CADSS design automation system. [computerized design language for small digital systems

NASA Technical Reports Server (NTRS)

Franke, E. A.

1973-01-01

This research was designed to implement and extend a previously defined design automation system for the design of small digital structures. A description is included of the higher level language developed to describe systems as a sequence of register transfer operations. The system simulator which is used to determine if the original description is correct is also discussed. The design automation system produces tables describing the state transistions of the system and the operation of all registers. In addition all Boolean equations specifying system operation are minimized and converted to NAND gate structures. Suggestions for further extensions to the system are also given.

Global attractivity of positive periodic solution to periodic Lotka-Volterra competition systems with pure delay

NASA Astrophysics Data System (ADS)

Tang, Xianhua; Cao, Daomin; Zou, Xingfu

We consider a periodic Lotka-Volterra competition system without instantaneous negative feedbacks (i.e., pure-delay systems) x(t)=x(t)[r(t)-∑j=1na(t)x(t-τ(t))], i=1,2,…,n. We establish some 3/2-type criteria for global attractivity of a positive periodic solution of the system, which generalize the well-known Wright's 3/2 criteria for the autonomous delay logistic equation, and thereby, address the open problem proposed by both Kuang [Y. Kuang, Global stability in delayed nonautonomous Lotka-Volterra type systems without saturated equilibria, Differential Integral Equations 9 (1996) 557-567] and Teng [Z. Teng, Nonautonomous Lotka-Volterra systems with delays, J. Differential Equations 179 (2002) 538-561].

Theory and calculus of cubical complexes

NASA Technical Reports Server (NTRS)

Perlman, M.

1973-01-01

Combination switching networks with multiple outputs may be represented by Boolean functions. Report has been prepared which describes derivation and use of extraction algorithm that may be adapted to simplification of such simultaneous Boolean functions.

Dynamic Boolean Mathematics

ERIC Educational Resources Information Center

Bossé, Michael J.; Adu-Gyamfi, Kwaku; Chandler, Kayla; Lynch-Davis, Kathleen

2016-01-01

Dynamic mathematical environments allow users to reify mathematical concepts through multiple representations, transform mathematical relations and organically explore mathematical properties, investigate integrated mathematics, and develop conceptual understanding. Herein, we integrate Boolean algebra, the functionalities of a dynamic…

Total Parenteral Nutrition

MedlinePlus

... Boolean useRights, FileShare share, Int32 bufferSize, FileOptions options, SECURITY_ATTRIBUTES secAttrs, String msgPath, Boolean bFromProxy) at System.IO.FileStream..ctor(String path, FileMode mode, FileAccess ...

Stability and bifurcation analysis of a generalized scalar delay differential equation.

PubMed

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.

A genetic code Boolean structure. II. The genetic information system as a Boolean information system.

PubMed

Sanchez, Robersy; Grau, Ricardo

2005-09-01

A Boolean structure of the genetic code where Boolean deductions have biological and physicochemical meanings was discussed in a previous paper. Now, from these Boolean deductions we propose to define the value of amino acid information in order to consider the genetic information system as a communication system and to introduce the semantic content of information ignored by the conventional information theory. In this proposal, the value of amino acid information is proportional to the molecular weight of amino acids with a proportional constant of about 1.96 x 10(25) bits per kg. In addition to this, for the experimental estimations of the minimum energy dissipation in genetic logic operations, we present two postulates: (1) the energy Ei (i=1,2,...,20) of amino acids in the messages conveyed by proteins is proportional to the value of information, and (2) amino acids are distributed according to their energy Ei so the amino acid population in proteins follows a Boltzmann distribution. Specifically, in the genetic message carried by the DNA from the genomes of living organisms, we found that the minimum energy dissipation in genetic logic operations was close to kTLn(2) joules per bit.

Global dynamics of a nonlocal delayed reaction-diffusion equation on a half plane

NASA Astrophysics Data System (ADS)

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.

Numerical Bifurcation Analysis of Delayed Recycle Stream in a Continuously Stirred Tank Reactor

NASA Astrophysics Data System (ADS)

Gangadhar, Nalwala Rohitbabu; Balasubramanian, Periyasamy

2010-10-01

In this paper, we present the stability analysis of delay differential equations which arise as a result of transportation lag in the CSTR-mechanical separator recycle system. A first order irreversible elementary reaction is considered to model the system and is governed by the delay differential equations. The DDE-BIFTOOL software package is used to analyze the stability of the delay system. The present analysis reveals that the system exhibits delay independent stability for isothermal operation of the CSTR. In the absence of delay, the system is dynamically unstable for non-isothermal operation of the CSTR, and as a result of delay, the system exhibits delay dependent stability.

Improving the quantum cost of reversible Boolean functions using reorder algorithm

NASA Astrophysics Data System (ADS)

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.

Volumetric T-spline Construction Using Boolean Operations

DTIC Science & Technology

2013-07-01

SUBTITLE Volumetric T-spline Construction Using Boolean Operations 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d...Acknowledgements The work of L. Liu and Y. Zhang was supported by ONR-YIP award N00014- 10-1-0698 and an ONR Grant N00014-08-1-0653. T. J.R. Hughes was sup- 16...T-spline Construction Using Boolean Operations 17 ported by ONR Grant N00014-08-1-0992, NSF GOALI CMI-0700807/0700204, NSF CMMI-1101007 and a SINTEF

Delay chemical master equation: direct and closed-form solutions

PubMed Central

Leier, Andre; Marquez-Lago, Tatiana T.

2015-01-01

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. PMID:26345616

Delay chemical master equation: direct and closed-form solutions.

PubMed

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.

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

Cycle-time equation for the Koller K300 cable yarder operating on steep slopes in the Northeast

Treesearch

Neil K. Huyler; Chris B. LeDoux

1997-01-01

Describes a delay-free-cycle time equation for the Koller K300 skyline yarder operating on steep slopes in the Northeast. Using the equation, the average delay-free-cycle time was 5.72 minutes. This means that about 420 cubic feet of material per hour can be produced. The important variables used in the equation were slope yarding distance, lateral yarding distance,...

Acoustic logic gates and Boolean operation based on self-collimating acoustic beams

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Ting; Xu, Jian-yi; Cheng, Ying, E-mail: chengying@nju.edu.cn

2015-03-16

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 logicmore » 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.« less

Boolean networks with veto functions

NASA Astrophysics Data System (ADS)

Ebadi, Haleh; Klemm, Konstantin

2014-08-01

Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction network [Helikar et al., Proc. Natl. Acad. Sci. USA 105, 1913 (2008), 10.1073/pnas.0705088105], the functions with veto are over-represented by a factor exceeding the over-representation of threshold functions and canalyzing functions in the same system. In Boolean networks for control of the yeast cell cycle [Li et al., Proc. Natl. Acad. Sci. USA 101, 4781 (2004), 10.1073/pnas.0305937101; Davidich et al., PLoS ONE 3, e1672 (2008), 10.1371/journal.pone.0001672], no or minimal changes to the wiring diagrams are necessary to formulate their dynamics in terms of the veto functions introduced here.

Data-Driven Sampling Matrix Boolean Optimization for Energy-Efficient Biomedical Signal Acquisition by Compressive Sensing.

PubMed

Wang, Yuhao; Li, Xin; Xu, Kai; Ren, Fengbo; Yu, Hao

2017-04-01

Compressive sensing is widely used in biomedical applications, and the sampling matrix plays a critical role on both quality and power consumption of signal acquisition. It projects a high-dimensional vector of data into a low-dimensional subspace by matrix-vector multiplication. An optimal sampling matrix can ensure accurate data reconstruction and/or high compression ratio. Most existing optimization methods can only produce real-valued embedding matrices that result in large energy consumption during data acquisition. In this paper, we propose an efficient method that finds an optimal Boolean sampling matrix in order to reduce the energy consumption. Compared to random Boolean embedding, our data-driven Boolean sampling matrix can improve the image recovery quality by 9 dB. Moreover, in terms of sampling hardware complexity, it reduces the energy consumption by 4.6× and the silicon area by 1.9× over the data-driven real-valued embedding.

An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.

PubMed

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.

On-line estimation and compensation of measurement delay in GPS/SINS integration

NASA Astrophysics Data System (ADS)

Yang, Tao; Wang, Wei

2008-10-01

The chief aim of this paper is to propose a simple on-line estimation and compensation method of GPS/SINS measurement delay. The causes of time delay for GPS/SINS integration are analyzed in this paper. New Kalman filter state equations augmented by measurement delay and modified measurement equations are derived. Based on an open-loop Kalman filter, several simulations are run, results of which show that by the proposed method, the estimation and compensation error of measurement delay is below 0.1s.

Maximum principle for a stochastic delayed system involving terminal state constraints.

PubMed

Wen, Jiaqiang; Shi, Yufeng

2017-01-01

We investigate a stochastic optimal control problem where the controlled system is depicted as a stochastic differential delayed equation; however, at the terminal time, the state is constrained in a convex set. We firstly introduce an equivalent backward delayed system depicted as a time-delayed backward stochastic differential equation. Then a stochastic maximum principle is obtained by virtue of Ekeland's variational principle. Finally, applications to a state constrained stochastic delayed linear-quadratic control model and a production-consumption choice problem are studied to illustrate the main obtained result.

A transition calculus for Boolean functions. [logic circuit analysis

NASA Technical Reports Server (NTRS)

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.

A dynamic IS-LM business cycle model with two time delays in capital accumulation equation

NASA Astrophysics Data System (ADS)

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.

A necessary and sufficient condition for well-posedness of initial value problems of retarded functional differential equations

NASA Astrophysics Data System (ADS)

Nishiguchi, Junya

2017-09-01

We introduce the retarded functional differential equations (RFDEs) with general delay structure to treat various delay differential equations (DDEs) in a unified way and to clarify the delay structure in those dynamics. We are interested in the question as to which space of histories is suitable for the dynamics of each DDE, and investigate the well-posedness of the initial value problems (IVPs) of the RFDEs. A main theorem is that the IVP is well-posed for any ;admissible; history functional if and only if the semigroup determined by the trivial RFDE x ˙ = 0 is continuous. We clarify the meaning of the Hale-Kato axiom (Hale & Kato [12]) by applying this result to RFDEs with infinite delay. We also apply the result to DDEs with unbounded time- and state-dependent delays.

Dynamics of localized structures in reaction-diffusion systems induced by delayed feedback

NASA Astrophysics Data System (ADS)

Gurevich, Svetlana V.

2013-05-01

We are interested in stability properties of a single localized structure in a three-component reaction-diffusion system subjected to the time-delayed feedback. We shall show that variation in the product of the delay time and the feedback strength leads to complex dynamical behavior of the system, including formation of target patterns, spontaneous motion, and spontaneous breathing as well as various complex structures, arising from combination of different oscillatory instabilities. In the case of spontaneous motion, we provide a bifurcation analysis of the delayed system and derive an order parameter equation for the position of the localized structure, explicitly describing its temporal evolution in the vicinity of the bifurcation point. This equation is a subject to a nonlinear delay differential equation, which can be transformed to the normal form of the pitchfork drift bifurcation.

Parametric Sensitivity Analysis of Oscillatory Delay Systems with an Application to Gene Regulation.

PubMed

Ingalls, Brian; Mincheva, Maya; Roussel, Marc R

2017-07-01

A parametric sensitivity analysis for periodic solutions of delay-differential equations is developed. Because phase shifts cause the sensitivity coefficients of a periodic orbit to diverge, we focus on sensitivities of the extrema, from which amplitude sensitivities are computed, and of the period. Delay-differential equations are often used to model gene expression networks. In these models, the parametric sensitivities of a particular genotype define the local geometry of the evolutionary landscape. Thus, sensitivities can be used to investigate directions of gradual evolutionary change. An oscillatory protein synthesis model whose properties are modulated by RNA interference is used as an example. This model consists of a set of coupled delay-differential equations involving three delays. Sensitivity analyses are carried out at several operating points. Comments on the evolutionary implications of the results are offered.

Delay feedback induces a spontaneous motion of two-dimensional cavity solitons in driven semiconductor microcavities

NASA Astrophysics Data System (ADS)

Tlidi, M.; Averlant, E.; Vladimirov, A.; Panajotov, K.

2012-09-01

We consider a broad area vertical-cavity surface-emitting laser (VCSEL) operating below the lasing threshold and subject to optical injection and time-delayed feedback. We derive a generalized delayed Swift-Hohenberg equation for the VCSEL system, which is valid close to the nascent optical bistability. We first characterize the stationary-cavity solitons by constructing their snaking bifurcation diagram and by showing clustering behavior within the pinning region of parameters. Then, we show that the delayed feedback induces a spontaneous motion of two-dimensional (2D) cavity solitons in an arbitrary direction in the transverse plane. We characterize moving cavity solitons by estimating their threshold and calculating their velocity. Numerical 2D solutions of the governing semiconductor laser equations are in close agreement with those obtained from the delayed generalized Swift-Hohenberg equation.

Characterizing short-term stability for Boolean networks over any distribution of transfer functions

DOE PAGES

Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; ...

2016-07-05

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.

Inferring Boolean network states from partial information

PubMed Central

2013-01-01

Networks of molecular interactions regulate key processes in living cells. Therefore, understanding their functionality is a high priority in advancing biological knowledge. Boolean networks are often used to describe cellular networks mathematically and are fitted to experimental datasets. The fitting often results in ambiguities since the interpretation of the measurements is not straightforward and since the data contain noise. In order to facilitate a more reliable mapping between datasets and Boolean networks, we develop an algorithm that infers network trajectories from a dataset distorted by noise. We analyze our algorithm theoretically and demonstrate its accuracy using simulation and microarray expression data. PMID:24006954

Estimation of coupling between time-delay systems from time series

NASA Astrophysics Data System (ADS)

Prokhorov, M. D.; Ponomarenko, V. I.

2005-07-01

We propose a method for estimation of coupling between the systems governed by scalar time-delay differential equations of the Mackey-Glass type from the observed time series data. The method allows one to detect the presence of certain types of linear coupling between two time-delay systems, to define the type, strength, and direction of coupling, and to recover the model equations of coupled time-delay systems from chaotic time series corrupted by noise. We verify our method using both numerical and experimental data.

Mathematical modeling of gene expression: a guide for the perplexed biologist

PubMed Central

Ay, Ahmet; Arnosti, David N.

2011-01-01

The detailed analysis of transcriptional networks holds a key for understanding central biological processes, and interest in this field has exploded due to new large-scale data acquisition techniques. Mathematical modeling can provide essential insights, but the diversity of modeling approaches can be a daunting prospect to investigators new to this area. For those interested in beginning a transcriptional mathematical modeling project we provide here an overview of major types of models and their applications to transcriptional networks. In this discussion of recent literature on thermodynamic, Boolean and differential equation models we focus on considerations critical for choosing and validating a modeling approach that will be useful for quantitative understanding of biological systems. PMID:21417596

Geometry creation for MCNP by Sabrina and XSM

DOE Office of Scientific and Technical Information (OSTI.GOV)

Van Riper, K.A.

The Monte Carlo N-Particle transport code MCNP is based on a surface description of 3-dimensional geometry. Cells are defined in terms of boolean operations on signed quadratic surfaces. MCNP geometry is entered as a card image file containing coefficients of the surface equations and a list of surfaces and operators describing cells. Several programs are available to assist in creation of the geometry specification, among them Sabrina and the new ``Smart Editor`` code XSM. We briefly describe geometry creation in Sabrina and then discuss XSM in detail. XSM is under development; our discussion is based on the state of XSMmore » as of January 1, 1994.« less

Banning standard cell engineering notebook

NASA Technical Reports Server (NTRS)

1976-01-01

A family of standardized thick-oxide P-MOS building blocks (standard cells) is described. The information is presented in a form useful for systems designs, logic design, and the preparation of inputs to both sets of Design Automation programs for array design and analysis. A data sheet is provided for each cell and gives the cell name, the cell number, its logic symbol, Boolean equation, truth table, circuit schematic circuit composite, input-output capacitances, and revision date. The circuit type file, also given for each cell, together with the logic drawing contained on the data sheet provides all the information required to prepare input data files for the Design Automation Systems. A detailed description of the electrical design procedure is included.

Estimation of delays and other parameters in nonlinear functional differential equations

NASA Technical Reports Server (NTRS)

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.

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

NASA Astrophysics Data System (ADS)

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.

Mean, covariance, and effective dimension of stochastic distributed delay dynamics

NASA Astrophysics Data System (ADS)

René, Alexandre; Longtin, André

2017-11-01

Dynamical models are often required to incorporate both delays and noise. However, the inherently infinite-dimensional nature of delay equations makes formal solutions to stochastic delay differential equations (SDDEs) challenging. Here, we present an approach, similar in spirit to the analysis of functional differential equations, but based on finite-dimensional matrix operators. This results in a method for obtaining both transient and stationary solutions that is directly amenable to computation, and applicable to first order differential systems with either discrete or distributed delays. With fewer assumptions on the system's parameters than other current solution methods and no need to be near a bifurcation, we decompose the solution to a linear SDDE with arbitrary distributed delays into natural modes, in effect the eigenfunctions of the differential operator, and show that relatively few modes can suffice to approximate the probability density of solutions. Thus, we are led to conclude that noise makes these SDDEs effectively low dimensional, which opens the possibility of practical definitions of probability densities over their solution space.

Incorporating delayed neutrons into the point-model equations routinely used for neutron coincidence counting in nuclear safeguards

DOE PAGES

Croft, Stephen; Favalli, Andrea

2016-09-21

Here, we extend the familiar Bӧhnel point-model equations, which are routinely used to interpret neutron coincidence counting rates, by including the contribution of delayed neutrons. After developing the necessary equations we use them to show, by providing some numerical results, what the quantitative impact of neglecting delayed neutrons is across the full range of practical nuclear safeguards applications. The influence of delayed neutrons is predicted to be small for the types of deeply sub-critical assay problems which concern the nuclear safeguards community, smaller than uncertainties arising from other factors. This is most clearly demonstrated by considering the change in themore » effective (α,n)-to-spontaneous fission prompt-neutron ratio that the inclusion of delayed neutrons gives rise to. That the influence of delayed neutrons is small is fortunate, and our results justify the long standing practice of simply neglecting them in the analysis of field measurements.« less

Continuous variables logic via coupled automata using a DNAzyme cascade with feedback.

PubMed

Lilienthal, S; Klein, M; Orbach, R; Willner, I; Remacle, F; Levine, R D

2017-03-01

The concentration of molecules can be changed by chemical reactions and thereby offer a continuous readout. Yet computer architecture is cast in textbooks in terms of binary valued, Boolean variables. To enable reactive chemical systems to compute we show how, using the Cox interpretation of probability theory, one can transcribe the equations of chemical kinetics as a sequence of coupled logic gates operating on continuous variables. It is discussed how the distinct chemical identity of a molecule allows us to create a common language for chemical kinetics and Boolean logic. Specifically, the logic AND operation is shown to be equivalent to a bimolecular process. The logic XOR operation represents chemical processes that take place concurrently. The values of the rate constants enter the logic scheme as inputs. By designing a reaction scheme with a feedback we endow the logic gates with a built in memory because their output then depends on the input and also on the present state of the system. Technically such a logic machine is an automaton. We report an experimental realization of three such coupled automata using a DNAzyme multilayer signaling cascade. A simple model verifies analytically that our experimental scheme provides an integrator generating a power series that is third order in time. The model identifies two parameters that govern the kinetics and shows how the initial concentrations of the substrates are the coefficients in the power series.

Stability analysis for a delay differential equations model of a hydraulic turbine speed governor

NASA Astrophysics Data System (ADS)

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.

Local bifurcations in differential equations with state-dependent delay.

PubMed

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.

Development of Boolean calculus and its applications. [digital systems design

NASA Technical Reports Server (NTRS)

Tapia, M. A.

1980-01-01

The development of Boolean calculus for its application to developing digital system design methodologies that would reduce system complexity, size, cost, speed, power requirements, etc., is discussed. Synthesis procedures for logic circuits are examined particularly asynchronous circuits using clock triggered flip flops.

Advanced Feedback Methods in Information Retrieval.

ERIC Educational Resources Information Center

Salton, G.; And Others

1985-01-01

In this study, automatic feedback techniques are applied to Boolean query statements in online information retrieval to generate improved query statements based on information contained in previously retrieved documents. Feedback operations are carried out using conventional Boolean logic and extended logic. Experimental output is included to…

Compact universal logic gates realized using quantization of current in nanodevices.

PubMed

Zhang, Wancheng; Wu, Nan-Jian; Yang, Fuhua

2007-12-12

This paper proposes novel universal logic gates using the current quantization characteristics of nanodevices. In nanodevices like the electron waveguide (EW) and single-electron (SE) turnstile, the channel current is a staircase quantized function of its control voltage. We use this unique characteristic to compactly realize Boolean functions. First we present the concept of the periodic-threshold threshold logic gate (PTTG), and we build a compact PTTG using EW and SE turnstiles. We show that an arbitrary three-input Boolean function can be realized with a single PTTG, and an arbitrary four-input Boolean function can be realized by using two PTTGs. We then use one PTTG to build a universal programmable two-input logic gate which can be used to realize all two-input Boolean functions. We also build a programmable three-input logic gate by using one PTTG. Compared with linear threshold logic gates, with the PTTG one can build digital circuits more compactly. The proposed PTTGs are promising for future smart nanoscale digital system use.

Phase transition in NK-Kauffman networks and its correction for Boolean irreducibility

NASA Astrophysics Data System (ADS)

Zertuche, Federico

2014-05-01

In a series of articles published in 1986, Derrida and his colleagues studied two mean field treatments (the quenched and the annealed) for NK-Kauffman networks. Their main results lead to a phase transition curve Kc 2 pc(1-pc)=1 (0

Controllability and observability of Boolean networks arising from biology

NASA Astrophysics Data System (ADS)

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.

Uncertainty in Damage Detection, Dynamic Propagation and Just-in-Time Networks

DTIC Science & Technology

2015-08-03

estimated parameter uncertainty in dynamic data sets; high order compact finite difference schemes for Helmholtz equations with discontinuous wave numbers...delay differential equations with a Gamma distributed delay. We found that with the same population size the histogram plots for the solution to the...schemes for Helmholtz equations with discontinuous wave numbers across interfaces. • We carried out numerical sensitivity analysis with respect to

Application of the Green's function method for 2- and 3-dimensional steady transonic flows

NASA Technical Reports Server (NTRS)

Tseng, K.

1984-01-01

A Time-Domain Green's function method for the nonlinear time-dependent three-dimensional aerodynamic potential equation is presented. The Green's theorem is being used to transform the partial differential equation into an integro-differential-delay equation. Finite-element and finite-difference methods are employed for the spatial and time discretizations to approximate the integral equation by a system of differential-delay equations. Solution may be obtained by solving for this nonlinear simultaneous system of equations in time. This paper discusses the application of the method to the Transonic Small Disturbance Equation and numerical results for lifting and nonlifting airfoils and wings in steady flows are presented.

An Alternative to the Stay/Switch Equation Assessed When Using a Changeover-Delay

PubMed Central

MacDonall, James S.

2015-01-01

An alternative to the generalized matching equation for understanding concurrent performances is the stay/switch model. For the stay/switch model, the important events are the contingencies and behaviors at each alternative. The current experiment compares the descriptions by two stay/switch equations, the original, empirically derived stay/switch equation and a more theoretically derived equation based on ratios of stay to switch responses matching ratios of stay to switch reinforcers. The present experiment compared descriptions by the original stay/switch equation when using and not using a changeover delay. It also compared descriptions by the more theoretical equation with and without a changeover delay. Finally, it compared descriptions of the concurrent performances by these two equations. Rats were trained in 15 conditions on identical concurrent random-interval schedules in each component of a multiple schedule. A COD operated in only one component. There were no consistent differences in the variance accounted for by each equation of concurrent performances whether or not a COD was used. The simpler equation found greater sensitivity to stay than to switch reinforcers. It also found a COD eliminated the influence of switch reinforcers. Because estimates of parameters were more meaningful when using the more theoretical stay/switch equation it is preferred. PMID:26299548

An alternative to the stay/switch equation assessed when using a changeover-delay.

PubMed

MacDonall, James S

2015-11-01

An alternative to the generalized matching equation for understanding concurrent performances is the stay/switch model. For the stay/switch model, the important events are the contingencies and behaviors at each alternative. The current experiment compares the descriptions by two stay/switch equations, the original, empirically derived stay/switch equation and a more theoretically derived equation based on ratios of stay to switch responses matching ratios of stay to switch reinforcers. The present experiment compared descriptions by the original stay/switch equation when using and not using a changeover delay. It also compared descriptions by the more theoretical equation with and without a changeover delay. Finally, it compared descriptions of the concurrent performances by these two equations. Rats were trained in 15 conditions on identical concurrent random-interval schedules in each component of a multiple schedule. A COD operated in only one component. There were no consistent differences in the variance accounted for by each equation of concurrent performances whether or not a COD was used. The simpler equation found greater sensitivity to stay than to switch reinforcers. It also found a COD eliminated the influence of switch reinforcers. Because estimates of parameters were more meaningful when using the more theoretical stay/switch equation it is preferred. Copyright © 2015 Elsevier B.V. All rights reserved.

Perturbation propagation in random and evolved Boolean networks

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Szejka, Agnes; Drossel, Barbara

2009-03-01

In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.

Multilayer neural networks with extensively many hidden units.

PubMed

Rosen-Zvi, M; Engel, A; Kanter, I

2001-08-13

The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is performed by general symmetric Boolean functions, whereas the hidden layer is connected to the output by either discrete or continuous couplings. Introducing an overlap in the space of Boolean functions as order parameter, the storage capacity is found to scale with the logarithm of the number of implementable Boolean functions. The generalization behavior is smooth for continuous couplings and shows a discontinuous transition to perfect generalization for discrete ones.

Toxicological Tipping Points: Learning Boolean Networks from High-Content Imaging Data. (BOSC meeting)

EPA Science Inventory

The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...

Boolean linear differential operators on elementary cellular automata

NASA Astrophysics Data System (ADS)

Martín Del Rey, Ángel

2014-12-01

In this paper, the notion of boolean linear differential operator (BLDO) on elementary cellular automata (ECA) is introduced and some of their more important properties are studied. Special attention is paid to those differential operators whose coefficients are the ECA with rule numbers 90 and 150.

Introduction to focus issue: quantitative approaches to genetic networks.

PubMed

Albert, Réka; Collins, James J; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Introduction to Focus Issue: Quantitative Approaches to Genetic Networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Collins, James J.; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Optimal estimation of parameters and states in stochastic time-varying systems with time delay

NASA Astrophysics Data System (ADS)

Torkamani, Shahab; Butcher, Eric A.

2013-08-01

In this study estimation of parameters and states in stochastic linear and nonlinear delay differential systems with time-varying coefficients and constant delay is explored. The approach consists of first employing a continuous time approximation to approximate the stochastic delay differential equation with a set of stochastic ordinary differential equations. Then the problem of parameter estimation in the resulting stochastic differential system is represented as an optimal filtering problem using a state augmentation technique. By adapting the extended Kalman-Bucy filter to the resulting system, the unknown parameters of the time-delayed system are estimated from noise-corrupted, possibly incomplete measurements of the states.

Reconstruction of ensembles of coupled time-delay systems from time series.

PubMed

Sysoev, I V; Prokhorov, M D; Ponomarenko, V I; Bezruchko, B P

2014-06-01

We propose a method to recover from time series the parameters of coupled time-delay systems and the architecture of couplings between them. The method is based on a reconstruction of model delay-differential equations and estimation of statistical significance of couplings. It can be applied to networks composed of nonidentical nodes with an arbitrary number of unidirectional and bidirectional couplings. We test our method on chaotic and periodic time series produced by model equations of ensembles of diffusively coupled time-delay systems in the presence of noise, and apply it to experimental time series obtained from electronic oscillators with delayed feedback coupled by resistors.

Sensitivity analysis of dynamic biological systems with time-delays.

PubMed

Wu, Wu Hsiung; Wang, Feng Sheng; Chang, Maw Shang

2010-10-15

Mathematical modeling has been applied to the study and analysis of complex biological systems for a long time. Some processes in biological systems, such as the gene expression and feedback control in signal transduction networks, involve a time delay. These systems are represented as delay differential equation (DDE) models. Numerical sensitivity analysis of a DDE model by the direct method requires the solutions of model and sensitivity equations with time-delays. The major effort is the computation of Jacobian matrix when computing the solution of sensitivity equations. The computation of partial derivatives of complex equations either by the analytic method or by symbolic manipulation is time consuming, inconvenient, and prone to introduce human errors. To address this problem, an automatic approach to obtain the derivatives of complex functions efficiently and accurately is necessary. We have proposed an efficient algorithm with an adaptive step size control to compute the solution and dynamic sensitivities of biological systems described by ordinal differential equations (ODEs). The adaptive direct-decoupled algorithm is extended to solve the solution and dynamic sensitivities of time-delay systems describing by DDEs. To save the human effort and avoid the human errors in the computation of partial derivatives, an automatic differentiation technique is embedded in the extended algorithm to evaluate the Jacobian matrix. The extended algorithm is implemented and applied to two realistic models with time-delays: the cardiovascular control system and the TNF-α signal transduction network. The results show that the extended algorithm is a good tool for dynamic sensitivity analysis on DDE models with less user intervention. By comparing with direct-coupled methods in theory, the extended algorithm is efficient, accurate, and easy to use for end users without programming background to do dynamic sensitivity analysis on complex biological systems with time-delays.

Describing the What and Why of Students' Difficulties in Boolean Logic

ERIC Educational Resources Information Center

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…

Evolution of canalizing Boolean networks

NASA Astrophysics Data System (ADS)

Szejka, A.; Drossel, B.

2007-04-01

Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive walk, which allows us to explore the fitness landscape. Mutations change the connections and the functions of the nodes. Our fitness criterion is the robustness of the dynamical attractors against small perturbations. We find that with this fitness criterion the global maximum is always reached and that there is a huge neutral space of 100% fitness. Furthermore, in spite of having such a high degree of robustness, the evolved networks still share many features with “chaotic” networks.

Analysis of backward differentiation formula for nonlinear differential-algebraic equations with 2 delays.

PubMed

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.

Multiple-parameter bifurcation analysis in a Kuramoto model with time delay and distributed shear

NASA Astrophysics Data System (ADS)

Niu, Ben; Zhang, Jiaming; Wei, Junjie

2018-05-01

In this paper, time delay effect and distributed shear are considered in the Kuramoto model. On the Ott-Antonsen's manifold, through analyzing the associated characteristic equation of the reduced functional differential equation, the stability boundary of the incoherent state is derived in multiple-parameter space. Moreover, very rich dynamical behavior such as stability switches inducing synchronization switches can occur in this equation. With the loss of stability, Hopf bifurcating coherent states arise, and the criticality of Hopf bifurcations is determined by applying the normal form theory and the center manifold theorem. On one hand, theoretical analysis indicates that the width of shear distribution and time delay can both eliminate the synchronization then lead the Kuramoto model to incoherence. On the other, time delay can induce several coexisting coherent states. Finally, some numerical simulations are given to support the obtained results where several bifurcation diagrams are drawn, and the effect of time delay and shear is discussed.

Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

DTIC Science & Technology

2015-01-01

definitions , including monomial rotation symmetric (MRS) Boolean functions and affine equivalence, and a known result for such quadratic functions...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

User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.

ERIC Educational Resources Information Center

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…

Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.

ERIC Educational Resources Information Center

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…

A Construction of Boolean Functions with Good Cryptographic Properties

DTIC Science & Technology

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

Using computer algebra and SMT solvers in algebraic biology

NASA Astrophysics Data System (ADS)

Pineda Osorio, Mateo

2014-05-01

Biologic processes are represented as Boolean networks, in a discrete time. The dynamics within these networks are approached with the help of SMT Solvers and the use of computer algebra. Software such as Maple and Z3 was used in this case. The number of stationary states for each network was calculated. The network studied here corresponds to the immune system under the effects of drastic mood changes. Mood is considered as a Boolean variable that affects the entire dynamics of the immune system, changing the Boolean satisfiability and the number of stationary states of the immune network. Results obtained show Z3's great potential as a SMT Solver. Some of these results were verified in Maple, even though it showed not to be as suitable for the problem approach. The solving code was constructed using Z3-Python and Z3-SMT-LiB. Results obtained are important in biology systems and are expected to help in the design of immune therapies. As a future line of research, more complex Boolean network representations of the immune system as well as the whole psychological apparatus are suggested.

Therapeutic target discovery using Boolean network attractors: improvements of kali

PubMed Central

Guziolowski, Carito

2018-01-01

In a previous article, an algorithm for identifying therapeutic targets in Boolean networks modelling pathological mechanisms was introduced. In the present article, the improvements made on this algorithm, named kali, are described. These improvements are (i) the possibility to work on asynchronous Boolean networks, (ii) a finer assessment of therapeutic targets and (iii) the possibility to use multivalued logic. kali assumes that the attractors of a dynamical system, such as a Boolean network, are associated with the phenotypes of the modelled biological system. Given a logic-based model of pathological mechanisms, kali searches for therapeutic targets able to reduce the reachability of the attractors associated with pathological phenotypes, thus reducing their likeliness. kali is illustrated on an example network and used on a biological case study. The case study is a published logic-based model of bladder tumorigenesis from which kali returns consistent results. However, like any computational tool, kali can predict but cannot replace human expertise: it is a supporting tool for coping with the complexity of biological systems in the field of drug discovery. PMID:29515890

3D Boolean operations in virtual surgical planning.

PubMed

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.

Generalization and capacity of extensively large two-layered perceptrons.

PubMed

Rosen-Zvi, Michal; Engel, Andreas; Kanter, Ido

2002-09-01

The generalization ability and storage capacity of a treelike two-layered neural network with a number of hidden units scaling as the input dimension is examined. The mapping from the input to the hidden layer is via Boolean functions; the mapping from the hidden layer to the output is done by a perceptron. The analysis is within the replica framework where an order parameter characterizing the overlap between two networks in the combined space of Boolean functions and hidden-to-output couplings is introduced. The maximal capacity of such networks is found to scale linearly with the logarithm of the number of Boolean functions per hidden unit. The generalization process exhibits a first-order phase transition from poor to perfect learning for the case of discrete hidden-to-output couplings. The critical number of examples per input dimension, alpha(c), at which the transition occurs, again scales linearly with the logarithm of the number of Boolean functions. In the case of continuous hidden-to-output couplings, the generalization error decreases according to the same power law as for the perceptron, with the prefactor being different.

Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming.

PubMed

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.

Stability of equations with a distributed delay, monotone production and nonlinear mortality

NASA Astrophysics Data System (ADS)

Berezansky, Leonid; Braverman, Elena

2013-10-01

We consider population dynamics models dN/dt = f(N(tτ)) - d(N(t)) with an increasing fecundity function f and any mortality function d which can be quadratic, as in the logistic equation, or have a different form provided that the equation has at most one positive equilibrium. Here the delay in the production term can be distributed and unbounded. It is demonstrated that the positive equilibrium is globally attractive if it exists, otherwise all positive solutions tend to zero. Moreover, we demonstrate that solutions of the equation are intrinsically non-oscillatory: once the initial function is less/greater than the equilibrium K > 0, so is the solution for any positive time value. The assumptions on f, d and the delay are rather nonrestrictive, and several examples demonstrate that none of them can be omitted.

Identification of Boolean Network Models From Time Series Data Incorporating Prior Knowledge.

PubMed

Leifeld, Thomas; Zhang, Zhihua; Zhang, Ping

2018-01-01

Motivation: Mathematical models take an important place in science and engineering. A model can help scientists to explain dynamic behavior of a system and to understand the functionality of system components. Since length of a time series and number of replicates is limited by the cost of experiments, Boolean networks as a structurally simple and parameter-free logical model for gene regulatory networks have attracted interests of many scientists. In order to fit into the biological contexts and to lower the data requirements, biological prior knowledge is taken into consideration during the inference procedure. In the literature, the existing identification approaches can only deal with a subset of possible types of prior knowledge. Results: We propose a new approach to identify Boolean networks from time series data incorporating prior knowledge, such as partial network structure, canalizing property, positive and negative unateness. Using vector form of Boolean variables and applying a generalized matrix multiplication called the semi-tensor product (STP), each Boolean function can be equivalently converted into a matrix expression. Based on this, the identification problem is reformulated as an integer linear programming problem to reveal the system matrix of Boolean model in a computationally efficient way, whose dynamics are consistent with the important dynamics captured in the data. By using prior knowledge the number of candidate functions can be reduced during the inference. Hence, identification incorporating prior knowledge is especially suitable for the case of small size time series data and data without sufficient stimuli. The proposed approach is illustrated with the help of a biological model of the network of oxidative stress response. Conclusions: The combination of efficient reformulation of the identification problem with the possibility to incorporate various types of prior knowledge enables the application of computational model inference to systems with limited amount of time series data. The general applicability of this methodological approach makes it suitable for a variety of biological systems and of general interest for biological and medical research.

Unimodal dynamical systems: Comparison principles, spreading speeds and travelling waves

NASA Astrophysics Data System (ADS)

Yi, Taishan; Chen, Yuming; Wu, Jianhong

Reaction diffusion equations with delayed nonlinear reaction terms are used as prototypes to motivate an appropriate abstract formulation of dynamical systems with unimodal nonlinearity. For such non-monotone dynamical systems, we develop a general comparison principle and show how this general comparison principle, coupled with some existing results for monotone dynamical systems, can be used to establish results on the asymptotic speeds of spread and travelling waves. We illustrate our main results by an integral equation which includes a nonlocal delayed reaction diffusion equation and a nonlocal delayed lattice differential system in an unbounded domain, with the non-monotone nonlinearities including the Ricker birth function and the Mackey-Glass hematopoiesis feedback.

Hybrid control of the Neimark-Sacker bifurcation in a delayed Nicholson's blowflies equation.

PubMed

Wang, Yuanyuan; Wang, Lisha

In this article, for delayed Nicholson's blowflies equation, we propose a hybrid control nonstandard finite-difference (NSFD) scheme in which state feedback and parameter perturbation are used to control the Neimark-Sacker bifurcation. Firstly, the local stability of the positive equilibria for hybrid control delay differential equation is discussed according to Hopf bifurcation theory. Then, for any step-size, a hybrid control numerical algorithm is introduced to generate the Neimark-Sacker bifurcation at a desired point. Finally, numerical simulation results confirm that the control strategy is efficient in controlling the Neimark-Sacker bifurcation. At the same time, the results show that the NSFD control scheme is better than the Euler control method.

Local and global Hopf bifurcation analysis in a neutral-type neuron system with two delays

NASA Astrophysics Data System (ADS)

Lv, Qiuyu; Liao, Xiaofeng

2018-03-01

In recent years, neutral-type differential-difference equations have been applied extensively in the field of engineering, and their dynamical behaviors are more complex than that of the delay differential-difference equations. In this paper, the equations used to describe a neutral-type neural network system of differential difference equation with two delays are studied (i.e. neutral-type differential equations). Firstly, by selecting τ1, τ2 respectively as a parameter, we provide an analysis about the local stability of the zero equilibrium point of the equations, and sufficient conditions of asymptotic stability for the system are derived. Secondly, by using the theory of normal form and applying the theorem of center manifold introduced by Hassard et al., the Hopf bifurcation is found and some formulas for deciding the stability of periodic solutions and the direction of Hopf bifurcation are given. Moreover, by applying the theorem of global Hopf bifurcation, the existence of global periodic solution of the system is studied. Finally, an example is given, and some computer numerical simulations are taken to demonstrate and certify the correctness of the presented results.

Factorization and the synthesis of optimal feedback kernels for differential-delay systems

NASA Technical Reports Server (NTRS)

Milman, Mark M.; Scheid, Robert E.

1987-01-01

A combination of ideas from the theories of operator Riccati equations and Volterra factorizations leads to the derivation of a novel, relatively simple set of hyperbolic equations which characterize the optimal feedback kernel for the finite-time regulator problem for autonomous differential-delay systems. Analysis of these equations elucidates the underlying structure of the feedback kernel and leads to the development of fast and accurate numerical methods for its computation. Unlike traditional formulations based on the operator Riccati equation, the gain is characterized by means of classical solutions of the derived set of equations. This leads to the development of approximation schemes which are analogous to what has been accomplished for systems of ordinary differential equations with given initial conditions.

Stability Criteria for Differential Equations with Variable Time Delays

ERIC Educational Resources Information Center

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…

Bifurcation to large period oscillations in physical systems controlled by delay

NASA Astrophysics Data System (ADS)

Erneux, Thomas; Walther, Hans-Otto

2005-12-01

An unusual bifurcation to time-periodic oscillations of a class of delay differential equations is investigated. As we approach the bifurcation point, both the amplitude and the frequency of the oscillations go to zero. The class of delay differential equations is a nonlinear extension of a nonevasive control method and is motivated by a recent study of the foreign exchange rate oscillations. By using asymptotic methods, we determine the bifurcation scaling laws for the amplitude and the period of the oscillations.

Interpolation of the Extended Boolean Retrieval Model.

ERIC Educational Resources Information Center

Zanger, Daniel Z.

2002-01-01

Presents an interpolation theorem for an extended Boolean information retrieval model. Results show that whenever two or more documents are similarly ranked at any two points for a query containing exactly two terms, then they are similarly ranked at all points in between; and that results can fail for queries with more than two terms. (Author/LRW)

The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students

ERIC Educational Resources Information Center

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…

Energy and criticality in random Boolean networks

NASA Astrophysics Data System (ADS)

Andrecut, M.; Kauffman, S. A.

2008-06-01

The central issue of the research on the Random Boolean Networks (RBNs) model is the characterization of the critical transition between ordered and chaotic phases. Here, we discuss an approach based on the ‘energy’ associated with the unsatisfiability of the Boolean functions in the RBNs model, which provides an upper bound estimation for the energy used in computation. We show that in the ordered phase the RBNs are in a ‘dissipative’ regime, performing mostly ‘downhill’ moves on the ‘energy’ landscape. Also, we show that in the disordered phase the RBNs have to ‘hillclimb’ on the ‘energy’ landscape in order to perform computation. The analytical results, obtained using Derrida's approximation method, are in complete agreement with numerical simulations.

Optical programmable Boolean logic unit.

PubMed

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 Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

PubMed

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.

Periodic and chaotic oscillations in a tumor and immune system interaction model with three delays

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bi, Ping; Center for Partial Differential Equations, East China Normal University, 500 Dongchuan Rd., Shanghai 200241; Ruan, Shigui, E-mail: ruan@math.miami.edu

2014-06-15

In this paper, a tumor and immune system interaction model consisted of two differential equations with three time delays is considered in which the delays describe the proliferation of tumor cells, the process of effector cells growth stimulated by tumor cells, and the differentiation of immune effector cells, respectively. Conditions for the asymptotic stability of equilibria and existence of Hopf bifurcations are obtained by analyzing the roots of a second degree exponential polynomial characteristic equation with delay dependent coefficients. It is shown that the positive equilibrium is asymptotically stable if all three delays are less than their corresponding critical valuesmore » and Hopf bifurcations occur if any one of these delays passes through its critical value. Numerical simulations are carried out to illustrate the rich dynamical behavior of the model with different delay values including the existence of regular and irregular long periodic oscillations.« less

Improvements in metabolic flux analysis using carbon bond labeling experiments: bondomer balancing and Boolean function mapping.

PubMed

Sriram, Ganesh; Shanks, Jacqueline V

2004-04-01

The biosynthetically directed fractional (13)C labeling method for metabolic flux evaluation relies on performing a 2-D [(13)C, (1)H] NMR experiment on extracts from organisms cultured on a uniformly labeled carbon substrate. This article focuses on improvements in the interpretation of data obtained from such an experiment by employing the concept of bondomers. Bondomers take into account the natural abundance of (13)C; therefore many bondomers in a real network are zero, and can be precluded a priori--thus resulting in fewer balances. Using this method, we obtained a set of linear equations which can be solved to obtain analytical formulas for NMR-measurable quantities in terms of fluxes in glycolysis and the pentose phosphate pathways. For a specific case of this network with four degrees of freedom, a priori identifiability of the fluxes was shown possible for any set of fluxes. For a more general case with five degrees of freedom, the fluxes were shown identifiable for a representative set of fluxes. Minimal sets of measurements which best identify the fluxes are listed. Furthermore, we have delineated Boolean function mapping, a new method to iteratively simulate bondomer abundances or efficiently convert carbon skeleton rearrangement information to mapping matrices. The efficiency of this method is expected to be valuable while analyzing metabolic networks which are not completely known (such as in plant metabolism) or while implementing iterative bondomer balancing methods.

The value of prior knowledge in machine learning of complex network systems.

PubMed

Ferranti, Dana; Krane, David; Craft, David

2017-11-15

Our overall goal is to develop machine-learning approaches based on genomics and other relevant accessible information for use in predicting how a patient will respond to a given proposed drug or treatment. Given the complexity of this problem, we begin by developing, testing and analyzing learning methods using data from simulated systems, which allows us access to a known ground truth. We examine the benefits of using prior system knowledge and investigate how learning accuracy depends on various system parameters as well as the amount of training data available. The simulations are based on Boolean networks-directed graphs with 0/1 node states and logical node update rules-which are the simplest computational systems that can mimic the dynamic behavior of cellular systems. Boolean networks can be generated and simulated at scale, have complex yet cyclical dynamics and as such provide a useful framework for developing machine-learning algorithms for modular and hierarchical networks such as biological systems in general and cancer in particular. We demonstrate that utilizing prior knowledge (in the form of network connectivity information), without detailed state equations, greatly increases the power of machine-learning algorithms to predict network steady-state node values ('phenotypes') and perturbation responses ('drug effects'). Links to codes and datasets here: https://gray.mgh.harvard.edu/people-directory/71-david-craft-phd. dcraft@broadinstitute.org. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Delay differential equations via the matrix Lambert W function and bifurcation analysis: application to machine tool chatter.

PubMed

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.

Linear stability and nonlinear analyses of traffic waves for the general nonlinear car-following model with multi-time delays

NASA Astrophysics Data System (ADS)

Sun, Dihua; Chen, Dong; Zhao, Min; Liu, Weining; Zheng, Linjiang

2018-07-01

In this paper, the general nonlinear car-following model with multi-time delays is investigated in order to describe the reactions of vehicle to driving behavior. Platoon stability and string stability criteria are obtained for the general nonlinear car-following model. Burgers equation and Korteweg de Vries (KdV) equation and their solitary wave solutions are derived adopting the reductive perturbation method. We investigate the properties of typical optimal velocity model using both analytic and numerical methods, which estimates the impact of delays about the evolution of traffic congestion. The numerical results show that time delays in sensing relative movement is more sensitive to the stability of traffic flow than time delays in sensing host motion.

Model Predictive Optimal Control of a Time-Delay Distributed-Parameter Systems

NASA Technical Reports Server (NTRS)

Nguyen, Nhan

2006-01-01

This paper presents an optimal control method for a class of distributed-parameter systems governed by first order, quasilinear hyperbolic partial differential equations that arise in many physical systems. Such systems are characterized by time delays since information is transported from one state to another by wave propagation. A general closed-loop hyperbolic transport model is controlled by a boundary control embedded in a periodic boundary condition. The boundary control is subject to a nonlinear differential equation constraint that models actuator dynamics of the system. The hyperbolic equation is thus coupled with the ordinary differential equation via the boundary condition. Optimality of this coupled system is investigated using variational principles to seek an adjoint formulation of the optimal control problem. The results are then applied to implement a model predictive control design for a wind tunnel to eliminate a transport delay effect that causes a poor Mach number regulation.

The Algorithm Theoretical Basis Document for the Atmospheric Delay Correction to GLAS Laser Altimeter Ranges. Volume 8

NASA Technical Reports Server (NTRS)

Herring, Thomas A.; Quinn, Katherine J.

2012-01-01

NASA s Ice, Cloud, and Land Elevation Satellite (ICESat) mission will be launched late 2001. It s primary instrument is the Geoscience Laser Altimeter System (GLAS) instrument. The main purpose of this instrument is to measure elevation changes of the Greenland and Antarctic icesheets. To accurately measure the ranges it is necessary to correct for the atmospheric delay of the laser pulses. The atmospheric delay depends on the integral of the refractive index along the path that the laser pulse travels through the atmosphere. The refractive index of air at optical wavelengths is a function of density and molecular composition. For ray paths near zenith and closed form equations for the refractivity, the atmospheric delay can be shown to be directly related to surface pressure and total column precipitable water vapor. For ray paths off zenith a mapping function relates the delay to the zenith delay. The closed form equations for refractivity recommended by the International Union of Geodesy and Geophysics (IUGG) are optimized for ground based geodesy techniques and in the next section we will consider whether these equations are suitable for satellite laser altimetry.

Delay-induced wave instabilities in single-species reaction-diffusion systems

NASA Astrophysics Data System (ADS)

Otto, Andereas; Wang, Jian; Radons, Günter

2017-11-01

The Turing (wave) instability is only possible in reaction-diffusion systems with more than one (two) components. Motivated by the fact that a time delay increases the dimension of a system, we investigate the presence of diffusion-driven instabilities in single-species reaction-diffusion systems with delay. The stability of arbitrary one-component systems with a single discrete delay, with distributed delay, or with a variable delay is systematically analyzed. We show that a wave instability can appear from an equilibrium of single-species reaction-diffusion systems with fluctuating or distributed delay, which is not possible in similar systems with constant discrete delay or without delay. More precisely, we show by basic analytic arguments and by numerical simulations that fast asymmetric delay fluctuations or asymmetrically distributed delays can lead to wave instabilities in these systems. Examples, for the resulting traveling waves are shown for a Fisher-KPP equation with distributed delay in the reaction term. In addition, we have studied diffusion-induced instabilities from homogeneous periodic orbits in the same systems with variable delay, where the homogeneous periodic orbits are attracting resonant periodic solutions of the system without diffusion, i.e., periodic orbits of the Hutchinson equation with time-varying delay. If diffusion is introduced, standing waves can emerge whose temporal period is equal to the period of the variable delay.

About Global Stable of Solutions of Logistic Equation with Delay

NASA Astrophysics Data System (ADS)

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.

Stability and square integrability of derivatives of solutions of nonlinear fourth order differential equations with delay.

PubMed

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.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Equilibrium and nonequilibrium properties of Boolean decision problems on scale-free graphs with competing interactions with external biases

NASA Astrophysics Data System (ADS)

Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.

2013-03-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.

Implementing neural nets with programmable logic

NASA Technical Reports Server (NTRS)

Vidal, Jacques J.

1988-01-01

Networks of Boolean programmable logic modules are presented as one purely digital class of artificial neural nets. The approach contrasts with the continuous analog framework usually suggested. Programmable logic networks are capable of handling many neural-net applications. They avoid some of the limitations of threshold logic networks and present distinct opportunities. The network nodes are called dynamically programmable logic modules. They can be implemented with digitally controlled demultiplexers. Each node performs a Boolean function of its inputs which can be dynamically assigned. The overall network is therefore a combinational circuit and its outputs are Boolean global functions of the network's input variables. The approach offers definite advantages for VLSI implementation, namely, a regular architecture with limited connectivity, simplicity of the control machinery, natural modularity, and the support of a mature technology.

Stabilizing Motifs in Autonomous Boolean Networks and the Yeast Cell Cycle Oscillator

NASA Astrophysics Data System (ADS)

Sevim, Volkan; Gong, Xinwei; Socolar, Joshua

2009-03-01

Synchronously updated Boolean networks are widely used to model gene regulation. Some properties of these model networks are known to be artifacts of the clocking in the update scheme. Autonomous updating is a less artificial scheme that allows one to introduce small timing perturbations and study stability of the attractors. We argue that the stabilization of a limit cycle in an autonomous Boolean network requires a combination of motifs such as feed-forward loops and auto-repressive links that can correct small fluctuations in the timing of switching events. A recently published model of the transcriptional cell-cycle oscillator in yeast contains the motifs necessary for stability under autonomous updating [1]. [1] D. A. Orlando, et al. Nature (London), 4530 (7197):0 944--947, 2008.

New stability conditions for mixed linear Levin-Nohel integro-differential equations

NASA Astrophysics Data System (ADS)

Dung, Nguyen Tien

2013-08-01

For the mixed Levin-Nohel integro-differential equation, we obtain new necessary and sufficient conditions of asymptotic stability. These results improve those obtained by Becker and Burton ["Stability, fixed points and inverse of delays," Proc. - R. Soc. Edinburgh, Sect. A 136, 245-275 (2006)], 10.1017/S0308210500004546 and Jin and Luo ["Stability of an integro-differential equation," Comput. Math. Appl. 57(7), 1080-1088 (2009)], 10.1016/j.camwa.2009.01.006 when b(t) = 0 and supplement the 3/2-stability theorem when a(t, s) = 0. In addition, the case of the equations with several delays is discussed as well.

A general-purpose approach to computer-aided dynamic analysis of a flexible helicopter

NASA Technical Reports Server (NTRS)

Agrawal, Om P.

1988-01-01

A general purpose mathematical formulation is described for dynamic analysis of a helicopter consisting of flexible and/or rigid bodies that undergo large translations and rotations. Rigid body and elastic sets of generalized coordinates are used. The rigid body coordinates define the location and the orientation of a body coordinate frame (global frame) with respect to an inertial frame. The elastic coordinates are introduced using a finite element approach in order to model flexible components. The compatibility conditions between two adjacent elements in a flexible body are imposed using a Boolean matrix, whereas the compatibility conditions between two adjacent bodies are imposed using the Lagrange multiplier approach. Since the form of the constraint equations depends upon the type of kinematic joint and involves only the generalized coordinates of the two participating elements, then a library of constraint elements can be developed to impose the kinematic constraint in an automated fashion. For the body constraints, the Lagrange multipliers yield the reaction forces and torques of the bodies at the joints. The virtual work approach is used to derive the equations of motion, which are a system of differential and algebraic equations that are highly nonlinear. The formulation presented is general and is compared with hard-wired formulations commonly used in helicopter analysis.

Modeling formalisms in Systems Biology

PubMed Central

2011-01-01

Systems Biology has taken advantage of computational tools and high-throughput experimental data to model several biological processes. These include signaling, gene regulatory, and metabolic networks. However, most of these models are specific to each kind of network. Their interconnection demands a whole-cell modeling framework for a complete understanding of cellular systems. We describe the features required by an integrated framework for modeling, analyzing and simulating biological processes, and review several modeling formalisms that have been used in Systems Biology including Boolean networks, Bayesian networks, Petri nets, process algebras, constraint-based models, differential equations, rule-based models, interacting state machines, cellular automata, and agent-based models. We compare the features provided by different formalisms, and discuss recent approaches in the integration of these formalisms, as well as possible directions for the future. PMID:22141422

Graph theory approach to the eigenvalue problem of large space structures

NASA Technical Reports Server (NTRS)

Reddy, A. S. S. R.; Bainum, P. M.

1981-01-01

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Effects of two-photon absorption on all optical logic operation based on quantum-dot semiconductor optical amplifiers

NASA Astrophysics Data System (ADS)

Zhang, Xiang; Dutta, Niloy K.

2018-01-01

We investigate all-optical logic operation in quantum-dot semiconductor optical amplifier (QD-SOA) based Mach-Zehnder interferometer considering the effects of two-photon absorption (TPA). TPA occurs during the propagation of sub-picosecond pulses in QD-SOA, which leads to a change in carrier recovery dynamics in quantum-dots. We utilize a rate equation model to take into account carrier refill through TPA and nonlinear dynamics including carrier heating and spectral hole burning in the QD-SOA. The simulation results show the TPA-induced pumping in the QD-SOA can reduce the pattern effect and increase the output quality of the all-optical logic operation. With TPA, this scheme is suitable for high-speed Boolean logic operation at 320 Gb/s.

Towards Symbolic Model Checking for Multi-Agent Systems via OBDDs

NASA Technical Reports Server (NTRS)

Raimondi, Franco; Lomunscio, Alessio

2004-01-01

We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on OBDD's, as they offer a compact and efficient representation for boolean formulae.

Feedback Controller Design for the Synchronization of Boolean Control Networks.

PubMed

Liu, Yang; Sun, Liangjie; Lu, Jianquan; Liang, Jinling

2016-09-01

This brief investigates the partial and complete synchronization of two Boolean control networks (BCNs). Necessary and sufficient conditions for partial and complete synchronization are established by the algebraic representations of logical dynamics. An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs. Two biological examples are provided to illustrate the effectiveness of the obtained results.

Computer Aided Instruction for a Course in Boolean Algebra and Logic Design. Final Report (Revised).

ERIC Educational Resources Information Center

Roy, Rob

The use of computers to prepare deficient college and graduate students for courses that build upon previously acquired information would solve the growing problem of professors who must spend up to one third of their class time in review of material. But examination of students who were taught Boolean Algebra and Logic Design by means of Computer…

On exponential stability of linear Levin-Nohel integro-differential equations

NASA Astrophysics Data System (ADS)

Tien Dung, Nguyen

2015-02-01

The aim of this paper is to investigate the exponential stability for linear Levin-Nohel integro-differential equations with time-varying delays. To the best of our knowledge, the exponential stability for such equations has not yet been discussed. In addition, since we do not require that the kernel and delay are continuous, our results improve those obtained in Becker and Burton [Proc. R. Soc. Edinburgh, Sect. A: Math. 136, 245-275 (2006)]; Dung [J. Math. Phys. 54, 082705 (2013)]; and Jin and Luo [Comput. Math. Appl. 57(7), 1080-1088 (2009)].

Deriving Laws from Ordering Relations

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.

2003-01-01

It took much effort in the early days of non-Euclidean geometry to break away from the mindset that all spaces are flat and that two distinct parallel lines do not cross. Up to that point, all that was known was Euclidean geometry, and it was difficult to imagine anything else. We have suffered a similar handicap brought on by the enormous relevance of Boolean algebra to the problems of our age-logic and set theory. Previously, I demonstrated that the algebra of questions is not Boolean, but rather is described by the free distributive algebra. To get to this stage took much effort, as many obstacles-most self-placed-had to be overcome. As Boolean algebras were all I had ever known, it was almost impossible for me to imagine working with an algebra where elements do not have complements. With this realization, it became very clear that the sum and product rules of probability theory at the most basic level had absolutely nothing to do with the Boolean algebra of logical statements. Instead, a measure of degree of inclusion can be invented for many different partially ordered sets, and the sum and product rules fall out of the associativity and distributivity of the algebra. To reinforce this very important idea, this paper will go over how these constructions are made, while focusing on the underlying assumptions. I will derive the sum and product rules for a distributive lattice in general and demonstrate how this leads to probability theory on the Boolean lattice and is related to the calculus of quantum mechanical amplitudes on the partially ordered set of experimental setups. I will also discuss the rules that can be derived from modular lattices and their relevance to the cross-ratio of projective geometry.

On Emulation of Flueric Devices in Excitable Chemical Medium

PubMed Central

Adamatzky, Andrew

2016-01-01

Flueric devices are fluidic devices without moving parts. Fluidic devices use fluid as a medium for information transfer and computation. A Belousov-Zhabotinsky (BZ) medium is a thin-layer spatially extended excitable chemical medium which exhibits travelling excitation wave-fronts. The excitation wave-fronts transfer information. Flueric devices compute via jets interaction. BZ devices compute via excitation wave-fronts interaction. In numerical model of BZ medium we show that functions of key flueric devices are implemented in the excitable chemical system: signal generator, and, xor, not and nor Boolean gates, delay elements, diodes and sensors. Flueric devices have been widely used in industry since late 1960s and are still employed in automotive and aircraft technologies. Implementation of analog of the flueric devices in the excitable chemical systems opens doors to further applications of excitation wave-based unconventional computing in soft robotics, embedded organic electronics and living technologies. PMID:27997561

On Emulation of Flueric Devices in Excitable Chemical Medium.

PubMed

Adamatzky, Andrew

2016-01-01

Flueric devices are fluidic devices without moving parts. Fluidic devices use fluid as a medium for information transfer and computation. A Belousov-Zhabotinsky (BZ) medium is a thin-layer spatially extended excitable chemical medium which exhibits travelling excitation wave-fronts. The excitation wave-fronts transfer information. Flueric devices compute via jets interaction. BZ devices compute via excitation wave-fronts interaction. In numerical model of BZ medium we show that functions of key flueric devices are implemented in the excitable chemical system: signal generator, and, xor, not and nor Boolean gates, delay elements, diodes and sensors. Flueric devices have been widely used in industry since late 1960s and are still employed in automotive and aircraft technologies. Implementation of analog of the flueric devices in the excitable chemical systems opens doors to further applications of excitation wave-based unconventional computing in soft robotics, embedded organic electronics and living technologies.

Data Auditor: Analyzing Data Quality Using Pattern Tableaux

NASA Astrophysics Data System (ADS)

Srivastava, Divesh

Monitoring databases maintain configuration and measurement tables about computer systems, such as networks and computing clusters, and serve important business functions, such as troubleshooting customer problems, analyzing equipment failures, planning system upgrades, etc. These databases are prone to many data quality issues: configuration tables may be incorrect due to data entry errors, while measurement tables may be affected by incorrect, missing, duplicate and delayed polls. We describe Data Auditor, a tool for analyzing data quality and exploring data semantics of monitoring databases. Given a user-supplied constraint, such as a boolean predicate expected to be satisfied by every tuple, a functional dependency, or an inclusion dependency, Data Auditor computes "pattern tableaux", which are concise summaries of subsets of the data that satisfy or fail the constraint. We discuss the architecture of Data Auditor, including the supported types of constraints and the tableau generation mechanism. We also show the utility of our approach on an operational network monitoring database.

The computational core and fixed point organization in Boolean networks

NASA Astrophysics Data System (ADS)

Correale, L.; Leone, M.; Pagnani, A.; Weigt, M.; Zecchina, R.

2006-03-01

In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows us to prune simple logical cascades and underdetermined variables, returning thereby the computational core of the network. Second, we apply the cavity method to analyse the number and organization of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter being characterized by the existence of an exponential number of macroscopically separated fixed point clusters. The different techniques developed are reinterpreted as algorithms for the analysis of single Boolean networks, and they are applied in the analysis of and in silico experiments on the gene regulatory networks of baker's yeast (Saccharomyces cerevisiae) and the segment-polarity genes of the fruitfly Drosophila melanogaster.

Observability of Boolean multiplex control networks

NASA Astrophysics Data System (ADS)

Wu, Yuhu; Xu, Jingxue; Sun, Xi-Ming; Wang, Wei

2017-04-01

Boolean multiplex (multilevel) networks (BMNs) are currently receiving considerable attention as theoretical arguments for modeling of biological systems and system level analysis. Studying control-related problems in BMNs may not only provide new views into the intrinsic control in complex biological systems, but also enable us to develop a method for manipulating biological systems using exogenous inputs. In this article, the observability of the Boolean multiplex control networks (BMCNs) are studied. First, the dynamical model and structure of BMCNs with control inputs and outputs are constructed. By using of Semi-Tensor Product (STP) approach, the logical dynamics of BMCNs is converted into an equivalent algebraic representation. Then, the observability of the BMCNs with two different kinds of control inputs is investigated by giving necessary and sufficient conditions. Finally, examples are given to illustrate the efficiency of the obtained theoretical results.

Boolean network representation of contagion dynamics during a financial crisis

NASA Astrophysics Data System (ADS)

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.

Stability Switches, Hopf Bifurcations, and Spatio-temporal Patterns in a Delayed Neural Model with Bidirectional Coupling

NASA Astrophysics Data System (ADS)

Song, Yongli; Zhang, Tonghua; Tadé, Moses O.

2009-12-01

The dynamical behavior of a delayed neural network with bi-directional coupling is investigated by taking the delay as the bifurcating parameter. Some parameter regions are given for conditional/absolute stability and Hopf bifurcations by using the theory of functional differential equations. As the propagation time delay in the coupling varies, stability switches for the trivial solution are found. Conditions ensuring the stability and direction of the Hopf bifurcation are determined by applying the normal form theory and the center manifold theorem. We also discuss the spatio-temporal patterns of bifurcating periodic oscillations by using the symmetric bifurcation theory of delay differential equations combined with representation theory of Lie groups. In particular, we obtain that the spatio-temporal patterns of bifurcating periodic oscillations will alternate according to the change of the propagation time delay in the coupling, i.e., different ranges of delays correspond to different patterns of neural activities. Numerical simulations are given to illustrate the obtained results and show the existence of bursts in some interval of the time for large enough delay.

Global cluster synchronization in nonlinearly coupled community networks with heterogeneous coupling delays.

PubMed

Tseng, Jui-Pin

2017-02-01

This investigation establishes the global cluster synchronization of complex networks with a community structure based on an iterative approach. The units comprising the network are described by differential equations, and can be non-autonomous and involve time delays. In addition, units in the different communities can be governed by different equations. The coupling configuration of the network is rather general. The coupling terms can be non-diffusive, nonlinear, asymmetric, and with heterogeneous coupling delays. Based on this approach, both delay-dependent and delay-independent criteria for global cluster synchronization are derived. We implement the present approach for a nonlinearly coupled neural network with heterogeneous coupling delays. Two numerical examples are given to show that neural networks can behave in a variety of new collective ways under the synchronization criteria. These examples also demonstrate that neural networks remain synchronized in spite of coupling delays between neurons across different communities; however, they may lose synchrony if the coupling delays between the neurons within the same community are too large, such that the synchronization criteria are violated. Copyright © 2016 Elsevier Ltd. All rights reserved.

Global dynamics of a delay differential equation with spatial non-locality in an unbounded domain

NASA Astrophysics Data System (ADS)

Yi, Taishan; Zou, Xingfu

In this paper, we study the global dynamics of a class of differential equations with temporal delay and spatial non-locality in an unbounded domain. Adopting the compact open topology, we describe the delicate asymptotic properties of the nonlocal delayed effect and establish some a priori estimate for nontrivial solutions which enables us to show the permanence of the equation. Combining these results with a dynamical systems approach, we determine the global dynamics of the equation under appropriate conditions. Applying the main results to the model with Ricker's birth function and Mackey-Glass's hematopoiesis function, we obtain threshold results for the global dynamics of these two models. We explain why our results on the global attractivity of the positive equilibrium in C∖{0} under the compact open topology becomes invalid in C∖{0} with respect to the usual supremum norm, and we identify a subset of C∖{0} in which the positive equilibrium remains attractive with respect to the supremum norm.

Stabilizing skateboard speed-wobble with reflex delay.

PubMed

Varszegi, Balazs; Takacs, Denes; Stepan, Gabor; Hogan, S John

2016-08-01

A simple mechanical model of the skateboard-skater system is analysed, in which the effect of human control is considered by means of a linear proportional-derivative (PD) controller with delay. The equations of motion of this non-holonomic system are neutral delay-differential equations. A linear stability analysis of the rectilinear motion is carried out analytically. It is shown how to vary the control gains with respect to the speed of the skateboard to stabilize the uniform motion. The critical reflex delay of the skater is determined as the function of the speed. Based on this analysis, we present an explanation for the linear instability of the skateboard-skater system at high speed. Moreover, the advantages of standing ahead of the centre of the board are demonstrated from the viewpoint of reflex delay and control gain sensitivity. © 2016 The Author(s).

A hybrid approach to parameter identification of linear delay differential equations involving multiple delays

NASA Astrophysics Data System (ADS)

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.

Modeling stochasticity and robustness in gene regulatory networks.

PubMed

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

Discrete interference modeling via boolean algebra.

PubMed

Beckhoff, Gerhard

2011-01-01

Two types of boolean functions are considered, the locus function of n variables, and the interval function of ν = n - 1 variables. A 1-1 mapping is given that takes elements (cells) of the interval function to antidual pairs of elements in the locus function, and vice versa. A set of ν binary codewords representing the intervals are defined and used to generate the codewords of all genomic regions. Next a diallelic three-point system is reviewed in the light of boolean functions, which leads to redefining complete interference by a logic function. Together with the upper bound of noninterference already defined by a boolean function, it confines the region of interference. Extensions of these two functions to any finite number of ν are straightforward, but have been also made in terms of variables taken from the inclusion-exclusion principle (expressing "at least" and "exactly equal to" a decimal integer). Two coefficients of coincidence for systems with more than three loci are defined and discussed, one using the average of several individual coefficients and the other taking as coefficient a real number between zero and one. Finally, by way of a malfunction of the mod-2 addition, it is shown that a four-point system may produce two different functions, one of which exhibiting loss of a class of odd recombinants.

Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

NASA Astrophysics Data System (ADS)

Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.

2014-02-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

Nonlinear waves of a nonlocal modified KdV equation in the atmospheric and oceanic dynamical system

NASA Astrophysics Data System (ADS)

Tang, Xiao-yan; Liang, Zu-feng; Hao, Xia-zhi

2018-07-01

A new general nonlocal modified KdV equation is derived from the nonlinear inviscid dissipative and equivalent barotropic vorticity equation in a β-plane. The nonlocal property is manifested in the shifted parity and delayed time reversal symmetries. Exact solutions of the nonlocal modified KdV equation are obtained including periodic waves, kink waves, solitary waves, kink- and/or anti-kink-cnoidal periodic wave interaction solutions, which can be utilized to describe various two-place and time-delayed correlated events. As an illustration, a special approximate solution is applied to theoretically capture the salient features of two correlated dipole blocking events in atmospheric dynamical systems.

Efficiently and easily integrating differential equations with JiTCODE, JiTCDDE, and JiTCSDE

NASA Astrophysics Data System (ADS)

Ansmann, Gerrit

2018-04-01

We present a family of Python modules for the numerical integration of ordinary, delay, or stochastic differential equations. The key features are that the user enters the derivative symbolically and it is just-in-time-compiled, allowing the user to efficiently integrate differential equations from a higher-level interpreted language. The presented modules are particularly suited for large systems of differential equations such as those used to describe dynamics on complex networks. Through the selected method of input, the presented modules also allow almost complete automatization of the process of estimating regular as well as transversal Lyapunov exponents for ordinary and delay differential equations. We conceptually discuss the modules' design, analyze their performance, and demonstrate their capabilities by application to timely problems.

A feedback control model for network flow with multiple pure time delays

NASA Technical Reports Server (NTRS)

Press, J.

1972-01-01

A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.

Continuous variables logic via coupled automata using a DNAzyme cascade with feedback† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c6sc03892a Click here for additional data file.

PubMed Central

Lilienthal, S.; Klein, M.; Orbach, R.; Willner, I.; Remacle, F.

2017-01-01

The concentration of molecules can be changed by chemical reactions and thereby offer a continuous readout. Yet computer architecture is cast in textbooks in terms of binary valued, Boolean variables. To enable reactive chemical systems to compute we show how, using the Cox interpretation of probability theory, one can transcribe the equations of chemical kinetics as a sequence of coupled logic gates operating on continuous variables. It is discussed how the distinct chemical identity of a molecule allows us to create a common language for chemical kinetics and Boolean logic. Specifically, the logic AND operation is shown to be equivalent to a bimolecular process. The logic XOR operation represents chemical processes that take place concurrently. The values of the rate constants enter the logic scheme as inputs. By designing a reaction scheme with a feedback we endow the logic gates with a built in memory because their output then depends on the input and also on the present state of the system. Technically such a logic machine is an automaton. We report an experimental realization of three such coupled automata using a DNAzyme multilayer signaling cascade. A simple model verifies analytically that our experimental scheme provides an integrator generating a power series that is third order in time. The model identifies two parameters that govern the kinetics and shows how the initial concentrations of the substrates are the coefficients in the power series. PMID:28507669

Discrete Dynamical Modeling of Influenza Virus Infection Suggests Age-Dependent Differences in Immunity.

PubMed

Keef, Ericka; Zhang, Li Ang; Swigon, David; Urbano, Alisa; Ermentrout, G Bard; Matuszewski, Michael; Toapanta, Franklin R; Ross, Ted M; Parker, Robert S; Clermont, Gilles

2017-12-01

Immunosenescence, an age-related decline in immune function, is a major contributor to morbidity and mortality in the elderly. Older hosts exhibit a delayed onset of immunity and prolonged inflammation after an infection, leading to excess damage and a greater likelihood of death. Our study applies a rule-based model to infer which components of the immune response are most changed in an aged host. Two groups of BALB/c mice (aged 12 to 16 weeks and 72 to 76 weeks) were infected with 2 inocula: a survivable dose of 50 PFU and a lethal dose of 500 PFU. Data were measured at 10 points over 19 days in the sublethal case and at 6 points over 7 days in the lethal case, after which all mice had died. Data varied primarily in the onset of immunity, particularly the inflammatory response, which led to a 2-day delay in the clearance of the virus from older hosts in the sublethal cohort. We developed a Boolean model to describe the interactions between the virus and 21 immune components, including cells, chemokines, and cytokines, of innate and adaptive immunity. The model identifies distinct sets of rules for each age group by using Boolean operators to describe the complex series of interactions that activate and deactivate immune components. Our model accurately simulates the immune responses of mice of both ages and with both inocula included in the data (95% accurate for younger mice and 94% accurate for older mice) and shows distinct rule choices for the innate immunity arm of the model between younger and aging mice in response to influenza A virus infection. IMPORTANCE Influenza virus infection causes high morbidity and mortality rates every year, especially in the elderly. The elderly tend to have a delayed onset of many immune responses as well as prolonged inflammatory responses, leading to an overall weakened response to infection. Many of the details of immune mechanisms that change with age are currently not well understood. We present a rule-based model of the intrahost immune response to influenza virus infection. The model is fit to experimental data for young and old mice infected with influenza virus. We generated distinct sets of rules for each age group to capture the temporal differences seen in the immune responses of these mice. These rules describe a network of interactions leading to either clearance of the virus or death of the host, depending on the initial dosage of the virus. Our models clearly demonstrate differences in these two age groups, particularly in the innate immune responses. Copyright © 2017 American Society for Microbiology.

Theory of repetitively pulsed operation of diode lasers subject to delayed feedback

DOE Office of Scientific and Technical Information (OSTI.GOV)

Napartovich, A P; Sukharev, A G

2015-03-31

Repetitively pulsed operation of a diode laser with delayed feedback has been studied theoretically at varying feedback parameters and pump power levels. A new approach has been proposed that allows one to reduce the system of Lang–Kobayashi equations for a steady-state repetitively pulsed operation mode to a first-order nonlinear differential equation. We present partial solutions that allow the pulse shape to be predicted. (lasers)

The Use of Generalized Laguerre Polynomials in Spectral Methods for Solving Fractional Delay Differential Equations.

PubMed

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.

Exact Algorithms for Output Encoding, State Assignment and Four-Level Boolean Minimization

DTIC Science & Technology

1989-10-01

APPROVED FOR PUBLIC DISTRIBUTION • DTIC MASSACHUSETTS INTITUTE OF TECHNOLOGY M VLSI PUBLICATIONSJAN 17 1990 VLSI Memo No. 89-569 JN. 9October 1989...nunijize large funclions exacly within reasonable amocunt. of CPt targeting twro-level logic imnplemientations involve finding ap- time. However, thle ,, m ...0(NV!) m ~iimizations . n5 10 The inptut encoding problemt can be exactly solved using mrultiple-valued Boolean nimuization. We present an exact (a) (b

Boolean logic tree of graphene-based chemical system for molecular computation and intelligent molecular search query.

PubMed

Huang, Wei Tao; Luo, Hong Qun; Li, Nian Bing

2014-05-06

The most serious, and yet unsolved, problem of constructing molecular computing devices consists in connecting all of these molecular events into a usable device. This report demonstrates the use of Boolean logic tree for analyzing the chemical event network based on graphene, organic dye, thrombin aptamer, and Fenton reaction, organizing and connecting these basic chemical events. And this chemical event network can be utilized to implement fluorescent combinatorial logic (including basic logic gates and complex integrated logic circuits) and fuzzy logic computing. On the basis of the Boolean logic tree analysis and logic computing, these basic chemical events can be considered as programmable "words" and chemical interactions as "syntax" logic rules to construct molecular search engine for performing intelligent molecular search query. Our approach is helpful in developing the advanced logic program based on molecules for application in biosensing, nanotechnology, and drug delivery.

A single-layer platform for Boolean logic and arithmetic through DNA excision in mammalian cells

PubMed Central

Weinberg, Benjamin H.; Hang Pham, N. T.; Caraballo, Leidy D.; Lozanoski, Thomas; Engel, Adrien; Bhatia, Swapnil; Wong, Wilson W.

2017-01-01

Genetic circuits engineered for mammalian cells often require extensive fine-tuning to perform their intended functions. To overcome this problem, we present a generalizable biocomputing platform that can engineer genetic circuits which function in human cells with minimal optimization. We used our Boolean Logic and Arithmetic through DNA Excision (BLADE) platform to build more than 100 multi-input-multi-output circuits. We devised a quantitative metric to evaluate the performance of the circuits in human embryonic kidney and Jurkat T cells. Of 113 circuits analysed, 109 functioned (96.5%) with the correct specified behavior without any optimization. We used our platform to build a three-input, two-output Full Adder and six-input, one-output Boolean Logic Look Up Table. We also used BLADE to design circuits with temporal small molecule-mediated inducible control and circuits that incorporate CRISPR/Cas9 to regulate endogenous mammalian genes. PMID:28346402

An Automated Design Framework for Multicellular Recombinase Logic.

PubMed

Guiziou, Sarah; Ulliana, Federico; Moreau, Violaine; Leclere, Michel; Bonnet, Jerome

2018-05-18

Tools to systematically reprogram cellular behavior are crucial to address pressing challenges in manufacturing, environment, or healthcare. Recombinases can very efficiently encode Boolean and history-dependent logic in many species, yet current designs are performed on a case-by-case basis, limiting their scalability and requiring time-consuming optimization. Here we present an automated workflow for designing recombinase logic devices executing Boolean functions. Our theoretical framework uses a reduced library of computational devices distributed into different cellular subpopulations, which are then composed in various manners to implement all desired logic functions at the multicellular level. Our design platform called CALIN (Composable Asynchronous Logic using Integrase Networks) is broadly accessible via a web server, taking truth tables as inputs and providing corresponding DNA designs and sequences as outputs (available at http://synbio.cbs.cnrs.fr/calin ). We anticipate that this automated design workflow will streamline the implementation of Boolean functions in many organisms and for various applications.

Tracking perturbations in Boolean networks with spectral methods

NASA Astrophysics Data System (ADS)

Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli

2005-08-01

In this paper we present a method for predicting the spread of perturbations in Boolean networks. The method is applicable to networks that have no regular topology. The prediction of perturbations can be performed easily by using a presented result which enables the efficient computation of the required iterative formulas. This result is based on abstract Fourier transform of the functions in the network. In this paper the method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data. The advances in the study of the spread of perturbations can directly be applied to enable ways of quantifying chaos in Boolean networks. Derrida plots over an arbitrary number of time steps can be computed and thus distributions of functions compared with each other with respect to the amount of order they create in random networks.

Computational Algorithms or Identification of Distributed Parameter Systems

DTIC Science & Technology

1993-04-24

delay-differential equations, Volterra integral equations, and partial differential equations with memory terms . In particular we investigated a...tested for estimating parameters in a Volterra integral equation arising from a viscoelastic model of a flexible structure with Boltzmann damping. In...particular, one of the parameters identified was the order of the derivative in Volterra integro-differential equations containing fractional

Spacecraft stability and control using new techniques for periodic and time-delayed systems

NASA Astrophysics Data System (ADS)

NAzari, Morad

This dissertation addresses various problems in spacecraft stability and control using specialized theoretical and numerical techniques for time-periodic and time-delayed systems. First, the effects of energy dissipation are considered in the dual-spin spacecraft, where the damper masses in the platform (?) and the rotor (?) cause energy loss in the system. Floquet theory is employed to obtain stability charts for different relative spin rates of the subsystem [special characters omitted] with respect to the subsystem [special characters omitted]. Further, the stability and bifurcation of delayed feedback spin stabilization of a rigid spacecraft is investigated. The spin is stabilized about the principal axis of the intermediate moment of inertia using a simple delayed feedback control law. In particular, linear stability is analyzed via the exponential-polynomial characteristic equations and then the method of multiple scales is used to obtain the normal form of the Hopf bifurcation. Next, the dynamics of a rigid spacecraft with nonlinear delayed multi-actuator feedback control are studied, where a nonlinear feedback controller using an inverse dynamics approach is sought for the controlled system to have the desired linear delayed closed-loop dynamics (CLD). Later, three linear state feedback control strategies based on Chebyshev spectral collocation and the Lyapunov Floquet transformation (LFT) are explored for regulation control of linear periodic time delayed systems. First , a delayed feedback control law with discrete delay is implemented and the stability of the closed-loop response is investigated in the parameter space of available control gains using infinite-dimensional Floquet theory. Second, the delay differential equation (DDE) is discretized into a large set of ordinary differential equations (ODEs) using the Chebyshev spectral continuous time approximation (CSCTA) and delayed feedback with distributed delay is applied. The third strategy involves use of both CSCTA and the reduced Lyapunov Floquet transformation (RLFT) in order to design a non-delayed feedback control law. The delayed Mathieu equation is used as an illustrative example in which the closed-loop response and control effort are compared for all three control strategies. Finally, three example applications of control of time-periodic astrodynamic systems, i.e. formation flying control for an elliptic Keplerian chief orbit, body-fixed hovering control over a tumbling asteroid, and stationkeeping in Earth-Moon L1 halo orbits, are shown using versions of the control strategies introduced above. These applications employ a mixture of feedforward and non-delayed periodic-gain state feedback for tracking control of natural and non-natural motions in these systems. A major conclusion is that control effort is minimized by employing periodic-gain (rather than constant-gain) feedback control in such systems.

Intrinsic delay of permeable base transistor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Wenchao; Guo, Jing; So, Franky

2014-07-28

Permeable base transistors (PBTs) fabricated by vacuum deposition or solution process have the advantages of easy fabrication and low power operation and are a promising device structure for flexible electronics. Intrinsic delay of PBT, which characterizes the speed of the transistor, is investigated by solving the three-dimensional Poisson equation and drift-diffusion equation self-consistently using finite element method. Decreasing the emitter thickness lowers the intrinsic delay by improving on-current, and a thinner base is also preferred for low intrinsic delay because of fewer carriers in the base region at off-state. The intrinsic delay exponentially decreases as the emitter contact Schottky barriermore » height decreases, and it linearly depends on the carrier mobility. With an optimized emitter contact barrier height and device geometry, a sub-nano-second intrinsic delay can be achieved with a carrier mobility of ∼10 cm{sup 2}/V/s obtainable in solution processed indium gallium zinc oxide, which indicates the potential of solution processed PBTs for GHz operations.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Croft, Stephen; Favalli, Andrea

Here, we extend the familiar Bӧhnel point-model equations, which are routinely used to interpret neutron coincidence counting rates, by including the contribution of delayed neutrons. After developing the necessary equations we use them to show, by providing some numerical results, what the quantitative impact of neglecting delayed neutrons is across the full range of practical nuclear safeguards applications. The influence of delayed neutrons is predicted to be small for the types of deeply sub-critical assay problems which concern the nuclear safeguards community, smaller than uncertainties arising from other factors. This is most clearly demonstrated by considering the change in themore » effective (α,n)-to-spontaneous fission prompt-neutron ratio that the inclusion of delayed neutrons gives rise to. That the influence of delayed neutrons is small is fortunate, and our results justify the long standing practice of simply neglecting them in the analysis of field measurements.« less

Time-delayed feedback control of breathing localized structures in a three-component reaction-diffusion system.

PubMed

Gurevich, Svetlana V

2014-10-28

The dynamics of a single breathing localized structure in a three-component reaction-diffusion system subjected to time-delayed feedback is investigated. It is shown that variation of the delay time and the feedback strength can lead either to stabilization of the breathing or to delay-induced periodic or quasi-periodic oscillations of the localized structure. A bifurcation analysis of the system in question is provided and an order parameter equation is derived that describes the dynamics of the localized structure in the vicinity of the Andronov-Hopf bifurcation. With the aid of this equation, the boundaries of the stabilization domains as well as the dependence of the oscillation radius on delay parameters can be explicitly derived, providing a robust mechanism to control the behaviour of the breathing localized structure in a straightforward manner. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Back-propagation learning of infinite-dimensional dynamical systems.

PubMed

Tokuda, Isao; Tokunaga, Ryuji; Aihara, Kazuyuki

2003-10-01

This paper presents numerical studies of applying back-propagation learning to a delayed recurrent neural network (DRNN). The DRNN is a continuous-time recurrent neural network having time delayed feedbacks and the back-propagation learning is to teach spatio-temporal dynamics to the DRNN. Since the time-delays make the dynamics of the DRNN infinite-dimensional, the learning algorithm and the learning capability of the DRNN are different from those of the ordinary recurrent neural network (ORNN) having no time-delays. First, two types of learning algorithms are developed for a class of DRNNs. Then, using chaotic signals generated from the Mackey-Glass equation and the Rössler equations, learning capability of the DRNN is examined. Comparing the learning algorithms, learning capability, and robustness against noise of the DRNN with those of the ORNN and time delay neural network, advantages as well as disadvantages of the DRNN are investigated.

A differential delay equation arising from the sieve of Eratosthenes

NASA Technical Reports Server (NTRS)

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.

Numerical modelling in biosciences using delay differential equations

NASA Astrophysics Data System (ADS)

Bocharov, Gennadii A.; Rihan, Fathalla A.

2000-12-01

Our principal purposes here are (i) to consider, from the perspective of applied mathematics, models of phenomena in the biosciences that are based on delay differential equations and for which numerical approaches are a major tool in understanding their dynamics, (ii) to review the application of numerical techniques to investigate these models. We show that there are prima facie reasons for using such models: (i) they have a richer mathematical framework (compared with ordinary differential equations) for the analysis of biosystem dynamics, (ii) they display better consistency with the nature of certain biological processes and predictive results. We analyze both the qualitative and quantitative role that delays play in basic time-lag models proposed in population dynamics, epidemiology, physiology, immunology, neural networks and cell kinetics. We then indicate suitable computational techniques for the numerical treatment of mathematical problems emerging in the biosciences, comparing them with those implemented by the bio-modellers.

A new multi-step technique with differential transform method for analytical solution of some nonlinear variable delay differential equations.

PubMed

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.

Alternans promotion in cardiac electrophysiology models by delay differential equations.

PubMed

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.

Emergence of diversity in homogeneous coupled Boolean networks

NASA Astrophysics Data System (ADS)

Kang, Chris; Aguilar, Boris; Shmulevich, Ilya

2018-05-01

The origin of multicellularity in metazoa is one of the fundamental questions of evolutionary biology. We have modeled the generic behaviors of gene regulatory networks in isogenic cells as stochastic nonlinear dynamical systems—coupled Boolean networks with perturbation. Model simulations under a variety of dynamical regimes suggest that the central characteristic of multicellularity, permanent spatial differentiation (diversification), indeed can arise. Additionally, we observe that diversification is more likely to occur near the critical regime of Lyapunov stability.

Adaptive Neuro-Fuzzy Determination of the Effect of Experimental Parameters on Vehicle Agent Speed Relative to Vehicle Intruder.

PubMed

Shamshirband, Shahaboddin; Banjanovic-Mehmedovic, Lejla; Bosankic, Ivan; Kasapovic, Suad; Abdul Wahab, Ainuddin Wahid Bin

2016-01-01

Intelligent Transportation Systems rely on understanding, predicting and affecting the interactions between vehicles. The goal of this paper is to choose a small subset from the larger set so that the resulting regression model is simple, yet have good predictive ability for Vehicle agent speed relative to Vehicle intruder. The method of ANFIS (adaptive neuro fuzzy inference system) was applied to the data resulting from these measurements. The ANFIS process for variable selection was implemented in order to detect the predominant variables affecting the prediction of agent speed relative to intruder. This process includes several ways to discover a subset of the total set of recorded parameters, showing good predictive capability. The ANFIS network was used to perform a variable search. Then, it was used to determine how 9 parameters (Intruder Front sensors active (boolean), Intruder Rear sensors active (boolean), Agent Front sensors active (boolean), Agent Rear sensors active (boolean), RSSI signal intensity/strength (integer), Elapsed time (in seconds), Distance between Agent and Intruder (m), Angle of Agent relative to Intruder (angle between vehicles °), Altitude difference between Agent and Intruder (m)) influence prediction of agent speed relative to intruder. The results indicated that distance between Vehicle agent and Vehicle intruder (m) and angle of Vehicle agent relative to Vehicle Intruder (angle between vehicles °) is the most influential parameters to Vehicle agent speed relative to Vehicle intruder.

Using Common Table Expressions to Build a Scalable Boolean Query Generator for Clinical Data Warehouses

PubMed Central

Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.

2015-01-01

We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572

Boolean Modeling of Neural Systems with Point-Process Inputs and Outputs. Part I: Theory and Simulations

PubMed Central

Marmarelis, Vasilis Z.; Zanos, Theodoros P.; Berger, Theodore W.

2010-01-01

This paper presents a new modeling approach for neural systems with point-process (spike) inputs and outputs that utilizes Boolean operators (i.e. modulo 2 multiplication and addition that correspond to the logical AND and OR operations respectively, as well as the AND_NOT logical operation representing inhibitory effects). The form of the employed mathematical models is akin to a “Boolean-Volterra” model that contains the product terms of all relevant input lags in a hierarchical order, where terms of order higher than first represent nonlinear interactions among the various lagged values of each input point-process or among lagged values of various inputs (if multiple inputs exist) as they reflect on the output. The coefficients of this Boolean-Volterra model are also binary variables that indicate the presence or absence of the respective term in each specific model/system. Simulations are used to explore the properties of such models and the feasibility of their accurate estimation from short data-records in the presence of noise (i.e. spurious spikes). The results demonstrate the feasibility of obtaining reliable estimates of such models, with excitatory and inhibitory terms, in the presence of considerable noise (spurious spikes) in the outputs and/or the inputs in a computationally efficient manner. A pilot application of this approach to an actual neural system is presented in the companion paper (Part II). PMID:19517238

Inferring Toxicological Responses of HepG2 Cells from ...

EPA Pesticide Factsheets

Understanding the dynamic perturbation of cell states by chemicals can aid in for predicting their adverse effects. High-content imaging (HCI) was used to measure the state of HepG2 cells over three time points (1, 24, and 72 h) in response to 976 ToxCast chemicals for 10 different concentrations (0.39-200µM). Cell state was characterized by p53 activation (p53), c-Jun activation (SK), phospho-Histone H2A.x (OS), phospho-Histone H3 (MA), alpha tubulin (Mt), mitochondrial membrane potential (MMP), mitochondrial mass (MM), cell cycle arrest (CCA), nuclear size (NS) and cell number (CN). Dynamic cell state perturbations due to each chemical concentration were utilized to infer coarse-grained dependencies between cellular functions as Boolean networks (BNs). BNs were inferred from data in two steps. First, the data for each state variable were discretized into changed/active (> 1 standard deviation), and unchanged/inactive values. Second, the discretized data were used to learn Boolean relationships between variables. In our case, a BN is a wiring diagram between nodes that represent 10 previously described observable phenotypes. Functional relationships between nodes were represented as Boolean functions. We found that inferred BN show that HepG2 cell response is chemical and concentration specific. We observed presence of both point and cycle BN attractors. In addition, there are instances where Boolean functions were not found. We believe that this may be either

A Factorization Approach to the Linear Regulator Quadratic Cost Problem

NASA Technical Reports Server (NTRS)

Milman, M. H.

1985-01-01

A factorization approach to the linear regulator quadratic cost problem is developed. This approach makes some new connections between optimal control, factorization, Riccati equations and certain Wiener-Hopf operator equations. Applications of the theory to systems describable by evolution equations in Hilbert space and differential delay equations in Euclidean space are presented.

Time-delayed feedback control of diffusion in random walkers.

PubMed

Ando, Hiroyasu; Takehara, Kohta; Kobayashi, Miki U

2017-07-01

Time delay in general leads to instability in some systems, while specific feedback with delay can control fluctuated motion in nonlinear deterministic systems to a stable state. In this paper, we consider a stochastic process, i.e., a random walk, and observe its diffusion phenomenon with time-delayed feedback. As a result, the diffusion coefficient decreases with increasing delay time. We analytically illustrate this suppression of diffusion by using stochastic delay differential equations and justify the feasibility of this suppression by applying time-delayed feedback to a molecular dynamics model.

American College of Rheumatology/European League Against Rheumatism remission criteria for rheumatoid arthritis maintain reliable performance when evaluated in 44 joints.

PubMed

Kaneko, Yuko; Kondo, Harumi; Takeuchi, Tsutomu

2013-08-01

To investigate the performance of the new remission criteria for rheumatoid arthritis (RA) in daily clinical practice and the effect of possible misclassification of remission when 44 joints are assessed. Disease activity and remission rate were calculated according to the Disease Activity Score (DAS28), Simplified Disease Activity Index (SDAI), Clinical Disease Activity Index (CDAI), and a Boolean-based definition for 1402 patients with RA in Keio University Hospital. Characteristics of patients in remission were investigated, and the number of misclassified patients was determined--those classified as being in remission based on 28-joint count but as nonremission based on a 44-joint count for each definition criterion. Of all patients analyzed, 46.6%, 45.9%, 41.0%, and 31.5% were classified as in remission in the DAS28, SDAI, CDAI, and Boolean definitions, respectively. Patients classified into remission based only on the DAS28 showed relatively low erythrocyte sedimentation rates but greater swollen joint counts than those classified into remission based on the other definitions. In patients classified into remission based only on the Boolean criteria, the mean physician global assessment was greater than the mean patient global assessment. Although 119 patients had ≤ 1 involved joint in the 28-joint count but > 1 in the 44-joint count, only 34 of these 119 (2.4% of all subjects) were found to have been misclassified into remission. In practice, about half of patients with RA can achieve clinical remission within the DAS28, SDAI, and CDAI; and one-third according to the Boolean-based definition. Patients classified in remission based on a 28-joint count may have pain and swelling in the feet, but misclassification of remission was relatively rare and was seen in only 2.4% of patients under a Boolean definition. The 28-joint count can be sufficient for assessing clinical remission based on the new remission criteria.

A model of a fishery with fish stock involving delay equations.

PubMed

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.

Surface-confined assemblies and polymers for molecular logic.

PubMed

de Ruiter, Graham; van der Boom, Milko E

2011-08-16

Stimuli responsive materials are capable of mimicking the operation characteristics of logic gates such as AND, OR, NOR, and even flip-flops. Since the development of molecular sensors and the introduction of the first AND gate in solution by de Silva in 1993, Molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. In this Account, we present recent research activities that focus on MBLC with electrochromic polymers and metal polypyridyl complexes on a solid support. Metal polypyridyl complexes act as useful sensors to a variety of analytes in solution (i.e., H(2)O, Fe(2+/3+), Cr(6+), NO(+)) and in the gas phase (NO(x) in air). This information transfer, whether the analyte is present, is based on the reversible redox chemistry of the metal complexes, which are stable up to 200 °C in air. The concurrent changes in the optical properties are nondestructive and fast. In such a setup, the input is directly related to the output and, therefore, can be represented by one-input logic gates. These input-output relationships are extendable for mimicking the diverse functions of essential molecular logic gates and circuits within a set of Boolean algebraic operations. Such a molecular approach towards Boolean logic has yielded a series of proof-of-concept devices: logic gates, multiplexers, half-adders, and flip-flop logic circuits. MBLC is a versatile and, potentially, a parallel approach to silicon circuits: assemblies of these molecular gates can perform a wide variety of logic tasks through reconfiguration of their inputs. Although these developments do not require a semiconductor blueprint, similar guidelines such as signal propagation, gate-to-gate communication, propagation delay, and combinatorial and sequential logic will play a critical role in allowing this field to mature. For instance, gate-to-gate communication by chemical wiring of the gates with metal ions as electron carriers results in the integration of stand-alone systems: the output of one gate is used as the input for another gate. Using the same setup, we were able to display both combinatorial and sequential logic. We have demonstrated MBLC by coupling electrochemical inputs with optical readout, which resulted in various logic architectures built on a redox-active, functionalized surface. Electrochemically operated sequential logic systems such as flip-flops, multivalued logic, and multistate memory could enhance computational power without increasing spatial requirements. Applying multivalued digits in data storage could exponentially increase memory capacity. Furthermore, we evaluate the pros and cons of MBLC and identify targets for future research in this Account. © 2011 American Chemical Society

Random Boolean networks for autoassociative memory: Optimization and sequential learning

NASA Astrophysics Data System (ADS)

Sherrington, D.; Wong, K. Y. M.

Conventional neural networks are based on synaptic storage of information, even when the neural states are discrete and bounded. In general, the set of potential local operations is much greater. Here we discuss some aspects of the properties of networks of binary neurons with more general Boolean functions controlling the local dynamics. Two specific aspects are emphasised; (i) optimization in the presence of noise and (ii) a simple model for short-term memory exhibiting primacy and recency in the recall of sequentially taught patterns.

Security analysis of boolean algebra based on Zhang-Wang digital signature scheme

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zheng, Jinbin, E-mail: jbzheng518@163.com

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.

Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.

PubMed

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.

Pulse-coupled mixed-mode oscillators: Cluster states and extreme noise sensitivity

NASA Astrophysics Data System (ADS)

Karamchandani, Avinash J.; Graham, James N.; Riecke, Hermann

2018-04-01

Motivated by rhythms in the olfactory system of the brain, we investigate the synchronization of all-to-all pulse-coupled neuronal oscillators exhibiting various types of mixed-mode oscillations (MMOs) composed of sub-threshold oscillations (STOs) and action potentials ("spikes"). We focus particularly on the impact of the delay in the interaction. In the weak-coupling regime, we reduce the system to a Kuramoto-type equation with non-sinusoidal phase coupling and the associated Fokker-Planck equation. Its linear stability analysis identifies the appearance of various cluster states. Their type depends sensitively on the delay and the width of the pulses. Interestingly, long delays do not imply slow population rhythms, and the number of emerging clusters only loosely depends on the number of STOs. Direct simulations of the oscillator equations reveal that for quantitative agreement of the weak-coupling theory the coupling strength and the noise have to be extremely small. Even moderate noise leads to significant skipping of STO cycles, which can enhance the diffusion coefficient in the Fokker-Planck equation by two orders of magnitude. Introducing an effective diffusion coefficient extends the range of agreement significantly. Numerical simulations of the Fokker-Planck equation reveal bistability and solutions with oscillatory order parameters that result from nonlinear mode interactions. These are confirmed in simulations of the full spiking model.

Stability for a class of difference equations

NASA Astrophysics Data System (ADS)

Muroya, Yoshiaki; Ishiwata, Emiko

2009-06-01

We consider the following non-autonomous and nonlinear difference equations with unbounded delays: where 0

Bifurcation Analysis and Application for Impulsive Systems with Delayed Impulses

NASA Astrophysics Data System (ADS)

Church, Kevin E. M.; Liu, Xinzhi

In this article, we present a systematic approach to bifurcation analysis of impulsive systems with autonomous or periodic right-hand sides that may exhibit delayed impulse terms. Methods include Lyapunov-Schmidt reduction and center manifold reduction. Both methods are presented abstractly in the context of the stroboscopic map associated to a given impulsive system, and are illustrated by way of two in-depth examples: the analysis of a SIR model of disease transmission with seasonality and unevenly distributed moments of treatment, and a scalar logistic differential equation with a delayed census impulsive harvesting effort. It is proven that in some special cases, the logistic equation can exhibit a codimension two bifurcation at a 1:1 resonance point.

Distributed Optimal Consensus Control for Multiagent Systems With Input Delay.

PubMed

Zhang, Huaipin; Yue, Dong; Zhao, Wei; Hu, Songlin; Dou, Chunxia; Huaipin Zhang; Dong Yue; Wei Zhao; Songlin Hu; Chunxia Dou; Hu, Songlin; Zhang, Huaipin; Dou, Chunxia; Yue, Dong; Zhao, Wei

2018-06-01

This paper addresses the problem of distributed optimal consensus control for a continuous-time heterogeneous linear multiagent system subject to time varying input delays. First, by discretization and model transformation, the continuous-time input-delayed system is converted into a discrete-time delay-free system. Two delicate performance index functions are defined for these two systems. It is shown that the performance index functions are equivalent and the optimal consensus control problem of the input-delayed system can be cast into that of the delay-free system. Second, by virtue of the Hamilton-Jacobi-Bellman (HJB) equations, an optimal control policy for each agent is designed based on the delay-free system and a novel value iteration algorithm is proposed to learn the solutions to the HJB equations online. The proposed adaptive dynamic programming algorithm is implemented on the basis of a critic-action neural network (NN) structure. Third, it is proved that local consensus errors of the two systems and weight estimation errors of the critic-action NNs are uniformly ultimately bounded while the approximated control policies converge to their target values. Finally, two simulation examples are presented to illustrate the effectiveness of the developed method.

Dynamics of a neutral delay equation for an insect population with long larval and short adult phases

NASA Astrophysics Data System (ADS)

Gourley, Stephen A.; Kuang, Yang

We present a global study on the stability of the equilibria in a nonlinear autonomous neutral delay differential population model formulated by Bocharov and Hadeler. This model may be suitable for describing the intriguing dynamics of an insect population with long larval and short adult phases such as the periodical cicada. We circumvent the usual difficulties associated with the study of the stability of a nonlinear neutral delay differential model by transforming it to an appropriate non-neutral nonautonomous delay differential equation with unbounded delay. In the case that no juveniles give birth, we establish the positivity and boundedness of solutions by ad hoc methods and global stability of the extinction and positive equilibria by the method of iteration. We also show that if the time adjusted instantaneous birth rate at the time of maturation is greater than 1, then the population will grow without bound, regardless of the population death process.

Boolean gates on actin filaments

NASA Astrophysics Data System (ADS)

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.

PyBoolNet: a python package for the generation, analysis and visualization of boolean networks.

PubMed

Klarner, Hannes; Streck, Adam; Siebert, Heike

2017-03-01

The goal of this project is to provide a simple interface to working with Boolean networks. Emphasis is put on easy access to a large number of common tasks including the generation and manipulation of networks, attractor and basin computation, model checking and trap space computation, execution of established graph algorithms as well as graph drawing and layouts. P y B ool N et is a Python package for working with Boolean networks that supports simple access to model checking via N u SMV, standard graph algorithms via N etwork X and visualization via dot . In addition, state of the art attractor computation exploiting P otassco ASP is implemented. The package is function-based and uses only native Python and N etwork X data types. https://github.com/hklarner/PyBoolNet. hannes.klarner@fu-berlin.de. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Discrete dynamic modeling of cellular signaling networks.

PubMed

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Origins of Chaos in Autonomous Boolean Networks

NASA Astrophysics Data System (ADS)

Socolar, Joshua; Cavalcante, Hugo; Gauthier, Daniel; Zhang, Rui

2010-03-01

Networks with nodes consisting of ideal Boolean logic gates are known to display either steady states, periodic behavior, or an ultraviolet catastrophe where the number of logic-transition events circulating in the network per unit time grows as a power-law. In an experiment, non-ideal behavior of the logic gates prevents the ultraviolet catastrophe and may lead to deterministic chaos. We identify certain non-ideal features of real logic gates that enable chaos in experimental networks. We find that short-pulse rejection and the asymmetry between the logic states tends to engender periodic behavior. On the other hand, a memory effect termed ``degradation'' can generate chaos. Our results strongly suggest that deterministic chaos can be expected in a large class of experimental Boolean-like networks. Such devices may find application in a variety of technologies requiring fast complex waveforms or flat power spectra. The non-ideal effects identified here also have implications for the statistics of attractors in large complex networks.

Phase diagram of restricted Boltzmann machines and generalized Hopfield networks with arbitrary priors.

PubMed

Barra, Adriano; Genovese, Giuseppe; Sollich, Peter; Tantari, Daniele

2018-02-01

Restricted Boltzmann machines are described by the Gibbs measure of a bipartite spin glass, which in turn can be seen as a generalized Hopfield network. This equivalence allows us to characterize the state of these systems in terms of their retrieval capabilities, both at low and high load, of pure states. We study the paramagnetic-spin glass and the spin glass-retrieval phase transitions, as the pattern (i.e., weight) distribution and spin (i.e., unit) priors vary smoothly from Gaussian real variables to Boolean discrete variables. Our analysis shows that the presence of a retrieval phase is robust and not peculiar to the standard Hopfield model with Boolean patterns. The retrieval region becomes larger when the pattern entries and retrieval units get more peaked and, conversely, when the hidden units acquire a broader prior and therefore have a stronger response to high fields. Moreover, at low load retrieval always exists below some critical temperature, for every pattern distribution ranging from the Boolean to the Gaussian case.

Experimental Clocking of Nanomagnets with Strain for Ultralow Power Boolean Logic.

PubMed

D'Souza, Noel; Salehi Fashami, Mohammad; Bandyopadhyay, Supriyo; Atulasimha, Jayasimha

2016-02-10

Nanomagnetic implementations of Boolean logic have attracted attention because of their nonvolatility and the potential for unprecedented overall energy-efficiency. Unfortunately, the large dissipative losses that occur when nanomagnets are switched with a magnetic field or spin-transfer-torque severely compromise the energy-efficiency. Recently, there have been experimental reports of utilizing the Spin Hall effect for switching magnets, and theoretical proposals for strain induced switching of single-domain magnetostrictive nanomagnets, that might reduce the dissipative losses significantly. Here, we experimentally demonstrate, for the first time that strain-induced switching of single-domain magnetostrictive nanomagnets of lateral dimensions ∼200 nm fabricated on a piezoelectric substrate can implement a nanomagnetic Boolean NOT gate and steer bit information unidirectionally in dipole-coupled nanomagnet chains. On the basis of the experimental results with bulk PMN-PT substrates, we estimate that the energy dissipation for logic operations in a reasonably scaled system using thin films will be a mere ∼1 aJ/bit.

Response of an oscillatory differential delay equation to a single stimulus.

PubMed

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.

Dynamical analysis of cigarette smoking model with a saturated incidence rate

NASA Astrophysics Data System (ADS)

Zeb, Anwar; Bano, Ayesha; Alzahrani, Ebraheem; Zaman, Gul

2018-04-01

In this paper, we consider a delayed smoking model in which the potential smokers are assumed to satisfy the logistic equation. We discuss the dynamical behavior of our proposed model in the form of Delayed Differential Equations (DDEs) and show conditions for asymptotic stability of the model in steady state. We also discuss the Hopf bifurcation analysis of considered model. Finally, we use the nonstandard finite difference (NSFD) scheme to show the results graphically with help of MATLAB.

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

PubMed Central

Lähdesmäki, Harri; Hautaniemi, Sampsa; Shmulevich, Ilya; Yli-Harja, Olli

2006-01-01

A significant amount of attention has recently been focused on modeling of gene regulatory networks. Two frequently used large-scale modeling frameworks are Bayesian networks (BNs) and Boolean networks, the latter one being a special case of its recent stochastic extension, probabilistic Boolean networks (PBNs). PBN is a promising model class that generalizes the standard rule-based interactions of Boolean networks into the stochastic setting. Dynamic Bayesian networks (DBNs) is a general and versatile model class that is able to represent complex temporal stochastic processes and has also been proposed as a model for gene regulatory systems. In this paper, we concentrate on these two model classes and demonstrate that PBNs and a certain subclass of DBNs can represent the same joint probability distribution over their common variables. The major benefit of introducing the relationships between the models is that it opens up the possibility of applying the standard tools of DBNs to PBNs and vice versa. Hence, the standard learning tools of DBNs can be applied in the context of PBNs, and the inference methods give a natural way of handling the missing values in PBNs which are often present in gene expression measurements. Conversely, the tools for controlling the stationary behavior of the networks, tools for projecting networks onto sub-networks, and efficient learning schemes can be used for DBNs. In other words, the introduced relationships between the models extend the collection of analysis tools for both model classes. PMID:17415411

Determining the transport mechanism of an enzyme-catalytic complex metabolic network based on biological robustness.

PubMed

Wang, Lei

2013-04-01

Understanding the transport mechanism of 1,3-propanediol (1,3-PD) is of critical importance to do further research on gene regulation. Due to the lack of intracellular information, on the basis of enzyme-catalytic system, using biological robustness as performance index, we present a system identification model to infer the most possible transport mechanism of 1,3-PD, in which the performance index consists of the relative error of the extracellular substance concentrations and biological robustness of the intracellular substance concentrations. We will not use a Boolean framework but prefer a model description based on ordinary differential equations. Among other advantages, this also facilitates the robustness analysis, which is the main goal of this paper. An algorithm is constructed to seek the solution of the identification model. Numerical results show that the most possible transport way is active transport coupled with passive diffusion.

Computational methodology to predict satellite system-level effects from impacts of untrackable space debris

NASA Astrophysics Data System (ADS)

Welty, N.; Rudolph, M.; Schäfer, F.; Apeldoorn, J.; Janovsky, R.

2013-07-01

This paper presents a computational methodology to predict the satellite system-level effects resulting from impacts of untrackable space debris particles. This approach seeks to improve on traditional risk assessment practices by looking beyond the structural penetration of the satellite and predicting the physical damage to internal components and the associated functional impairment caused by untrackable debris impacts. The proposed method combines a debris flux model with the Schäfer-Ryan-Lambert ballistic limit equation (BLE), which accounts for the inherent shielding of components positioned behind the spacecraft structure wall. Individual debris particle impact trajectories and component shadowing effects are considered and the failure probabilities of individual satellite components as a function of mission time are calculated. These results are correlated to expected functional impairment using a Boolean logic model of the system functional architecture considering the functional dependencies and redundancies within the system.

Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics, production version (SOUSSA-P 1.1). Volume 1: Theoretical manual. [Green function

NASA Technical Reports Server (NTRS)

Morino, L.

1980-01-01

Recent developments of the Green's function method and the computer program SOUSSA (Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics) are reviewed and summarized. Applying the Green's function method to the fully unsteady (transient) potential equation yields an integro-differential-delay equation. With spatial discretization by the finite-element method, this equation is approximated by a set of differential-delay equations in time. Time solution by Laplace transform yields a matrix relating the velocity potential to the normal wash. Premultiplying and postmultiplying by the matrices relating generalized forces to the potential and the normal wash to the generalized coordinates one obtains the matrix of the generalized aerodynamic forces. The frequency and mode-shape dependence of this matrix makes the program SOUSSA useful for multiple frequency and repeated mode-shape evaluations.

Transfer Alignment Error Compensator Design Based on Robust State Estimation

NASA Astrophysics Data System (ADS)

Lyou, Joon; Lim, You-Chol

This paper examines the transfer alignment problem of the StrapDown Inertial Navigation System (SDINS), which is subject to the ship’s roll and pitch. Major error sources for velocity and attitude matching are lever arm effect, measurement time delay and ship-body flexure. To reduce these alignment errors, an error compensation method based on state augmentation and robust state estimation is devised. A linearized error model for the velocity and attitude matching transfer alignment system is derived first by linearizing the nonlinear measurement equation with respect to its time delay and dominant Y-axis flexure, and by augmenting the delay state and flexure state into conventional linear state equations. Then an H∞ filter is introduced to account for modeling uncertainties of time delay and the ship-body flexure. The simulation results show that this method considerably decreases azimuth alignment errors considerably.

Effect of the scattering delay on time-dependent photon migration in turbid media.

PubMed

Yaroslavsky, I V; Yaroslavsky, A N; Tuchin, V V; Schwarzmaier, H J

1997-09-01

We modified the diffusion approximation of the time-dependent radiative transfer equation to account for a finite scattering delay time. Under the usual assumptions of the diffusion approximation, the effect of the scattering delay leads to a simple renormalization of the light velocity that appears in the diffusion equation. Accuracy of the model was evaluated by comparison with Monte Carlo simulations in the frequency domain for a semi-infinite geometry. A good agreement is demonstrated for both matched and mismatched boundary conditions when the distance from the source is sufficiently large. The modified diffusion model predicts that the neglect of the scattering delay when the optical properties of the turbid material are derived from normalized frequency- or time-domain measurements should result in an underestimation of the absorption coefficient and an overestimation of the transport coefficient. These observations are consistent with the published experimental data.

Sensitivity and Switching Delay in Trigger Circuits; SENSIBILITA E RITARDO ENI CIRCUITI A SCATTO

DOE Office of Scientific and Technical Information (OSTI.GOV)

De Lotto, I.; Stanchi, L.

The problem of regeneration in trigger circuits is studied, particularly in relation to switching delay and switching time. The factors that affect the speed, such as the threshold as a function of the input signal duration, are examined. The sensitivity of the circuit is also discussed. The characteristics of the dipole equivalent to a trigger circuit are determined, and the switching delay and switching rise time are examined using considerable simplifications (circuits with constant parameters) and graphical methods. For the particular case of a transistor circuit, the equation of the equivalent circuit is derived taking into account the nonlinearity ofmore » the parameters. This equation is processed by means of an analog computer. Using experimental data, the circuits are classified according to their sensitivity and the switching delay. A merit figure is obtained for synthetically evaluating different circuits and optimizing circuit sensitivity and speed. (auth)« less

General Relativistic Theory of the VLBI Time Delay in the Gravitational Field of Moving Bodies

NASA Technical Reports Server (NTRS)

Kopeikin, Sergei

2003-01-01

The general relativistic theory of the gravitational VLBI experiment conducted on September 8, 2002 by Fomalont and Kopeikin is explained. Equations of radio waves (light) propagating from the quasar to the observer are integrated in the time-dependent gravitational field of the solar system by making use of either retarded or advanced solutions of the Einstein field equations. This mathematical technique separates explicitly the effects associated with the propagation of gravity from those associated with light in the integral expression for the relativistic VLBI time delay of light. We prove that the relativistic correction to the Shapiro time delay, discovered by Kopeikin (ApJ, 556, L1, 2001), changes sign if one retains direction of the light propagation but replaces the retarded for the advanced solution of the Einstein equations. Hence, this correction is associated with the propagation of gravity. The VLBI observation measured its speed, and that the retarded solution is the correct one.

Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams

DTIC Science & Technology

1992-07-01

memories , where careful attention has been given to programming the memory management routines [Brace et al 19901. To extract maximum performance, it...OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as...indicated 3 X X2 X3 f 000 0 0 01 0X22 0 10 0 0 11 1 d 1 0 0 0 X3 X 3X 1 01 1 1 10 0 - i"o11 10o 1 1 Figure 1: Truth Table and Decison Tree Repremmtatios

Generating probabilistic Boolean networks from a prescribed transition probability matrix.

PubMed

Ching, W-K; Chen, X; Tsing, N-K

2009-11-01

Probabilistic Boolean networks (PBNs) have received much attention in modeling genetic regulatory networks. A PBN can be regarded as a Markov chain process and is characterised by a transition probability matrix. In this study, the authors propose efficient algorithms for constructing a PBN when its transition probability matrix is given. The complexities of the algorithms are also analysed. This is an interesting inverse problem in network inference using steady-state data. The problem is important as most microarray data sets are assumed to be obtained from sampling the steady-state.

A Parallel Approach in Computing Correlation Immunity up to Six Variables

DTIC Science & Technology

2015-03-10

their nonlinearity is divisible by 4. Let CI(n, k) (respectively, BCI (n, k)) be the number of exact order k correlation im- mune, (respectively...further balanced) n-variable Boolean functions. The notations CI(n, k, d), BCI (n, k, d) restricts the previous count to degree d Boolean functions...Theorem 3. The following are true: (i) BCI (n, n, 0) = 0, CI(n, n, 0) = 2, CI(n, k, 1) = BCI (n, k, 1) = 2 ( n k+1 ) , 0 ≤ k ≤ n− 1. (ii) BCI (n, n− 2) = 2

On Weak and Strong 2k- bent Boolean Functions

DTIC Science & Technology

2016-01-01

U.S.A. Email: pstanica@nps.edu Abstract—In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent...denotes the complex conjugate of z. An important tool in our analysis is the discrete Fourier transform , known in Boolean functions literature, as Walsh...Hadamard, or Walsh–Hadamard transform , which is the func- tion Wf : Fn2 → C, defined by Wf (u) = 2− n 2 ∑ x∈Vn (−1)f(x)⊕u·x. Any f ∈ Bn can be

Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder

NASA Astrophysics Data System (ADS)

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.

Approximating a nonlinear advanced-delayed equation from acoustics

NASA Astrophysics Data System (ADS)

Teodoro, M. Filomena

2016-10-01

We approximate the solution of a particular non-linear mixed type functional differential equation from physiology, the mucosal wave model of the vocal oscillation during phonation. The mathematical equation models a superficial wave propagating through the tissues. The numerical scheme is adapted from the work presented in [1, 2, 3], using homotopy analysis method (HAM) to solve the non linear mixed type equation under study.

Global Hopf bifurcation analysis on a BAM neural network with delays

NASA Astrophysics Data System (ADS)

Sun, Chengjun; Han, Maoan; Pang, Xiaoming

2007-01-01

A delayed differential equation that models a bidirectional associative memory (BAM) neural network with four neurons is considered. By using a global Hopf bifurcation theorem for FDE and a Bendixon's criterion for high-dimensional ODE, a group of sufficient conditions for the system to have multiple periodic solutions are obtained when the sum of delays is sufficiently large.

Theoretical foundations for traditional and generalized sensitivity functions for nonlinear delay differential equations.

PubMed

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.

Time delay and noise explaining the behaviour of the cell growth in fermentation process

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ayuobi, Tawfiqullah; Rosli, Norhayati; Bahar, Arifah

2015-02-03

This paper proposes to investigate the interplay between time delay and external noise in explaining the behaviour of the microbial growth in batch fermentation process. Time delay and noise are modelled jointly via stochastic delay differential equations (SDDEs). The typical behaviour of cell concentration in batch fermentation process under this model is investigated. Milstein scheme is applied for solving this model numerically. Simulation results illustrate the effects of time delay and external noise in explaining the lag and stationary phases, respectively for the cell growth of fermentation process.

Time delay and noise explaining the behaviour of the cell growth in fermentation process

NASA Astrophysics Data System (ADS)

Ayuobi, Tawfiqullah; Rosli, Norhayati; Bahar, Arifah; Salleh, Madihah Md

2015-02-01

This paper proposes to investigate the interplay between time delay and external noise in explaining the behaviour of the microbial growth in batch fermentation process. Time delay and noise are modelled jointly via stochastic delay differential equations (SDDEs). The typical behaviour of cell concentration in batch fermentation process under this model is investigated. Milstein scheme is applied for solving this model numerically. Simulation results illustrate the effects of time delay and external noise in explaining the lag and stationary phases, respectively for the cell growth of fermentation process.

Modeling nuclear processes by Simulink

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rashid, Nahrul Khair Alang Md, E-mail: nahrul@iium.edu.my

2015-04-29

Modelling and simulation are essential parts in the study of dynamic systems behaviours. In nuclear engineering, modelling and simulation are important to assess the expected results of an experiment before the actual experiment is conducted or in the design of nuclear facilities. In education, modelling can give insight into the dynamic of systems and processes. Most nuclear processes can be described by ordinary or partial differential equations. Efforts expended to solve the equations using analytical or numerical solutions consume time and distract attention from the objectives of modelling itself. This paper presents the use of Simulink, a MATLAB toolbox softwaremore » that is widely used in control engineering, as a modelling platform for the study of nuclear processes including nuclear reactor behaviours. Starting from the describing equations, Simulink models for heat transfer, radionuclide decay process, delayed neutrons effect, reactor point kinetic equations with delayed neutron groups, and the effect of temperature feedback are used as examples.« less

Comparative analysis of Goodwin's business cycle models

NASA Astrophysics Data System (ADS)

Antonova, A. O.; Reznik, S.; Todorov, M. D.

2016-10-01

We compare the behavior of solutions of Goodwin's business cycle equation in the form of neutral delay differential equation with fixed delay (NDDE model) and in the form of the differential equations of 3rd, 4th and 5th orders (ODE model's). Such ODE model's (Taylor series expansion of NDDE in powers of θ) are proposed in N. Dharmaraj and K. Vela Velupillai [6] for investigation of the short periodic sawthooth oscillations in NDDE. We show that the ODE's of 3rd, 4th and 5th order may approximate the asymptotic behavior of only main Goodwin's mode, but not the sawthooth modes. If the order of the Taylor series expansion exceeds 5, then the approximate ODE becomes unstable independently of time lag θ.

The application of Legendre-tau approximation to parameter identification for delay and partial differential equations

NASA Technical Reports Server (NTRS)

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.

Oscillatory dynamics of an intravenous glucose tolerance test model with delay interval

NASA Astrophysics Data System (ADS)

Shi, Xiangyun; Kuang, Yang; Makroglou, Athena; Mokshagundam, Sriprakash; Li, Jiaxu

2017-11-01

Type 2 diabetes mellitus (T2DM) has become prevalent pandemic disease in view of the modern life style. Both diabetic population and health expenses grow rapidly according to American Diabetes Association. Detecting the potential onset of T2DM is an essential focal point in the research of diabetes mellitus. The intravenous glucose tolerance test (IVGTT) is an effective protocol to determine the insulin sensitivity, glucose effectiveness, and pancreatic β-cell functionality, through the analysis and parameter estimation of a proper differential equation model. Delay differential equations have been used to study the complex physiological phenomena including the glucose and insulin regulations. In this paper, we propose a novel approach to model the time delay in IVGTT modeling. This novel approach uses two parameters to simulate not only both discrete time delay and distributed time delay in the past interval, but also the time delay distributed in a past sub-interval. Normally, larger time delay, either a discrete or a distributed delay, will destabilize the system. However, we find that time delay over a sub-interval might not. We present analytically some basic model properties, which are desirable biologically and mathematically. We show that this relatively simple model provides good fit to fluctuating patient data sets and reveals some intriguing dynamics. Moreover, our numerical simulation results indicate that our model may remove the defect in well known Minimal Model, which often overestimates the glucose effectiveness index.

Logic circuits from zero forcing.

PubMed

Burgarth, Daniel; Giovannetti, Vittorio; Hogben, Leslie; Severini, Simone; Young, Michael

We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of "back forcing" as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we show that zero forcing can be also used to implement reversible computation. The model introduced here provides a potentially new tool in the analysis of Boolean functions, with particular attention to monotonicity. Moreover, in the light of applications of zero forcing in quantum mechanics, the link with Boolean functions may suggest a new directions in quantum control theory and in the study of engineered quantum spin systems. It is an open technical problem to verify whether there is a link between zero forcing and computation with contact circuits.

Boolean dynamics of genetic regulatory networks inferred from microarray time series data

DOE PAGES

Martin, Shawn; Zhang, Zhaoduo; Martino, Anthony; ...

2007-01-31

Methods available for the inference of genetic regulatory networks strive to produce a single network, usually by optimizing some quantity to fit the experimental observations. In this paper we investigate the possibility that multiple networks can be inferred, all resulting in similar dynamics. This idea is motivated by theoretical work which suggests that biological networks are robust and adaptable to change, and that the overall behavior of a genetic regulatory network might be captured in terms of dynamical basins of attraction. We have developed and implemented a method for inferring genetic regulatory networks for time series microarray data. Our methodmore » first clusters and discretizes the gene expression data using k-means and support vector regression. We then enumerate Boolean activation–inhibition networks to match the discretized data. In conclusion, the dynamics of the Boolean networks are examined. We have tested our method on two immunology microarray datasets: an IL-2-stimulated T cell response dataset and a LPS-stimulated macrophage response dataset. In both cases, we discovered that many networks matched the data, and that most of these networks had similar dynamics.« less

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.

PubMed

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde

2015-08-28

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.

Verification and Optimal Control of Context-Sensitive Probabilistic Boolean Networks Using Model Checking and Polynomial Optimization

PubMed Central

Hiraishi, Kunihiko

2014-01-01

One of the significant topics in systems biology is to develop control theory of gene regulatory networks (GRNs). In typical control of GRNs, expression of some genes is inhibited (activated) by manipulating external stimuli and expression of other genes. It is expected to apply control theory of GRNs to gene therapy technologies in the future. In this paper, a control method using a Boolean network (BN) is studied. A BN is widely used as a model of GRNs, and gene expression is expressed by a binary value (ON or OFF). In particular, a context-sensitive probabilistic Boolean network (CS-PBN), which is one of the extended models of BNs, is used. For CS-PBNs, the verification problem and the optimal control problem are considered. For the verification problem, a solution method using the probabilistic model checker PRISM is proposed. For the optimal control problem, a solution method using polynomial optimization is proposed. Finally, a numerical example on the WNT5A network, which is related to melanoma, is presented. The proposed methods provide us useful tools in control theory of GRNs. PMID:24587766

Synchronization Analysis of Master-Slave Probabilistic Boolean Networks

PubMed Central

Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W. C.; Cao, Jinde

2015-01-01

In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results. PMID:26315380

A survey of SAT solver

NASA Astrophysics Data System (ADS)

Gong, Weiwei; Zhou, Xu

2017-06-01

In Computer Science, the Boolean Satisfiability Problem(SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. SAT is one of the first problems that was proven to be NP-complete, which is also fundamental to artificial intelligence, algorithm and hardware design. This paper reviews the main algorithms of the SAT solver in recent years, including serial SAT algorithms, parallel SAT algorithms, SAT algorithms based on GPU, and SAT algorithms based on FPGA. The development of SAT is analyzed comprehensively in this paper. Finally, several possible directions for the development of the SAT problem are proposed.

Modeling bidirectional reflectance of forests and woodlands using Boolean models and geometric optics

NASA Technical Reports Server (NTRS)

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.

A Parallel Approach in Computing Correlation Immunity up to Six Variables

DTIC Science & Technology

2015-07-24

nonlinearity is divisible by 4. Let CI(n, k) (respectively, BCI (n, k)) be the number of exact order k corre- lation immune, (respectively, further...balanced) n-variable Boolean functions. The notations CI(n, k, d), BCI (n, k, d) restricts the previous count to degree d Boolean functions. Theorem 3...The following are true: (i) BCI (n, n, 0) = 0, CI(n, n, 0) = 2, CI(n, k, 1) = BCI (n, k, 1) = 2 ( n k+1 ) , 0 ≤ k ≤ n− 1. (ii) BCI (n, n− 2) = 2 ( n n−1

Dynamic reduction with applications to mathematical biology and other areas.

PubMed

Sacker, Robert J; Von Bremen, Hubertus F

2007-10-01

In a difference or differential equation one is usually interested in finding solutions having certain properties, either intrinsic properties (e.g. bounded, periodic, almost periodic) or extrinsic properties (e.g. stable, asymptotically stable, globally asymptotically stable). In certain instances it may happen that the dependence of these equations on the state variable is such that one may (1) alter that dependency by replacing part of the state variable by a function from a class having some of the above properties and (2) solve the 'reduced' equation for a solution having the remaining properties and lying in the same class. This then sets up a mapping Τ of the class into itself, thus reducing the original problem to one of finding a fixed point of the mapping. The procedure is applied to obtain a globally asymptotically stable periodic solution for a system of difference equations modeling the interaction of wild and genetically altered mosquitoes in an environment yielding periodic parameters. It is also shown that certain coupled periodic systems of difference equations may be completely decoupled so that the mapping Τ is established by solving a set of scalar equations. Periodic difference equations of extended Ricker type and also rational difference equations with a finite number of delays are also considered by reducing them to equations without delays but with a larger period. Conditions are given guaranteeing the existence and global asymptotic stability of periodic solutions.

Synchronization in networks with heterogeneous coupling delays

NASA Astrophysics Data System (ADS)

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.

An analysis of source structure effects in radio interferometry measurements

NASA Technical Reports Server (NTRS)

Thomas, J. B.

1980-01-01

To begin a study of structure effects, this report presents a theoretical framework, proposes an effective position approach to structure corrections based on brightness distribution measurements, and analyzes examples of analytical and measured brightness distributions. Other topics include the effect of the frequency dependence of a brightness distribution on bandwidth synthesis (BWS) delay, the determination of the absolute location of a measured brightness distribution, and structure effects in dual frequency calibration of charged particle delays. For the 10 measured distributions analyzed, it was found that the structure effect in BWS delay at X-band (3.6 cm) can reach 30 cm, but typically falls in the range of 0 to 5 cm. A trial limit equation that is dependent on visibility was successfully tested against the 10 measured brightness distributions (seven sources). If the validity of this particular equation for an upper limit can be established for nearly all sources, the structure effect in BWS delay could be greatly reduced without supplementary measurements of brightness distributions.

Unraveling mirror properties in time-delayed quantum feedback scenarios

NASA Astrophysics Data System (ADS)

Faulstich, Fabian M.; Kraft, Manuel; Carmele, Alexander

2018-06-01

We derive in the Heisenberg picture a widely used phenomenological coupling element to treat feedback effects in quantum optical platforms. Our derivation is based on a microscopic Hamiltonian, which describes the mirror-emitter dynamics based on a dielectric, a mediating fully quantized electromagnetic field and a single two-level system in front of the dielectric. The dielectric is modelled as a system of identical two-state atoms. The Heisenberg equation yields a system of describing differential operator equations, which we solve in the Weisskopf-Wigner limit. Due to a finite round-trip time between emitter and dielectric, we yield delay differential operator equations. Our derivation motivates and justifies the typical phenomenologicalassumed coupling element and allows, furthermore, a generalization to a variety of mirrors, such as dissipative mirrors or mirrors with gain dynamics.

Stability of the human respiratory control system. I. Analysis of a two-dimensional delay state-space model.

PubMed

Batzel, J J; Tran, H T

2000-07-01

A number of mathematical models of the human respiratory control system have been developed since 1940 to study a wide range of features of this complex system. Among them, periodic breathing (including Cheyne-Stokes respiration and apneustic breathing) is a collection of regular but involuntary breathing patterns that have important medical implications. The hypothesis that periodic breathing is the result of delay in the feedback signals to the respiratory control system has been studied since the work of Grodins et al. in the early 1950's [12]. The purpose of this paper is to study the stability characteristics of a feedback control system of five differential equations with delays in both the state and control variables presented by Khoo et al. [17] in 1991 for modeling human respiration. The paper is divided in two parts. Part I studies a simplified mathematical model of two nonlinear state equations modeling arterial partial pressures of O2 and CO2 and a peripheral controller. Analysis was done on this model to illuminate the effect of delay on the stability. It shows that delay dependent stability is affected by the controller gain, compartmental volumes and the manner in which changes in the ventilation rate is produced (i.e., by deeper breathing or faster breathing). In addition, numerical simulations were performed to validate analytical results. Part II extends the model in Part I to include both peripheral and central controllers. This, however, necessitates the introduction of a third state equation modeling CO2 levels in the brain. In addition to analytical studies on delay dependent stability, it shows that the decreased cardiac output (and hence increased delay) resulting from the congestive heart condition can induce instability at certain control gain levels. These analytical results were also confirmed by numerical simulations.

Stability of the human respiratory control system. II. Analysis of a three-dimensional delay state-space model.

PubMed

Batzel, J J; Tran, H T

2000-07-01

A number of mathematical models of the human respiratory control system have been developed since 1940 to study a wide range of features of this complex system. Among them, periodic breathing (including Cheyne-Stokes respiration and apneustic breathing) is a collection of regular but involuntary breathing patterns that have important medical implications. The hypothesis that periodic breathing is the result of delay in the feedback signals to the respiratory control system has been studied since the work of Grodins et al. in the early 1950's [1]. The purpose of this paper is to study the stability characteristics of a feedback control system of five differential equations with delays in both the state and control variables presented by Khoo et al. [4] in 1991 for modeling human respiration. The paper is divided in two parts. Part I studies a simplified mathematical model of two nonlinear state equations modeling arterial partial pressures of O2 and CO2 and a peripheral controller. Analysis was done on this model to illuminate the effect of delay on the stability. It shows that delay dependent stability is affected by the controller gain, compartmental volumes and the manner in which changes in the ventilation rate is produced (i.e., by deeper breathing or faster breathing). In addition, numerical simulations were performed to validate analytical results. Part II extends the model in Part I to include both peripheral and central controllers. This, however, necessitates the introduction of a third state equation modeling CO2 levels in the brain. In addition to analytical studies on delay dependent stability, it shows that the decreased cardiac output (and hence increased delay) resulting from the congestive heart condition can induce instability at certain control gain levels. These analytical results were also confirmed by numerical simulations.

Nuclear reactor with internal thimble-type delayed neutron detection system

DOEpatents

Gross, Kenny C.; Poloncsik, John; Lambert, John D. B.

1990-01-01

This invention teaches improved apparatus for the method of detecting a breach in cladded fuel used in a nuclear reactor. The detector apparatus is located in the primary heat exchanger which conveys part of the reactor coolant past at least three separate delayed-neutron detectors mounted in this heat exchanger. The detectors are spaced apart such that the coolant flow time from the core to each detector is different, and these differences are known. The delayed-neutron activity at the detectors is a function of the delay time after the reaction in the fuel until the coolant carrying the delayed-neutron emitter passes the respective detector. This time delay is broken down into separate components including an isotopic holdup time required for the emitter to move through the fuel from the reaction to the coolant at the breach, and two transit times required for the emitter now in the coolant to flow from the breach to the detector loop and then via the loop to the detector. At least two of these time components are determined during calibrated operation of the reactor. Thereafter during normal reactor operation, repeated comparisons are made by the method of regression approximation of the third time component for the best-fit line correlating measured delayed-neutron activity against activity that is approximated according to specific equations. The equations use these time-delay components and known parameter values of the fuel and of the part and emitting daughter isotopes.

Robotic reactions: delay-induced patterns in autonomous vehicle systems.

PubMed

Orosz, Gábor; Moehlis, Jeff; Bullo, Francesco

2010-02-01

Fundamental design principles are presented for vehicle systems governed by autonomous cruise control devices. By analyzing the corresponding delay differential equations, it is shown that for any car-following model short-wavelength oscillations can appear due to robotic reaction times, and that there are tradeoffs between the time delay and the control gains. The analytical findings are demonstrated on an optimal velocity model using numerical continuation and numerical simulation.

Robotic reactions: Delay-induced patterns in autonomous vehicle systems

NASA Astrophysics Data System (ADS)

Orosz, Gábor; Moehlis, Jeff; Bullo, Francesco

2010-02-01

Fundamental design principles are presented for vehicle systems governed by autonomous cruise control devices. By analyzing the corresponding delay differential equations, it is shown that for any car-following model short-wavelength oscillations can appear due to robotic reaction times, and that there are tradeoffs between the time delay and the control gains. The analytical findings are demonstrated on an optimal velocity model using numerical continuation and numerical simulation.

A differential delay equation arising from the sieve of Eratosthenes

NASA Astrophysics Data System (ADS)

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.

2–stage stochastic Runge–Kutta for stochastic delay differential equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rosli, Norhayati; Jusoh Awang, Rahimah; Bahar, Arifah

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.

Effect of remission definition on healthcare cost savings estimates for patients with rheumatoid arthritis treated with biologic therapies.

PubMed

Barnabe, Cheryl; Thanh, Nguyen Xuan; Ohinmaa, Arto; Homik, Joanne; Barr, Susan G; Martin, Liam; Maksymowych, Walter P

2014-08-01

Sustained remission in rheumatoid arthritis (RA) results in healthcare utilization cost savings. We evaluated the variation in estimates of savings when different definitions of remission [2011 American College of Rheumatology/European League Against Rheumatism Boolean Definition, Simplified Disease Activity Index (SDAI) ≤ 3.3, Clinical Disease Activity Index (CDAI) ≤ 2.8, and Disease Activity Score-28 (DAS28) ≤ 2.6] are applied. The annual mean healthcare service utilization costs were estimated from provincial physician billing claims, outpatient visits, and hospitalizations, with linkage to clinical data from the Alberta Biologics Pharmacosurveillance Program (ABioPharm). Cost savings in patients who had a 1-year continuous period of remission were compared to those who did not, using 4 definitions of remission. In 1086 patients, sustained remission rates were 16.1% for DAS28, 8.8% for Boolean, 5.5% for CDAI, and 4.2% for SDAI. The estimated mean annual healthcare cost savings per patient achieving remission (relative to not) were SDAI $1928 (95% CI 592, 3264), DAS28 $1676 (95% CI 987, 2365), and Boolean $1259 (95% CI 417, 2100). The annual savings by CDAI remission per patient were not significant at $423 (95% CI -1757, 2602). For patients in DAS28, Boolean, and SDAI remission, savings were seen both in costs directly related to RA and its comorbidities, and in costs for non-RA-related conditions. The magnitude of the healthcare cost savings varies according to the remission definition used in classifying patient disease status. The highest point estimate for cost savings was observed in patients attaining SDAI remission and the least with the CDAI; confidence intervals for these estimates do overlap. Future pharmacoeconomic analyses should employ all response definitions in assessing the influence of treatment.

Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach

NASA Astrophysics Data System (ADS)

Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru

2014-12-01

Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.

The DAS28-ESR cutoff value necessary to achieve remission under the new Boolean-based remission criteria in patients receiving tocilizumab.

PubMed

Hirabayashi, Yasuhiko; Ishii, Tomonori

2013-01-01

To seek the cutoff value of the 28-joint disease activity score using erythrocyte sedimentation rate (DAS28-ESR) that is necessary to achieve remission under the new Boolean-based criteria, we analyzed the data for 285 patients with rheumatoid arthritis registered between May 2008 and November 2009 by the Michinoku Tocilizumab Study Group and observed for 1 year after receiving tocilizumab (TCZ) in real clinical practice. Remission rates under the DAS28-ESR criteria and the Boolean criteria were assessed every 6 months after the first TCZ dose. The DAS28-ESR cutoff value necessary to achieve remission under the new criteria was analyzed by receiver operating characteristic (ROC) analysis. Data were analyzed using last observation carried forward. After 12 months of TCZ use, remission was achieved in 164 patients (57.5 %) by DAS28-ESR and 71 patients (24.9 %) under the new criteria for clinical trials. CRP levels scarcely affected remission rates, and the difference between remission rates defined by DAS28-ESR and by the new criteria was mainly due to patient global assessment (PGA). Improvement of PGA was inversely related to disease duration. ROC analysis revealed that the DAS28-ESR cutoff value necessary to predict remission under the new criteria for clinical trials was 1.54, with a sensitivity of 88.7 %, specificity of 85.5 %, positive predictive value of 67.0 %, and negative predictive value of 95.8 %. A DAS28-ESR cutoff value of 1.54 may be reasonable to predict achievement of remission under the new Boolean-based criteria for clinical trials in patients receiving TCZ.

Fitted Fourier-pseudospectral methods for solving a delayed reaction-diffusion partial differential equation in biology

NASA Astrophysics Data System (ADS)

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.

Stability and global Hopf bifurcation in a delayed food web consisting of a prey and two predators

NASA Astrophysics Data System (ADS)

Meng, Xin-You; Huo, Hai-Feng; Zhang, Xiao-Bing

2011-11-01

This paper is concerned with a predator-prey system with Holling II functional response and hunting delay and gestation. By regarding the sum of delays as the bifurcation parameter, the local stability of the positive equilibrium and the existence of Hopf bifurcation are investigated. We obtained explicit formulas to determine the properties of Hopf bifurcation by using the normal form method and center manifold theorem. Special attention is paid to the global continuation of local Hopf bifurcation. Using a global Hopf bifurcation result of Wu [Wu JH. Symmetric functional differential equations and neural networks with memory, Trans Amer Math Soc 1998;350:4799-4838] for functional differential equations, we may show the global existence of the periodic solutions. Finally, several numerical simulations illustrating the theoretical analysis are also given.

Ignition delay times of benzene and toluene with oxygen in argon mixtures

NASA Technical Reports Server (NTRS)

Burcat, A.; Snyder, C.; Brabbs, T.

1985-01-01

The ignition delay times of benzene and toluene with oxygen diluted in argon were investigated over a wide range of conditions. For benzene the concentration ranges were 0.42 to 1.69 percent fuel and 3.78 to 20.3 percent oxygen. The temperature range was 1212 to 1748 K and the reflected shock pressures were 1.7 to 7.89 atm. Statistical evaluation of the benzene experiments provided an overall equation which is given. For toluene the concentration ranges were 0.5 to 1.5 percent fuel and 4.48 to 13.45 percent oxygen. The temperature range was 1339 to 1797 K and the reflected shock pressures were 1.95 to 8.85 atm. The overall ignition delay equation for toluene after a statistical evaluation is also given. Detailed experimental information is provided.

Control-based method to identify underlying delays of a nonlinear dynamical system.

PubMed

Yu, Dongchuan; Frasca, Mattia; Liu, Fang

2008-10-01

We suggest several stationary state control-based delay identification methods which do not require any structural information about the controlled systems and are applicable to systems described by delayed ordinary differential equations. This proposed technique includes three steps: (i) driving a system to a steady state; (ii) perturbing the control signal for shifting the steady state; and (iii) identifying all delays by detecting the time that the system is abruptly drawn out of stationarity. Some aspects especially important for applications are discussed as well, including interaction delay identification, stationary state convergence speed, performance comparison, and the influence of noise on delay identification. Several examples are presented to illustrate the reliability and robustness of all delay identification methods suggested.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miyadera, Takayuki; Imai, Hideki; Graduate School of Science and Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551

This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloningmore » on effect algebras and hidden variables.« less

Computer Program Development Specification for Ada Integrated Environment. Ada Compiler Phases B5-AIE (1). COMP (1).

DTIC Science & Technology

1982-11-05

routines required by the Back End. 3.3 Detailed Functional Requirements 3.3.1 Front End 3.3.1.1 DRIVER The DRIVER is the primary user interface to the...Main 2. Exam ple" !.i ,, , ,vari able • id -: go for B Boolean Ai ’ A" ’ I type d 1 I , for Boolean I (from Standard) i I - - for A function i fuction ...TN in. If a TN cannot be allocated to the primary area of storage it needs(such as a register) it is allocated to the spill area reserved in the local

Concept locator: a client-server application for retrieval of UMLS metathesaurus concepts through complex boolean query.

PubMed

Nadkarni, P M

1997-08-01

Concept Locator (CL) is a client-server application that accesses a Sybase relational database server containing a subset of the UMLS Metathesaurus for the purpose of retrieval of concepts corresponding to one or more query expressions supplied to it. CL's query grammar permits complex Boolean expressions, wildcard patterns, and parenthesized (nested) subexpressions. CL translates the query expressions supplied to it into one or more SQL statements that actually perform the retrieval. The generated SQL is optimized by the client to take advantage of the strengths of the server's query optimizer, and sidesteps its weaknesses, so that execution is reasonably efficient.

A comparison of Boolean-based retrieval to the WAIS system for retrieval of aeronautical information

NASA Technical Reports Server (NTRS)

Marchionini, Gary; Barlow, Diane

1994-01-01

An evaluation of an information retrieval system using a Boolean-based retrieval engine and inverted file architecture and WAIS, which uses a vector-based engine, was conducted. Four research questions in aeronautical engineering were used to retrieve sets of citations from the NASA Aerospace Database which was mounted on a WAIS server and available through Dialog File 108 which served as the Boolean-based system (BBS). High recall and high precision searches were done in the BBS and terse and verbose queries were used in the WAIS condition. Precision values for the WAIS searches were consistently above the precision values for high recall BBS searches and consistently below the precision values for high precision BBS searches. Terse WAIS queries gave somewhat better precision performance than verbose WAIS queries. In every case, a small number of relevant documents retrieved by one system were not retrieved by the other, indicating the incomplete nature of the results from either retrieval system. Relevant documents in the WAIS searches were found to be randomly distributed in the retrieved sets rather than distributed by ranks. Advantages and limitations of both types of systems are discussed.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

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.

Intrinsic noise and deviations from criticality in Boolean gene-regulatory networks

NASA Astrophysics Data System (ADS)

Villegas, Pablo; Ruiz-Franco, José; Hidalgo, Jorge; Muñoz, Miguel A.

2016-10-01

Gene regulatory networks can be successfully modeled as Boolean networks. A much discussed hypothesis says that such model networks reproduce empirical findings the best if they are tuned to operate at criticality, i.e. at the borderline between their ordered and disordered phases. Critical networks have been argued to lead to a number of functional advantages such as maximal dynamical range, maximal sensitivity to environmental changes, as well as to an excellent tradeoff between stability and flexibility. Here, we study the effect of noise within the context of Boolean networks trained to learn complex tasks under supervision. We verify that quasi-critical networks are the ones learning in the fastest possible way -even for asynchronous updating rules- and that the larger the task complexity the smaller the distance to criticality. On the other hand, when additional sources of intrinsic noise in the network states and/or in its wiring pattern are introduced, the optimally performing networks become clearly subcritical. These results suggest that in order to compensate for inherent stochasticity, regulatory and other type of biological networks might become subcritical rather than being critical, all the most if the task to be performed has limited complexity.

On the number of different dynamics in Boolean networks with deterministic update schedules.

PubMed

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.

PubMed

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.

Boolean logic analysis for flow regime recognition of gas-liquid horizontal flow

NASA Astrophysics Data System (ADS)

Ramskill, Nicholas P.; Wang, Mi

2011-10-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.

Trajectory controllability of semilinear systems with multiple variable delays in control

DOE Office of Scientific and Technical Information (OSTI.GOV)

Klamka, Jerzy, E-mail: Jerzy.Klamka@polsl.pl, E-mail: Michal.Niezabitowski@polsl.pl; Niezabitowski, Michał, E-mail: Jerzy.Klamka@polsl.pl, E-mail: Michal.Niezabitowski@polsl.pl

In this paper, finite-dimensional dynamical control system described by semilinear differential state equation with multiple variable delays in control are considered. The concept of controllability we extend on trajectory controllability for systems with multiple point delays in control. Moreover, remarks and comments on the relationships between different concepts of controllability are presented. Finally, simple numerical example, which illustrates theoretical considerations is also given. The possible extensions are also proposed.

Transit and lifespan in neutrophil production: implications for drug intervention.

PubMed

Câmara De Souza, Daniel; Craig, Morgan; Cassidy, Tyler; Li, Jun; Nekka, Fahima; Bélair, Jacques; Humphries, Antony R

2018-02-01

A comparison of the transit compartment ordinary differential equation modelling approach to distributed and discrete delay differential equation models is studied by focusing on Quartino's extension to the Friberg transit compartment model of myelosuppression, widely relied upon in the pharmaceutical sciences to predict the neutrophil response after chemotherapy, and on a QSP delay differential equation model of granulopoiesis. An extension to the Quartino model is provided by considering a general number of transit compartments and introducing an extra parameter that allows for the decoupling of the maturation time from the production rate of cells. An overview of the well established linear chain technique, used to reformulate transit compartment models with constant transit rates as distributed delay differential equations (DDEs), is then given. A state-dependent time rescaling of the Quartino model is performed to apply the linear chain technique and rewrite the Quartino model as a distributed DDE, yielding a discrete DDE model in a certain parameter limit. Next, stability and bifurcation analyses are undertaken in an effort to situate such studies in a mathematical pharmacology context. We show that both the original Friberg and the Quartino extension models incorrectly define the mean maturation time, essentially treating the proliferative pool as an additional maturation compartment. This misspecification can have far reaching consequences on the development of future models of myelosuppression in PK/PD.

Ultimate boundedness stability and controllability of hereditary systems

NASA Technical Reports Server (NTRS)

Chukwu, E. N.

1979-01-01

By generalizing the Liapunov-Yoshizawa techniques, necessary and sufficient conditions are given for uniform boundedness and uniform ultimate boundedness of a rather general class of nonlinear differential equations of neutral type. Among the applications treated by the methods are the Lienard equation of neutral type and hereditary systems of Lurie type. The absolute stability of this later equation is also investigated. A certain existence result of a solution of a neutral functional differential inclusion with two point boundary values is applied to study the exact function space controllability of a nonlinear neutral functional differential control system. A geometric growth condition is used to characterize both the function space and Euclidean controllability of another nonlinear delay system which has a compact and convex control set. This yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Optimal control strategy for an impulsive stochastic competition system with time delays and jumps

NASA Astrophysics Data System (ADS)

Liu, Lidan; Meng, Xinzhu; Zhang, Tonghua

2017-07-01

Driven by both white and jump noises, a stochastic delayed model with two competitive species in a polluted environment is proposed and investigated. By using the comparison theorem of stochastic differential equations and limit superior theory, sufficient conditions for persistence in mean and extinction of two species are established. In addition, we obtain that the system is asymptotically stable in distribution by using ergodic method. Furthermore, the optimal harvesting effort and the maximum of expectation of sustainable yield (ESY) are derived from Hessian matrix method and optimal harvesting theory of differential equations. Finally, some numerical simulations are provided to illustrate the theoretical results.

Bistability and State Transition of a Delay Differential Equation Model of Neutrophil Dynamics

NASA Astrophysics Data System (ADS)

Ma, Suqi; Zhu, Kaiyi; Lei, Jinzhi

This paper studies the existence of bistable states and control strategies to induce state transitions of a delay differential equation model of neutrophil dynamics. We seek the conditions that a stable steady state and an oscillatory state coexist in the neutrophil dynamical system. Physiologically, stable steady state represents the healthy state, while oscillatory state is usually associated with diseases such as cyclical neutropenia. We study the control strategies to induce the transitions from the disease state to the healthy state by introducing temporal perturbations to system parameters. This study is valuable in designing clinical protocols for the treatment of cyclical neutropenia.

Solving delay differential equations in S-ADAPT by method of steps.

PubMed

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.

Wavefronts for a global reaction-diffusion population model with infinite distributed delay

NASA Astrophysics Data System (ADS)

Weng, Peixuan; Xu, Zhiting

2008-09-01

We consider a global reaction-diffusion population model with infinite distributed delay which includes models of Nicholson's blowflies and hematopoiesis derived by Gurney, Mackey and Glass, respectively. The existence of monotone wavefronts is derived by using the abstract settings of functional differential equations and Schauder fixed point theory.

Dynamical Behaviors in Complex-Valued Love Model With or Without Time Delays

NASA Astrophysics Data System (ADS)

Deng, Wei; Liao, Xiaofeng; Dong, Tao

2017-12-01

In this paper, a novel version of nonlinear model, i.e. a complex-valued love model with two time delays between two individuals in a love affair, has been proposed. A notable feature in this model is that we separate the emotion of one individual into real and imaginary parts to represent the variation and complexity of psychophysiological emotion in romantic relationship instead of just real domain, and make our model much closer to reality. This is because love is a complicated cognitive and social phenomenon, full of complexity, diversity and unpredictability, which refers to the coexistence of different aspects of feelings, states and attitudes ranging from joy and trust to sadness and disgust. By analyzing associated characteristic equation of linearized equations for our model, it is found that the Hopf bifurcation occurs when the sum of time delays passes through a sequence of critical value. Stability of bifurcating cyclic love dynamics is also derived by applying the normal form theory and the center manifold theorem. In addition, it is also shown that, for some appropriate chosen parameters, chaotic behaviors can appear even without time delay.

Supervised Learning of Two-Layer Perceptron under the Existence of External Noise — Learning Curve of Boolean Functions of Two Variables in Tree-Like Architecture —

NASA Astrophysics Data System (ADS)

Uezu, Tatsuya; Kiyokawa, Shuji

2016-06-01

We investigate the supervised batch learning of Boolean functions expressed by a two-layer perceptron with a tree-like structure. We adopt continuous weights (spherical model) and the Gibbs algorithm. We study the Parity and And machines and two types of noise, input and output noise, together with the noiseless case. We assume that only the teacher suffers from noise. By using the replica method, we derive the saddle point equations for order parameters under the replica symmetric (RS) ansatz. We study the critical value αC of the loading rate α above which the learning phase exists for cases with and without noise. We find that αC is nonzero for the Parity machine, while it is zero for the And machine. We derive the exponents barβ of order parameters expressed as (α - α C)bar{β} when α is near to αC. Furthermore, in the Parity machine, when noise exists, we find a spin glass solution, in which the overlap between the teacher and student vectors is zero but that between student vectors is nonzero. We perform Markov chain Monte Carlo simulations by simulated annealing and also by exchange Monte Carlo simulations in both machines. In the Parity machine, we study the de Almeida-Thouless stability, and by comparing theoretical and numerical results, we find that there exist parameter regions where the RS solution is unstable, and that the spin glass solution is metastable or unstable. We also study asymptotic learning behavior for large α and derive the exponents hat{β } of order parameters expressed as α - hat{β } when α is large in both machines. By simulated annealing simulations, we confirm these results and conclude that learning takes place for the input noise case with any noise amplitude and for the output noise case when the probability that the teacher's output is reversed is less than one-half.

Local Stability of AIDS Epidemic Model Through Treatment and Vertical Transmission with Time Delay

NASA Astrophysics Data System (ADS)

Novi W, Cascarilla; Lestari, Dwi

2016-02-01

This study aims to explain stability of the spread of AIDS through treatment and vertical transmission model. Human with HIV need a time to positively suffer AIDS. The existence of a time, human with HIV until positively suffer AIDS can be delayed for a time so that the model acquired is the model with time delay. The model form is a nonlinear differential equation with time delay, SIPTA (susceptible-infected-pre AIDS-treatment-AIDS). Based on SIPTA model analysis results the disease free equilibrium point and the endemic equilibrium point. The disease free equilibrium point with and without time delay are local asymptotically stable if the basic reproduction number is less than one. The endemic equilibrium point will be local asymptotically stable if the time delay is less than the critical value of delay, unstable if the time delay is more than the critical value of delay, and bifurcation occurs if the time delay is equal to the critical value of delay.

Hopf-Pitchfork Bifurcation in a Symmetrically Conservative Two-Mass System with Delay

NASA Astrophysics Data System (ADS)

Sun, Ye; Zhang, Chunrui; Cai, Yuting

2018-06-01

A symmetrically conservative two-mass system with time delay is considered here. We analyse the influence of interaction coefficient and time delay on the Hopf-pitchfork bifurcation. The bifurcation diagrams and phase portraits are then obtained by computing the normal forms for the system in which, particularly, the unfolding form for case III is seldom given in delayed differential equations. Furthermore, we also find some interesting dynamical behaviours of the original system, such as the coexistence of two stable non-trivial equilibria and a pair of stable periodic orbits, which are verified both theoretically and numerically.

Stability and bifurcation analysis for the Kaldor-Kalecki model with a discrete delay and a distributed delay

NASA Astrophysics Data System (ADS)

Yu, Jinchen; Peng, Mingshu

2016-10-01

In this paper, a Kaldor-Kalecki model of business cycle with both discrete and distributed delays is considered. With the corresponding characteristic equation analyzed, the local stability of the positive equilibrium is investigated. It is found that there exist Hopf bifurcations when the discrete time delay passes a sequence of critical values. By applying the method of multiple scales, the explicit formulae which determine the direction of Hopf bifurcation and the stability of bifurcating periodic solutions are derived. Finally, numerical simulations are carried out to illustrate our main results.

Analysis of an age structured model for tick populations subject to seasonal effects

NASA Astrophysics Data System (ADS)

Liu, Kaihui; Lou, Yijun; Wu, Jianhong

2017-08-01

We investigate an age-structured hyperbolic equation model by allowing the birth and death functions to be density dependent and periodic in time with the consideration of seasonal effects. By studying the integral form solution of this general hyperbolic equation obtained through the method of integration along characteristics, we give a detailed proof of the uniqueness and existence of the solution in light of the contraction mapping theorem. With additional biologically natural assumptions, using the tick population growth as a motivating example, we derive an age-structured model with time-dependent periodic maturation delays, which is quite different from the existing population models with time-independent maturation delays. For this periodic differential system with seasonal delays, the basic reproduction number R0 is defined as the spectral radius of the next generation operator. Then, we show the tick population tends to die out when R0 < 1 while remains persistent if R0 > 1. When there is no intra-specific competition among immature individuals due to the sufficient availability of immature tick hosts, the global stability of the positive periodic state for the whole model system of four delay differential equations can be obtained with the observation that a scalar subsystem for the adult stage size can be decoupled. The challenge for the proof of such a global stability result can be overcome by introducing a new phase space, based on which, a periodic solution semiflow can be defined which is eventually strongly monotone and strictly subhomogeneous.

Maximum profile likelihood estimation of differential equation parameters through model based smoothing state estimates.

PubMed

Campbell, D A; Chkrebtii, O

2013-12-01

Statistical inference for biochemical models often faces a variety of characteristic challenges. In this paper we examine state and parameter estimation for the JAK-STAT intracellular signalling mechanism, which exemplifies the implementation intricacies common in many biochemical inference problems. We introduce an extension to the Generalized Smoothing approach for estimating delay differential equation models, addressing selection of complexity parameters, choice of the basis system, and appropriate optimization strategies. Motivated by the JAK-STAT system, we further extend the generalized smoothing approach to consider a nonlinear observation process with additional unknown parameters, and highlight how the approach handles unobserved states and unevenly spaced observations. The methodology developed is generally applicable to problems of estimation for differential equation models with delays, unobserved states, nonlinear observation processes, and partially observed histories. Crown Copyright © 2013. Published by Elsevier Inc. All rights reserved.

Boolean function applied to Mimosa pudica movements.

PubMed

De Luccia, Thiago Paes de Barros; Friedman, Pedro

2011-09-01

Seismonastic or thigmonastic movements of Mimosa pudica L. is mostly because of the fast loss of water from swollen motor cells, resulting in temporary collapse of cells and quick curvature in the parts where these cells are located. Because of this, the plant has been much studied since the 18th century, leading us to think about the classical binomial stimulus-response (action-reaction) when compared to animals. Mechanic and electrical stimuli were used to investigate the analogy of mimosa branch with an artificial neuron model and to observe the action potential propagation through the mimosa branch. Boolean function applied to the mimosa branch in analogy with an artificial neuron model is one of the peculiarities of our hypothesis.

Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Y.; Zhong, Y. P.; Deng, Y. F.

2013-12-21

Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices.

Questions Revisited: A Close Examination of Calculus of Inference and Inquiry

NASA Technical Reports Server (NTRS)

Knuth, Kevin H.; Koga, Dennis (Technical Monitor)

2003-01-01

In this paper I examine more closely the way in which probability theory, the calculus of inference, is derived from the Boolean lattice structure of logical assertions ordered by implication. I demonstrate how the duality between the logical conjunction and disjunction in Boolean algebra is lost when deriving the probability calculus. In addition, I look more closely at the other lattice identities to verify that they are satisfied by the probability calculus. Last, I look towards developing the calculus of inquiry demonstrating that there is a sum and product rule for the relevance measure as well as a Bayes theorem. Current difficulties in deriving the complete inquiry calculus will also be discussed.

Optical reversible programmable Boolean logic unit.

PubMed

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.

A sparse matrix algorithm on the Boolean vector machine

NASA Technical Reports Server (NTRS)

Wagner, Robert A.; Patrick, Merrell L.

1988-01-01

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

NASA Astrophysics Data System (ADS)

Zengler, Christoph; Küchlin, Wolfgang

We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra system Reduce to extend the SAT solver MiniSAT with Gröbner basis learning. Our approach shows a significant reduction of conflicts and a reduction of restarts and computation time on many hard problems from the SAT 2009 competition.

Adaptation and survivors in a random Boolean network.

PubMed

Nakamura, Ikuo

2002-04-01

We introduce the competitive agent with imitation strategy in a random Boolean network, in which the agent plays a competitive game that rewards those in minority. After a long time interval, the worst performer changes its strategy to the one of the best and the process is repeated. The network, initially in a chaotic state, evolves to an intermittent state and finally reaches a frozen state. Time series of survived species (whose strategies are imitated by other agents) in the system depend on the connectivity of each agent. In a system with various connectivity groups, the low connectivity groups win the minority game over the high connectivity groups. We also compared the result with mutation strategy system.

Exact synchronization bound for coupled time-delay systems.

PubMed

Senthilkumar, D V; Pesquera, Luis; Banerjee, Santo; Ortín, Silvia; Kurths, J

2013-04-01

We obtain an exact bound for synchronization in coupled time-delay systems using the generalized Halanay inequality for the general case of time-dependent delay, coupling, and coefficients. Furthermore, we show that the same analysis is applicable to both uni- and bidirectionally coupled time-delay systems with an appropriate evolution equation for their synchronization manifold, which can also be defined for different types of synchronization. The exact synchronization bound assures an exponential stabilization of the synchronization manifold which is crucial for applications. The analytical synchronization bound is independent of the nature of the modulation and can be applied to any time-delay system satisfying a Lipschitz condition. The analytical results are corroborated numerically using the Ikeda system.

The Statistical Mechanics of Dilute, Disordered Systems

NASA Astrophysics Data System (ADS)

Blackburn, Roger Michael

Available from UMI in association with The British Library. Requires signed TDF. A graph partitioning problem with variable inter -partition costs is studied by exploiting its mapping on to the Ashkin-Teller spin glass. The cavity method is used to derive the TAP equations and free energy for both extensively connected and dilute systems. Unlike Ising and Potts spin glasses, the self-consistent equation for the distribution of effective fields does not have a solution solely made up of delta functions. Numerical integration is used to find the stable solution, from which the ground state energy is calculated. Simulated annealing is used to test the results. The retrieving activity distribution for networks of boolean functions trained as associative memories for optimal capacity is derived. For infinite networks, outputs are shown to be frozen, in contrast to dilute asymmetric networks trained with the Hebb rule. For finite networks, a steady leaking to the non-retrieving attractor is demonstrated. Simulations of quenched networks are reported which show a departure from this picture: some configurations remain frozen for all time, while others follow cycles of small periods. An estimate of the critical capacity from the simulations is found to be in broad agreement with recent analytical results. The existing theory is extended to include noise on recall, and the behaviour is found to be robust to noise up to order 1/c^2 for networks with connectivity c.

Scalable analysis of nonlinear systems using convex optimization

NASA Astrophysics Data System (ADS)

Papachristodoulou, Antonis

In this thesis, we investigate how convex optimization can be used to analyze different classes of nonlinear systems at various scales algorithmically. The methodology is based on the construction of appropriate Lyapunov-type certificates using sum of squares techniques. After a brief introduction on the mathematical tools that we will be using, we turn our attention to robust stability and performance analysis of systems described by Ordinary Differential Equations. A general framework for constrained systems analysis is developed, under which stability of systems with polynomial, non-polynomial vector fields and switching systems, as well estimating the region of attraction and the L2 gain can be treated in a unified manner. We apply our results to examples from biology and aerospace. We then consider systems described by Functional Differential Equations (FDEs), i.e., time-delay systems. Their main characteristic is that they are infinite dimensional, which complicates their analysis. We first show how the complete Lyapunov-Krasovskii functional can be constructed algorithmically for linear time-delay systems. Then, we concentrate on delay-independent and delay-dependent stability analysis of nonlinear FDEs using sum of squares techniques. An example from ecology is given. The scalable stability analysis of congestion control algorithms for the Internet is investigated next. The models we use result in an arbitrary interconnection of FDE subsystems, for which we require that stability holds for arbitrary delays, network topologies and link capacities. Through a constructive proof, we develop a Lyapunov functional for FAST---a recently developed network congestion control scheme---so that the Lyapunov stability properties scale with the system size. We also show how other network congestion control schemes can be analyzed in the same way. Finally, we concentrate on systems described by Partial Differential Equations. We show that axially constant perturbations of the Navier-Stokes equations for Hagen-Poiseuille flow are globally stable, even though the background noise is amplified as R3 where R is the Reynolds number, giving a 'robust yet fragile' interpretation. We also propose a sum of squares methodology for the analysis of systems described by parabolic PDEs. We conclude this work with an account for future research.

Phase transition of Boolean networks with partially nested canalizing functions

NASA Astrophysics Data System (ADS)

Jansen, Kayse; Matache, Mihaela Teodora

2013-07-01

We generate the critical condition for the phase transition of a Boolean network governed by partially nested canalizing functions for which a fraction of the inputs are canalizing, while the remaining non-canalizing inputs obey a complementary threshold Boolean function. Past studies have considered the stability of fully or partially nested canalizing functions paired with random choices of the complementary function. In some of those studies conflicting results were found with regard to the presence of chaotic behavior. Moreover, those studies focus mostly on ergodic networks in which initial states are assumed equally likely. We relax that assumption and find the critical condition for the sensitivity of the network under a non-ergodic scenario. We use the proposed mathematical model to determine parameter values for which phase transitions from order to chaos occur. We generate Derrida plots to show that the mathematical model matches the actual network dynamics. The phase transition diagrams indicate that both order and chaos can occur, and that certain parameters induce a larger range of values leading to order versus chaos. The edge-of-chaos curves are identified analytically and numerically. It is shown that the depth of canalization does not cause major dynamical changes once certain thresholds are reached; these thresholds are fairly small in comparison to the connectivity of the nodes.

Development of a computer-aided design software for dental splint in orthognathic surgery

NASA Astrophysics Data System (ADS)

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-12-01

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated.

Toward using games to teach fundamental computer science concepts

NASA Astrophysics Data System (ADS)

Edgington, Jeffrey Michael

Video and computer games have become an important area of study in the field of education. Games have been designed to teach mathematics, physics, raise social awareness, teach history and geography, and train soldiers in the military. Recent work has created computer games for teaching computer programming and understanding basic algorithms. We present an investigation where computer games are used to teach two fundamental computer science concepts: boolean expressions and recursion. The games are intended to teach the concepts and not how to implement them in a programming language. For this investigation, two computer games were created. One is designed to teach basic boolean expressions and operators and the other to teach fundamental concepts of recursion. We describe the design and implementation of both games. We evaluate the effectiveness of these games using before and after surveys. The surveys were designed to ascertain basic understanding, attitudes and beliefs regarding the concepts. The boolean game was evaluated with local high school students and students in a college level introductory computer science course. The recursion game was evaluated with students in a college level introductory computer science course. We present the analysis of the collected survey information for both games. This analysis shows a significant positive change in student attitude towards recursion and modest gains in student learning outcomes for both topics.

Development of a computer-aided design software for dental splint in orthognathic surgery

PubMed Central

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-01-01

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated. PMID:27966601

Development of a computer-aided design software for dental splint in orthognathic surgery.

PubMed

Chen, Xiaojun; Li, Xing; Xu, Lu; Sun, Yi; Politis, Constantinus; Egger, Jan

2016-12-14

In the orthognathic surgery, dental splints are important and necessary to help the surgeon reposition the maxilla or mandible. However, the traditional methods of manual design of dental splints are difficult and time-consuming. The research on computer-aided design software for dental splints is rarely reported. Our purpose is to develop a novel special software named EasySplint to design the dental splints conveniently and efficiently. The design can be divided into two steps, which are the generation of initial splint base and the Boolean operation between it and the maxilla-mandibular model. The initial splint base is formed by ruled surfaces reconstructed using the manually picked points. Then, a method to accomplish Boolean operation based on the distance filed of two meshes is proposed. The interference elimination can be conducted on the basis of marching cubes algorithm and Boolean operation. The accuracy of the dental splint can be guaranteed since the original mesh is utilized to form the result surface. Using EasySplint, the dental splints can be designed in about 10 minutes and saved as a stereo lithography (STL) file for 3D printing in clinical applications. Three phantom experiments were conducted and the efficiency of our method was demonstrated.

Bounds on the number of hidden neurons in three-layer binary neural networks.

PubMed

Zhang, Zhaozhi; Ma, Xiaomin; Yang, Yixian

2003-09-01

This paper investigates an important problem concerning the complexity of three-layer binary neural networks (BNNs) with one hidden layer. The neuron in the studied BNNs employs a hard limiter activation function with only integer weights and an integer threshold. The studies are focused on implementations of arbitrary Boolean functions which map from [0, 1]n into [0, 1]. A deterministic algorithm called set covering algorithm (SCA) is proposed for the construction of a three-layer BNN to implement an arbitrary Boolean function. The SCA is based on a unit sphere covering (USC) of the Hamming space (HS) which is chosen in advance. It is proved that for the implementation of an arbitrary Boolean function of n-variables (n > or = 3) by using SCA, [3L/2] hidden neurons are necessary and sufficient, where L is the number of unit spheres contained in the chosen USC of the n-dimensional HS. It is shown that by using SCA, the number of hidden neurons required is much less than that by using a two-parallel hyperplane method. In order to indicate the potential ability of three-layer BNNs, a lower bound on the required number of hidden neurons which is derived by using the method of estimating the Vapnik-Chervonenkis (VC) dimension is also given.

Application of Time-Delay Absorber to Suppress Vibration of a Dynamical System to Tuned Excitation.

PubMed

El-Ganaini, W A A; El-Gohary, H A

2014-08-01

In this work, we present a comprehensive investigation of the time delay absorber effects on the control of a dynamical system represented by a cantilever beam subjected to tuned excitation forces. Cantilever beam is one of the most widely used system in too many engineering applications, such as mechanical and civil engineering. The main aim of this work is to control the vibration of the beam at simultaneous internal and combined resonance condition, as it is the worst resonance case. Control is conducted via time delay absorber to suppress chaotic vibrations. Time delays often appear in many control systems in the state, in the control input, or in the measurements. Time delay commonly exists in various engineering, biological, and economical systems because of the finite speed of the information processing. It is a source of performance degradation and instability. Multiple time scale perturbation method is applied to obtain a first order approximation for the nonlinear differential equations describing the system behavior. The different resonance cases are reported and studied numerically. The stability of the steady-state solution at the selected worst resonance case is investigated applying Runge-Kutta fourth order method and frequency response equations via Matlab 7.0 and Maple11. Time delay absorber is effective, but within a specified range of time delay. It is the critical factor in selecting such absorber. Time delay absorber is better than the ordinary one as from the effectiveness point of view. The effects of the different absorber parameters on the system behavior and stability are studied numerically. A comparison with the available published work showed a close agreement with some previously published work.

Structural Properties and Estimation of Delay Systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Kwong, R. H. S.

1975-01-01

Two areas in the theory of delay systems were studied: structural properties and their applications to feedback control, and optimal linear and nonlinear estimation. The concepts of controllability, stabilizability, observability, and detectability were investigated. The property of pointwise degeneracy of linear time-invariant delay systems is considered. Necessary and sufficient conditions for three dimensional linear systems to be made pointwise degenerate by delay feedback were obtained, while sufficient conditions for this to be possible are given for higher dimensional linear systems. These results were applied to obtain solvability conditions for the minimum time output zeroing control problem by delay feedback. A representation theorem is given for conditional moment functionals of general nonlinear stochastic delay systems, and stochastic differential equations are derived for conditional moment functionals satisfying certain smoothness properties.

Incorporating time-delays in S-System model for reverse engineering genetic networks.

PubMed

Chowdhury, Ahsan Raja; Chetty, Madhu; Vinh, Nguyen Xuan

2013-06-18

In any gene regulatory network (GRN), the complex interactions occurring amongst transcription factors and target genes can be either instantaneous or time-delayed. However, many existing modeling approaches currently applied for inferring GRNs are unable to represent both these interactions simultaneously. As a result, all these approaches cannot detect important interactions of the other type. S-System model, a differential equation based approach which has been increasingly applied for modeling GRNs, also suffers from this limitation. In fact, all S-System based existing modeling approaches have been designed to capture only instantaneous interactions, and are unable to infer time-delayed interactions. In this paper, we propose a novel Time-Delayed S-System (TDSS) model which uses a set of delay differential equations to represent the system dynamics. The ability to incorporate time-delay parameters in the proposed S-System model enables simultaneous modeling of both instantaneous and time-delayed interactions. Furthermore, the delay parameters are not limited to just positive integer values (corresponding to time stamps in the data), but can also take fractional values. Moreover, we also propose a new criterion for model evaluation exploiting the sparse and scale-free nature of GRNs to effectively narrow down the search space, which not only reduces the computation time significantly but also improves model accuracy. The evaluation criterion systematically adapts the max-min in-degrees and also systematically balances the effect of network accuracy and complexity during optimization. The four well-known performance measures applied to the experimental studies on synthetic networks with various time-delayed regulations clearly demonstrate that the proposed method can capture both instantaneous and delayed interactions correctly with high precision. The experiments carried out on two well-known real-life networks, namely IRMA and SOS DNA repair network in Escherichia coli show a significant improvement compared with other state-of-the-art approaches for GRN modeling.

Global exponential synchronization of inertial memristive neural networks with time-varying delay via nonlinear controller.

PubMed

Gong, Shuqing; Yang, Shaofu; Guo, Zhenyuan; Huang, Tingwen

2018-06-01

The paper is concerned with the synchronization problem of inertial memristive neural networks with time-varying delay. First, by choosing a proper variable substitution, inertial memristive neural networks described by second-order differential equations can be transformed into first-order differential equations. Then, a novel controller with a linear diffusive term and discontinuous sign term is designed. By using the controller, the sufficient conditions for assuring the global exponential synchronization of the derive and response neural networks are derived based on Lyapunov stability theory and some inequality techniques. Finally, several numerical simulations are provided to substantiate the effectiveness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

The value of less connected agents in Boolean networks

NASA Astrophysics Data System (ADS)

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 that help to see how agents are organized.

Stabilization of perturbed Boolean network attractors through compensatory interactions

PubMed Central

2014-01-01

Background Understanding and ameliorating the effects of network damage are of significant interest, due in part to the variety of applications in which network damage is relevant. For example, the effects of genetic mutations can cascade through within-cell signaling and regulatory networks and alter the behavior of cells, possibly leading to a wide variety of diseases. The typical approach to mitigating network perturbations is to consider the compensatory activation or deactivation of system components. Here, we propose a complementary approach wherein interactions are instead modified to alter key regulatory functions and prevent the network damage from triggering a deregulatory cascade. Results We implement this approach in a Boolean dynamic framework, which has been shown to effectively model the behavior of biological regulatory and signaling networks. We show that the method can stabilize any single state (e.g., fixed point attractors or time-averaged representations of multi-state attractors) to be an attractor of the repaired network. We show that the approach is minimalistic in that few modifications are required to provide stability to a chosen attractor and specific in that interventions do not have undesired effects on the attractor. We apply the approach to random Boolean networks, and further show that the method can in some cases successfully repair synchronous limit cycles. We also apply the methodology to case studies from drought-induced signaling in plants and T-LGL leukemia and find that it is successful in both stabilizing desired behavior and in eliminating undesired outcomes. Code is made freely available through the software package BooleanNet. Conclusions The methodology introduced in this report offers a complementary way to manipulating node expression levels. A comprehensive approach to evaluating network manipulation should take an "all of the above" perspective; we anticipate that theoretical studies of interaction modification, coupled with empirical advances, will ultimately provide researchers with greater flexibility in influencing system behavior. PMID:24885780

Disparity between ultrasound and clinical findings in psoriatic arthritis.

PubMed

Husic, Rusmir; Gretler, Judith; Felber, Anja; Graninger, Winfried B; Duftner, Christina; Hermann, Josef; Dejaco, Christian

2014-08-01

To investigate the association between psoriatic arthritis (PsA)-specific clinical composite scores and ultrasound-verified pathology as well as comparison of clinical and ultrasound definitions of remission. We performed a prospective study on 70 consecutive PsA patients. Clinical assessments included components of Disease Activity Index for Psoriatic Arthritis (DAPSA) and the Composite Psoriatic Disease Activity Index (CPDAI). Minimal disease activity (MDA) and the following remission criteria were applied: CPDAI joint, entheses and dactylitis domains (CPDAI-JED)=0, DAPSA≤3.3, Boolean's remission definition and physician-judged remission (rem-phys). B-mode and power Doppler (PD-) ultrasound findings were semiquantitatively scored at 68 joints (evaluating synovia, peritendinous tissue, tendons and bony changes) and 14 entheses. Ultrasound remission and minimal ultrasound disease activity (MUDA) were defined as PD-score=0 and PD-score ≤1, respectively, at joints, peritendinous tissue, tendons and entheses. DAPSA but not CPDAI correlated with B-mode and PD-synovitis. Ultrasound signs of enthesitis, dactylitis, tenosynovitis and perisynovitis were not linked with clinical composites. Clinical remission or MDA was observed in 15.7% to 47.1% of PsA patients. Ultrasound remission and MUDA were present in 4.3% and 20.0% of patients, respectively. Joint and tendon-related PD-scores were higher in patients with active versus inactive disease according to CPDAI-JED, DAPSA, Boolean's and rem-phys, whereas no difference was observed regarding enthesitis and perisynovitis. DAPSA≤3.3 (OR 3.9, p=0.049) and Boolean's definition (OR 4.6, p=0.03) were more useful to predict MUDA than other remission criteria. PsA-specific composite scores partially reflect ultrasound findings. DAPSA and Boolean's remission definitions better identify MUDA patients than other clinical criteria. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

Solutions for the diurnally forced advection-diffusion equation to estimate bulk fluid velocity and diffusivity in streambeds from temperature time series

NASA Astrophysics Data System (ADS)

Luce, C.; Tonina, D.; Gariglio, F. P.; Applebee, R.

2012-12-01

Differences in the diurnal variations of temperature at different depths in streambed sediments are commonly used for estimating vertical fluxes of water in the streambed. We applied spatial and temporal rescaling of the advection-diffusion equation to derive two new relationships that greatly extend the kinds of information that can be derived from streambed temperature measurements. The first equation provides a direct estimate of the Peclet number from the amplitude decay and phase delay information. The analytical equation is explicit (e.g. no numerical root-finding is necessary), and invertable. The thermal front velocity can be estimated from the Peclet number when the thermal diffusivity is known. The second equation allows for an independent estimate of the thermal diffusivity directly from the amplitude decay and phase delay information. Several improvements are available with the new information. The first equation uses a ratio of the amplitude decay and phase delay information; thus Peclet number calculations are independent of depth. The explicit form also makes it somewhat faster and easier to calculate estimates from a large number of sensors or multiple positions along one sensor. Where current practice requires a priori estimation of streambed thermal diffusivity, the new approach allows an independent calculation, improving precision of estimates. Furthermore, when many measurements are made over space and time, expectations of the spatial correlation and temporal invariance of thermal diffusivity are valuable for validation of measurements. Finally, the closed-form explicit solution allows for direct calculation of propagation of uncertainties in error measurements and parameter estimates, providing insight about error expectations for sensors placed at different depths in different environments as a function of surface temperature variation amplitudes. The improvements are expected to increase the utility of temperature measurement methods for studying groundwater-surface water interactions across space and time scales. We discuss the theoretical implications of the new solutions supported by examples with data for illustration and validation.

Apparatus for and method of monitoring for breached fuel elements

DOEpatents

Gross, Kenny C.; Strain, Robert V.

1983-01-01

This invention teaches improved apparatus for the method of detecting a breach in cladded fuel used in a nuclear reactor. The detector apparatus uses a separate bypass loop for conveying part of the reactor coolant away from the core, and at least three separate delayed-neutron detectors mounted proximate this detector loop. The detectors are spaced apart so that the coolant flow time from the core to each detector is different, and these differences are known. The delayed-neutron activity at the detectors is a function of the dealy time after the reaction in the fuel until the coolant carrying the delayed-neutron emitter passes the respective detector. This time delay is broken down into separate components including an isotopic holdup time required for the emitter to move through the fuel from the reaction to the coolant at the breach, and two transit times required for the emitter now in the coolant to flow from the breach to the detector loop and then via the loop to the detector. At least two of these time components are determined during calibrated operation of the reactor. Thereafter during normal reactor operation, repeated comparisons are made by the method of regression approximation of the third time component for the best-fit line correlating measured delayed-neutron activity against activity that is approximated according to specific equations. The equations use these time-delay components and known parameter values of the fuel and of the part and emitting daughter isotopes.

Using delay differential equations to induce alternans in a model of cardiac electrophysiology.

PubMed

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.

Estimation of nonlinear pilot model parameters including time delay.

NASA Technical Reports Server (NTRS)

Schiess, J. R.; Roland, V. R.; Wells, W. R.

1972-01-01

Investigation of the feasibility of using a Kalman filter estimator for the identification of unknown parameters in nonlinear dynamic systems with a time delay. The problem considered is the application of estimation theory to determine the parameters of a family of pilot models containing delayed states. In particular, the pilot-plant dynamics are described by differential-difference equations of the retarded type. The pilot delay, included as one of the unknown parameters to be determined, is kept in pure form as opposed to the Pade approximations generally used for these systems. Problem areas associated with processing real pilot response data are included in the discussion.

Period locking due to delayed feedback in a laser with saturable absorber.

PubMed

Carr, T W

2003-08-01

We consider laser with saturable absorber operating in the pulsating regime that is subject to delayed feedback. Alone, both the saturable absorber and delayed feedback cause the clockwise output to become unstable to periodic output via Hopf bifurcations. The delay feedback causes the laser pulse period to lock to an integer fraction of the feedback time. We derive a map from the original model to describe the periodic pulsations of the laser. Equations for the period of the laser predict the occurrence of the different locking states as well as the value of the pump when there is a switch between the locked states.

Delay-induced stochastic bifurcations in a bistable system under white noise

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sun, Zhongkui, E-mail: sunzk@nwpu.edu.cn; Fu, Jin; Xu, Wei

2015-08-15

In this paper, the effects of noise and time delay on stochastic bifurcations are investigated theoretically and numerically in a time-delayed Duffing-Van der Pol oscillator subjected to white noise. Due to the time delay, the random response is not Markovian. Thereby, approximate methods have been adopted to obtain the Fokker-Planck-Kolmogorov equation and the stationary probability density function for amplitude of the response. Based on the knowledge that stochastic bifurcation is characterized by the qualitative properties of the steady-state probability distribution, it is found that time delay and feedback intensity as well as noise intensity will induce the appearance of stochasticmore » P-bifurcation. Besides, results demonstrated that the effects of the strength of the delayed displacement feedback on stochastic bifurcation are accompanied by the sensitive dependence on time delay. Furthermore, the results from numerical simulations best confirm the effectiveness of the theoretical analyses.« less

Land Use, Land Conservation, and Wind Energy Development Outcomes in New England

NASA Astrophysics Data System (ADS)

Weimar, William Cameron

This dissertation provides three independent research inquiries. The first examines how inter-governmental policy, site-specific, and social factors lead to the success, prolonged delay, or failure of inland wind power projects in New England. The three case studies examined include the 48 megawatt Glebe Mountain Wind Farm proposal in southern Vermont, the 30 megawatt Hoosac Wind Farm in western Massachusetts, and the 24 megawatt Lempster Wind Farm in southern New Hampshire. To ascertain why the project outcomes varied, 45 semi-structured interviews were conducted with a range of stakeholders, including wind development firms, utility companies, state regulatory agencies, regional planning commissions, town officials, land conservation organizations, and opposition groups. The second study establishes a comprehensive set of thirty-seven explanatory variables to determine the amount of suitable land and the corresponding electricity generation potential within the prime wind resource areas of Western Massachusetts. The explanatory variables are incorporated into Boolean GIS suitability models which represent the two divergent positions towards wind power development in Massachusetts, and a third, balanced model. The third study determines that exurban residential development is not the only land use factor that reduces wind power development potential in Western Massachusetts. A set of Boolean GIS models for 1985 and 2009 find the onset of conservation easements on private lands having the largest impact. During this 25 year period a combination of land use conversion and land conservation has reduced the access to prime wind resource areas by 18% (11,601 hectares), an equivalent loss of 5,800--8,700 GWh/year of zero carbon electricity generation. The six main findings from this research are: (1) Visual aesthetics remain the main factor of opposition to specific projects; (2) The Not-in-my Backyard debate for wind power remains unsettled; (3) Widespread support exists for regional land use energy plans; (4) The wind resources of Western Massachusetts can significantly contribute to the state's current renewable portfolio standard while balancing conservation and renewable energy development objectives; However, (5) a combination of exurban residential development and conservation easements significantly reduces wind power development potential over time; and (6) a need exists to legally define wind as a publicly beneficial resource.

Hopf Bifurcation Analysis of a Gene Regulatory Network Mediated by Small Noncoding RNA with Time Delays and Diffusion

NASA Astrophysics Data System (ADS)

Li, Chengxian; Liu, Haihong; Zhang, Tonghua; Yan, Fang

2017-12-01

In this paper, a gene regulatory network mediated by small noncoding RNA involving two time delays and diffusion under the Neumann boundary conditions is studied. Choosing the sum of delays as the bifurcation parameter, the stability of the positive equilibrium and the existence of spatially homogeneous and spatially inhomogeneous periodic solutions are investigated by analyzing the corresponding characteristic equation. It is shown that the sum of delays can induce Hopf bifurcation and the diffusion incorporated into the system can effect the amplitude of periodic solutions. Furthermore, the spatially homogeneous periodic solution always exists and the spatially inhomogeneous periodic solution will arise when the diffusion coefficients of protein and mRNA are suitably small. Particularly, the small RNA diffusion coefficient is more robust and its effect on model is much less than protein and mRNA. Finally, the explicit formulae for determining the direction of Hopf bifurcation and the stability of the bifurcating periodic solutions are derived by employing the normal form theory and center manifold theorem for partial functional differential equations. Finally, numerical simulations are carried out to illustrate our theoretical analysis.

Burst wait time simulation of CALIBAN reactor at delayed super-critical state

DOE Office of Scientific and Technical Information (OSTI.GOV)

Humbert, P.; Authier, N.; Richard, B.

2012-07-01

In the past, the super prompt critical wait time probability distribution was measured on CALIBAN fast burst reactor [4]. Afterwards, these experiments were simulated with a very good agreement by solving the non-extinction probability equation [5]. Recently, the burst wait time probability distribution has been measured at CEA-Valduc on CALIBAN at different delayed super-critical states [6]. However, in the delayed super-critical case the non-extinction probability does not give access to the wait time distribution. In this case it is necessary to compute the time dependent evolution of the full neutron count number probability distribution. In this paper we present themore » point model deterministic method used to calculate the probability distribution of the wait time before a prescribed count level taking into account prompt neutrons and delayed neutron precursors. This method is based on the solution of the time dependent adjoint Kolmogorov master equations for the number of detections using the generating function methodology [8,9,10] and inverse discrete Fourier transforms. The obtained results are then compared to the measurements and Monte-Carlo calculations based on the algorithm presented in [7]. (authors)« less

Boolean function applied to Mimosa pudica movements

PubMed Central

Friedman, Pedro

2011-01-01

Seismonastic or thigmonastic movements of Mimosa pudica L. is mostly because of the fast loss of water from swollen motor cells, resulting in temporary collapse of cells and quick curvature in the parts where these cells are located. Because of this, the plant has been much studied since the 18th century, leading us to think about the classical binomial stimulus-response (action-reaction) when compared to animals. Mechanic and electrical stimuli were used to investigate the analogy of mimosa branch with an artificial neuron model and to observe the action potential propagation through the mimosa branch. Boolean function applied to the mimosa branch in analogy with an artificial neuron model is one of the peculiarities of our hypothesis. PMID:21847029

Fisher information at the edge of chaos in random Boolean networks.

PubMed

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.

Investigating Cell Criticality

NASA Astrophysics Data System (ADS)

Serra, R.; Villani, M.; Damiani, C.; Graudenzi, A.; Ingrami, P.; Colacci, A.

Random Boolean networks provide a way to give a precise meaning to the notion that living beings are in a critical state. Some phenomena which are observed in real biological systems (distribution of "avalanches" in gene knock-out experiments) can be modeled using random Boolean networks, and the results can be analytically proven to depend upon the Derrida parameter, which also determines whether the network is critical. By comparing observed and simulated data one can then draw inferences about the criticality of biological cells, although with some care because of the limited number of experimental observations. The relationship between the criticality of a single network and that of a set of interacting networks, which simulate a tissue or a bacterial colony, is also analyzed by computer simulations.

Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.

PubMed

Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai

2017-08-02

Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.

Reliable computation from contextual correlations

NASA Astrophysics Data System (ADS)

Oestereich, André L.; Galvão, Ernesto F.

2017-12-01

An operational approach to the study of computation based on correlations considers black boxes with one-bit inputs and outputs, controlled by a limited classical computer capable only of performing sums modulo-two. In this setting, it was shown that noncontextual correlations do not provide any extra computational power, while contextual correlations were found to be necessary for the deterministic evaluation of nonlinear Boolean functions. Here we investigate the requirements for reliable computation in this setting; that is, the evaluation of any Boolean function with success probability bounded away from 1 /2 . We show that bipartite CHSH quantum correlations suffice for reliable computation. We also prove that an arbitrarily small violation of a multipartite Greenberger-Horne-Zeilinger noncontextuality inequality also suffices for reliable computation.

The pseudo-Boolean optimization approach to form the N-version software structure

NASA Astrophysics Data System (ADS)

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.

A procedure concept for local reflex control of grasping

NASA Technical Reports Server (NTRS)

Fiorini, Paolo; Chang, Jeffrey

1989-01-01

An architecture is proposed for the control of robotic devices, and in particular of anthropomorphic hands, characterized by a hierarchical structure in which every level of the architecture contains data and control function with varying degree of abstraction. Bottom levels of the hierarchy interface directly with sensors and actuators, and process raw data and motor commands. Higher levels perform more symbolic types of tasks, such as application of boolean rules and general planning operations. Layers implementation has to be consistent with the type of operation and its requirements for real time control. It is proposed to implement the rule level with a Boolean Artificial Neural Network characterized by a response time sufficient for producing reflex corrective action at the actuator level.

Spline approximations for nonlinear hereditary control systems

NASA Technical Reports Server (NTRS)

Daniel, P. L.

1982-01-01

A sline-based approximation scheme is discussed for optimal control problems governed by nonlinear nonautonomous delay differential equations. The approximating framework reduces the original control problem to a sequence of optimization problems governed by ordinary differential equations. Convergence proofs, which appeal directly to dissipative-type estimates for the underlying nonlinear operator, are given and numerical findings are summarized.

Nuclear Engineering Computer Modules: Reactor Dynamics, RD-1 and RD-2.

ERIC Educational Resources Information Center

Onega, Ronald J.

The objective of the Reactor Dynamics Module, RD-1, is to obtain the kinetics equation without feedback and solve the kinetics equations numerically for one to six delayed neutron groups for time varying reactivity insertions. The computer code FUMOKI (Fundamental Mode Kinetics) will calculate the power as a function of time for either uranium or…

A heterogenous Cournot duopoly with delay dynamics: Hopf bifurcations and stability switching curves

NASA Astrophysics Data System (ADS)

Pecora, Nicolò; Sodini, Mauro

2018-05-01

This article considers a Cournot duopoly model in a continuous-time framework and analyze its dynamic behavior when the competitors are heterogeneous in determining their output decision. Specifically the model is expressed in the form of differential equations with discrete delays. The stability conditions of the unique Nash equilibrium of the system are determined and the emergence of Hopf bifurcations is shown. Applying some recent mathematical techniques (stability switching curves) and performing numerical simulations, the paper confirms how different time delays affect the stability of the economy.

Finite-Dimensional Representations for Controlled Diffusions with Delay

DOE Office of Scientific and Technical Information (OSTI.GOV)

Federico, Salvatore, E-mail: salvatore.federico@unimi.it; Tankov, Peter, E-mail: tankov@math.univ-paris-diderot.fr

2015-02-15

We study stochastic delay differential equations (SDDE) where the coefficients depend on the moving averages of the state process. As a first contribution, we provide sufficient conditions under which the solution of the SDDE and a linear path functional of it admit a finite-dimensional Markovian representation. As a second contribution, we show how approximate finite-dimensional Markovian representations may be constructed when these conditions are not satisfied, and provide an estimate of the error corresponding to these approximations. These results are applied to optimal control and optimal stopping problems for stochastic systems with delay.

Measurement of oxidative metabolism of the working human muscles by near-infrared spectroscopy

NASA Astrophysics Data System (ADS)

Yücetaş, Akin; Şayli, Ömer; Karahan, Mustafa; Akin, Ata

2006-02-01

Monitoring the oxygenation of skeletal muscle tissues during rest to work transient provides valuable information about the performance of a particular tissue in adapting to aerobic glycolysis. In this paper we analyze the temporal relation of O II consumption with deoxy-hemoglobin (Hb) signals measured by functional Near Infrared Spectroscopy (fNIRS) technique during moderate isotonic forearm finger joint flexion exercise under ischemic conditions and model it with a mono exponential equation with delay. The time constants of fitting equation are questioned under two different work loads and among subjects differing in gender. Ten (6 men and 4 women) subjects performed isotonic forearm finger joint flexion exercise with two different loads. It is shown that under the same load, men and women subjects generate similar time constants and time delays. However, apparent change in time constants and time delays were observed when exercise was performed under different loads. When t-test is applied to compare the outputs for time constants between 0.41202 Watts and 0.90252 Watts, P value of 9.3445x10 -4 < 0.05 is observed which implies that the differences between the time constants are statistically significant. When the same procedure is applied for the time delay comparison, P value of 0.027<0.05 is observed which implies that also the differences between the time delays are statistically significant.

Stochastic parameter estimation in nonlinear time-delayed vibratory systems with distributed delay

NASA Astrophysics Data System (ADS)

Torkamani, Shahab; Butcher, Eric A.

2013-07-01

The stochastic estimation of parameters and states in linear and nonlinear time-delayed vibratory systems with distributed delay is explored. The approach consists of first employing a continuous time approximation to approximate the delayed integro-differential system with a large set of ordinary differential equations having stochastic excitations. Then the problem of state and parameter estimation in the resulting stochastic ordinary differential system is represented as an optimal filtering problem using a state augmentation technique. By adapting the extended Kalman-Bucy filter to the augmented filtering problem, the unknown parameters of the time-delayed system are estimated from noise-corrupted, possibly incomplete measurements of the states. Similarly, the upper bound of the distributed delay can also be estimated by the proposed technique. As an illustrative example to a practical problem in vibrations, the parameter, delay upper bound, and state estimation from noise-corrupted measurements in a distributed force model widely used for modeling machine tool vibrations in the turning operation is investigated.

Power-spectral-density relationship for retarded differential equations

NASA Technical Reports Server (NTRS)

Barker, L. K.

1974-01-01

The power spectral density (PSD) relationship between input and output of a set of linear differential-difference equations of the retarded type with real constant coefficients and delays is discussed. The form of the PSD relationship is identical with that applicable to unretarded equations. Since the PSD relationship is useful if and only if the system described by the equations is stable, the stability must be determined before applying the PSD relationship. Since it is sometimes difficult to determine the stability of retarded equations, such equations are often approximated by simpler forms. It is pointed out that some common approximations can lead to erroneous conclusions regarding the stability of a system and, therefore, to the possibility of obtaining PSD results which are not valid.

Global existence and exponential decay of the solution for a viscoelastic wave equation with a delay

NASA Astrophysics Data System (ADS)

Dai, Qiuyi; Yang, Zhifeng

2014-10-01

In this paper, we consider initial-boundary value problem of viscoelastic wave equation with a delay term in the interior feedback. Namely, we study the following equation together with initial-boundary conditions of Dirichlet type in Ω × (0, + ∞) and prove that for arbitrary real numbers μ 1 and μ 2, the above-mentioned problem has a unique global solution under suitable assumptions on the kernel g. This improve the results of the previous literature such as Nicaise and Pignotti (SIAM J. Control Optim 45:1561-1585, 2006) and Kirane and Said-Houari (Z. Angew. Math. Phys. 62:1065-1082, 2011) by removing the restriction imposed on μ 1 and μ 2. Furthermore, we also get an exponential decay results for the energy of the concerned problem in the case μ 1 = 0 which solves an open problem proposed by Kirane and Said-Houari (Z. Angew. Math. Phys. 62:1065-1082, 2011).

A delay differential equation model of follicle waves in women.

PubMed

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.

Theoretical analysis of cross-talking signals between counter-streaming electron beams in a vacuum tube oscillator

NASA Astrophysics Data System (ADS)

Shin, Y. M.; Ryskin, N. M.; Won, J. H.; Han, S. T.; Park, G. S.

2006-03-01

The basic theory of cross-talking signals between counter-streaming electron beams in a vacuum tube oscillator consisting of two two-cavity klystron amplifiers reversely coupled through input/output slots is theoretically investigated. Application of Kirchhoff's laws to the coupled equivalent RLC circuit model of the device provides four nonlinear coupled equations, which are the first-order time-delayed differential equations. Analytical solutions obtained through linearization of the equations provide oscillation frequencies and thresholds of four fundamental eigenstates, symmetric/antisymmetric 0/π modes. Time-dependent output signals are numerically analyzed with variation of the beam current, and a self-modulation mechanism and transition to chaos scenario are examined. The oscillator shows a much stronger multistability compared to a delayed feedback klystron oscillator owing to the competitions among more diverse eigenmodes. A fully developed chaos region also appears at a relatively lower beam current, ˜3.5Ist, compared to typical vacuum tube oscillators (10-100Ist), where Ist is a start-oscillation current.

Shear Wave Splitting Inversion in a Complex Crust

NASA Astrophysics Data System (ADS)

Lucas, A.

2015-12-01

Shear wave splitting (SWS) inversion presents a method whereby the upper crust can be interrogated for fracture density. It is caused when a shear wave traverses an area of anisotropy, splits in two, with each wave experiencing a different velocity resulting in an observable separation in arrival times. A SWS observation consists of the first arrival polarization direction and the time delay. Given the large amount of data common in SWS studies, manual inspection for polarization and time delay is considered prohibitively time intensive. All automated techniques used can produce high amounts of observations falsely interpreted as SWS. Thus introducing error into the interpretation. The technique often used for removing these false observations is to manually inspect all SWS observations defined as high quality by the automated routine, and remove false identifications. We investigate the nature of events falsely identified compared to those correctly identified. Once this identification is complete we conduct a inversion for crack density from SWS time delay. The current body of work on linear SWS inversion utilizes an equation that defines the time delay between arriving shear waves with respect to fracture density. This equation makes the assumption that no fluid flow occurs as a result of the passing shear wave, a situation called squirt flow. We show that the assumption is not applicable in all geological situations. When it is not true, its use in an inversion produces a result which is negatively affected by the assumptions. This is shown to be the case at the test case of 6894 SWS observations gathered in a small area at Puna geothermal field, Hawaii. To rectify this situation, a series of new time delay formulae, applicable to linear inversion, are derived from velocity equations presented in literature. The new formula use a 'fluid influence parameter' which indicates the degree to which squirt flow is influencing the SWS. It is found that accounting for squirt flow better fits the data and is more applicable. The fluid influence factor that best describes the data can be identified prior to solving the inversion. Implementing this formula in a linear inversion has a significantly improved fit to the time delay observations than that of the current methods.

Information processing in dendrites I. Input pattern generalisation.

PubMed

Gurney, K N

2001-10-01

In this paper and its companion, we address the question as to whether there are any general principles underlying information processing in the dendritic trees of biological neurons. In order to address this question, we make two assumptions. First, the key architectural feature of dendrites responsible for many of their information processing abilities is the existence of independent sub-units performing local non-linear processing. Second, any general functional principles operate at a level of abstraction in which neurons are modelled by Boolean functions. To accommodate these assumptions, we therefore define a Boolean model neuron-the multi-cube unit (MCU)-which instantiates the notion of the discrete functional sub-unit. We then use this model unit to explore two aspects of neural functionality: generalisation (in this paper) and processing complexity (in its companion). Generalisation is dealt with from a geometric viewpoint and is quantified using a new metric-the set of order parameters. These parameters are computed for threshold logic units (TLUs), a class of random Boolean functions, and MCUs. Our interpretation of the order parameters is consistent with our knowledge of generalisation in TLUs and with the lack of generalisation in randomly chosen functions. Crucially, the order parameters for MCUs imply that these functions possess a range of generalisation behaviour. We argue that this supports the general thesis that dendrites facilitate input pattern generalisation despite any local non-linear processing within functionally isolated sub-units.

Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.

PubMed

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.

Evolution of a designless nanoparticle network into reconfigurable Boolean logic

NASA Astrophysics Data System (ADS)

Bose, S. K.; Lawrence, C. P.; Liu, Z.; Makarenko, K. S.; van Damme, R. M. J.; Broersma, H. J.; van der Wiel, W. G.

2015-12-01

Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures.

Integrating Multiple Data Sources for Combinatorial Marker Discovery: A Study in Tumorigenesis.

PubMed

Bandyopadhyay, Sanghamitra; Mallik, Saurav

2018-01-01

Identification of combinatorial markers from multiple data sources is a challenging task in bioinformatics. Here, we propose a novel computational framework for identifying significant combinatorial markers ( s) using both gene expression and methylation data. The gene expression and methylation data are integrated into a single continuous data as well as a (post-discretized) boolean data based on their intrinsic (i.e., inverse) relationship. A novel combined score of methylation and expression data (viz., ) is introduced which is computed on the integrated continuous data for identifying initial non-redundant set of genes. Thereafter, (maximal) frequent closed homogeneous genesets are identified using a well-known biclustering algorithm applied on the integrated boolean data of the determined non-redundant set of genes. A novel sample-based weighted support ( ) is then proposed that is consecutively calculated on the integrated boolean data of the determined non-redundant set of genes in order to identify the non-redundant significant genesets. The top few resulting genesets are identified as potential s. Since our proposed method generates a smaller number of significant non-redundant genesets than those by other popular methods, the method is much faster than the others. Application of the proposed technique on an expression and a methylation data for Uterine tumor or Prostate Carcinoma produces a set of significant combination of markers. We expect that such a combination of markers will produce lower false positives than individual markers.

Predictive computation of genomic logic processing functions in embryonic development

PubMed Central

Peter, Isabelle S.; Faure, Emmanuel; Davidson, Eric H.

2012-01-01

Gene regulatory networks (GRNs) control the dynamic spatial patterns of regulatory gene expression in development. Thus, in principle, GRN models may provide system-level, causal explanations of developmental process. To test this assertion, we have transformed a relatively well-established GRN model into a predictive, dynamic Boolean computational model. This Boolean model computes spatial and temporal gene expression according to the regulatory logic and gene interactions specified in a GRN model for embryonic development in the sea urchin. Additional information input into the model included the progressive embryonic geometry and gene expression kinetics. The resulting model predicted gene expression patterns for a large number of individual regulatory genes each hour up to gastrulation (30 h) in four different spatial domains of the embryo. Direct comparison with experimental observations showed that the model predictively computed these patterns with remarkable spatial and temporal accuracy. In addition, we used this model to carry out in silico perturbations of regulatory functions and of embryonic spatial organization. The model computationally reproduced the altered developmental functions observed experimentally. Two major conclusions are that the starting GRN model contains sufficiently complete regulatory information to permit explanation of a complex developmental process of gene expression solely in terms of genomic regulatory code, and that the Boolean model provides a tool with which to test in silico regulatory circuitry and developmental perturbations. PMID:22927416

Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata

PubMed Central

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2016-01-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. PMID:27660398

Effects of time delays on stability and Hopf bifurcation in a fractional ring-structured network with arbitrary neurons

NASA Astrophysics Data System (ADS)

Huang, Chengdai; Cao, Jinde; Xiao, Min; Alsaedi, Ahmed; Hayat, Tasawar

2018-04-01

This paper is comprehensively concerned with the dynamics of a class of high-dimension fractional ring-structured neural networks with multiple time delays. Based on the associated characteristic equation, the sum of time delays is regarded as the bifurcation parameter, and some explicit conditions for describing delay-dependent stability and emergence of Hopf bifurcation of such networks are derived. It reveals that the stability and bifurcation heavily relies on the sum of time delays for the proposed networks, and the stability performance of such networks can be markedly improved by selecting carefully the sum of time delays. Moreover, it is further displayed that both the order and the number of neurons can extremely influence the stability and bifurcation of such networks. The obtained criteria enormously generalize and improve the existing work. Finally, numerical examples are presented to verify the efficiency of the theoretical results.

Bounded Linear Stability Analysis - A Time Delay Margin Estimation Approach for Adaptive Control

NASA Technical Reports Server (NTRS)

Nguyen, Nhan T.; Ishihara, Abraham K.; Krishnakumar, Kalmanje Srinlvas; Bakhtiari-Nejad, Maryam

2009-01-01

This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.

Design of a Nanoscale, CMOS-Integrable, Thermal-Guiding Structure for Boolean-Logic and Neuromorphic Computation.

PubMed

Loke, Desmond; Skelton, Jonathan M; Chong, Tow-Chong; Elliott, Stephen R

2016-12-21

One of the requirements for achieving faster CMOS electronics is to mitigate the unacceptably large chip areas required to steer heat away from or, more recently, toward the critical nodes of state-of-the-art devices. Thermal-guiding (TG) structures can efficiently direct heat by "meta-materials" engineering; however, some key aspects of the behavior of these systems are not fully understood. Here, we demonstrate control of the thermal-diffusion properties of TG structures by using nanometer-scale, CMOS-integrable, graphene-on-silica stacked materials through finite-element-methods simulations. It has been shown that it is possible to implement novel, controllable, thermally based Boolean-logic and spike-timing-dependent plasticity operations for advanced (neuromorphic) computing applications using such thermal-guide architectures.

Modeling gene regulatory networks: A network simplification algorithm

NASA Astrophysics Data System (ADS)

Ferreira, Luiz Henrique O.; de Castro, Maria Clicia S.; da Silva, Fabricio A. B.

2016-12-01

Boolean networks have been used for some time to model Gene Regulatory Networks (GRNs), which describe cell functions. Those models can help biologists to make predictions, prognosis and even specialized treatment when some disturb on the GRN lead to a sick condition. However, the amount of information related to a GRN can be huge, making the task of inferring its boolean network representation quite a challenge. The method shown here takes into account information about the interactome to build a network, where each node represents a protein, and uses the entropy of each node as a key to reduce the size of the network, allowing the further inferring process to focus only on the main protein hubs, the ones with most potential to interfere in overall network behavior.

Stability of Boolean multilevel networks.

PubMed

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.

Parenting Predictors of Delay Inhibition in Socioeconomically Disadvantaged Preschoolers

PubMed Central

Merz, Emily C.; Landry, Susan H.; Zucker, Tricia A.; Barnes, Marcia A.; Assel, Michael; Taylor, Heather B.; Lonigan, Christopher J.; Phillips, Beth M.; Clancy-Menchetti, Jeanine; Eisenberg, Nancy; Spinrad, Tracy L.; Valiente, Carlos; de Villiers, Jill; Consortium, the School Readiness Research

2016-01-01

This study examined longitudinal associations between specific parenting factors and delay inhibition in socioeconomically disadvantaged preschoolers. At Time 1, parents and 2- to 4-year-old children (mean age = 3.21 years; N = 247) participated in a videotaped parent-child free play session, and children completed delay inhibition tasks (gift delay-wrap, gift delay-bow, and snack delay tasks). Three months later, at Time 2, children completed the same set of tasks. Parental responsiveness was coded from the parent-child free play sessions, and parental directive language was coded from transcripts of a subset of 127 of these sessions. Structural equation modeling was used, and covariates included age, gender, language skills, parental education, and Time 1 delay inhibition. Results indicated that in separate models, Time 1 parental directive language was significantly negatively associated with Time 2 delay inhibition, and Time 1 parental responsiveness was significantly positively associated with Time 2 delay inhibition. When these parenting factors were entered simultaneously, Time 1 parental directive language significantly predicted Time 2 delay inhibition whereas Time 1 parental responsiveness was no longer significant. Findings suggest that parental language that modulates the amount of autonomy allotted the child may be an important predictor of early delay inhibition skills. PMID:27833461

Linear models of activation cascades: analytical solutions and coarse-graining of delayed signal transduction

PubMed Central

Desikan, Radhika

2016-01-01

Cellular signal transduction usually involves activation cascades, the sequential activation of a series of proteins following the reception of an input signal. Here, we study the classic model of weakly activated cascades and obtain analytical solutions for a variety of inputs. We show that in the special but important case of optimal gain cascades (i.e. when the deactivation rates are identical) the downstream output of the cascade can be represented exactly as a lumped nonlinear module containing an incomplete gamma function with real parameters that depend on the rates and length of the cascade, as well as parameters of the input signal. The expressions obtained can be applied to the non-identical case when the deactivation rates are random to capture the variability in the cascade outputs. We also show that cascades can be rearranged so that blocks with similar rates can be lumped and represented through our nonlinear modules. Our results can be used both to represent cascades in computational models of differential equations and to fit data efficiently, by reducing the number of equations and parameters involved. In particular, the length of the cascade appears as a real-valued parameter and can thus be fitted in the same manner as Hill coefficients. Finally, we show how the obtained nonlinear modules can be used instead of delay differential equations to model delays in signal transduction. PMID:27581482

Chenciner bubbles and torus break-up in a periodically forced delay differential equation

NASA Astrophysics Data System (ADS)

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.

Instantons in Self-Organizing Logic Gates

NASA Astrophysics Data System (ADS)

Bearden, Sean R. B.; Manukian, Haik; Traversa, Fabio L.; Di Ventra, Massimiliano

2018-03-01

Self-organizing logic is a recently suggested framework that allows the solution of Boolean truth tables "in reverse"; i.e., it is able to satisfy the logical proposition of gates regardless to which terminal(s) the truth value is assigned ("terminal-agnostic logic"). It can be realized if time nonlocality (memory) is present. A practical realization of self-organizing logic gates (SOLGs) can be done by combining circuit elements with and without memory. By employing one such realization, we show, numerically, that SOLGs exploit elementary instantons to reach equilibrium points. Instantons are classical trajectories of the nonlinear equations of motion describing SOLGs and connect topologically distinct critical points in the phase space. By linear analysis at those points, we show that these instantons connect the initial critical point of the dynamics, with at least one unstable direction, directly to the final fixed point. We also show that the memory content of these gates affects only the relaxation time to reach the logically consistent solution. Finally, we demonstrate, by solving the corresponding stochastic differential equations, that, since instantons connect critical points, noise and perturbations may change the instanton trajectory in the phase space but not the initial and final critical points. Therefore, even for extremely large noise levels, the gates self-organize to the correct solution. Our work provides a physical understanding of, and can serve as an inspiration for, models of bidirectional logic gates that are emerging as important tools in physics-inspired, unconventional computing.

A Discrete Events Delay Differential System Model for Transmission of Vancomycin-Resistant Enterococcus (VRE) in Hospitals

DTIC Science & Technology

2010-09-19

estimated directly form the surveillance data Infection control measures were implemented in the form of health care worker hand - hygiene before and after...hospital infections , is used to motivate possibilities of modeling nosocomial infec- tion dynamics. This is done in the context of hospital monitoring and...model development. Key Words: Delay equations, discrete events, nosocomial infection dynamics, surveil- lance data, inverse problems, parameter

Standard cosmology delayed

DOE Office of Scientific and Technical Information (OSTI.GOV)

Choudhury, Debajyoti; Ghoshal, Debashis; Sen, Anjan Ananda, E-mail: debajyoti.choudhury@gmail.com, E-mail: dghoshal@mail.jnu.ac.in, E-mail: anjan.ctp@jmi.ac.in

2012-02-01

The introduction of a delay in the Friedmann equation of cosmological evolution is shown to result in the very early universe undergoing the necessary accelerated expansion in the usual radiation (or matter) dominated phase. Occurring even without a violation of the strong energy condition, this expansion slows down naturally to go over to the decelerated phase, namely the standard Hubble expansion. This may obviate the need for a scalar field driven inflationary epoch.

The effect of delays on filament oscillations and stability

NASA Astrophysics Data System (ADS)

van den Oord, G. H. J.; Schutgens, N. A. J.; Kuperus, M.

1998-11-01

We discuss the linear response of a filament to perturbations, taking the finite communication time between the filament and the photosphere into account. The finite communication time introduces delays in the system. Recently Schutgens (1997ab) investigated the solutions of the delay equation for vertical perturbations. In this paper we expand his analysis by considering also horizontal and coupled oscillations. The latter occur in asymmetric coronal fields. We also discuss the effect of Alfven wave emission on filament oscillations and show that wave emission is important for stabilizing filaments. We introduce a fairly straightforward method to study the solutions of delay equations as a function of the filament-photosphere communication time. A solution can be described by a linear combination of damped harmonic oscillations each characterized by a frequency, a damping/growth time and, accordingly, a quality factor. As a secondary result of our analysis we show that, within the context of line current models, Kippenhahn/Schlüter-type filament equilibria can never be stable in the horizontal and the vertical direction at the same time but we also demonstrate that Kuperus/Raadu-type equilibria can account for both an inverse or a normal polarity signature. The diagnostic value of our analysis for determining, e.g., the filament current from observations of oscillating filaments is discussed.

The time-delay signature of quark-gluon plasma formation in relativistic nuclear collisions

NASA Astrophysics Data System (ADS)

Rischke, Dirk H.; Gyulassy, Miklos

1996-02-01

The hydrodynamic expansion of quark-gluon plasmas with spherical and longitudinally boost-invariant geometries is studied as a function of the initial energy density. The sensitivity of the collective flow pattern to uncertainties in the nuclear matter equation of state is explored. We concentrate on the effect of a possible finite width, ΔT ˜ 0.1 Tc, of the transition region between quark-gluon plasma and hadronic phase. Although slow deflagration solutions that act to stall the expansion do not exist for ΔT > 0.08 Tc, we find, nevertheless, that the equation of state remains sufficiently soft in the transition region to delay the propagation of ordinary rarefaction waves for a considerable time. We compute the dependence of the pion-interferometry correlation function on ΔT, since this is the most promising observable for time-delayed expansion. The signature of time delay, proposed by Pratt and Bertsch, is an enhancement of the ratio of the inverse width of the pion correlation function in out-direction to that in side-direction. One of our main results is that this generic signature of quark-gluon plasma formation is rather robust to the uncertainties in the width of the transition region. Furthermore, for longitudinal boost-invariant geometries, the signal is likely to be maximized around RHIC energies

Delay time in a single barrier for a movable quantum shutter

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hernandez, Alberto

2010-05-15

The transient solution and delay time for a {delta} potential scatterer with a movable quantum shutter is calculated by solving analytically the time-dependent Schroedinger equation. The delay time is analyzed as a function of the distance between the shutter and the potential barrier and also as a function of the distance between the potential barrier and the detector. In both cases, it is found that the delay time exhibits a dynamical behavior and that it tends to a saturation value {Delta}t{sub sat} in the limit of very short distances, which represents the maximum delay produced by the potential barrier nearmore » the interaction region. The phase time {tau}{sub {theta},} on the other hand, is not an appropriate time scale for measuring the time delay near the interaction region, except if the shutter is moved far away from the potential. The role played by the antibound state of the system on the behavior of the delay time is also discussed.« less

A new lattice hydrodynamic model based on control method considering the flux change rate and delay feedback signal

NASA Astrophysics Data System (ADS)

Qin, Shunda; Ge, Hongxia; Cheng, Rongjun

2018-02-01

In this paper, a new lattice hydrodynamic model is proposed by taking delay feedback and flux change rate effect into account in a single lane. The linear stability condition of the new model is derived by control theory. By using the nonlinear analysis method, the mKDV equation near the critical point is deduced to describe the traffic congestion. Numerical simulations are carried out to demonstrate the advantage of the new model in suppressing traffic jam with the consideration of flux change rate effect in delay feedback model.

Numerical bifurcation analysis of immunological models with time delays

NASA Astrophysics Data System (ADS)

Luzyanina, Tatyana; Roose, Dirk; Bocharov, Gennady

2005-12-01

In recent years, a large number of mathematical models that are described by delay differential equations (DDEs) have appeared in the life sciences. To analyze the models' dynamics, numerical methods are necessary, since analytical studies can only give limited results. In turn, the availability of efficient numerical methods and software packages encourages the use of time delays in mathematical modelling, which may lead to more realistic models. We outline recently developed numerical methods for bifurcation analysis of DDEs and illustrate the use of these methods in the analysis of a mathematical model of human hepatitis B virus infection.

Explosive attractor solutions to a universal cubic delay equation

NASA Astrophysics Data System (ADS)

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.

Quantitative evaluation of thickness reduction in corroded steel plates using surface SH waves

NASA Astrophysics Data System (ADS)

Suzuki, Keigo; Ha, Nguyen Phuong; Otobe, Yuichi; Tamura, Hiroshi; Sasaki, Eiichi

2018-04-01

This study evaluates the effect of reduction in plate thickness for a steel plate existing in concrete on guided ultrasonic SH (g-SH) waves. It has been found that the time of flight (TOF) increases if the plate thickness is reduced. The parameter investigated in this study is a delay time obtained from a TOF comparison between a healthy and a damaged plate. The wave propagation is simulated by dynamic Finite Element Analysis (FEA). The resulting data are then used to propose a theoretical equation for predicting TOF. The prediction of delay time obtained from the proposed equation is found to be in general agreement, with an error of 10% (or less), when compared with the experiment results, if the thickness reduction is over 3.65mm.

Understanding genetic regulatory networks

NASA Astrophysics Data System (ADS)

Kauffman, Stuart

2003-04-01

Random Boolean networks (RBM) were introduced about 35 years ago as first crude models of genetic regulatory networks. RBNs are comprised of N on-off genes, connected by a randomly assigned regulatory wiring diagram where each gene has K inputs, and each gene is controlled by a randomly assigned Boolean function. This procedure samples at random from the ensemble of all possible NK Boolean networks. The central ideas are to study the typical, or generic properties of this ensemble, and see 1) whether characteristic differences appear as K and biases in Boolean functions are introducted, and 2) whether a subclass of this ensemble has properties matching real cells. Such networks behave in an ordered or a chaotic regime, with a phase transition, "the edge of chaos" between the two regimes. Networks with continuous variables exhibit the same two regimes. Substantial evidence suggests that real cells are in the ordered regime. A key concept is that of an attractor. This is a reentrant trajectory of states of the network, called a state cycle. The central biological interpretation is that cell types are attractors. A number of properties differentiate the ordered and chaotic regimes. These include the size and number of attractors, the existence in the ordered regime of a percolating "sea" of genes frozen in the on or off state, with a remainder of isolated twinkling islands of genes, a power law distribution of avalanches of gene activity changes following perturbation to a single gene in the ordered regime versus a similar power law distribution plus a spike of enormous avalanches of gene changes in the chaotic regime, and the existence of branching pathway of "differentiation" between attractors induced by perturbations in the ordered regime. Noise is serious issue, since noise disrupts attractors. But numerical evidence suggests that attractors can be made very stable to noise, and meanwhile, metaplasias may be a biological manifestation of noise. As we learn more about the wiring diagram and constraints on rules controlling real genes, we can build refined ensembles reflecting these properties, study the generic properties of the refined ensembles, and hope to gain insight into the dynamics of real cells.

Approximating a retarded-advanced differential equation that models human phonation

NASA Astrophysics Data System (ADS)

Teodoro, M. Filomena

2017-11-01

In [1, 2, 3] we have got the numerical solution of a linear mixed type functional differential equation (MTFDE) introduced initially in [4], considering the autonomous and non-autonomous case by collocation, least squares and finite element methods considering B-splines basis set. The present work introduces a numerical scheme using least squares method (LSM) and Gaussian basis functions to solve numerically a nonlinear mixed type equation with symmetric delay and advance which models human phonation. The preliminary results are promising. We obtain an accuracy comparable with the previous results.

Periodicity computation of generalized mathematical biology problems involving delay differential equations.

PubMed

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.

Delay-induced Turing-like waves for one-species reaction-diffusion model on a network

NASA Astrophysics Data System (ADS)

Petit, Julien; Carletti, Timoteo; Asllani, Malbor; Fanelli, Duccio

2015-09-01

A one-species time-delay reaction-diffusion system defined on a complex network is studied. Traveling waves are predicted to occur following a symmetry-breaking instability of a homogeneous stationary stable solution, subject to an external nonhomogeneous perturbation. These are generalized Turing-like waves that materialize in a single-species populations dynamics model, as the unexpected byproduct of the imposed delay in the diffusion part. Sufficient conditions for the onset of the instability are mathematically provided by performing a linear stability analysis adapted to time-delayed differential equations. The method here developed exploits the properties of the Lambert W-function. The prediction of the theory are confirmed by direct numerical simulation carried out for a modified version of the classical Fisher model, defined on a Watts-Strogatz network and with the inclusion of the delay.

Delayed feedback control in quantum transport.

PubMed

Emary, Clive

2013-09-28

Feedback control in quantum transport has been predicted to give rise to several interesting effects, among them quantum state stabilization and the realization of a mesoscopic Maxwell's daemon. These results were derived under the assumption that control operations on the system are affected instantaneously after the measurement of electronic jumps through it. In this contribution, I describe how to include a delay between detection and control operation in the master equation theory of feedback-controlled quantum transport. I investigate the consequences of delay for the state stabilization and Maxwell's daemon schemes. Furthermore, I describe how delay can be used as a tool to probe coherent oscillations of electrons within a transport system and how this formalism can be used to model finite detector bandwidth.

Nonlinear Estimation of Discrete-Time Signals Under Random Observation Delay

DOE Office of Scientific and Technical Information (OSTI.GOV)

Caballero-Aguila, R.; Jimenez-Lopez, J. D.; Hermoso-Carazo, A.

2008-11-06

This paper presents an approximation to the nonlinear least-squares estimation problem of discrete-time stochastic signals using nonlinear observations with additive white noise which can be randomly delayed by one sampling time. The observation delay is modelled by a sequence of independent Bernoulli random variables whose values, zero or one, indicate that the real observation arrives on time or it is delayed and, hence, the available measurement to estimate the signal is not up-to-date. Assuming that the state-space model generating the signal is unknown and only the covariance functions of the processes involved in the observation equation are ready for use,more » a filtering algorithm based on linear approximations of the real observations is proposed.« less

The model of root graviresponse with retarded arguments

NASA Astrophysics Data System (ADS)

Kondrachuk, Alexander

The graviperception mechanism (GPM) of the roots of higher plants localized in the cap region of a root and supposedly related to statoliths sedimentation produces the signals in response to the change of the root axis orientation relative to the gravity vector G. Meanwhile, the regions (Distal Elongation Zone -DEZ and Central Elongation Zone-CEZ), where the signals initiate the changes of the growth rates of the upper and lower flanks of the root, are located at the significant distances from the cap (thousands microns for some plants). It causes the time delays between the relocation of statoliths in statocytes and the change of the growth rates in elongation zones. It is suggested that the signal targeting the CEZ modulates the initially uniform lateral distribution of some specific substances (S) in the cap region. Then already nonhomogeneous lateral distribution of S is transferred to the CEZ to initiate the change of the growth rates of the opposite flanks. It results in the bending of the root in the line of G and thus in the change of the GPM signal in the cap region. In the present model the kinetics of a root apex bending (angle A) in response to the time (t)-dependent change of the G orientation is described by the integro-differential equation in A(t). The main peculiarity of this model is the presence of retarded (time-delayed) arguments t-TCEZ and t-TDEZ . In this case the solutions of this equation depend on the preceding kinetics of A(t) during the time delays TCEZ and TDEZ . It is suggested that the signals activating the CEZ and DEZ are of different nature. The work is focused on two problems concerning the modeling of the effects of time-delay(s) on the root bending. The first problem supposes the existence of one zone (CEZ) and one time-delay TCEZ . This equation was studied and solved using analytical and numerical methods. We analyzed the model as to whether it can be used to describe the kinetics of root graviresponse in the case of different orientations of the root apex relative to the G vector during the time interval equal to TCEZ (TCEZ > TDEZ ) that precedes the beginning of gravistimultion. Also we explored the conditions of the overshooting (the vertical) and non-overshooting regimes of gravistimulated root bending. Good correlation between the results of the modeling and known experimental data (Barlow et al, 1993, Stochkus, 1994, Mullen, 1998) was found. This allowed us to estimate and analyze the parameters of the model. The second problem supposed the existence of two zones of growth (CEZ and DEZ) and two corresponding time-delays. The effects of the second time-delay connected with the presence of the DEZ on the behavior of the model equation of the root graviresponse kinetics were analyzed and discussed.

Binary full adder, made of fusion gates, in a subexcitable Belousov-Zhabotinsky system

NASA Astrophysics Data System (ADS)

Adamatzky, Andrew

2015-09-01

In an excitable thin-layer Belousov-Zhabotinsky (BZ) medium a localized perturbation leads to the formation of omnidirectional target or spiral waves of excitation. A subexcitable BZ medium responds to asymmetric local perturbation by producing traveling localized excitation wave-fragments, distant relatives of dissipative solitons. The size and life span of an excitation wave-fragment depend on the illumination level of the medium. Under the right conditions the wave-fragments conserve their shape and velocity vectors for extended time periods. I interpret the wave-fragments as values of Boolean variables. When two or more wave-fragments collide they annihilate or merge into a new wave-fragment. States of the logic variables, represented by the wave-fragments, are changed in the result of the collision between the wave-fragments. Thus, a logical gate is implemented. Several theoretical designs and experimental laboratory implementations of Boolean logic gates have been proposed in the past but little has been done cascading the gates into binary arithmetical circuits. I propose a unique design of a binary one-bit full adder based on a fusion gate. A fusion gate is a two-input three-output logical device which calculates the conjunction of the input variables and the conjunction of one input variable with the negation of another input variable. The gate is made of three channels: two channels cross each other at an angle, a third channel starts at the junction. The channels contain a BZ medium. When two excitation wave-fragments, traveling towards each other along input channels, collide at the junction they merge into a single wave-front traveling along the third channel. If there is just one wave-front in the input channel, the front continues its propagation undisturbed. I make a one-bit full adder by cascading two fusion gates. I show how to cascade the adder blocks into a many-bit full adder. I evaluate the feasibility of my designs by simulating the evolution of excitation in the gates and adders using the numerical integration of Oregonator equations.

Electrical Circuits in the Mathematics/Computer Science Classroom.

ERIC Educational Resources Information Center

McMillan, Robert D.

1988-01-01

Shows how, with little or no electrical background, students can apply Boolean algebra concepts to design and build integrated electrical circuits in the classroom that will reinforce important ideas in mathematics. (PK)

Topological Aspects of Information Retrieval.

ERIC Educational Resources Information Center

Egghe, Leo; Rousseau, Ronald

1998-01-01

Discusses topological aspects of theoretical information retrieval, including retrieval topology; similarity topology; pseudo-metric topology; document spaces as topological spaces; Boolean information retrieval as a subsystem of any topological system; and proofs of theorems. (LRW)

Combinatorial optimization in foundry practice

NASA Astrophysics Data System (ADS)

Antamoshkin, A. N.; Masich, I. S.

2016-04-01

The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

Defining of the BDX930 Assembly Language

NASA Technical Reports Server (NTRS)

Boyer, R. S.; Moore, J. S.

1983-01-01

A definition of the BDX930 assembly language is presented. Various definition problems and suggested solutions are included. A class of defined recognizers based on boolean valued nowrecursive functions is employed in preprocessing.

Application of a Discrete Nonlinear Spectral Model to Ideal Cases of Wind Wave Generation.

DTIC Science & Technology

1982-04-01

WRITE (6965)) bBD ODRM4T (IHII C SKI ’> 3 LINS i AND WRITE PLOT TITLE (IDOCHAR S PER LINE t 10 LINES AXI4CH-,(NClkR*9) /10 dRJTE (660) (TJL..EfI),I-I...A*CaGE.D.)JPP-J>P 𔃻 I F ( 8 D Do)) jpp-j P?+2 MiFPPeE)’i)&O TO 44 73 40JT-NPr(NIN,JPP) ;o TD (72, 14,7b,7BhNOUT 44 IF(A*3)q46q4b47 46 JPP-2 ;0 TO 73...EXTEZNAL FJNrI3N LAND IJS 13 THE BOOLEAN I.EoLDGICAL$ AND 01’ Td C FULLWORD INTEGCRS. C EXTEtNAL FJN:TION LOR, I,JS 1)7 THE BOOLEAN OR OF TWO FULLWORD

Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.

PubMed

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic Tunnel Junctions (MTJs). The inherent physics of MTJs, enhanced by device level modifications, is harnessed here to emulate the intricate dynamics of an analog satisfiability (SAT) solver. In the presence of thermal noise, the MTJ based system can successfully solve Boolean satisfiability problems. Most importantly, our results exhibit that, the proposed MTJ based hardware SAT solver is capable of finding a solution to a significant fraction (at least 85%) of hard 3-SAT problems, within a time that has a polynomial relationship with the number of variables(<50).

A Semiquantitative Framework for Gene Regulatory Networks: Increasing the Time and Quantitative Resolution of Boolean Networks

PubMed Central

Kerkhofs, Johan; Geris, Liesbet

2015-01-01

Boolean models have been instrumental in predicting general features of gene networks and more recently also as explorative tools in specific biological applications. In this study we introduce a basic quantitative and a limited time resolution to a discrete (Boolean) framework. Quantitative resolution is improved through the employ of normalized variables in unison with an additive approach. Increased time resolution stems from the introduction of two distinct priority classes. Through the implementation of a previously published chondrocyte network and T helper cell network, we show that this addition of quantitative and time resolution broadens the scope of biological behaviour that can be captured by the models. Specifically, the quantitative resolution readily allows models to discern qualitative differences in dosage response to growth factors. The limited time resolution, in turn, can influence the reachability of attractors, delineating the likely long term system behaviour. Importantly, the information required for implementation of these features, such as the nature of an interaction, is typically obtainable from the literature. Nonetheless, a trade-off is always present between additional computational cost of this approach and the likelihood of extending the model’s scope. Indeed, in some cases the inclusion of these features does not yield additional insight. This framework, incorporating increased and readily available time and semi-quantitative resolution, can help in substantiating the litmus test of dynamics for gene networks, firstly by excluding unlikely dynamics and secondly by refining falsifiable predictions on qualitative behaviour. PMID:26067297

Remission of rheumatoid arthritis and potential determinants: a national multi-center cross-sectional survey.

PubMed

Wang, Guan-Ying; Zhang, Sa-Li; Wang, Xiu-Ru; Feng, Min; Li, Chun; An, Yuan; Li, Xiao-Feng; Wang, Li-Zhi; Wang, Cai-Hong; Wang, Yong-Fu; Yang, Rong; Yan, Hui-Ming; Wang, Guo-Chun; Lu, Xin; Liu, Xia; Zhu, Ping; Chen, Li-Na; Jin, Hong-Tao; Liu, Jin-Ting; Guo, Hui-Fang; Chen, Hai-Ying; Xie, Jian-Li; Wei, Ping; Wang, Jun-Xiang; Liu, Xiang-Yuan; Sun, Lin; Cui, Liu-Fu; Shu, Rong; Liu, Bai-Lu; Yu, Ping; Zhang, Zhuo-Li; Li, Guang-Tao; Li, Zhen-Bin; Yang, Jing; Li, Jun-Fang; Jia, Bin; Zhang, Feng-Xiao; Tao, Jie-Mei; Lin, Jin-Ying; Wei, Mei-Qiu; Liu, Xiao-Min; Ke, Dan; Hu, Shao-Xian; Ye, Cong; Han, Shu-Ling; Yang, Xiu-Yan; Li, Hao; Huang, Ci-Bo; Gao, Ming; Lai, Bei; Cheng, Yong-Jing; Li, Xing-Fu; Song, Li-Jun; Yu, Xiao-Xia; Wang, Ai-Xue; Wu, Li-Jun; Wang, Yan-Hua; He, Lan; Sun, Wen-Wen; Gong, Lu; Wang, Xiao-Yuan; Wang, Yi; Zhao, Yi; Li, Xiao-Xia; Wang, Yan; Zhang, Yan; Su, Yin; Zhang, Chun-Fang; Mu, Rong; Li, Zhan-Guo

2015-02-01

The aim of this study is to investigate the remission rate of rheumatoid arthritis (RA) in China and identify its potential determinants. A multi-center cross-sectional study was conducted from July 2009 to January 2012. Data were collected by face-to-face interviews of the rheumatology outpatients in 28 tertiary hospitals in China. The remission rates were calculated in 486 RA patients according to different definitions of remission: the Disease Activity Score in 28 joints (DAS28), the Simplified Disease Activity Index (SDAI), the Clinical Disease Activity Index (CDAI), and the American College of Rheumatology/European League Against Rheumatism (ACR/EULAR) Boolean definition. Potential determinants of RA remission were assessed by univariate and multivariate analyses. The remission rates of RA from this multi-center cohort were 8.6% (DAS28), 8.4% (SDAI), 8.2% (CDAI), and 6.8% (Boolean), respectively. Favorable factors associated with remission were: low Health Assessment Questionnaire (HAQ) score, absence of rheumatoid factor (RF) and anti-cyclic citrullinated peptide (anti-CCP), and treatment of methotrexate (MTX) and hydroxychloroquine (HCQ). Younger age was also predictive for the DAS28 and the Boolean remission. Multivariate analyses revealed a low HAQ score, the absence of anti-CCP, and the treatment with HCQ as independent determinants of remission. The clinical remission rate of RA patients was low in China. A low HAQ score, the absence of anti-CCP, and HCQ were significant independent determinants for RA remission.

Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

PubMed

Ahnert, S E; Fink, T M A

2016-07-01

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

Psychological state is related to the remission of the Boolean-based definition of patient global assessment in patients with rheumatoid arthritis.

PubMed

Fusama, Mie; Miura, Yasushi; Yukioka, Kumiko; Kuroiwa, Takanori; Yukioka, Chikako; Inoue, Miyako; Nakanishi, Tae; Murata, Norikazu; Takai, Noriko; Higashi, Kayoko; Kuritani, Taro; Maeda, Keiji; Sano, Hajime; Yukioka, Masao; Nakahara, Hideko

2015-09-01

To evaluate whether the psychological state is related to the Boolean-based definition of patient global assessment (PGA) remission in patients with rheumatoid arthritis (RA). Patients with RA who met the criteria of swollen joint count (SJC) ≤ 1, tender joint count (TJC) ≤ 1 and C-reactive protein (CRP) ≤ 1 were divided into two groups, PGA remission group (PGA ≤ 1 cm) and non-remission group (PGA > 1 cm). Anxiety was evaluated utilizing the Hospital Anxiety and Depression Scale-Anxiety (HADS-A), while depression was evaluated with HADS-Depression (HADS-D) and the Center for Epidemiologic Studies Depression Scale (CES-D). Comparison analyses were done between the PGA remission and non-remission groups in HADS-A, HADS-D and CES-D. Seventy-eight patients met the criteria for SJC ≤ 1, TJC ≤ 1 and CRP ≤ 1. There were no significant differences between the PGA remission group (n = 45) and the non-remission group (n = 33) in age, sex, disease duration and Steinbrocker's class and stage. HADS-A, HADS-D and CES-D scores were significantly lower in the PGA remission group. Patients with RA who did not meet the PGA remission criteria despite good disease condition were in a poorer psychological state than those who satisfied the Boolean-based definition of clinical remission. Psychological support might be effective for improvement of PGA, resulting in the attainment of true remission.

A numerical scheme for singularly perturbed reaction-diffusion problems with a negative shift via numerov method

NASA Astrophysics Data System (ADS)

Dinesh Kumar, S.; Nageshwar Rao, R.; Pramod Chakravarthy, P.

2017-11-01

In this paper, we consider a boundary value problem for a singularly perturbed delay differential equation of reaction-diffusion type. We construct an exponentially fitted numerical method using Numerov finite difference scheme, which resolves not only the boundary layers but also the interior layers arising from the delay term. An extensive amount of computational work has been carried out to demonstrate the applicability of the proposed method.

MSW (Magnetostatic Wave) Variable Time-Delay Techniques.

DTIC Science & Technology

1983-09-01

will be releasable to the general public, including foreign nations. RADC-TR-83-139 has been reviewed and is approved for publication. APPROVED: 4...film carries by itself an infinite set of modes ( exchange effects being ignored). In the absence of ground planes, the secular equation for a single... exchange (3 2 ) * spin waves, which produces regularly spaced narrow-band absorbtions or "notches" in the delay line transmission response. This effect is

Investigation of a Nonlinear Control System

NASA Technical Reports Server (NTRS)

Flugge-Lotz, I; Taylor, C F; Lindberg, H E

1958-01-01

A discontinuous variation of coefficients of the differential equation describing the linear control system before nonlinear elements are added is studied in detail. The nonlinear feedback is applied to a second-order system. Simulation techniques are used to study performance of the nonlinear control system and to compare it with the linear system for a wide variety of inputs. A detailed quantitative study of the influence of relay delays and of a transport delay is presented.

Existence and stability of periodic solutions of quasi-linear Korteweg — de Vries equation

NASA Astrophysics Data System (ADS)

Glyzin, S. D.; Kolesov, A. Yu; Preobrazhenskaia, M. M.

2017-01-01

We consider the scalar nonlinear differential-difference equation with two delays, which models electrical activity of a neuron. Under some additional suppositions for this equation well known method of quasi-normal forms can be applied. Its essence lies in the formal normalization of the Poincare - Dulac obtaining quasi-normal form and the subsequent application of the theorems of conformity. In this case, the result of the application of quasi-normal forms is a countable system of differential-difference equations, which can be turned into a boundary value problem of the Korteweg - de Vries equation. The investigation of this boundary value problem allows us to draw a conclusion about the behaviour of the original equation. Namely, for a suitable choice of parameters in the framework of this equation is implemented buffer phenomenon consisting in the presence of the bifurcation mechanism for the birth of an arbitrarily large number of stable cycles.

Electrical synchronization of spin-torque oscillators driven by self-emitted high frequency current (Conference Presentation)

NASA Astrophysics Data System (ADS)

Tsunegi, Sumito; Lebrun, Romain; Grimaldi, Eva; Jenkins, Alex S.; Kubota, Hitoshi; Yakushiji, Kay; Bortolotti, Paolo; Grollier, Julie; Fukushima, Akio; Yuasa, Shinji; Cros, Vincent

2016-10-01

The rich physics of spin transfer nano-oscillators (STNO) has provoked a huge interest to create a new generation of multi-functional microwave spintronic devices [1]. It has been often emphasized that their nonlinear behavior gives a unique opportunity to tune their radiofrequency (rf) properties but at the cost of large phase noise, not compatible with practical applications. To tackle this issue as well as to open the opportunities to new developments for non-boolean computations [1], one strategy is to use electrical synchronization of STOs through the rf current. Thereby, it is crucial to understand how the synchronization forces transmitted through the electric current. In this talk, we will first present the results of an experimental study showing the self-synchronization of STNO by re-injecting its rf current after a certain delay time [2]. In the second part, we demonstrate that the synchronization of two vortex-STNOs connected in parallel can be tuned either by an artificial delay or by the spin transfer torques [3]. The synchronization of spin-torque oscillators, combined with the drastic improvement of the rf-features (linewidth decreases by a factor of 2 and power increases by a factor of 4) in the synchronized state, marks an important milestone towards a new generation of rf-devices based on STNO. The authors acknowledge the financial support from ANR agency (SPINNOVA: ANR-11-NANO-0016) and EU grant (MOSAIC: ICT-FP7-317950). [1] N. Locatelli, V. Cros, and J. Grollier, Nat Mater 13, 11 (2014). [2] S. Tsunegi et al., arXiv:1509.05583 (2015) [3] R. Lebrun et al., arXiv:1601.01247 (2016)

A partial differential equation model and its reduction to an ordinary differential equation model for prostate tumor growth under intermittent hormone therapy.

PubMed

Tao, Youshan; Guo, Qian; Aihara, Kazuyuki

2014-10-01

Hormonal therapy with androgen suppression is a common treatment for advanced prostate tumors. The emergence of androgen-independent cells, however, leads to a tumor relapse under a condition of long-term androgen deprivation. Clinical trials suggest that intermittent androgen suppression (IAS) with alternating on- and off-treatment periods can delay the relapse when compared with continuous androgen suppression (CAS). In this paper, we propose a mathematical model for prostate tumor growth under IAS therapy. The model elucidates initial hormone sensitivity, an eventual relapse of a tumor under CAS therapy, and a delay of a relapse under IAS therapy, which are due to the coexistence of androgen-dependent cells, androgen-independent cells resulting from reversible changes by adaptation, and androgen-independent cells resulting from irreversible changes by genetic mutations. The model is formulated as a free boundary problem of partial differential equations that describe the evolution of populations of the abovementioned three types of cells during on-treatment periods and off-treatment periods. Moreover, the model can be transformed into a piecewise linear ordinary differential equation model by introducing three new volume variables, and the study of the resulting model may help to devise optimal IAS schedules.

Time and frequency domain analysis of sampled data controllers via mixed operation equations

NASA Technical Reports Server (NTRS)

Frisch, H. P.

1981-01-01

Specification of the mathematical equations required to define the dynamic response of a linear continuous plant, subject to sampled data control, is complicated by the fact that the digital components of the control system cannot be modeled via linear ordinary differential equations. This complication can be overcome by introducing two new mathematical operations; namely, the operation of zero order hold and digial delay. It is shown that by direct utilization of these operations, a set of linear mixed operation equations can be written and used to define the dynamic response characteristics of the controlled system. It also is shown how these linear mixed operation equations lead, in an automatable manner, directly to a set of finite difference equations which are in a format compatible with follow on time and frequency domain analysis methods.

Theoretical analysis of cross-talking signals between counter-streaming electron beams in a vacuum tube oscillator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shin, Y.M.; Ryskin, N.M.; Won, J.H.

The basic theory of cross-talking signals between counter-streaming electron beams in a vacuum tube oscillator consisting of two two-cavity klystron amplifiers reversely coupled through input/output slots is theoretically investigated. Application of Kirchhoff's laws to the coupled equivalent RLC circuit model of the device provides four nonlinear coupled equations, which are the first-order time-delayed differential equations. Analytical solutions obtained through linearization of the equations provide oscillation frequencies and thresholds of four fundamental eigenstates, symmetric/antisymmetric 0/{pi} modes. Time-dependent output signals are numerically analyzed with variation of the beam current, and a self-modulation mechanism and transition to chaos scenario are examined. The oscillatormore » shows a much stronger multistability compared to a delayed feedback klystron oscillator owing to the competitions among more diverse eigenmodes. A fully developed chaos region also appears at a relatively lower beam current, {approx}3.5I{sub st}, compared to typical vacuum tube oscillators (10-100I{sub st}), where I{sub st} is a start-oscillation current.« less

Research on the speed of light transmission in a dual-frequency laser pumped single fiber with two directions

NASA Astrophysics Data System (ADS)

Qiu, Wei; Liu, Jianjun; Wang, Yuda; Yang, Yujing; Gao, Yuan; Lv, Pin; Jiang, Qiuli

2018-01-01

In this article a general theory of the coherent population oscillation effect in an erbium-doped fiber at room temperature is presented. We use dual pumping light waves with a simplified two-level system. Thus the time delay equations can be calculated from rate equations and the transmission equation. Using numerical simulation, in the case of dual-frequency pump light waves (1480 nm and 980 nm) with two directions, we analyze the influence of the pump power ratio on the group speed of light propagation. In addition, we compare slow light propagation with a single-pumping light and slow light propagation with a dual-pumping light at room temperature. The discussion shows that a larger time delay of slow light propagation can be obtained with a dual-frequency pumping laser. Compared to previous research methods, a dual-frequency laser pumped fiber with two directions is more controllable. Moreover, we conclude that the group velocity of light can be varied by changing the pump ratio.

A stochastic delay model for pricing debt and equity: Numerical techniques and applications

NASA Astrophysics Data System (ADS)

Tambue, Antoine; Kemajou Brown, Elisabeth; Mohammed, Salah

2015-01-01

Delayed nonlinear models for pricing corporate liabilities and European options were recently developed. Using self-financed strategy and duplication we were able to derive a Random Partial Differential Equation (RPDE) whose solutions describe the evolution of debt and equity values of a corporate in the last delay period interval in the accompanied paper (Kemajou et al., 2012) [14]. In this paper, we provide robust numerical techniques to solve the delayed nonlinear model for the corporate value, along with the corresponding RPDEs modeling the debt and equity values of the corporate. Using financial data from some firms, we forecast and compare numerical solutions from both the nonlinear delayed model and classical Merton model with the real corporate data. From this comparison, it comes up that in corporate finance the past dependence of the firm value process may be an important feature and therefore should not be ignored.

Steady states and outbreaks of two-phase nonlinear age-structured model of population dynamics with discrete time delay.

PubMed

Akimenko, Vitalii; Anguelov, Roumen

2017-12-01

In this paper we study the nonlinear age-structured model of a polycyclic two-phase population dynamics including delayed effect of population density growth on the mortality. Both phases are modelled as a system of initial boundary values problem for semi-linear transport equation with delay and initial problem for nonlinear delay ODE. The obtained system is studied both theoretically and numerically. Three different regimes of population dynamics for asymptotically stable states of autonomous systems are obtained in numerical experiments for the different initial values of population density. The quasi-periodical travelling wave solutions are studied numerically for the autonomous system with the different values of time delays and for the system with oscillating death rate and birth modulus. In both cases it is observed three types of travelling wave solutions: harmonic oscillations, pulse sequence and single pulse.

Automated Library System Specifications.

DTIC Science & Technology

1986-06-01

University), LIS (Georqetown Universitv Medical Center) 20 DiSTRI3UT!ON.. AVAILABILITY OF ABSTRACT 21 ABSTRACT SECURITY CLASSIFICATION :UNCLASSIFIED...Interface) acquisitions, patron access catalo. (Boolean search), authority Afiles, zana ~ezient reports. Serials control expected in 1985. INDIVIDUALIZATIOI

Global asymptotic stability and hopf bifurcation for a blood cell production model.

PubMed

Crauste, Fabien

2006-04-01

We analyze the asymptotic stability of a nonlinear system of two differential equations with delay, describing the dynamics of blood cell produc- tion. This process takes place in the bone marrow, where stem cells differen- tiate throughout division in blood cells. Taking into account an explicit role of the total population of hematopoietic stem cells in the introduction of cells in cycle, we are led to study a characteristic equation with delay-dependent coefficients. We determine a necessary and sufficient condition for the global stability of the first steady state of our model, which describes the popula- tion's dying out, and we obtain the existence of a Hopf bifurcation for the only nontrivial positive steady state, leading to the existence of periodic solutions. These latter are related to dynamical diseases affecting blood cells known for their cyclic nature.

Geodesic curve-of-sight formulae for the cosmic microwave background: a unified treatment of redshift, time delay, and lensing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saito, Ryo; Naruko, Atsushi; Hiramatsu, Takashi

2014-10-01

In this paper, we introduce a new approach to a treatment of the gravitational effects (redshift, time delay and lensing) on the observed cosmic microwave background (CMB) anisotropies based on the Boltzmann equation. From the Liouville's theorem in curved spacetime, the intensity of photons is conserved along a photon geodesic when non-gravitational scatterings are absent. Motivated by this fact, we derive a second-order line-of-sight formula by integrating the Boltzmann equation along a perturbed geodesic (curve) instead of a background geodesic (line). In this approach, the separation of the gravitational and intrinsic effects are manifest. This approach can be considered asmore » a generalization of the remapping approach of CMB lensing, where all the gravitational effects can be treated on the same footing.« less

Structural and functional networks in complex systems with delay.

PubMed

Eguíluz, Víctor M; Pérez, Toni; Borge-Holthoefer, Javier; Arenas, Alex

2011-05-01

Functional networks of complex systems are obtained from the analysis of the temporal activity of their components, and are often used to infer their unknown underlying connectivity. We obtain the equations relating topology and function in a system of diffusively delay-coupled elements in complex networks. We solve exactly the resulting equations in motifs (directed structures of three nodes) and in directed networks. The mean-field solution for directed uncorrelated networks shows that the clusterization of the activity is dominated by the in-degree of the nodes, and that the locking frequency decreases with increasing average degree. We find that the exponent of a power law degree distribution of the structural topology γ is related to the exponent of the associated functional network as α=(2-γ)(-1) for γ<2. © 2011 American Physical Society

Synchronization of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions and Infinite Delays.

PubMed

Sheng, Yin; Zhang, Hao; Zeng, Zhigang

2017-10-01

This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.

Sampled-data chain-observer design for a class of delayed nonlinear systems

NASA Astrophysics Data System (ADS)

Kahelras, M.; Ahmed-Ali, T.; Giri, F.; Lamnabhi-Lagarrigue, F.

2018-05-01

The problem of observer design is addressed for a class of triangular nonlinear systems with not-necessarily small delay and sampled output measurements. One more difficulty is that the system state matrix is dependent on the un-delayed output signal which is not accessible to measurement, making existing observers inapplicable. A new chain observer, composed of m elementary observers in series, is designed to compensate for output sampling and arbitrary large delays. The larger the time-delay the larger the number m. Each elementary observer includes an output predictor that is conceived to compensate for the effects of output sampling and a fractional delay. The predictors are defined by first-order ordinary differential equations (ODEs) much simpler than those of existing predictors which involve both output and state predictors. Using a small gain type analysis, sufficient conditions for the observer to be exponentially convergent are established in terms of the minimal number m of elementary observers and the maximum sampling interval.

Adaptive Fading Memory H∞ Filter Design for Compensation of Delayed Components in Self Powered Flux Detectors

NASA Astrophysics Data System (ADS)

Tamboli, Prakash Kumar; Duttagupta, Siddhartha P.; Roy, Kallol

2015-08-01

The paper deals with dynamic compensation of delayed Self Powered Flux Detectors (SPFDs) using discrete time H∞ filtering method for improving the response of SPFDs with significant delayed components such as Platinum and Vanadium SPFD. We also present a comparative study between the Linear Matrix Inequality (LMI) based H∞ filtering and Algebraic Riccati Equation (ARE) based Kalman filtering methods with respect to their delay compensation capabilities. Finally an improved recursive H∞ filter based on the adaptive fading memory technique is proposed which provides an improved performance over existing methods. The existing delay compensation algorithms do not account for the rate of change in the signal for determining the filter gain and therefore add significant noise during the delay compensation process. The proposed adaptive fading memory H∞ filter minimizes the overall noise very effectively at the same time keeps the response time at minimum values. The recursive algorithm is easy to implement in real time as compared to the LMI (or ARE) based solutions.

Controlling Mackey-Glass chaos.

PubMed

Kiss, Gábor; Röst, Gergely

2017-11-01

The Mackey-Glass equation is the representative example of delay induced chaotic behavior. Here, we propose various control mechanisms so that otherwise erratic solutions are forced to converge to the positive equilibrium or to a periodic orbit oscillating around that equilibrium. We take advantage of some recent results of the delay differential literature, when a sufficiently large domain of the phase space has been shown to be attractive and invariant, where the system is governed by monotone delayed feedback and chaos is not possible due to some Poincaré-Bendixson type results. We systematically investigate what control mechanisms are suitable to drive the system into such a situation and prove that constant perturbation, proportional feedback control, Pyragas control, and state dependent delay control can all be efficient to control Mackey-Glass chaos with properly chosen control parameters.

Controlling Mackey-Glass chaos

NASA Astrophysics Data System (ADS)

Kiss, Gábor; Röst, Gergely

2017-11-01

The Mackey-Glass equation is the representative example of delay induced chaotic behavior. Here, we propose various control mechanisms so that otherwise erratic solutions are forced to converge to the positive equilibrium or to a periodic orbit oscillating around that equilibrium. We take advantage of some recent results of the delay differential literature, when a sufficiently large domain of the phase space has been shown to be attractive and invariant, where the system is governed by monotone delayed feedback and chaos is not possible due to some Poincaré-Bendixson type results. We systematically investigate what control mechanisms are suitable to drive the system into such a situation and prove that constant perturbation, proportional feedback control, Pyragas control, and state dependent delay control can all be efficient to control Mackey-Glass chaos with properly chosen control parameters.

Evaluating the Coda Phase Delay Method for Determining Temperature Ratios in Windy Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Albert, Sarah; Bowman, Daniel; Rodgers, Arthur

2017-07-01

We evaluate the acoustic coda phase delay method for estimating changes in atmospheric phenomena in realistic environments. Previous studies verifying the method took place in an environment with negligible wind. The equation for effective sound speed, which the method is based upon, shows that the influence of wind is equal to the square of temperature. Under normal conditions, wind is significant and therefore cannot be ignored. Results from this study con rm the previous statement. The acoustic coda phase delay method breaks down in non-ideal environments, namely those where wind speed and direction varies across small distances. We suggest thatmore » future studies make use of gradiometry to better understand the effect of wind on the acoustic coda and subsequent phase delays.« less

Symmetry, Hopf bifurcation, and the emergence of cluster solutions in time delayed neural networks.

PubMed

Wang, Zhen; Campbell, Sue Ann

2017-11-01

We consider the networks of N identical oscillators with time delayed, global circulant coupling, modeled by a system of delay differential equations with Z N symmetry. We first study the existence of Hopf bifurcations induced by the coupling time delay and then use symmetric Hopf bifurcation theory to determine how these bifurcations lead to different patterns of symmetric cluster oscillations. We apply our results to a case study: a network of FitzHugh-Nagumo neurons with diffusive coupling. For this model, we derive the asymptotic stability, global asymptotic stability, absolute instability, and stability switches of the equilibrium point in the plane of coupling time delay (τ) and excitability parameter (a). We investigate the patterns of cluster oscillations induced by the time delay and determine the direction and stability of the bifurcating periodic orbits by employing the multiple timescales method and normal form theory. We find that in the region where stability switching occurs, the dynamics of the system can be switched from the equilibrium point to any symmetric cluster oscillation, and back to equilibrium point as the time delay is increased.

Learning monopolies with delayed feedback on price expectations

NASA Astrophysics Data System (ADS)

Matsumoto, Akio; Szidarovszky, Ferenc

2015-11-01

We call the intercept of the price function with the vertical axis the maximum price and the slope of the price function the marginal price. In this paper it is assumed that a monopolistic firm has full information about the marginal price and its own cost function but is uncertain on the maximum price. However, by repeated interaction with the market, the obtained price observations give a basis for an adaptive learning process of the maximum price. It is also assumed that the price observations have fixed delays, so the learning process can be described by a delayed differential equation. In the cases of one or two delays, the asymptotic behavior of the resulting dynamic process is examined, stability conditions are derived. Three main results are demonstrated in the two delay learning processes. First, it is possible to stabilize the equilibrium which is unstable in the one delay model. Second, complex dynamics involving chaos, which is impossible in the one delay model, can emerge. Third, alternations of stability and instability (i.e., stability switches) occur repeatedly.

Differential Equations and Computational Simulations

DTIC Science & Technology

1999-06-18

divergence operator of a vector field, which can be defined in terms of the Levi - Civita connection. Let $(x, t) be the orbit passing through x g M...differential equations 31 Junping Chen and Dadi Yang The limit cycle of two species predator-prey model with general functional response > 34 S. S...analysis of two -species nonlinear competition system with periodic coefficients 286 X. H. Tang and J. S. Yu Oscillation of first order delay

Nonvolatile reconfigurable sequential logic in a HfO2 resistive random access memory array.

PubMed

Zhou, Ya-Xiong; Li, Yi; Su, Yu-Ting; Wang, Zhuo-Rui; Shih, Ling-Yi; Chang, Ting-Chang; Chang, Kuan-Chang; Long, Shi-Bing; Sze, Simon M; Miao, Xiang-Shui

2017-05-25

Resistive random access memory (RRAM) based reconfigurable logic provides a temporal programmable dimension to realize Boolean logic functions and is regarded as a promising route to build non-von Neumann computing architecture. In this work, a reconfigurable operation method is proposed to perform nonvolatile sequential logic in a HfO 2 -based RRAM array. Eight kinds of Boolean logic functions can be implemented within the same hardware fabrics. During the logic computing processes, the RRAM devices in an array are flexibly configured in a bipolar or complementary structure. The validity was demonstrated by experimentally implemented NAND and XOR logic functions and a theoretically designed 1-bit full adder. With the trade-off between temporal and spatial computing complexity, our method makes better use of limited computing resources, thus provides an attractive scheme for the construction of logic-in-memory systems.

Synthesizing Biomolecule-based Boolean Logic Gates

PubMed Central

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

Interconnect-free parallel logic circuits in a single mechanical resonator

PubMed Central

Mahboob, I.; Flurin, E.; Nishiguchi, K.; Fujiwara, A.; Yamaguchi, H.

2011-01-01

In conventional computers, wiring between transistors is required to enable the execution of Boolean logic functions. This has resulted in processors in which billions of transistors are physically interconnected, which limits integration densities, gives rise to huge power consumption and restricts processing speeds. A method to eliminate wiring amongst transistors by condensing Boolean logic into a single active element is thus highly desirable. Here, we demonstrate a novel logic architecture using only a single electromechanical parametric resonator into which multiple channels of binary information are encoded as mechanical oscillations at different frequencies. The parametric resonator can mix these channels, resulting in new mechanical oscillation states that enable the construction of AND, OR and XOR logic gates as well as multibit logic circuits. Moreover, the mechanical logic gates and circuits can be executed simultaneously, giving rise to the prospect of a parallel logic processor in just a single mechanical resonator. PMID:21326230

Interconnect-free parallel logic circuits in a single mechanical resonator.

PubMed

Mahboob, I; Flurin, E; Nishiguchi, K; Fujiwara, A; Yamaguchi, H

2011-02-15

In conventional computers, wiring between transistors is required to enable the execution of Boolean logic functions. This has resulted in processors in which billions of transistors are physically interconnected, which limits integration densities, gives rise to huge power consumption and restricts processing speeds. A method to eliminate wiring amongst transistors by condensing Boolean logic into a single active element is thus highly desirable. Here, we demonstrate a novel logic architecture using only a single electromechanical parametric resonator into which multiple channels of binary information are encoded as mechanical oscillations at different frequencies. The parametric resonator can mix these channels, resulting in new mechanical oscillation states that enable the construction of AND, OR and XOR logic gates as well as multibit logic circuits. Moreover, the mechanical logic gates and circuits can be executed simultaneously, giving rise to the prospect of a parallel logic processor in just a single mechanical resonator.

Calculating the bidirectional reflectance of natural vegetation covers using Boolean models and geometric optics

NASA Technical Reports Server (NTRS)

Strahler, Alan H.; Li, Xiao-Wen; Jupp, David L. B.

1991-01-01

The bidirectional radiance or reflectance of a forest or woodland can be modeled using principles of geometric optics and Boolean models for random sets in a three dimensional space. This model may be defined at two levels, the scene includes four components; sunlight and shadowed canopy, and sunlit and shadowed background. The reflectance of the scene is modeled as the sum of the reflectances of the individual components as weighted by their areal proportions in the field of view. At the leaf level, the canopy envelope is an assemblage of leaves, and thus the reflectance is a function of the areal proportions of sunlit and shadowed leaf, and sunlit and shadowed background. Because the proportions of scene components are dependent upon the directions of irradiance and exitance, the model accounts for the hotspot that is well known in leaf and tree canopies.

Synthesizing biomolecule-based Boolean logic gates.

PubMed

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.

Simultaneous G-Quadruplex DNA Logic.

PubMed

Bader, Antoine; Cockroft, Scott L

2018-04-03

A fundamental principle of digital computer operation is Boolean logic, where inputs and outputs are described by binary integer voltages. Similarly, inputs and outputs may be processed on the molecular level as exemplified by synthetic circuits that exploit the programmability of DNA base-pairing. Unlike modern computers, which execute large numbers of logic gates in parallel, most implementations of molecular logic have been limited to single computing tasks, or sensing applications. This work reports three G-quadruplex-based logic gates that operate simultaneously in a single reaction vessel. The gates respond to unique Boolean DNA inputs by undergoing topological conversion from duplex to G-quadruplex states that were resolved using a thioflavin T dye and gel electrophoresis. The modular, addressable, and label-free approach could be incorporated into DNA-based sensors, or used for resolving and debugging parallel processes in DNA computing applications. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Satisfiability of logic programming based on radial basis function neural networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged

2014-07-10

In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We appliedmore » the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.« less

Altered Micro-RNA Degradation Promotes Tumor Heterogeneity: A Result from Boolean Network Modeling.

PubMed

Wu, Yunyi; Krueger, Gerhard R F; Wang, Guanyu

2016-02-01

Cancer heterogeneity may reflect differential dynamical outcomes of the regulatory network encompassing biomolecules at both transcriptional and post-transcriptional levels. In other words, differential gene-expression profiles may correspond to different stable steady states of a mathematical model for simulation of biomolecular networks. To test this hypothesis, we simplified a regulatory network that is important for soft-tissue sarcoma metastasis and heterogeneity, comprising of transcription factors, micro-RNAs, and signaling components of the NOTCH pathway. We then used a Boolean network model to simulate the dynamics of this network, and particularly investigated the consequences of differential miRNA degradation modes. We found that efficient miRNA degradation is crucial for sustaining a homogenous and healthy phenotype, while defective miRNA degradation may lead to multiple stable steady states and ultimately to carcinogenesis and heterogeneity. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.

A solution to the surface intersection problem. [Boolean functions in geometric modeling

NASA Technical Reports Server (NTRS)

Timer, H. G.

1977-01-01

An application-independent geometric model within a data base framework should support the use of Boolean operators which allow the user to construct a complex model by appropriately combining a series of simple models. The use of these operators leads to the concept of implicitly and explicitly defined surfaces. With an explicitly defined model, the surface area may be computed by simply summing the surface areas of the bounding surfaces. For an implicitly defined model, the surface area computation must deal with active and inactive regions. Because the surface intersection problem involves four unknowns and its solution is a space curve, the parametric coordinates of each surface must be determined as a function of the arc length. Various subproblems involved in the general intersection problem are discussed, and the mathematical basis for their solution is presented along with a program written in FORTRAN IV for implementation on the IBM 370 TSO system.

Polynomial algebra of discrete models in systems biology.

PubMed

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Graphene-based non-Boolean logic circuits

NASA Astrophysics Data System (ADS)

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.

Stability analysis of a liquid fuel annular combustion chamber. M.S. Thesis

NASA Technical Reports Server (NTRS)

Mcdonald, G. H.

1979-01-01

The problems of combustion instability in an annular combustion chamber are investigated. A modified Galerkin method was used to produce a set of modal amplitude equations from the general nonlinear partial differential acoustic wave equation. From these modal amplitude equations, the two variable perturbation method was used to develop a set of approximate equations of a given order of magnitude. These equations were modeled to show the effects of velocity sensitive combustion instabilities by evaluating the effects of certain parameters in the given set of equations. By evaluating these effects, parameters which cause instabilities to occur in the combustion chamber can be ascertained. It is assumed that in the annular combustion chamber, the liquid propellants are injected uniformly across the injector face, the combustion processes are distributed throughout the combustion chamber, and that no time delay occurs in the combustion processes.

How time delay and network design shape response patterns in biochemical negative feedback systems.

PubMed

Börsch, Anastasiya; Schaber, Jörg

2016-08-24

Negative feedback in combination with time delay can bring about both sustained oscillations and adaptive behaviour in cellular networks. Here, we study which design features of systems with delayed negative feedback shape characteristic response patterns with special emphasis on the role of time delay. To this end, we analyse generic two-dimensional delay differential equations describing the dynamics of biochemical signal-response networks. We investigate the influence of several design features on the stability of the model equilibrium, i.e., presence of auto-inhibition and/or mass conservation and the kind and/or strength of the delayed negative feedback. We show that auto-inhibition and mass conservation have a stabilizing effect, whereas increasing abruptness and decreasing feedback threshold have a de-stabilizing effect on the model equilibrium. Moreover, applying our theoretical analysis to the mammalian p53 system we show that an auto-inhibitory feedback can decouple period and amplitude of an oscillatory response, whereas the delayed feedback can not. Our theoretical framework provides insight into how time delay and design features of biochemical networks act together to elicit specific characteristic response patterns. Such insight is useful for constructing synthetic networks and controlling their behaviour in response to external stimulation.

Factors associated with sustained remission in patients with rheumatoid arthritis.

PubMed

Martire, María Victoria; Marino Claverie, Lucila; Duarte, Vanesa; Secco, Anastasia; Mammani, Marta

2015-01-01

To find out the factors that are associated with sustained remission measured by DAS28 and boolean ACR EULAR 2011 criteria at the time of diagnosis of rheumatoid arthritis. Medical records of patients with rheumatoid arthritis in sustained remission according to DAS28 were reviewed. They were compared with patients who did not achieved values of DAS28<2.6 in any visit during the first 3 years after diagnosis. We also evaluated if patients achieved the boolean ACR/EULAR criteria. Variables analyzed: sex, age, smoking, comorbidities, rheumatoid factor, anti-CCP, ESR, CRP, erosions, HAQ, DAS28, extra-articular manifestations, time to initiation of treatment, involvement of large joints, number of tender joints, number of swollen joints, pharmacological treatment. Forty five patients that achieved sustained remission were compared with 44 controls. The variables present at diagnosis that significantly were associated with remission by DAS28 were: lower values of DAS28, HAQ, ESR, NTJ, NSJ, negative CRP, absence of erosions, male sex and absence of involvement of large joints. Only 24.71% achieved the boolean criteria. The variables associated with sustained remission by these criteria were: lower values of DAS28, HAQ, ESR, number of tender joints and number of swollen joints, negative CRP and absence of erosions. The factors associated with sustained remission were the lower baseline disease activity, the low degree of functional disability and lower joint involvement. We consider it important to recognize these factors to optimize treatment. Copyright © 2014 Elsevier España, S.L.U. All rights reserved.

Jimena: efficient computing and system state identification for genetic regulatory networks.

PubMed

Karl, Stefan; Dandekar, Thomas

2013-10-11

Boolean networks capture switching behavior of many naturally occurring regulatory networks. For semi-quantitative modeling, interpolation between ON and OFF states is necessary. The high degree polynomial interpolation of Boolean genetic regulatory networks (GRNs) in cellular processes such as apoptosis or proliferation allows for the modeling of a wider range of node interactions than continuous activator-inhibitor models, but suffers from scaling problems for networks which contain nodes with more than ~10 inputs. Many GRNs from literature or new gene expression experiments exceed those limitations and a new approach was developed. (i) As a part of our new GRN simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms greatly expedite the calculation of the polynomial interpolation in almost all cases, thereby expanding the range of networks which can be simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently counted and identified using binary decision diagrams. As application example, we show how system states can now be sampled efficiently in small up to large scale hormone disease networks (Arabidopsis thaliana development and immunity, pathogen Pseudomonas syringae and modulation by cytokinins and plant hormones). Jimena simulates currently available GRNs about 10-100 times faster than the previous implementation of the polynomial interpolation model and even greater gains are achieved for large scale-free networks. This speed-up also facilitates a much more thorough sampling of continuous state spaces which may lead to the identification of new stable states. Mutants of large networks can be constructed and analyzed very quickly enabling new insights into network robustness and behavior.

Boolean Operations with Prism Algebraic Patches

PubMed Central

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

Computing smallest intervention strategies for multiple metabolic networks in a boolean model.

PubMed

Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya

2015-02-01

This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online.

Modelling and control issues of dynamically substructured systems: adaptive forward prediction taken as an example

PubMed Central

Tu, Jia-Ying; Hsiao, Wei-De; Chen, Chih-Ying

2014-01-01

Testing techniques of dynamically substructured systems dissects an entire engineering system into parts. Components can be tested via numerical simulation or physical experiments and run synchronously. Additional actuator systems, which interface numerical and physical parts, are required within the physical substructure. A high-quality controller, which is designed to cancel unwanted dynamics introduced by the actuators, is important in order to synchronize the numerical and physical outputs and ensure successful tests. An adaptive forward prediction (AFP) algorithm based on delay compensation concepts has been proposed to deal with substructuring control issues. Although the settling performance and numerical conditions of the AFP controller are improved using new direct-compensation and singular value decomposition methods, the experimental results show that a linear dynamics-based controller still outperforms the AFP controller. Based on experimental observations, the least-squares fitting technique, effectiveness of the AFP compensation and differences between delay and ordinary differential equations are discussed herein, in order to reflect the fundamental issues of actuator modelling in relevant literature and, more specifically, to show that the actuator and numerical substructure are heterogeneous dynamic components and should not be collectively modelled as a homogeneous delay differential equation. PMID:25104902

Electrocardiogram classification using delay differential equations

NASA Astrophysics Data System (ADS)

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.

Surface Craft Motion Parameter Estimation Using Multipath Delay Measurements from Hydrophones

DTIC Science & Technology

2011-12-01

the sensor is cd . The slant range of the source from the sensor at time t is given by 21222 ])([)( cc RtvtR +−= τ ( 1 ) where 2122 ])[( crtc dhhR...Surface Craft Motion Parameter Estimation Using Multipath Delay Measurements from Hydrophones Kam W. Lo # 1 and Brian G. Ferguson #2 # Maritime...Eveleigh, NSW 2015 Australia 1 kam.lo@dsto.defence.gov.au 2 brian.ferguson@dsto.defence.gov.au Abstract— An equation-error (EE) method is

Class-A mode-locked lasers: Fundamental solutions

NASA Astrophysics Data System (ADS)

Kovalev, Anton V.; Viktorov, Evgeny A.

2017-11-01

We consider a delay differential equation (DDE) model for mode-locked operation in class-A semiconductor lasers containing both gain and absorber sections. The material processes are adiabatically eliminated as these are considered fast in comparison to the delay time for a long cavity device. We determine the steady states and analyze their bifurcations using DDE-BIFTOOL [Engelborghs et al., ACM Trans. Math. Software 28, 1 (2002)]. Multiple forms of coexistence, transformation, and hysteretic behavior of stable steady states and fundamental periodic regimes are discussed in bifurcation diagrams.

A new approach to approximating the linear quadratic optimal control law for hereditary systems with control delays

NASA Technical Reports Server (NTRS)

Milman, M. H.

1985-01-01

A factorization approach is presented for deriving approximations to the optimal feedback gain for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the feedback kernels.

A Note about Information Science Research.

ERIC Educational Resources Information Center

Salton, Gerard

1985-01-01

Discusses the relationship between information science research and practice and briefly describes current research on 10 topics in information retrieval literature: vector processing retrieval strategy, probabilistic retrieval models, inverted file procedures, relevance feedback, Boolean query formulations, front-end procedures, citation…

Bibliographic Instruction in the 21st Century.

ERIC Educational Resources Information Center

Poirier, Gayle

2000-01-01

Discusses bibliographic instruction in libraries. Topics include a history of bibliographic instruction; the Internet and electronic searching; librarians' use of technology; defining information needs; locating and accessing information, including classification systems and Boolean searching; evaluating information; using and communication…

Traveling wavefront solutions to nonlinear reaction-diffusion-convection equations

NASA Astrophysics Data System (ADS)

Indekeu, Joseph O.; Smets, Ruben

2017-08-01

Physically motivated modified Fisher equations are studied in which nonlinear convection and nonlinear diffusion is allowed for besides the usual growth and spread of a population. It is pointed out that in a large variety of cases separable functions in the form of exponentially decaying sharp wavefronts solve the differential equation exactly provided a co-moving point source or sink is active at the wavefront. The velocity dispersion and front steepness may differ from those of some previously studied exact smooth traveling wave solutions. For an extension of the reaction-diffusion-convection equation, featuring a memory effect in the form of a maturity delay for growth and spread, also smooth exact wavefront solutions are obtained. The stability of the solutions is verified analytically and numerically.

From Nothing to Something II: Nonlinear Systems via Consistent Correlated Bang

NASA Astrophysics Data System (ADS)

Lou, Sen-Yue

2017-06-01

Chinese ancient sage Laozi said everything comes from \\emph{\\bf \\em "nothing"}. \\rm In the first letter (Chin. Phys. Lett. 30 (2013) 080202), infinitely many discrete integrable systems have been obtained from "nothing" via simple principles (Dao). In this second letter, a new idea, the consistent correlated bang, is introduced to obtain nonlinear dynamic systems including some integrable ones such as the continuous nonlinear Schr\\"odinger equation (NLS), the (potential) Korteweg de Vries (KdV) equation, the (potential) Kadomtsev-Petviashvili (KP) equation and the sine-Gordon (sG) equation. These nonlinear systems are derived from nothing via suitable "Dao", the shifted parity, the charge conjugate, the delayed time reversal, the shifted exchange, the shifted-parity-rotation and so on.

Quantization improves stabilization of dynamical systems with delayed feedback

NASA Astrophysics Data System (ADS)

Stepan, Gabor; Milton, John G.; Insperger, Tamas

2017-11-01

We show that an unstable scalar dynamical system with time-delayed feedback can be stabilized by quantizing the feedback. The discrete time model corresponds to a previously unrecognized case of the microchaotic map in which the fixed point is both locally and globally repelling. In the continuous-time model, stabilization by quantization is possible when the fixed point in the absence of feedback is an unstable node, and in the presence of feedback, it is an unstable focus (spiral). The results are illustrated with numerical simulation of the unstable Hayes equation. The solutions of the quantized Hayes equation take the form of oscillations in which the amplitude is a function of the size of the quantization step. If the quantization step is sufficiently small, the amplitude of the oscillations can be small enough to practically approximate the dynamics around a stable fixed point.

A delay differential equation model for dengue transmission with regular visits to a mosquito breeding site

NASA Astrophysics Data System (ADS)

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.

Delay-bandwidth product of electromagnetically induced transparency media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tidstroem, Jonas; Jaenes, Peter; Andersson, L. Mauritz

2007-05-15

The limitations on the delay-bandwidth product (DBP) in an electromagnetically induced transparency medium are investigated analytically by studying the susceptibility of the system, derived through Lindblad's master equation, including dephasing. The effect of inhomogeneous broadening is treated. It is shown that the DBP for a given material is fundamentally limited by the frequency-dependent absorption, while the residual absorption limits the penetration length of a pulse. Simple expression for the optimal choice of parameters to maximize the DBP are derived. Also, the length of a device is presented as a function of DBP and control-field Rabi frequency. Supporting these results, numericalmore » calculations are carried out through the Maxwell-Bloch equations in the slowly varying envelope approximation. The results are scalable, hence they apply to the case of atoms or molecules in a gas as well as quantum dots and wells.« less

Solvability of some partial functional integrodifferential equations with finite delay and optimal controls in Banach spaces.

PubMed

Ezzinbi, Khalil; Ndambomve, Patrice

2016-01-01

In this work, we consider the control system governed by some partial functional integrodifferential equations with finite delay in Banach spaces. We assume that the undelayed part admits a resolvent operator in the sense of Grimmer. Firstly, some suitable conditions are established to guarantee the existence and uniqueness of mild solutions for a broad class of partial functional integrodifferential infinite dimensional control systems. Secondly, it is proved that, under generally mild conditions of cost functional, the associated Lagrange problem has an optimal solution, and that for each optimal solution there is a minimizing sequence of the problem that converges to the optimal solution with respect to the trajectory, the control, and the functional in appropriate topologies. Our results extend and complement many other important results in the literature. Finally, a concrete example of application is given to illustrate the effectiveness of our main results.

Anticontrol of chaos in continuous-time systems via time-delay feedback.

PubMed

Wang, Xiao Fan; Chen, Guanrong; Yu, Xinghuo

2000-12-01

In this paper, a systematic design approach based on time-delay feedback is developed for anticontrol of chaos in a continuous-time system. This anticontrol method can drive a finite-dimensional, continuous-time, autonomous system from nonchaotic to chaotic, and can also enhance the existing chaos of an originally chaotic system. Asymptotic analysis is used to establish an approximate relationship between a time-delay differential equation and a discrete map. Anticontrol of chaos is then accomplished based on this relationship and the differential-geometry control theory. Several examples are given to verify the effectiveness of the methodology and to illustrate the systematic design procedure. (c) 2000 American Institute of Physics.

Ikeda-like chaos on a dynamically filtered supercontinuum light source

NASA Astrophysics Data System (ADS)

Chembo, Yanne K.; Jacquot, Maxime; Dudley, John M.; Larger, Laurent

2016-08-01

We demonstrate temporal chaos in a color-selection mechanism from the visible spectrum of a supercontinuum light source. The color-selection mechanism is governed by an acousto-optoelectronic nonlinear delayed-feedback scheme modeled by an Ikeda-like equation. Initially motivated by the design of a broad audience live demonstrator in the framework of the International Year of Light 2015, the setup also provides a different experimental tool to investigate the dynamical complexity of delayed-feedback dynamics. Deterministic hyperchaos is analyzed here from the experimental time series. A projection method identifies the delay parameter, for which the chaotic strange attractor originally evolving in an infinite-dimensional phase space can be revealed in a two-dimensional subspace.

Estimation of time-delayed mutual information and bias for irregularly and sparsely sampled time-series

PubMed Central

Albers, D. J.; Hripcsak, George

2012-01-01

A method to estimate the time-dependent correlation via an empirical bias estimate of the time-delayed mutual information for a time-series is proposed. In particular, the bias of the time-delayed mutual information is shown to often be equivalent to the mutual information between two distributions of points from the same system separated by infinite time. Thus intuitively, estimation of the bias is reduced to estimation of the mutual information between distributions of data points separated by large time intervals. The proposed bias estimation techniques are shown to work for Lorenz equations data and glucose time series data of three patients from the Columbia University Medical Center database. PMID:22536009

Numerical analysis for trajectory controllability of a coupled multi-order fractional delay differential system via the shifted Jacobi method

NASA Astrophysics Data System (ADS)

Priya, B. Ganesh; Muthukumar, P.

2018-02-01

This paper deals with the trajectory controllability for a class of multi-order fractional linear systems subject to a constant delay in state vector. The solution for the coupled fractional delay differential equation is established by the Mittag-Leffler function. The necessary and sufficient condition for the trajectory controllability is formulated and proved by the generalized Gronwall's inequality. The approximate trajectory for the proposed system is obtained through the shifted Jacobi operational matrix method. The numerical simulation of the approximate solution shows the theoretical results. Finally, some remarks and comments on the existing results of constrained controllability for the fractional dynamical system are also presented.

IERS Conventions (2003)

DTIC Science & Technology

2004-01-01

International Earth Rotation and Reference Systems Service (IERS) Service International de la Rotation Terrestre et des Systèmes de Référence IERS...Equation for the determination of the density of moist air (1981/91),” Metrologia , 29, pp. 67–70. Giacomo, P., 1982, “Equation for the determination of...the density of moist air (1981),” Metrologia , 18, pp. 33–40. Herring, T. A., 1992, “Modeling Atmospheric Delays in the Analysis of Space Geodetic Data

Stochastic nonlinear time series forecasting using time-delay reservoir computers: performance and universality.

PubMed

Grigoryeva, Lyudmila; Henriques, Julie; Larger, Laurent; Ortega, Juan-Pablo

2014-07-01

Reservoir computing is a recently introduced machine learning paradigm that has already shown excellent performances in the processing of empirical data. We study a particular kind of reservoir computers called time-delay reservoirs that are constructed out of the sampling of the solution of a time-delay differential equation and show their good performance in the forecasting of the conditional covariances associated to multivariate discrete-time nonlinear stochastic processes of VEC-GARCH type as well as in the prediction of factual daily market realized volatilities computed with intraday quotes, using as training input daily log-return series of moderate size. We tackle some problems associated to the lack of task-universality for individually operating reservoirs and propose a solution based on the use of parallel arrays of time-delay reservoirs. Copyright © 2014 Elsevier Ltd. All rights reserved.

D-VASim: an interactive virtual laboratory environment for the simulation and analysis of genetic circuits.

PubMed

Baig, Hasan; Madsen, Jan

2017-01-15

Simulation and behavioral analysis of genetic circuits is a standard approach of functional verification prior to their physical implementation. Many software tools have been developed to perform in silico analysis for this purpose, but none of them allow users to interact with the model during runtime. The runtime interaction gives the user a feeling of being in the lab performing a real world experiment. In this work, we present a user-friendly software tool named D-VASim (Dynamic Virtual Analyzer and Simulator), which provides a virtual laboratory environment to simulate and analyze the behavior of genetic logic circuit models represented in an SBML (Systems Biology Markup Language). Hence, SBML models developed in other software environments can be analyzed and simulated in D-VASim. D-VASim offers deterministic as well as stochastic simulation; and differs from other software tools by being able to extract and validate the Boolean logic from the SBML model. D-VASim is also capable of analyzing the threshold value and propagation delay of a genetic circuit model. D-VASim is available for Windows and Mac OS and can be downloaded from bda.compute.dtu.dk/downloads/. haba@dtu.dk, jama@dtu.dk. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Fredkin and Toffoli Gates Implemented in Oregonator Model of Belousov-Zhabotinsky Medium

NASA Astrophysics Data System (ADS)

Adamatzky, Andrew

A thin-layer Belousov-Zhabotinsky (BZ) medium is a powerful computing device capable for implementing logical circuits, memory, image processors, robot controllers, and neuromorphic architectures. We design the reversible logical gates — Fredkin gate and Toffoli gate — in a BZ medium network of excitable channels with subexcitable junctions. Local control of the BZ medium excitability is an important feature of the gates’ design. An excitable thin-layer BZ medium responds to a localized perturbation with omnidirectional target or spiral excitation waves. A subexcitable BZ medium responds to an asymmetric perturbation by producing traveling localized excitation wave-fragments similar to dissipative solitons. We employ interactions between excitation wave-fragments to perform the computation. We interpret the wave-fragments as values of Boolean variables. The presence of a wave-fragment at a given site of a circuit represents the logical truth, absence of the wave-fragment — logically false. Fredkin gate consists of ten excitable channels intersecting at 11 junctions, eight of which are subexcitable. Toffoli gate consists of six excitable channels intersecting at six junctions, four of which are subexcitable. The designs of the gates are verified using numerical integration of two-variable Oregonator equations.

Mathematical models for space shuttle ground systems

NASA Technical Reports Server (NTRS)

Tory, E. G.

1985-01-01

Math models are a series of algorithms, comprised of algebraic equations and Boolean Logic. At Kennedy Space Center, math models for the Space Shuttle Systems are performed utilizing the Honeywell 66/80 digital computers, Modcomp II/45 Minicomputers and special purpose hardware simulators (MicroComputers). The Shuttle Ground Operations Simulator operating system provides the language formats, subroutines, queueing schemes, execution modes and support software to write, maintain and execute the models. The ground systems presented consist primarily of the Liquid Oxygen and Liquid Hydrogen Cryogenic Propellant Systems, as well as liquid oxygen External Tank Gaseous Oxygen Vent Hood/Arm and the Vehicle Assembly Building (VAB) High Bay Cells. The purpose of math modeling is to simulate the ground hardware systems and to provide an environment for testing in a benign mode. This capability allows the engineers to check out application software for loading and launching the vehicle, and to verify the Checkout, Control, & Monitor Subsystem within the Launch Processing System. It is also used to train operators and to predict system response and status in various configurations (normal operations, emergency and contingent operations), including untried configurations or those too dangerous to try under real conditions, i.e., failure modes.