WorldWideScience

Sample records for boolean biological regulatory

  1. Additive functions in boolean models of gene regulatory network modules.

    Science.gov (United States)

    Darabos, Christian; Di Cunto, Ferdinando; Tomassini, Marco; Moore, Jason H; Provero, Paolo; Giacobini, Mario

    2011-01-01

    Gene-on-gene regulations are key components of every living organism. Dynamical abstract models of genetic regulatory networks help explain the genome's evolvability and robustness. These properties can be attributed to the structural topology of the graph formed by genes, as vertices, and regulatory interactions, as edges. Moreover, the actual gene interaction of each gene is believed to play a key role in the stability of the structure. With advances in biology, some effort was deployed to develop update functions in boolean models that include recent knowledge. We combine real-life gene interaction networks with novel update functions in a boolean model. We use two sub-networks of biological organisms, the yeast cell-cycle and the mouse embryonic stem cell, as topological support for our system. On these structures, we substitute the original random update functions by a novel threshold-based dynamic function in which the promoting and repressing effect of each interaction is considered. We use a third real-life regulatory network, along with its inferred boolean update functions to validate the proposed update function. Results of this validation hint to increased biological plausibility of the threshold-based function. To investigate the dynamical behavior of this new model, we visualized the phase transition between order and chaos into the critical regime using Derrida plots. We complement the qualitative nature of Derrida plots with an alternative measure, the criticality distance, that also allows to discriminate between regimes in a quantitative way. Simulation on both real-life genetic regulatory networks show that there exists a set of parameters that allows the systems to operate in the critical region. This new model includes experimentally derived biological information and recent discoveries, which makes it potentially useful to guide experimental research. The update function confers additional realism to the model, while reducing the complexity

  2. A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.

    Science.gov (United States)

    Guo, Wensheng; Yang, Guowu; Wu, Wei; He, Lei; Sun, Mingyu

    2014-01-01

    In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.

  3. A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks.

    Directory of Open Access Journals (Sweden)

    Wensheng Guo

    Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.

  4. Inference of asynchronous Boolean network from biological pathways.

    Science.gov (United States)

    Das, Haimabati; Layek, Ritwik Kumar

    2015-01-01

    Gene regulation is a complex process with multiple levels of interactions. In order to describe this complex dynamical system with tractable parameterization, the choice of the dynamical system model is of paramount importance. The right abstraction of the modeling scheme can reduce the complexity in the inference and intervention design, both computationally and experimentally. This article proposes an asynchronous Boolean network framework to capture the transcriptional regulation as well as the protein-protein interactions in a genetic regulatory system. The inference of asynchronous Boolean network from biological pathways information and experimental evidence are explained using an algorithm. The suitability of this paradigm for the variability of several reaction rates is also discussed. This methodology and model selection open up new research challenges in understanding gene-protein interactive system in a coherent way and can be beneficial for designing effective therapeutic intervention strategy.

  5. Stability depends on positive autoregulation in Boolean gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Ricardo Pinho

    2014-11-01

    Full Text Available Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs. The most basic motif, autoregulation, has been associated with bistability (when positive and with homeostasis and robustness to noise (when negative, but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals.

  6. Dynamical modeling of the cholesterol regulatory pathway with Boolean networks

    Directory of Open Access Journals (Sweden)

    Corcos Laurent

    2008-11-01

    Full Text Available Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivotal role in dislypidemia and, ultimately, in cancer through intermediates such as mevalonate, farnesyl pyrophosphate and geranyl geranyl pyrophosphate, but no dynamic model of this pathway has been proposed until now. Results We set up a computational framework to dynamically analyze large biological networks. This framework associates a classical and computationally efficient synchronous Boolean analysis with a newly introduced method based on Markov chains, which identifies spurious cycles among the results of the synchronous simulation. Based on this method, we present here the results of the analysis of the cholesterol biosynthesis pathway and its physiological regulation by the Sterol Response Element Binding Proteins (SREBPs, as well as the modeling of the action of statins, inhibitor drugs, on this pathway. The in silico experiments show the blockade of the cholesterol endogenous synthesis by statins and its regulation by SREPBs, in full agreement with the known biochemical features of the pathway. Conclusion We believe that the method described here to identify spurious cycles opens new routes to compute large and biologically relevant models, thanks to the computational efficiency of synchronous simulation. Furthermore, to the best of our knowledge, we present here the first dynamic systems biology model of the human cholesterol pathway and several of its key regulatory control elements, hoping it would provide a good basis to perform in silico

  7. Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks

    Directory of Open Access Journals (Sweden)

    Koichi Kobayashi

    2010-01-01

    Full Text Available In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.

  8. An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks.

    Science.gov (United States)

    He, Qinbin; Xia, Zhile; Lin, Bin

    2016-11-01

    Boolean network models provide an efficient way for studying gene regulatory networks. The main dynamics of a Boolean network is determined by its attractors. Attractor calculation plays a key role for analyzing Boolean gene regulatory networks. An approach of attractor calculation was proposed in this study, which improved the predecessor-based approach. Furthermore, the proposed approach combined with the identification of constant nodes and simplified Boolean networks to accelerate attractor calculation. The proposed algorithm is effective to calculate all attractors for large-scale Boolean gene regulatory networks. If the average degree of the network is not too large, the algorithm can get all attractors of a Boolean network with dozens or even hundreds of nodes.

  9. Overview of methods of reverse engineering of gene regulatory networks: Boolean and Bayesian networks

    Directory of Open Access Journals (Sweden)

    Frolova A. O.

    2012-06-01

    Full Text Available Reverse engineering of gene regulatory networks is an intensively studied topic in Systems Biology as it reconstructs regulatory interactions between all genes in the genome in the most complete form. The extreme computational complexity of this problem and lack of thorough reviews on reconstruction methods of gene regulatory network is a significant obstacle to further development of this area. In this article the two most common methods for modeling gene regulatory networks are surveyed: Boolean and Bayesian networks. The mathematical description of each method is given, as well as several algorithmic approaches to modeling gene networks using these methods; the complexity of algorithms and the problems that arise during its implementation are also noted.

  10. Controllability and observability of Boolean networks arising from biology.

    Science.gov (United States)

    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.

  11. Boolean Models of Biological Processes Explain Cascade-Like Behavior.

    Science.gov (United States)

    Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen

    2016-01-01

    Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.

  12. Boolean Models of Biological Processes Explain Cascade-Like Behavior.

    Science.gov (United States)

    Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen

    2016-01-01

    Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes. PMID:26821940

  13. Controllability and observability of Boolean networks arising from biology

    Science.gov (United States)

    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.

  14. Stability of biological networks as represented in Random Boolean Nets.

    Energy Technology Data Exchange (ETDEWEB)

    Slepoy, Alexander; Thompson, Marshall

    2004-09-01

    We explore stability of Random Boolean Networks as a model of biological interaction networks. We introduce surface-to-volume ratio as a measure of stability of the network. Surface is defined as the set of states within a basin of attraction that maps outside the basin by a bit-flip operation. Volume is defined as the total number of states in the basin. We report development of an object-oriented Boolean network analysis code (Attract) to investigate the structure of stable vs. unstable networks. We find two distinct types of stable networks. The first type is the nearly trivial stable network with a few basins of attraction. The second type contains many basins. We conclude that second type stable networks are extremely rare.

  15. Analysis of Boolean Functions based on Interaction Graphs and their influence in System Biology

    OpenAIRE

    Das, Jayanta Kumar; Rout, Ranjeet Kumar; Choudhury, Pabitra Pal

    2014-01-01

    Interaction graphs provide an important qualitative modeling approach for System Biology. This paper presents a novel approach for construction of interaction graph with the help of Boolean function decomposition. Each decomposition part (Consisting of 2-bits) of the Boolean functions has some important significance. In the dynamics of a biological system, each variable or node is nothing but gene or protein. Their regulation has been explored in terms of interaction graphs which are generate...

  16. Dynamical modeling of the cholesterol regulatory pathway with Boolean networks

    OpenAIRE

    Corcos Laurent; Kervizic Gwenael

    2008-01-01

    Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivo...

  17. Boolean modelling reveals new regulatory connections between transcription factors orchestrating the development of the ventral spinal cord.

    KAUST Repository

    Lovrics, Anna

    2014-11-14

    We have assembled a network of cell-fate determining transcription factors that play a key role in the specification of the ventral neuronal subtypes of the spinal cord on the basis of published transcriptional interactions. Asynchronous Boolean modelling of the network was used to compare simulation results with reported experimental observations. Such comparison highlighted the need to include additional regulatory connections in order to obtain the fixed point attractors of the model associated with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where the transcription factors were overexpressed. Furthermore the network predicted the inhibition of Irx3 by Nkx2.2 and this prediction was tested experimentally. Our results provide evidence for the existence of an as yet undescribed inhibitory connection which could potentially have significance beyond the ventral spinal cord. The work presented in this paper demonstrates the strength of Boolean modelling for identifying gene regulatory networks.

  18. An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data.

    Science.gov (United States)

    Berestovsky, Natalie; Nakhleh, Luay

    2013-01-01

    Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in bioinformatics. Boolean networks have been used extensively for modeling regulatory networks. In this model, the state of each gene can be either 'on' or 'off' and that next-state of a gene is updated, synchronously or asynchronously, according to a Boolean rule that is applied to the current-state of the entire system. Inferring a Boolean network from a set of experimental data entails two main steps: first, the experimental time-series data are discretized into Boolean trajectories, and then, a Boolean network is learned from these Boolean trajectories. In this paper, we consider three methods for data discretization, including a new one we propose, and three methods for learning Boolean networks, and study the performance of all possible nine combinations on four regulatory systems of varying dynamics complexities. We find that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power. Our findings are in contrast to a recent survey that placed Boolean networks on the low end of the "faithfulness to biological reality" and "ability to model dynamics" spectra. Further, contrary to the common argument in favor of Boolean networks, we find that a relatively large number of time points in the time-series data is required to learn good Boolean networks for certain data sets. Last but not least, while methods have been proposed for inferring Boolean networks, as discussed above, missing still are publicly available implementations thereof. Here, we make our implementation of the methods available publicly in open source at http://bioinfo.cs.rice.edu/.

  19. Boolean process

    Institute of Scientific and Technical Information of China (English)

    闵应骅; 李忠诚; 赵著行

    1997-01-01

    Boolean algebra successfully describes the logical behavior of a digital circuit, and has been widely used in electronic circuit design and test With the development of high speed VLSIs it is a drawback for Boolean algebra to be unable to describe circuit timing behavior. Therefore a Boolean process is defined as a family of Boolean van ables relevant to the time parameter t. A real-valued sample of a Boolean process is a waveform. Waveform functions can be manipulated formally by using mathematical tools. The distance, difference and limit of a waveform polynomial are defined, and a sufficient and necessary condition of the limit existence is presented. Based on this, the concept of sensitization is redefined precisely to demonstrate the potential and wide application possibility The new definition is very different from the traditional one, and has an impact on determining the sensitizable paths with maximum or minimum length, and false paths, and then designing and testing high performance circuits

  20. Propagation of external regulation and asynchronous dynamics in random Boolean networks

    OpenAIRE

    Mahmoudi, Hamed; Pagnani, Andrea; Weigt, Martin; Zecchina, Riccardo

    2007-01-01

    Boolean Networks and their dynamics are of great interest as abstract modeling schemes in various disciplines, ranging from biology to computer science. Whereas parallel update schemes have been studied extensively in past years, the level of understanding of asynchronous updates schemes is still very poor. In this paper we study the propagation of external information given by regulatory input variables into a random Boolean network. We compute both analytically and numerically the time evol...

  1. Boolean networks with multiexpressions and parameters.

    Science.gov (United States)

    Zou, Yi Ming

    2013-01-01

    To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean models, both synchronous and asynchronous, have been proposed in the literature. However, analytical study of these more general Boolean networks models is lagging. This paper aims to develop a concise theory for these different Boolean logic-based modeling methods. Boolean models for networks where each node can have more than two levels of expression and Boolean models with parameters are defined algebraically with examples provided. Certain classes of random asynchronous Boolean networks and deterministic moduli asynchronous Boolean networks are investigated in detail using the setting introduced in this paper. The derived theorems provide a clear picture for the attractor structures of these asynchronous Boolean networks.

  2. Boolean modeling: a logic-based dynamic approach for understanding signaling and regulatory networks and for making useful predictions.

    Science.gov (United States)

    Albert, Réka; Thakar, Juilee

    2014-01-01

    The biomolecules inside or near cells form a complex interacting system. Cellular phenotypes and behaviors arise from the totality of interactions among the components of this system. A fruitful way of modeling interacting biomolecular systems is by network-based dynamic models that characterize each component by a state variable, and describe the change in the state variables due to the interactions in the system. Dynamic models can capture the stable state patterns of this interacting system and can connect them to different cell fates or behaviors. A Boolean or logic model characterizes each biomolecule by a binary state variable that relates the abundance of that molecule to a threshold abundance necessary for downstream processes. The regulation of this state variable is described in a parameter free manner, making Boolean modeling a practical choice for systems whose kinetic parameters have not been determined. Boolean models integrate the body of knowledge regarding the components and interactions of biomolecular systems, and capture the system's dynamic repertoire, for example the existence of multiple cell fates. These models were used for a variety of systems and led to important insights and predictions. Boolean models serve as an efficient exploratory model, a guide for follow-up experiments, and as a foundation for more quantitative models.

  3. ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors.

    Science.gov (United States)

    Kobayashi, Koichi; Hiraishi, Kunihiko

    2014-01-01

    Attractors in gene regulatory networks represent cell types or states of cells. In system biology and synthetic biology, it is important to generate gene regulatory networks with desired attractors. In this paper, we focus on a singleton attractor, which is also called a fixed point. Using a Boolean network (BN) model, we consider the problem of finding Boolean functions such that the system has desired singleton attractors and has no undesired singleton attractors. To solve this problem, we propose a matrix-based representation of BNs. Using this representation, the problem of finding Boolean functions can be rewritten as an Integer Linear Programming (ILP) problem and a Satisfiability Modulo Theories (SMT) problem. Furthermore, the effectiveness of the proposed method is shown by a numerical example on a WNT5A network, which is related to melanoma. The proposed method provides us a basic method for design of gene regulatory networks.

  4. Boolean Differential Operators

    OpenAIRE

    Catumba, Jorge; Diaz, Rafael

    2012-01-01

    We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.

  5. Predicting Variabilities in Cardiac Gene Expression with a Boolean Network Incorporating Uncertainty.

    Science.gov (United States)

    Grieb, Melanie; Burkovski, Andre; Sträng, J Eric; Kraus, Johann M; Groß, Alexander; Palm, Günther; Kühl, Michael; Kestler, Hans A

    2015-01-01

    Gene interactions in cells can be represented by gene regulatory networks. A Boolean network models gene interactions according to rules where gene expression is represented by binary values (on / off or {1, 0}). In reality, however, the gene's state can have multiple values due to biological properties. Furthermore, the noisy nature of the experimental design results in uncertainty about a state of the gene. Here we present a new Boolean network paradigm to allow intermediate values on the interval [0, 1]. As in the Boolean network, fixed points or attractors of such a model correspond to biological phenotypes or states. We use our new extension of the Boolean network paradigm to model gene expression in first and second heart field lineages which are cardiac progenitor cell populations involved in early vertebrate heart development. By this we are able to predict additional biological phenotypes that the Boolean model alone is not able to identify without utilizing additional biological knowledge. The additional phenotypes predicted by the model were confirmed by published biological experiments. Furthermore, the new method predicts gene expression propensities for modelled but yet to be analyzed genes.

  6. Using Boolean Logic Modeling of Gene Regulatory Networks to Exploit the Links Between Cancer and Metabolism for Therapeutic Purposes.

    Science.gov (United States)

    Arshad, Osama A; Venkatasubramani, Priyadharshini S; Datta, Aniruddha; Venkatraj, Jijayanagaram

    2016-01-01

    The uncontrolled cell proliferation that is characteristically associated with cancer is usually accompanied by alterations in the genome and cell metabolism. Indeed, the phenomenon of cancer cells metabolizing glucose using a less efficient anaerobic process even in the presence of normal oxygen levels, termed the Warburg effect, is currently considered to be one of the hallmarks of cancer. Diabetes, much like cancer, is defined by significant metabolic changes. Recent epidemiological studies have shown that diabetes patients treated with the antidiabetic drug Metformin have significantly lowered risk of cancer as compared to patients treated with other antidiabetic drugs. We utilize a Boolean logic model of the pathways commonly mutated in cancer to not only investigate the efficacy of Metformin for cancer therapeutic purposes but also demonstrate how Metformin in concert with other cancer drugs could provide better and less toxic clinical outcomes as compared to using cancer drugs alone.

  7. Combinatorics of Boolean automata circuits dynamics

    OpenAIRE

    Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain

    2012-01-01

    International audience In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work fo...

  8. Boolean Networks with Multi-Expressions and Parameters.

    Science.gov (United States)

    Zou, Yi Ming

    2013-07-01

    To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean models, both synchronous and asynchronous, have been proposed in the literature. However, analytical study of these more general Boolean networks models is lagging. This paper aims to develop a concise theory for these different Boolean logic based modeling methods. Boolean models for networks where each node can have more than two levels of expression and Boolean models with parameters are defined algebraically with examples provided. Certain classes of random asynchronous Boolean networks and deterministic moduli asynchronous Boolean networks are investigated in detail using the setting introduced in this paper. The derived theorems provide a clear picture for the attractor structures of these asynchronous Boolean networks.

  9. Estimation of delays in generalized asynchronous Boolean networks.

    Science.gov (United States)

    Das, Haimabati; Layek, Ritwik Kumar

    2016-10-20

    A new generalized asynchronous Boolean network (GABN) model has been proposed in this paper. This continuous-time discrete-state model captures the biological reality of cellular dynamics without compromising the computational efficiency of the Boolean framework. The GABN synthesis procedure is based on the prior knowledge of the logical structure of the regulatory network, and the experimental transcriptional parameters. The novelty of the proposed methodology lies in considering different delays associated with the activation and deactivation of a particular protein (especially the transcription factors). A few illustrative examples of some well-studied network motifs have been provided to explore the scope of using the GABN model for larger networks. The GABN model of the p53-signaling pathway in response to γ-irradiation has also been simulated in the current paper to provide an indirect validation of the proposed schema. PMID:27464825

  10. Estimation of delays in generalized asynchronous Boolean networks.

    Science.gov (United States)

    Das, Haimabati; Layek, Ritwik Kumar

    2016-10-20

    A new generalized asynchronous Boolean network (GABN) model has been proposed in this paper. This continuous-time discrete-state model captures the biological reality of cellular dynamics without compromising the computational efficiency of the Boolean framework. The GABN synthesis procedure is based on the prior knowledge of the logical structure of the regulatory network, and the experimental transcriptional parameters. The novelty of the proposed methodology lies in considering different delays associated with the activation and deactivation of a particular protein (especially the transcription factors). A few illustrative examples of some well-studied network motifs have been provided to explore the scope of using the GABN model for larger networks. The GABN model of the p53-signaling pathway in response to γ-irradiation has also been simulated in the current paper to provide an indirect validation of the proposed schema.

  11. Quantum boolean functions

    OpenAIRE

    Montanaro, Ashley; Osborne, Tobias J.

    2008-01-01

    In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier coefficients of boolean functions; and two quantum versions of a theorem of Friedgut, Kalai and Naor on the Fourier spectra of boolean functions. In o...

  12. Free Boolean Topological Groups

    Directory of Open Access Journals (Sweden)

    Ol’ga Sipacheva

    2015-11-01

    Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.

  13. Boolean reasoning the logic of boolean equations

    CERN Document Server

    Brown, Frank Markham

    2012-01-01

    A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.

  14. Boolean algebra essentials

    CERN Document Server

    Solomon, Alan D

    2012-01-01

    REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean

  15. Mining TCGA data using Boolean implications.

    Science.gov (United States)

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

  16. Mining TCGA data using Boolean implications.

    Directory of Open Access Journals (Sweden)

    Subarna Sinha

    Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.

  17. Effect of memory in non-Markovian Boolean networks

    CERN Document Server

    Ebadi, Haleh; Ausloos, Marcel; Jafari, GholamReza

    2016-01-01

    One successful model of interacting biological systems is the Boolean network. 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 a cell cycle network, we discover a power law memory with a more robust dynamics than the Markovian dynamics.

  18. Boolean integral calculus

    Science.gov (United States)

    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.

  19. Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Andersen, Henrik Reif; Hulgaard, Henrik

    1997-01-01

    This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable pro...... standard BDD techniques this problem is infeasible. BEDs are useful in applications where the end-result as a reduced ordered BDD is small, for example for tautology checking...

  20. Bayesian variable selection and data integration for biological regulatory networks

    OpenAIRE

    Jensen, Shane T; Chen, Guang; Stoeckert, Jr, Christian J.

    2007-01-01

    A substantial focus of research in molecular biology are gene regulatory networks: the set of transcription factors and target genes which control the involvement of different biological processes in living cells. Previous statistical approaches for identifying gene regulatory networks have used gene expression data, ChIP binding data or promoter sequence data, but each of these resources provides only partial information. We present a Bayesian hierarchical model that integrates all three dat...

  1. Exploring phospholipase C-coupled Ca(2+) signalling networks using Boolean modelling.

    Science.gov (United States)

    Bhardwaj, G; Wells, C P; Albert, R; van Rossum, D B; Patterson, R L

    2011-05-01

    In this study, the authors explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signalling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP(3)R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomisation of the Boolean operators ablates oscillatory pattern formation. Furthermore, knock-out simulations of the IP(3)R, TRPC3 and multiple other proteins recapitulate experimentally derived results. The potential of this approach can be observed by its ability to predict previously undescribed cellular phenotypes using in vitro experimental data. Indeed, our cellular analysis of the developmental and calcium-regulatory protein, DANGER1a, confirms the counter-intuitive predictions from our Boolean models in two highly relevant cellular models. Based on these results, the authors theorise that with sufficient legacy knowledge and/or computational biology predictions, Boolean networks can provide a robust method for predictive modelling of any biological system. [Includes supplementary material]. PMID:21639591

  2. Social insect colony as a biological regulatory system: modelling information flow in dominance networks.

    Science.gov (United States)

    Nandi, Anjan K; Sumana, Annagiri; Bhattacharya, Kunal

    2014-12-01

    Social insects provide an excellent platform to investigate flow of information in regulatory systems since their successful social organization is essentially achieved by effective information transfer through complex connectivity patterns among the colony members. Network representation of such behavioural interactions offers a powerful tool for structural as well as dynamical analysis of the underlying regulatory systems. In this paper, we focus on the dominance interaction networks in the tropical social wasp Ropalidia marginata-a species where behavioural observations indicate that such interactions are principally responsible for the transfer of information between individuals about their colony needs, resulting in a regulation of their own activities. Our research reveals that the dominance networks of R. marginata are structurally similar to a class of naturally evolved information processing networks, a fact confirmed also by the predominance of a specific substructure-the 'feed-forward loop'-a key functional component in many other information transfer networks. The dynamical analysis through Boolean modelling confirms that the networks are sufficiently stable under small fluctuations and yet capable of more efficient information transfer compared to their randomized counterparts. Our results suggest the involvement of a common structural design principle in different biological regulatory systems and a possible similarity with respect to the effect of selection on the organization levels of such systems. The findings are also consistent with the hypothesis that dominance behaviour has been shaped by natural selection to co-opt the information transfer process in such social insect species, in addition to its primal function of mediation of reproductive competition in the colony. PMID:25320069

  3. 广义Boolean-like环%Generalized Boolean-like Rings

    Institute of Scientific and Technical Information of China (English)

    秦蕊

    2013-01-01

    广义Boolean-like环是Boolean-like环的一个推广,文章主要介绍了广义Boolean-like环的构建,从而列举了若干广义Boolean-like环的相关例子及基本性质.并且,考虑了广义Boolean-like环的部分扩张,如上三角矩阵环.

  4. Boolean network model predicts cell cycle sequence of fission yeast.

    Directory of Open Access Journals (Sweden)

    Maria I Davidich

    Full Text Available A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe is constructed solely on the basis of the known biochemical interaction topology. Simulating the model in the computer faithfully reproduces the known activity sequence of regulatory proteins along the cell cycle of the living cell. Contrary to existing differential equation models, no parameters enter the model except the structure of the regulatory circuitry. The dynamical properties of the model indicate that the biological dynamical sequence is robustly implemented in the regulatory network, with the biological stationary state G1 corresponding to the dominant attractor in state space, and with the biological regulatory sequence being a strongly attractive trajectory. Comparing the fission yeast cell-cycle model to a similar model of the corresponding network in S. cerevisiae, a remarkable difference in circuitry, as well as dynamics is observed. While the latter operates in a strongly damped mode, driven by external excitation, the S. pombe network represents an auto-excited system with external damping.

  5. On pseudo-Boolean polynomials

    Science.gov (United States)

    Leont'ev, V. K.

    2015-11-01

    A pseudo-Boolean function is an arbitrary mapping of the set of binary n-tuples to the real line. Such functions are a natural generalization of classical Boolean functions and find numerous applications in various applied studies. Specifically, the Fourier transform of a Boolean function is a pseudo-Boolean function. A number of facts associated with pseudo-Boolean polynomials are presented, and their applications to well-known discrete optimization problems are described.

  6. Boolean differential equations

    CERN Document Server

    Steinbach, Bernd

    2013-01-01

    The Boolean Differential Calculus (BDC) is a very powerful theory that extends the structure of a Boolean Algebra significantly. Based on a small number of definitions, many theorems have been proven. The available operations have been efficiently implemented in several software packages. There is a very wide field of applications. While a Boolean Algebra is focused on values of logic functions, the BDC allows the evaluation of changes of function values. Such changes can be explored for pairs of function values as well as for whole subspaces. Due to the same basic data structures, the BDC can

  7. An optimal control approach to probabilistic Boolean networks

    Science.gov (United States)

    Liu, Qiuli

    2012-12-01

    External control of some genes in a genetic regulatory network is useful for avoiding undesirable states associated with some diseases. For this purpose, a number of stochastic optimal control approaches have been proposed. Probabilistic Boolean networks (PBNs) as powerful tools for modeling gene regulatory systems have attracted considerable attention in systems biology. In this paper, we deal with a problem of optimal intervention in a PBN with the help of the theory of discrete time Markov decision process. Specifically, we first formulate a control model for a PBN as a first passage model for discrete time Markov decision processes and then find, using a value iteration algorithm, optimal effective treatments with the minimal expected first passage time over the space of all possible treatments. In order to demonstrate the feasibility of our approach, an example is also displayed.

  8. On the number of attractors of Boolean automata circuits

    OpenAIRE

    Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain

    2009-01-01

    In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work focuses on th...

  9. Boolean networks as modelling framework

    Directory of Open Access Journals (Sweden)

    Florian eGreil

    2012-08-01

    Full Text Available In a network, the components of a given system are represented as nodes, the interactions are abstracted as links between the nodes. Boolean networks refer to a class of dynamics on networks, in fact it is the simplest possible dynamics where each node has a value 0 or 1. This allows to investigate extensively the dynamics both analytically and by numerical experiments. The present article focuses on the theoretical concept of relevant components and the immediate application in plant biology, references for more in-depths treatment of the mathematical details are also given.

  10. Stratification and enumeration of Boolean functions by canalizing depth

    Science.gov (United States)

    He, Qijun; Macauley, Matthew

    2016-01-01

    Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively "picked off", until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.

  11. Stratification and enumeration of Boolean functions by canalizing depth

    CERN Document Server

    He, Qijun

    2015-01-01

    Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively picked off, until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.

  12. Enhancing Boolean networks with fuzzy operators and edge tuning

    OpenAIRE

    Poret, Arnaud; Monteiro Sousa, Claudio; Boissel, Jean-Pierre

    2014-01-01

    Quantitative modeling in systems biology can be difficult due to the scarcity of quantitative details about biological phenomenons, especially at the subcellular scale. An alternative to escape this difficulty is qualitative modeling since it requires few to no quantitative information. Among the qualitative modeling approaches, the Boolean network formalism is one of the most popular. However, Boolean models allow variables to be valued at only true or false, which can appear too simplistic ...

  13. Oscillatory Activities in Regulatory Biological Networks and Hopf Bifurcation

    Institute of Scientific and Technical Information of China (English)

    YAN Shi-Wei; WANG Qi; XIE Bai-Song; ZHANG Feng-Shou

    2007-01-01

    Exploiting the nonlinear dynamics in the negative feedback loop, we propose a statistical signal-response model to describe the different oscillatory behaviour in a biological network motif. By choosing the delay as a bifurcation parameter, we discuss the existence of Hopf bifurcation and the stability of the periodic solutions of model equations with the centre manifold theorem and the normal form theory. It is shown that a periodic solution is born in a Hopf bifurcation beyond a critical time delay, and thus the bifurcation phenomenon may be important to elucidate the mechanism of oscillatory activities in regulatory biological networks.

  14. Relative stability of network states in Boolean network models of gene regulation in development.

    Science.gov (United States)

    Zhou, Joseph Xu; Samal, Areejit; d'Hérouël, Aymeric Fouquier; Price, Nathan D; Huang, Sui

    2016-01-01

    Progress in cell type reprogramming has revived the interest in Waddington's concept of the epigenetic landscape. Recently researchers developed the quasi-potential theory to represent the Waddington's landscape. The Quasi-potential U(x), derived from interactions in the gene regulatory network (GRN) of a cell, quantifies the relative stability of network states, which determine the effort required for state transitions in a multi-stable dynamical system. However, quasi-potential landscapes, originally developed for continuous systems, are not suitable for discrete-valued networks which are important tools to study complex systems. In this paper, we provide a framework to quantify the landscape for discrete Boolean networks (BNs). We apply our framework to study pancreas cell differentiation where an ensemble of BN models is considered based on the structure of a minimal GRN for pancreas development. We impose biologically motivated structural constraints (corresponding to specific type of Boolean functions) and dynamical constraints (corresponding to stable attractor states) to limit the space of BN models for pancreas development. In addition, we enforce a novel functional constraint corresponding to the relative ordering of attractor states in BN models to restrict the space of BN models to the biological relevant class. We find that BNs with canalyzing/sign-compatible Boolean functions best capture the dynamics of pancreas cell differentiation. This framework can also determine the genes' influence on cell state transitions, and thus can facilitate the rational design of cell reprogramming protocols.

  15. Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Andersen, Henrik Reif; Hulgaard, Henrik

    2002-01-01

    Boolean function. Using BEDs, this verification problem is solved efficiently, while using standard BDD techniques this problem is infeasible. Generally, BEDs are useful in applications, for example tautology checking, where the end-result as a reduced ordered BDD is small. Moreover, using operators...

  16. A full bayesian approach for boolean genetic network inference.

    Directory of Open Access Journals (Sweden)

    Shengtong Han

    Full Text Available Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.

  17. T Regulatory Cell Biology in Health and Disease.

    Science.gov (United States)

    Alroqi, Fayhan J; Chatila, Talal A

    2016-04-01

    Regulatory T (Treg) cells that express the transcription factor forkhead box protein P3 (FOXP3) play an essential role in enforcing immune tolerance to self tissues, regulating host-commensal flora interaction, and facilitating tissue repair. Their deficiency and/or dysfunction trigger unbridled autoimmunity and inflammation. A growing number of monogenic defects have been recognized that adversely impact Treg cell development, differentiation, and/or function, leading to heritable diseases of immune dysregulation and autoimmunity. In this article, we review recent insights into Treg cell biology and function, with particular attention to lessons learned from newly recognized clinical disorders of Treg cell deficiency. PMID:26922942

  18. T Regulatory Cell Biology in Health and Disease.

    Science.gov (United States)

    Alroqi, Fayhan J; Chatila, Talal A

    2016-04-01

    Regulatory T (Treg) cells that express the transcription factor forkhead box protein P3 (FOXP3) play an essential role in enforcing immune tolerance to self tissues, regulating host-commensal flora interaction, and facilitating tissue repair. Their deficiency and/or dysfunction trigger unbridled autoimmunity and inflammation. A growing number of monogenic defects have been recognized that adversely impact Treg cell development, differentiation, and/or function, leading to heritable diseases of immune dysregulation and autoimmunity. In this article, we review recent insights into Treg cell biology and function, with particular attention to lessons learned from newly recognized clinical disorders of Treg cell deficiency.

  19. Computational complexity of Boolean functions

    Science.gov (United States)

    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.

  20. Summing Boolean Algebras

    Institute of Scientific and Technical Information of China (English)

    Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA

    2004-01-01

    In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.

  1. Geometric Operators on Boolean Functions

    OpenAIRE

    Frisvad, Jeppe Revall; Falster, Peter

    2007-01-01

    In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propo...

  2. J-Boolean like环%J-Boolean Like Ring

    Institute of Scientific and Technical Information of China (English)

    秦蕊

    2013-01-01

    本文首先引进了Boolean-like环的一类新的扩张J-Boolean like环,即对任意环R中元素a,b都有(a-a2)(b-b2)∈J(R),这里J(R)为环R的Jacobson根,则环R称为J-Boolean like环.证明了两个定理分别为(1)设D是一个环,C是D的一个子环,R[D,C]是一个J-Boolean like环(=)(a)C,D是J-Boolean like环,(b)J2(C)(∈)J(D).(2)如果B/J(B)是Boolean环,并且B[i]={a+bi| i2=ui+η,a,b,u,η∈B},那么B[i]是J-Booleanlike环当且仅当uη∈J(B).

  3. Approximate Reasoning with Fuzzy Booleans

    NARCIS (Netherlands)

    Broek, van den P.M.; Noppen, J.A.R.

    2004-01-01

    This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante

  4. Statins as Modulators of Regulatory T-Cell Biology

    Directory of Open Access Journals (Sweden)

    David A. Forero-Peña

    2013-01-01

    Full Text Available Statins are pharmacological inhibitors of the activity of 3-hydroxy-3-methyl-glutaryl-CoA reductase (HMGCR, an enzyme responsible for the synthesis of cholesterol. Some recent experimental studies have shown that besides their effects on the primary and secondary prevention of cardiovascular diseases, statins may also have beneficial anti-inflammatory effects through diverse mechanisms. On the other hand, the induction and activity of regulatory T cells (Treg are key processes in the prevention of pathology during chronic inflammatory and autoimmune diseases. Hence, strategies oriented towards the therapeutic expansion of Tregs are gaining special attention among biomedical researchers. The potential effects of statins on the biology of Treg are of particular importance because of their eventual application as in vivo inducers of Treg in the treatment of multiple conditions. In this paper we review the experimental evidence pointing out to a potential effect of statins on the role of regulatory T cells in different conditions and discuss its potential clinical significance.

  5. Symmetry in Boolean Satisfiability

    Directory of Open Access Journals (Sweden)

    Fadi A. Aloul

    2010-06-01

    Full Text Available This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use symmetries to avoid traversing all assignments by constraining the search to visit a few representative assignments in each equivalence class. This can lead to a significant reduction in search runtime without affecting the completeness of the search.

  6. Boolean Orthogonalizing Combination Methods

    Directory of Open Access Journals (Sweden)

    Yavuz Can

    2015-05-01

    Full Text Available In this paper a new logical operation method called “ presented. It is used to calculate the difference, but also the complement of a function as well as the EXOR and EXNOR of two minterms respectively two ternary respectively two ternary-vector logical operation method called “orthogonal OR advantages of both methods are their results, which are already available form that has an essential advantage for continuing calculations. Since it applies, an orthogonal disjunctive normal form is equal to orthogonal antivalence normal form, subsequent Boolean differential calculus will be simplified.

  7. Geometric Operators on Boolean Functions

    DEFF Research Database (Denmark)

    Frisvad, Jeppe Revall; Falster, Peter

    In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...

  8. Cryptographic Boolean functions and applications

    CERN Document Server

    Cusick, Thomas W

    2009-01-01

    Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...

  9. Techniques for solving Boolean equation systems

    OpenAIRE

    Keinänen, Misa

    2006-01-01

    Boolean equation systems are ordered sequences of Boolean equations decorated with least and greatest fixpoint operators. Boolean equation systems provide a useful framework for formal verification because various specification and verification problems, for instance, μ-calculus model checking can be represented as the problem of solving Boolean equation systems. The general problem of solving a Boolean equation system is a computationally hard task, and no polynomial time solution technique ...

  10. A more robust Boolean model describing inhibitor binding

    Institute of Scientific and Technical Information of China (English)

    Zhaoqian Steven XIE; Chao TANG

    2008-01-01

    From the first application of the Boolean model to the cell cycle regulation network of budding yeast, new regulative pathways have been discovered, par-ticularly in the G1/S transition circuit. This discovery called for finer modeling to study the essential biology, and the resulting outcomes are first introduced in the ar-ticle. A traditional Boolean network model set up for the new G1/S transition circuit shows that it cannot correctly simulate real biology unless the model parameters are fine tuned. The deficiency is caused by an overly coarse-grained description of the inhibitor binding process, which shall be overcome by a two-vector model proposed whose robustness is surveyed using random perturba-tions. Simulations show that the proposed two-vector model is much more robust in describing inhibitor binding processes within the Boolean framework.

  11. A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas

    OpenAIRE

    Morizumi, Hiroki

    2008-01-01

    In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function $f$ is called the inversion complexity of $f$. In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that $\\lceil \\log_2(n+1) \\rceil$ NOT gates are sufficient to compute any Boolean function on $n$ variables. As far as we...

  12. Dependency in Cooperative Boolean Games

    OpenAIRE

    Sauro, Luigi; van der Torre, Leon; Villata, Serena

    2009-01-01

    Cooperative boolean games are coalitional games with both goals and costs associated to actions, and dependence networks for boolean games are a kind of social networks representing how the actions of other agents have an influence on the achievement of an agent’s goal. In this paper, we introduce two new types of dependence networks, called the abstract dependence network and the refined dependence network. Moreover, we show that the notion of stability is complete with respect to the soluti...

  13. On the Number of Attractors of Positive and Negative Boolean Automata Circuits.

    OpenAIRE

    Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain

    2010-01-01

    International audience In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain t...

  14. Feedback Controller Design for the Synchronization of Boolean Control Networks.

    Science.gov (United States)

    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.

  15. Boolean Searches--A Life Skill.

    Science.gov (United States)

    Ala, Judy; Cerabona, Kathy

    1992-01-01

    Discusses the importance of Boolean searching as a skill that students will need in the future. Methods for teaching Boolean searching are described, and the value of truncation as an online searching aid is considered. (MES)

  16. Generalized join-hemimorphisms on Boolean algebras

    OpenAIRE

    Sergio Celani

    2003-01-01

    We introduce the notions of generalized join-hemimorphism and generalized Boolean relation as an extension of the notions of join-hemimorphism and Boolean relation, respectively. We prove a duality between these two notions. We will also define a generalization of the notion of Boolean algebra with operators by considering a finite family of Boolean algebras endowed with a generalized join-hemimorphism. Finally, we define suitable notions of subalgebra, congruences, Boole...

  17. Biologic

    CERN Document Server

    Kauffman, L H

    2002-01-01

    In this paper we explore the boundary between biology and the study of formal systems (logic). In the end, we arrive at a summary formalism, a chapter in "boundary mathematics" where there are not only containers but also extainers ><, entities open to interaction and distinguishing the space that they are not. The boundary algebra of containers and extainers is to biologic what boolean algebra is to classical logic. We show how this formalism encompasses significant parts of the logic of DNA replication, the Dirac formalism for quantum mechanics, formalisms for protein folding and the basic structure of the Temperley Lieb algebra at the foundations of topological invariants of knots and links.

  18. Boolean network model for GPR142 against Type 2 diabetes and relative dynamic change ratio analysis using systems and biological circuits approach

    OpenAIRE

    Kaushik, Aman Chandra; Sahi, Shakti

    2015-01-01

    Systems biology addresses challenges in the analysis of genomics data, especially for complex genes and protein interactions using Meta data approach on various signaling pathways. In this paper, we report systems biology and biological circuits approach to construct pathway and identify early gene and protein interactions for predicting GPR142 responses in Type 2 diabetes. The information regarding genes, proteins and other molecules involved in Type 2 diabetes were retrieved from literature...

  19. Boolean Operations on Conic Polygons

    Institute of Scientific and Technical Information of China (English)

    Yong-Xi Gong; Yu Liu; Lun Wu; Yu-Bo Xie

    2009-01-01

    An algorithm for Boolean operations on conic polygons is proposed. Conic polygons are polygons consisting of conic segments or bounded conics with directions. Preliminaries of Boolean operations on general polygons are presented. In our algorithm, the intersection points and the topological relationships between two conic polygons are computed. Boundaries are obtained by tracking path and selecting uncrossed boundaries following rule tables to build resulting conic polygons.We define a set of rules for the intersection, union, and subtraction operations on conic polygons. The algorithm considers degeneration cases such as homology, complement, interior, and exterior. The algorithm is also evaluated and implemented.

  20. Learning restricted Boolean network model by time-series data.

    Science.gov (United States)

    Ouyang, Hongjia; Fang, Jie; Shen, Liangzhong; Dougherty, Edward R; Liu, Wenbin

    2014-01-01

    Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance [Formula: see text], the normalized Hamming distance of state transition [Formula: see text], and the steady-state distribution distance μ (ssd). Results show that the proposed algorithm outperforms the others according to both [Formula: see text] and [Formula: see text], whereas its performance according to μ (ssd) is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.

  1. Profiling of genetic switches using boolean implications in expression data.

    Science.gov (United States)

    Çakır, Mehmet Volkan; Binder, Hans; Wirth, Henry

    2014-01-01

    Correlation analysis assuming coexpression of the genes is a widely used method for gene expression analysis in molecular biology. Yet growing extent, quality and dimensionality of the molecular biological data permits emerging, more sophisticated approaches like Boolean implications. We present an approach which is a combination of the SOM (self organizing maps) machine learning method and Boolean implication analysis to identify relations between genes, metagenes and similarly behaving metagene groups (spots). Our method provides a way to assign Boolean states to genes/metagenes/spots and offers a functional view over significantly variant elements of gene expression data on these three different levels. While being able to cover relations between weakly correlated entities Boolean implication method also decomposes these relations into six implication classes. Our method allows one to validate or identify potential relationships between genes and functional modules of interest and to assess their switching behaviour. Furthermore the output of the method renders it possible to construct and study the network of genes. By providing logical implications as updating rules for the network it can also serve to aid modelling approaches.

  2. Partial stability and stabilisation of Boolean networks

    Science.gov (United States)

    Chen, Hong-Wei; Sun, Liang-Jie; Liu, Yang

    2016-07-01

    In this paper, we investigate the stability of Boolean networks and the stabilisation of Boolean control networks with respect to part of the system's states. First, an algebraic expression of the Boolean (control) network is derived by the semi-tensor product of matrices. Then, some necessary and sufficient conditions for partial stability of Boolean networks are given. Finally, the stabilisation of Boolean control networks by a free control sequence and a state-feedback control is investigated and the respective necessary and sufficient conditions are obtained. Examples are provided to illustrate the efficiency of the obtained results.

  3. Synchronization of Asynchronous Switched Boolean Network.

    Science.gov (United States)

    Zhang, Hao; Wang, Xingyuan; Lin, Xiaohui

    2015-01-01

    In this paper, the complete synchronizations for asynchronous switched Boolean network with free Boolean sequence controllers and close-loop controllers are studied. First, the basic asynchronous switched Boolean network model is provided. With the method of semi-tensor product, the Boolean dynamics is translated into linear representation. Second, necessary and sufficient conditions for ASBN synchronization with free Boolean sequence control and close-loop control are derived, respectively. Third, some illustrative examples are provided to show the efficiency of the proposed methods.

  4. Super-transient scaling in time-delay autonomous Boolean network motifs

    Science.gov (United States)

    D'Huys, Otti; Lohmann, Johannes; Haynes, Nicholas D.; Gauthier, Daniel J.

    2016-09-01

    Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.

  5. Construction of optimized Boolean functions

    Institute of Scientific and Technical Information of China (English)

    CHEN Wei; YANG Yi-xian; NIU Xin-xin

    2006-01-01

    Considering connections of characteristics,this paper is aimed at the construction of optimized Boolean functions.A new method based on the Bent function,discrete Walsh spectrum and characteristics matrices are presented by concatenating,breaking,and revising output sequences conditionally.This new construction can be used to construct different kinds of functions satisfying different design criteria.

  6. Mental Models of Boolean Concepts

    Science.gov (United States)

    Goodwin, Geoffrey P.; Johnson-Laird, P. N.

    2011-01-01

    Negation, conjunction, and disjunction are major building blocks in the formation of concepts. This article presents a new model-based theory of these Boolean components. It predicts that individuals simplify the models of instances of concepts. Evidence corroborates the theory and challenges alternative accounts, such as those based on minimal…

  7. Modular Decomposition of Boolean Functions

    NARCIS (Netherlands)

    J.C. Bioch (Cor)

    2002-01-01

    textabstractModular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we give a uni_ed treatment of modular decompositio

  8. Evolutionary Design of Boolean Functions

    Institute of Scientific and Technical Information of China (English)

    WANG Zhang-yi; ZHANG Huan-guo; QIN Zhong-ping; MENG Qing-shu

    2005-01-01

    We use evolutionary computing to synthesize Boolean functions randomly. By using specific crossover and mutation operator in evolving process and modifying search space and fitness function, we get some high non-linearity functions which have other good cryptography characteristics such as autocorrelation etc. Comparing to other heuristic search techniques, evolutionary computing approach is more effective because of global search strategy and implicit parallelism.

  9. Biological data warehousing system for identifying transcriptional regulatory sites from gene expressions of microarray data.

    Science.gov (United States)

    Tsou, Ann-Ping; Sun, Yi-Ming; Liu, Chia-Lin; Huang, Hsien-Da; Horng, Jorng-Tzong; Tsai, Meng-Feng; Liu, Baw-Juine

    2006-07-01

    Identification of transcriptional regulatory sites plays an important role in the investigation of gene regulation. For this propose, we designed and implemented a data warehouse to integrate multiple heterogeneous biological data sources with data types such as text-file, XML, image, MySQL database model, and Oracle database model. The utility of the biological data warehouse in predicting transcriptional regulatory sites of coregulated genes was explored using a synexpression group derived from a microarray study. Both of the binding sites of known transcription factors and predicted over-represented (OR) oligonucleotides were demonstrated for the gene group. The potential biological roles of both known nucleotides and one OR nucleotide were demonstrated using bioassays. Therefore, the results from the wet-lab experiments reinforce the power and utility of the data warehouse as an approach to the genome-wide search for important transcription regulatory elements that are the key to many complex biological systems.

  10. On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions

    Science.gov (United States)

    Zertuche, Federico

    2009-04-01

    NK-Kauffman networks LKN are a subset of the Boolean functions on N Boolean variables to themselves, ΛN={ξ :Z2N→Z2N}. To each NK-Kauffman network it is possible to assign a unique Boolean function on N variables through the function Ψ :LKN→ΛN. The probability PK that Ψ(f )=Ψ(f'), when f' is obtained through f by a change in one of its K-Boolean functions (bK:Z2K→Z2), and/or connections, is calculated. The leading term of the asymptotic expansion of PK, for N ≫1, turns out to depend on the probability to extract the tautology and contradiction Boolean functions, and in the average value of the distribution of probability of the Boolean functions, the other terms decay as O(1/N). In order to accomplish this, a classification of the Boolean functions in terms of what I have called their irreducible degree of connectivity is established. The mathematical findings are discussed in the biological context, where Ψ is used to model the genotype-phenotype map.

  11. Boolean Factor Congruences and Property (*)

    CERN Document Server

    Terraf, Pedro Sánchez

    2008-01-01

    A variety V has Boolean factor congruences (BFC) if the set of factor congruences of every algebra in V is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a semilattice operation. BFC has a prominent role in the study of uniqueness of direct product representations of algebras, since it is a strengthening of the refinement property. We provide an explicit Mal'cev condition for BFC. With the aid of this condition, it is shown that BFC is equivalent to a variant of the definability property (*), an open problem in R. Willard's work ("Varieties Having Boolean Factor Congruences," J. Algebra, 132 (1990)).

  12. Quantum algorithms for testing Boolean functions

    Directory of Open Access Journals (Sweden)

    Erika Andersson

    2010-06-01

    Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

  13. Boolean networks with veto functions

    Science.gov (United States)

    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.

  14. Boolean Reasoning with Graphs of Partitions

    OpenAIRE

    Goossens, Daniel

    2010-01-01

    version longue du papier court "A Dynamic Boolean Knowledge Base" accepté à ICTAI 2010. This paper presents an implemented architecture for easy learning, reorganizing and navigation into a Boolean knowledge base. As the base grows with new definitions and constraints, it is normalized by the closure of a completion operator. This normalization allows arbitrary formats for Boolean expressions. It ensures basic reasoning abilities and spontaneously organizes intermingled taxonomies of conce...

  15. Model Checking of Boolean Process Models

    OpenAIRE

    Schneider, Christoph; Wehler, Joachim

    2011-01-01

    In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to mode...

  16. G-quadruplexes and their regulatory roles in biology

    OpenAIRE

    Rhodes, Daniela; Lipps, Hans J

    2015-01-01

    ‘If G-quadruplexes form so readily in vitro, Nature will have found a way of using them in vivo’ (Statement by Aaron Klug over 30 years ago). During the last decade, four-stranded helical structures called G-quadruplex (or G4) have emerged from being a structural curiosity observed in vitro, to being recognized as a possible nucleic acid based mechanism for regulating multiple biological processes in vivo. The sequencing of many genomes has revealed that they are rich in sequence motifs that ...

  17. Synchronization of Boolean Networks with Different Update Schemes.

    Science.gov (United States)

    Zhang, Hao; Wang, Xingyuan; Lin, Xiaohui

    2014-01-01

    In this paper, the synchronizations of Boolean networks with different update schemes (synchronized Boolean networks and asynchronous Boolean networks) are investigated. All nodes in Boolean network are represented in terms of semi-tensor product. First, we give the concept of inner synchronization and observe that all nodes in a Boolean network are synchronized with each other. Second, we investigate the outer synchronization between a driving Boolean network and a corresponding response Boolean network. We provide not only the concept of traditional complete synchronization, but also the anti-synchronization and get the anti-synchronization in simulation. Third, we extend the outer synchronization to asynchronous Boolean network and get the complete synchronization between an asynchronous Boolean network and a response Boolean network. Consequently, theorems for synchronization of Boolean networks and asynchronous Boolean networks are derived. Examples are provided to show the correctness of our theorems.

  18. Polynomial threshold functions and Boolean threshold circuits

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2013-01-01

    We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is 12n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being...... of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...

  19. Progress in Applications of Boolean Functions

    CERN Document Server

    Sasao, Tsutomu

    2010-01-01

    This book brings together five topics on the application of Boolean functions. They are 1. Equivalence classes of Boolean functions: The number of n-variable functions is large, even for values as small as n = 6, and there has been much research on classifying functions. There are many classifications, each with their own distinct merit. 2. Boolean functions for cryptography: The process of encrypting/decrypting plain text messages often depends on Boolean functions with specific properties. For example, highly nonlinear functions are valued because they are less susceptible to linear attacks.

  20. A novel generalized design methodology and realization of Boolean operations using DNA.

    Science.gov (United States)

    Zoraida, B S E; Arock, Michael; Ronald, B S M; Ponalagusamy, R

    2009-09-01

    The biological deoxyribonucleic acid (DNA) strand has been increasingly seen as a promising computing unit. A new algorithm is formulated in this paper to design any DNA Boolean operator with molecular beacons (MBs) as its input. Boolean operators realized using the proposed design methodology is presented. The developed operators adopt a uniform representation for logical 0 and 1 for any Boolean operator. The Boolean operators designed in this work employ only a hybridization operation at each stage. Further, this paper for the first time brings out the realization of a binary adder and subtractor using molecular beacons. Simulation results of the DNA-based binary adder and subtractor are given to validate the design. PMID:19505531

  1. A SAT-based algorithm for finding attractors in synchronous Boolean networks.

    Science.gov (United States)

    Dubrova, Elena; Teslenko, Maxim

    2011-01-01

    This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible. PMID:21778527

  2. Information theory in systems biology. Part I: Gene regulatory and metabolic networks.

    Science.gov (United States)

    Mousavian, Zaynab; Kavousi, Kaveh; Masoudi-Nejad, Ali

    2016-03-01

    "A Mathematical Theory of Communication", was published in 1948 by Claude Shannon to establish a framework that is now known as information theory. In recent decades, information theory has gained much attention in the area of systems biology. The aim of this paper is to provide a systematic review of those contributions that have applied information theory in inferring or understanding of biological systems. Based on the type of system components and the interactions between them, we classify the biological systems into 4 main classes: gene regulatory, metabolic, protein-protein interaction and signaling networks. In the first part of this review, we attempt to introduce most of the existing studies on two types of biological networks, including gene regulatory and metabolic networks, which are founded on the concepts of information theory.

  3. Combination of Neuro-Fuzzy Network Models with Biological Knowledge for Reconstructing Gene Regulatory Networks

    Institute of Scientific and Technical Information of China (English)

    Guixia Liu; Lei Liu; Chunyu Liu; Ming Zheng; Lanying Su; Chunguang Zhou

    2011-01-01

    Inferring gene regulatory networks from large-scale expression data is an important topic in both cellular systems and computational biology. The inference of regulators might be the core factor for understanding actual regulatory conditions in gene regulatory networks, especially when strong regulators do work significantly, in this paper, we propose a novel approach based on combining neuro-fuzzy network models with biological knowledge to infer strong regulators and interrelated fuzzy rules. The hybrid neuro-fuzzy architecture can not only infer the fuzzy rules, which are suitable for describing the regulatory conditions in regulatory networks, but also explain the meaning of nodes and weight value in the neural network. It can get useful rules automatically without factitious judgments. At the same time, it does not add recursive layers to the model, and the model can also strengthen the relationships among genes and reduce calculation. We use the proposed approach to reconstruct a partial gene regulatory network of yeast. The results show that this approach can work effectively.

  4. Low doses of ionizing radiation: Biological effects and regulatory control. Contributed papers

    International Nuclear Information System (INIS)

    The International Atomic Energy Agency and the World Health Organization, in cooperation with the United Nations Scientific Committee on the Effects of Atomic Radiation, organized an international conference on Low Doses of Ionizing Radiation: Biological Effects and Regulatory Control, held in seville, Spain, from 17 to 21 November 1997. This technical document contains concise papers submitted to the conference

  5. Analysis and Control of Boolean Networks:A Semi-tensor Product Approach%布尔网络的分析与控制-矩阵半张量积方法

    Institute of Scientific and Technical Information of China (English)

    程代展; 齐洪胜; 赵寅

    2011-01-01

    布尔网络是描述基因调控网络的一个有力工具.由于系统生物学的发展,布尔网络的分析与控制成为生物学与系统控制学科的交叉热点.本文综述作者用其原创的矩阵半张量积方法在布尔网络的分析与控制中得到的一系列结果.内容包括:布尔网络的拓扑结构,布尔控制网络的能控、能观性与实现,布尔网络的稳定性和布尔控制网络的镇定,布尔控制网络的干扰解耦,布尔(控制)网络的辨识,以及布尔网络的最优控制等.%Boolean network is a powerful tool for describing gene regulatory network. With the development of the systems biology, the analysis and control of Boolean networks become a hot topic for multidisciplinary research. This paper surveys some recent results obtained in the analysis and control of Boolean networks using semi-tensor product of matrices. The contents of this paper include the topological structure of Boolean networks, the controllability and observability, realization, stability and stabilization, disturbance decoupling, identification, and optimal control of Boolean (control) networks.

  6. Boolean Search: Current State and Perspectives.

    Science.gov (United States)

    Frants, Valery I.; Shapiro, Jacob; Taksa, Isak; Voiskunskii, Vladimir G.

    1999-01-01

    Discusses the use of Boolean logic in information-retrieval systems and analyzes existing criticisms of operational systems. Considers users' ability to use and understand Boolean operators, ranking, the quality of query formulations, and negative effects of criticism; and concludes that criticism is directed at the methodology employed in…

  7. Boolean integral calculus for digital systems

    Science.gov (United States)

    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.

  8. Delay synchronization of temporal Boolean networks

    Science.gov (United States)

    Wei, Qiang; Xie, Cheng-jun; Liang, Yi; Niu, Yu-jun; Lin, Da

    2016-01-01

    This paper investigates the delay synchronization between two temporal Boolean networks base on semi-tensor product method, which improve complete synchronization. Necessary and sufficient conditions for delay synchronization are drawn base on algebraic expression of temporal Boolean networks. A example is presented to show the effectiveness of theoretical analysis.

  9. Version Spaces and Generalized Monotone Boolean Functions

    NARCIS (Netherlands)

    J.C. Bioch (Cor); T. Ibaraki

    2002-01-01

    textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as speci

  10. Tracking perturbations in Boolean networks with spectral methods.

    Science.gov (United States)

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

  11. Boolean gates on actin filaments

    Science.gov (United States)

    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.

  12. Automatic compilation from high-level biologically-oriented programming language to genetic regulatory networks.

    Directory of Open Access Journals (Sweden)

    Jacob Beal

    Full Text Available BACKGROUND: The field of synthetic biology promises to revolutionize our ability to engineer biological systems, providing important benefits for a variety of applications. Recent advances in DNA synthesis and automated DNA assembly technologies suggest that it is now possible to construct synthetic systems of significant complexity. However, while a variety of novel genetic devices and small engineered gene networks have been successfully demonstrated, the regulatory complexity of synthetic systems that have been reported recently has somewhat plateaued due to a variety of factors, including the complexity of biology itself and the lag in our ability to design and optimize sophisticated biological circuitry. METHODOLOGY/PRINCIPAL FINDINGS: To address the gap between DNA synthesis and circuit design capabilities, we present a platform that enables synthetic biologists to express desired behavior using a convenient high-level biologically-oriented programming language, Proto. The high level specification is compiled, using a regulatory motif based mechanism, to a gene network, optimized, and then converted to a computational simulation for numerical verification. Through several example programs we illustrate the automated process of biological system design with our platform, and show that our compiler optimizations can yield significant reductions in the number of genes (~ 50% and latency of the optimized engineered gene networks. CONCLUSIONS/SIGNIFICANCE: Our platform provides a convenient and accessible tool for the automated design of sophisticated synthetic biological systems, bridging an important gap between DNA synthesis and circuit design capabilities. Our platform is user-friendly and features biologically relevant compiler optimizations, providing an important foundation for the development of sophisticated biological systems.

  13. Model Checking of Boolean Process Models

    CERN Document Server

    Schneider, Christoph

    2011-01-01

    In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to model explicitly states with a subsequent skipping of activations and arbitrary logical rules of type AND, XOR, OR etc. to model the split and join of the control flow. We apply model checking as a verification method for the safeness and liveness of Boolean systems. Model checking of Boolean systems uses the elementary theory of propositional logic, no modal operators are needed. Our verification builds on a finite complete prefix of a certain T-system attached to the Boolean system. It splits the processes of the Boolean sy...

  14. Investigating noise tolerance in an efficient engine for inferring biological regulatory networks.

    Science.gov (United States)

    Komori, Asako; Maki, Yukihiro; Ono, Isao; Okamoto, Masahiro

    2015-06-01

    Biological systems are composed of biomolecules such as genes, proteins, metabolites, and signaling components, which interact in complex networks. To understand complex biological systems, it is important to be capable of inferring regulatory networks from experimental time series data. In previous studies, we developed efficient numerical optimization methods for inferring these networks, but we have yet to test the performance of our methods when considering the error (noise) that is inherent in experimental data. In this study, we investigated the noise tolerance of our proposed inferring engine. We prepared the noise data using the Langevin equation, and compared the performance of our method with that of alternative optimization methods. PMID:25790786

  15. Densities of mixed volumes for Boolean models

    OpenAIRE

    Weil, Wolfgang

    2001-01-01

    In generalization of the well-known formulae for quermass densities of stationary and isotropic Boolean models, we prove corresponding results for densities of mixed volumes in the stationary situation and show how they can be used to determine the intensity of non-isotropic Boolean models Z in d-dimensional space for d = 2, 3, 4. We then consider non-stationary Boolean models and extend results of Fallert on quermass densities to densities of mixed volumes. In particular, we present explicit...

  16. Boolean Algebra of C-Algebras

    Directory of Open Access Journals (Sweden)

    G.C. Rao

    2012-11-01

    Full Text Available A C- algebra is the algebraic form of the 3-valued conditional logic, which was introduced by F. Guzman and C. C. Squier in 1990. In this paper, some equivalent conditions for a C- algebra to become a boolean algebra in terms of congruences are given. It is proved that the set of all central elements B(A is isomorphic to the Boolean algebra of all C-algebras Sa, where a B(A. It is also proved that B(A is isomorphic to the Boolean algebra of all C-algebras Aa, where a B(A.

  17. Subnuclear organization and trafficking of regulatory proteins: implications for biological control and cancer.

    Science.gov (United States)

    Stein, G S; van Wijnen, A J; Stein, J L; Lian, J B; Montecino, M; Zaidi, K; Javed, A

    2000-01-01

    The regulated and regulatory components that interrelate nuclear structure and function must be experimentally established. A formidable challenge is to define further the control of transcription factor targeting to acceptor sites associated with the nuclear matrix. It will be important to determine whether acceptor proteins are associated with a pre-existing core-filament structural lattice or whether a compositely organized scaffold of regulatory factors is dynamically assembled. An inclusive model for all steps in the targeting of proteins to subnuclear sites cannot yet be proposed. However, this model must account for the apparent diversity of intranuclear targeting signals. It is also important to assess the extent to which regulatory discrimination is mediated by subnuclear domain-specific trafficking signals. Furthermore, the checkpoints that monitor subnuclear distribution of regulatory factors and the sorting steps that ensure both structural and functional fidelity of nuclear domains in which replication and expression of genes occur must be biochemically and mechanistically defined. There is emerging recognition that placement of regulatory components of gene expression must be temporally and spatially coordinated to facilitate biological control. The consequences of breaches in nuclear structure-function relationships are observed in an expanding series of diseases that include cancer [Weis et al., 1994; Rogaia et al., 1997; Yano et al., 1997; Rowley, 1998; Zeng et al., 1998; McNeil et al., 1999; Tao and Levine, 1999a] and neurological disorders [Skinner et al., 1997]. As the repertoire of architecture-associated regulatory factors and cofactors expands, workers in the field are becoming increasingly confident that nuclear organization contributes significantly to control of transcription. To gain increased appreciation for the complexities of subnuclear organization and gene regulation, we must continue to characterize mechanisms that direct

  18. A Systems’ Biology Approach to Study MicroRNA-Mediated Gene Regulatory Networks

    Directory of Open Access Journals (Sweden)

    Xin Lai

    2013-01-01

    Full Text Available MicroRNAs (miRNAs are potent effectors in gene regulatory networks where aberrant miRNA expression can contribute to human diseases such as cancer. For a better understanding of the regulatory role of miRNAs in coordinating gene expression, we here present a systems biology approach combining data-driven modeling and model-driven experiments. Such an approach is characterized by an iterative process, including biological data acquisition and integration, network construction, mathematical modeling and experimental validation. To demonstrate the application of this approach, we adopt it to investigate mechanisms of collective repression on p21 by multiple miRNAs. We first construct a p21 regulatory network based on data from the literature and further expand it using algorithms that predict molecular interactions. Based on the network structure, a detailed mechanistic model is established and its parameter values are determined using data. Finally, the calibrated model is used to study the effect of different miRNA expression profiles and cooperative target regulation on p21 expression levels in different biological contexts.

  19. Generalizing Boolean Satisfiability II: Theory

    CERN Document Server

    Dixon, H E; Luks, E M; Parkes, A J; 10.1613/jair.1555

    2011-01-01

    This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-...

  20. Boolean networks with reliable dynamics

    CERN Document Server

    Peixoto, Tiago P

    2009-01-01

    We investigated the properties of Boolean networks that follow a given reliable trajectory in state space. A reliable trajectory is defined as a sequence of states which is independent of the order in which the nodes are updated. We explored numerically the topology, the update functions, and the state space structure of these networks, which we constructed using a minimum number of links and the simplest update functions. We found that the clustering coefficient is larger than in random networks, and that the probability distribution of three-node motifs is similar to that found in gene regulation networks. Among the update functions, only a subset of all possible functions occur, and they can be classified according to their probability. More homogeneous functions occur more often, leading to a dominance of canalyzing functions. Finally, we studied the entire state space of the networks. We observed that with increasing systems size, fixed points become more dominant, moving the networks close to the frozen...

  1. Local Correction of Boolean Functions

    CERN Document Server

    Alon, Noga

    2011-01-01

    A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using q queries to g. We observe that any k-junta, that is, any function which depends only on k of its input variables, is O(2^k)-locally correctable. Moreover, we show that there are examples where this is essentially best possible, and locally correcting some k-juntas requires a number of queries which is exponential in k. These examples, however, are far from being typical, and indeed we prove that for almost every k-junta, O(k log k) queries suffice.

  2. Synthetic biology and regulatory networks: where metabolic systems biology meets control engineering

    OpenAIRE

    He, Fei; Murabito, Ettore; Westerhoff, Hans V

    2016-01-01

    Metabolic pathways can be engineered to maximize the synthesis of various products of interest. With the advent of computational systems biology, this endeavour is usually carried out through in silico theoretical studies with the aim to guide and complement further in vitro and in vivo experimental efforts. Clearly, what counts is the result in vivo, not only in terms of maximal productivity but also robustness against environmental perturbations. Engineering an organism towards an increased...

  3. Minimum network constraint on reverse engineering to develop biological regulatory networks.

    Science.gov (United States)

    Shao, Bin; Wu, Jiayi; Tian, Binghui; Ouyang, Qi

    2015-09-01

    Reconstructing the topological structure of biological regulatory networks from microarray expression data or data of protein expression profiles is one of major tasks in systems biology. In recent years, various mathematical methods have been developed to meet this task. Here, based on our previously reported reverse engineering method, we propose a new constraint, i.e., the minimum network constraint, to facilitate the reconstruction of biological networks. Three well studied regulatory networks (the budding yeast cell cycle network, the fission yeast cell cycle network, and the SOS network of Escherichia coli) were used as the test sets to verify the performance of this method. Numerical results show that the biological networks prefer to use the minimal networks to fulfill their functional tasks, making it possible to apply minimal network criteria in the network reconstruction process. Two scenarios were considered in the reconstruction process: generating data using different initial conditions; and generating data from knock out and over-expression experiments. In both cases, network structures are revealed faithfully in a few steps using our approach.

  4. Boolean Logic with Fault Tolerant Coding

    OpenAIRE

    Alagoz, B. Baykant

    2009-01-01

    Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have provided the digital system skill of auto-recovery without need for designing additional-fault tolerance mechanisms.

  5. Symmetry in critical random Boolean network dynamics.

    Science.gov (United States)

    Hossein, Shabnam; Reichl, Matthew D; Bassler, Kevin E

    2014-04-01

    Using Boolean networks as prototypical examples, the role of symmetry in the dynamics of heterogeneous complex systems is explored. We show that symmetry of the dynamics, especially in critical states, is a controlling feature that can be used both to greatly simplify analysis and to characterize different types of dynamics. Symmetry in Boolean networks is found by determining the frequency at which the various Boolean output functions occur. There are classes of functions that consist of Boolean functions that behave similarly. These classes are orbits of the controlling symmetry group. We find that the symmetry that controls the critical random Boolean networks is expressed through the frequency by which output functions are utilized by nodes that remain active on dynamical attractors. This symmetry preserves canalization, a form of network robustness. We compare it to a different symmetry known to control the dynamics of an evolutionary process that allows Boolean networks to organize into a critical state. Our results demonstrate the usefulness and power of using the symmetry of the behavior of the nodes to characterize complex network dynamics, and introduce an alternative approach to the analysis of heterogeneous complex systems.

  6. The role of certain Post classes in Boolean network models of genetic networks.

    Science.gov (United States)

    Shmulevich, Ilya; Lähdesmäki, Harri; Dougherty, Edward R; Astola, Jaakko; Zhang, Wei

    2003-09-16

    A topic of great interest and debate concerns the source of order and remarkable robustness observed in genetic regulatory networks. The study of the generic properties of Boolean networks has proven to be useful for gaining insight into such phenomena. The main focus, as regards ordered behavior in networks, has been on canalizing functions, internal homogeneity or bias, and network connectivity. Here we examine the role that certain classes of Boolean functions that are closed under composition play in the emergence of order in Boolean networks. The closure property implies that any gene at any number of steps in the future is guaranteed to be governed by a function from the same class. By means of Derrida curves on random Boolean networks and percolation simulations on square lattices, we demonstrate that networks constructed from functions belonging to these classes have a tendency toward ordered behavior. Thus they are not overly sensitive to initial conditions, and damage does not readily spread throughout the network. In addition, the considered classes are significantly larger than the class of canalizing functions as the connectivity increases. The functions in these classes exhibit the same kind of preference toward biased functions as do canalizing functions, meaning that functions from this class are likely to be biased. Finally, functions from this class have a natural way of ensuring robustness against noise and perturbations, thus representing plausible evolutionarily selected candidates for regulatory rules in genetic networks. PMID:12963822

  7. Synthetic Biology and the U.S. Biotechnology Regulatory System: Challenges and Options

    Energy Technology Data Exchange (ETDEWEB)

    Carter, Sarah R. [J. Craig Venter Institute; Rodemeyer, Michael [University of Virginia; Garfinkel, Michele S. [EMBO; Friedman, Robert M [J. Craig Venter Institute

    2014-05-01

    Synthetic Biology and the U.S. Biotechnology Regulatory System: Challenges and Options Sarah R. Carter, Ph.D., J. Craig Venter Institute; Michael Rodemeyer, J.D., University of Virginia; Michele S. Garfinkel, Ph.D., EMBO; Robert M. Friedman, Ph.D., J. Craig Venter Institute In recent years, a range of genetic engineering techniques referred to as “synthetic biology” has significantly expanded the tool kit available to scientists and engineers, providing them with far greater capabilities to engineer organisms than previous techniques allowed. The field of synthetic biology includes the relatively new ability to synthesize long pieces of DNA from chemicals, as well as improved methods for genetic manipulation and design of genetic pathways to achieve more precise control of biological systems. These advances will help usher in a new generation of genetically engineered microbes, plants, and animals. The JCVI Policy Center team, along with researchers at the University of Virginia and EMBO, examined how well the current U.S. regulatory system for genetically engineered products will handle the near-term introduction of organisms engineered using synthetic biology. In particular, the focus was on those organisms intended to be used or grown directly in the environment, outside of a contained facility. The study concludes that the U.S. regulatory agencies have adequate legal authority to address most, but not all, potential environmental, health and safety concerns posed by these organisms. Such near-term products are likely to represent incremental changes rather than a marked departure from previous genetically engineered organisms. However, the study also identified two key challenges for the regulatory system, which are detailed in the report. First, USDA’s authority over genetically engineered plants depends on the use of an older engineering technique that is no longer necessary for many applications. The shift to synthetic biology and other newer genetic

  8. When do tissues and cells become products? Regulatory oversight of emerging biological therapies.

    Science.gov (United States)

    Farrugia, Albert

    2006-01-01

    Although therapeutics derived from biological sources have been subjected to regulatory oversight for some time, the products used in transplantation procedures have historically been exempt from this oversight. These products have been viewed as being part of medical practice rather than as the result of mainstream pharmaceutical manufacture. Furthermore, their unique source makes them difficult to assess in traditional regulatory systems based on the tenets of pharmaceutical quality control. With the increasing use of transplantation therapies to both replace dysfunctional organs and to influence genetic and metabolic processes, public health concerns on these therapies have increased. In addition, it is recognized that therapeutic claims for some of these interventions need to be properly assessed. These considerations have led the established regulatory agencies of the developed world to develop new regulatory paradigms for the products of transplantation practice. While a number of concerns have driven these developments, the minimization of infectious disease risk remains the paramount driver for introducing these regulatory systems. More than the regulation of medicines and medical devices manufactured in traditional pharmaceutical modes, the regulation of cell and tissue products is intimately linked to areas of public health policy and funding. This places regulators in a challenging position as they attempt to reconcile their roles as independent assessors with the needs of the overall public health framework. This is particularly difficult when considering measures which may affect access to life saving therapies. Regulators have recognized the need to assess these therapies through systems which incorporate consideration of risk-benefit ratios and include mechanisms for transparent and accountable release of products when full compliance to traditional concepts of manufacturing practice is not possible.

  9. An in silico target identification using Boolean network attractors: Avoiding pathological phenotypes.

    Science.gov (United States)

    Poret, Arnaud; Boissel, Jean-Pierre

    2014-12-01

    Target identification aims at identifying biomolecules whose function should be therapeutically altered to cure the considered pathology. An algorithm for in silico target identification using Boolean network attractors is proposed. It assumes that attractors correspond to phenotypes produced by the modeled biological network. It identifies target combinations which allow disturbed networks to avoid attractors associated with pathological phenotypes. The algorithm is tested on a Boolean model of the mammalian cell cycle and its applications are illustrated on a Boolean model of Fanconi anemia. Results show that the algorithm returns target combinations able to remove attractors associated with pathological phenotypes and then succeeds in performing the proposed in silico target identification. However, as with any in silico evidence, there is a bridge to cross between theory and practice. Nevertheless, it is expected that the algorithm is of interest for target identification.

  10. Evolution and Controllability of Cancer Networks: A Boolean Perspective.

    Science.gov (United States)

    Srihari, Sriganesh; Raman, Venkatesh; Leong, Hon Wai; Ragan, Mark A

    2014-01-01

    Cancer forms a robust system capable of maintaining stable functioning (cell sustenance and proliferation) despite perturbations. Cancer progresses as stages over time typically with increasing aggressiveness and worsening prognosis. Characterizing these stages and identifying the genes driving transitions between them is critical to understand cancer progression and to develop effective anti-cancer therapies. In this work, we propose a novel model for the `cancer system' as a Boolean state space in which a Boolean network, built from protein-interaction and gene-expression data from different stages of cancer, transits between Boolean satisfiability states by "editing" interactions and "flipping" genes. Edits reflect rewiring of the PPI network while flipping of genes reflect activation or silencing of genes between stages. We formulate a minimization problem min flip to identify these genes driving the transitions. The application of our model (called BoolSpace) on three case studies-pancreatic and breast tumours in human and post spinal-cord injury (SCI) in rats-reveals valuable insights into the phenomenon of cancer progression: (i) interactions involved in core cell-cycle and DNA-damage repair pathways are significantly rewired in tumours, indicating significant impact to key genome-stabilizing mechanisms; (ii) several of the genes flipped are serine/threonine kinases which act as biological switches, reflecting cellular switching mechanisms between stages; and (iii) different sets of genes are flipped during the initial and final stages indicating a pattern to tumour progression. Based on these results, we hypothesize that robustness of cancer partly stems from "passing of the baton" between genes at different stages-genes from different biological processes and/or cellular components are involved in different stages of tumour progression thereby allowing tumour cells to evade targeted therapy, and therefore an effective therapy should target a "cover set" of

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

    Science.gov (United States)

    Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N

    2015-01-01

    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.

  12. A synthetic biology approach to self-regulatory recombinant protein production in Escherichia coli

    Directory of Open Access Journals (Sweden)

    Dragosits Martin

    2012-03-01

    Full Text Available Abstract Background Recombinant protein production is a process of great industrial interest, with products that range from pharmaceuticals to biofuels. Since high level production of recombinant protein imposes significant stress in the host organism, several methods have been developed over the years to optimize protein production. So far, these trial-and-error techniques have proved laborious and sensitive to process parameters, while there has been no attempt to address the problem by applying Synthetic Biology principles and methods, such as integration of standardized parts in novel synthetic circuits. Results We present a novel self-regulatory protein production system that couples the control of recombinant protein production with a stress-induced, negative feedback mechanism. The synthetic circuit allows the down-regulation of recombinant protein expression through a stress-induced promoter. We used E. coli as the host organism, since it is widely used in recombinant processes. Our results show that the introduction of the self-regulatory circuit increases the soluble/insoluble ratio of recombinant protein at the expense of total protein yield. To further elucidate the dynamics of the system, we developed a computational model that is in agreement with the observed experimental data, and provides insight on the interplay between protein solubility and yield. Conclusion Our work introduces the idea of a self-regulatory circuit for recombinant protein products, and paves the way for processes with reduced external control or monitoring needs. It demonstrates that the library of standard biological parts serves as a valuable resource for initial synthetic blocks that needs to be further refined to be successfully applied in practical problems of biotechnological significance. Finally, the development of a predictive model in conjunction with experimental validation facilitates a better understanding of the underlying dynamics and can be

  13. Forced synchronization of autonomous dynamical Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx [División de Matemáticas Aplicadas, Instituto Potosino de Investigación Científica y Tecnológica A. C., Camino a la Presa San José 2055, Col. Lomas 4 Sección, C.P. 78216, San Luis Potosí, S.L.P. (Mexico); Campos-Cantón, I. [Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Álvaro Obregón 64, C.P. 78000, San Luis Potosí, S.L.P. (Mexico); Gauthier, Daniel J. [Department of Physics and Center for Nonlinear and Complex Systems, Duke University, Box 90305, Durham, North Carolina 27708 (United States)

    2015-08-15

    We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.

  14. Forced synchronization of autonomous dynamical Boolean networks.

    Science.gov (United States)

    Rivera-Durón, R R; Campos-Cantón, E; Campos-Cantón, I; Gauthier, Daniel J

    2015-08-01

    We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.

  15. Duality theories for Boolean algebras with operators

    CERN Document Server

    Givant, Steven

    2014-01-01

    In this new text, Steven Givant—the author of several acclaimed books, including works co-authored with Paul Halmos and Alfred Tarski—develops three theories of duality for Boolean algebras with operators. Givant addresses the two most recognized dualities (one algebraic and the other topological) and introduces a third duality, best understood as a hybrid of the first two. This text will be of interest to graduate students and researchers in the fields of mathematics, computer science, logic, and philosophy who are interested in exploring special or general classes of Boolean algebras with operators. Readers should be familiar with the basic arithmetic and theory of Boolean algebras, as well as the fundamentals of point-set topology.

  16. A finite alternation result for reversible boolean circuits

    OpenAIRE

    Selinger, Peter

    2016-01-01

    We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits. We show that every reversible boolean function of n >= 4 bits has alternation depth 9.

  17. EXACT SIMULATION OF A BOOLEAN MODEL

    Directory of Open Access Journals (Sweden)

    Christian Lantuéjoul

    2013-06-01

    Full Text Available A Boolean model is a union of independent objects (compact random subsets located at Poisson points. Two algorithms are proposed for simulating a Boolean model in a bounded domain. The first one applies only to stationary models. It generates the objects prior to their Poisson locations. Two examples illustrate its applicability. The second algorithm applies to stationary and non-stationary models. It generates the Poisson points prior to the objects. Its practical difficulties of implementation are discussed. Both algorithms are based on importance sampling techniques, and the generated objects are weighted.

  18. Analysis of affinely equivalent Boolean functions

    Institute of Scientific and Technical Information of China (English)

    MENG QingShu; ZHANG HuanGuo; YANG Min; WANG ZhangYi

    2007-01-01

    By some basic transforms and invariant theory, we give two results: 1) an algorithm,which can be used to judge if two Boolean functions are affinely equivalent and to obtain the equivalence relationship if they are equivalent. This is useful in studying Boolean functions and in engineering. For example, we classify all 8-variable homogeneous bent functions of degree 3 into two classes; 2) Reed-Muller codes R(4,6)/R(1,6), R(3,7)/R(1,7) are classified efficiently.

  19. Coherent spaces, Boolean rings and quantum gates

    Science.gov (United States)

    Vourdas, A.

    2016-10-01

    Coherent spaces spanned by a finite number of coherent states, are introduced. Their coherence properties are studied, using the Dirac contour representation. It is shown that the corresponding projectors resolve the identity, and that they transform into projectors of the same type, under displacement transformations, and also under time evolution. The set of these spaces, with the logical OR and AND operations is a distributive lattice, and with the logical XOR and AND operations is a Boolean ring (Stone's formalism). Applications of this Boolean ring into classical CNOT gates with n-ary variables, and also quantum CNOT gates with coherent states, are discussed.

  20. Boolean differentiation and integration using Karnaugh maps

    Science.gov (United States)

    Tucker, J. H.; Tapia, M. A.; Bennett, A. W.

    1977-01-01

    Algorithms are presented for differentiation and integration of Boolean functions by means of Karnaugh maps. The algorithms are considered simple when the number of variables is six or less; in this case Boolean differentiation and integration is said to be as easy as the Karnaugh map method of simplifying switching functions. It is suggested that the algorithms would be useful in the analysis of faults in combinational systems and in the synthesis of asynchronous sequential systems which utilize edge-sensitive flip-flops.

  1. Algorithms for Boolean Function Query Properties

    OpenAIRE

    Aaronson, Scott

    2001-01-01

    We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,' and an O(N) algorithm for `quasisymmetry.' These algorithms are based on new insights into the structure of Boolean functions that may be of independent interest. We also give a subexponential-time algorithm for the space-bounded quantum query complexity of...

  2. Thiosulfoxide (Sulfane Sulfur: New Chemistry and New Regulatory Roles in Biology

    Directory of Open Access Journals (Sweden)

    John I. Toohey

    2014-08-01

    Full Text Available The understanding of sulfur bonding is undergoing change. Old theories on hypervalency of sulfur and the nature of the chalcogen-chalcogen bond are now questioned. At the same time, there is a rapidly expanding literature on the effects of sulfur in regulating biological systems. The two fields are inter-related because the new understanding of the thiosulfoxide bond helps to explain the newfound roles of sulfur in biology. This review examines the nature of thiosulfoxide (sulfane, S0 sulfur, the history of its regulatory role, its generation in biological systems, and its functions in cells. The functions include synthesis of cofactors (molybdenum cofactor, iron-sulfur clusters, sulfuration of tRNA, modulation of enzyme activities, and regulating the redox environment by several mechanisms (including the enhancement of the reductive capacity of glutathione. A brief review of the analogous form of selenium suggests that the toxicity of selenium may be due to over-reduction caused by the powerful reductive activity of glutathione perselenide.

  3. An efficient algorithm to identify the optimal one-bit perturbation based on the basin-of-state size of Boolean networks.

    Science.gov (United States)

    Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin

    2016-01-01

    Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behavior of systems. In this paper, we investigate the less-studied one-bit perturbation, which falls under the category of structural intervention. Previous works focused on finding the optimal one-bit perturbation to maximally alter the steady-state distribution (SSD) of undesirable states through matrix perturbation theory. However, the application of the SSD is limited to Boolean networks with about ten genes. In 2007, Xiao et al. proposed to search the optimal one-bit perturbation by altering the sizes of the basin of attractions (BOAs). However, their algorithm requires close observation of the state-transition diagram. In this paper, we propose an algorithm that efficiently determines the BOA size after a perturbation. Our idea is that, if we construct the basin of states for all states, then the size of the BOA of perturbed networks can be obtained just by updating the paths of the states whose transitions have been affected. Results from both synthetic and real biological networks show that the proposed algorithm performs better than the exhaustive SSD-based algorithm and can be applied to networks with about 25 genes.

  4. An efficient algorithm to identify the optimal one-bit perturbation based on the basin-of-state size of Boolean networks.

    Science.gov (United States)

    Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin

    2016-01-01

    Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behavior of systems. In this paper, we investigate the less-studied one-bit perturbation, which falls under the category of structural intervention. Previous works focused on finding the optimal one-bit perturbation to maximally alter the steady-state distribution (SSD) of undesirable states through matrix perturbation theory. However, the application of the SSD is limited to Boolean networks with about ten genes. In 2007, Xiao et al. proposed to search the optimal one-bit perturbation by altering the sizes of the basin of attractions (BOAs). However, their algorithm requires close observation of the state-transition diagram. In this paper, we propose an algorithm that efficiently determines the BOA size after a perturbation. Our idea is that, if we construct the basin of states for all states, then the size of the BOA of perturbed networks can be obtained just by updating the paths of the states whose transitions have been affected. Results from both synthetic and real biological networks show that the proposed algorithm performs better than the exhaustive SSD-based algorithm and can be applied to networks with about 25 genes. PMID:27196530

  5. Using synthetic biology to distinguish and overcome regulatory and functional barriers related to nitrogen fixation.

    Directory of Open Access Journals (Sweden)

    Xia Wang

    Full Text Available Biological nitrogen fixation is a complex process requiring multiple genes working in concert. To date, the Klebsiella pneumoniae nif gene cluster, divided into seven operons, is one of the most studied systems. Its nitrogen fixation capacity is subject to complex cascade regulation and physiological limitations. In this report, the entire K. pneumoniae nif gene cluster was reassembled as operon-based BioBrick parts in Escherichia coli. It provided ~100% activity of native K. pneumoniae system. Based on the expression levels of these BioBrick parts, a T7 RNA polymerase-LacI expression system was used to replace the σ(54-dependent promoters located upstream of nif operons. Expression patterns of nif operons were critical for the maximum activity of the recombinant system. By mimicking these expression levels with variable-strength T7-dependent promoters, ~42% of the nitrogenase activity of the σ(54-dependent nif system was achieved in E. coli. When the newly constructed T7-dependent nif system was challenged with different genetic and physiological conditions, it bypassed the original complex regulatory circuits, with minor physiological limitations. Therefore, we have successfully replaced the nif regulatory elements with a simple expression system that may provide the first step for further research of introducing nif genes into eukaryotic organelles, which has considerable potentials in agro-biotechnology.

  6. Regulatory inhibition of biological tissue mineralization through post-nucleation shielding

    Science.gov (United States)

    Chang, Joshua; Miura, Robert

    In vertebrates, insufficient availability of calcium and phosphate ions in extracellular fluids leads to loss of bone density and neuronal hyper-excitability. To counteract this problem, calcium ions are present at high concentrations throughout body fluids - at concentrations exceeding the saturation point. This condition leads to the opposite situation where unwanted mineral sedimentation may occur. Remarkably, ectopic or out-of-place sedimentation into soft tissues is rare, in spite of the thermodynamic driving factors. This fortunate fact is due to the presence of auto-regulatory proteins that are found in abundance in bodily fluids. Yet, many important inflammatory disorders such as atherosclerosis and osteoarthritis are associated with this undesired calcification. Hence, it is important to gain an understanding of the regulatory process and the conditions under which it can go awry. We adapted mean-field classical nucleation theory to the case of surface-shielding in order to study the regulation of sedimentation of calcium phosphate salts in biological tissues. Mathematical Biosciences Institute, NSF DMS-1021818, National Institutes of Health, Rehab Medicine.

  7. Statistical and regulatory considerations in assessments of interchangeability of biological drug products.

    Science.gov (United States)

    Tóthfalusi, Lászlo; Endrényi, László; Chow, Shein-Chung

    2014-05-01

    When the patent of a brand-name, marketed drug expires, new, generic products are usually offered. Small-molecule generic and originator drug products are expected to be chemically identical. Their pharmaceutical similarity can be typically assessed by simple regulatory criteria such as the expectation that the 90% confidence interval for the ratio of geometric means of some pharmacokinetic parameters be between 0.80 and 1.25. When such criteria are satisfied, the drug products are generally considered to exhibit therapeutic equivalence. They are then usually interchanged freely within individual patients. Biological drugs are complex proteins, for instance, because of their large size, intricate structure, sensitivity to environmental conditions, difficult manufacturing procedures, and the possibility of immunogenicity. Generic and brand-name biologic products can be expected to show only similarity but not identity in their various features and clinical effects. Consequently, the determination of biosimilarity is also a complicated process which involves assessment of the totality of the evidence for the close similarity of the two products. Moreover, even when biosimilarity has been established, it may not be assumed that the two biosimilar products can be automatically substituted by pharmacists. This generally requires additional, careful considerations. Without declaring interchangeability, a new product could be prescribed, i.e. it is prescribable. However, two products can be automatically substituted only if they are interchangeable. Interchangeability is a statistical term and it means that products can be used in any order in the same patient without considering the treatment history. The concepts of interchangeability and prescribability have been widely discussed in the past but only in relation to small molecule generics. In this paper we apply these concepts to biosimilars and we discuss: definitions of prescribability and interchangeability and

  8. Formal modeling and analysis of ER-α associated Biological Regulatory Network in breast cancer

    Science.gov (United States)

    Tareen, Samar H.K.; Siddiqa, Amnah; Bibi, Zurah; Ahmad, Jamil

    2016-01-01

    Background Breast cancer (BC) is one of the leading cause of death among females worldwide. The increasing incidence of BC is due to various genetic and environmental changes which lead to the disruption of cellular signaling network(s). It is a complex disease in which several interlinking signaling cascades play a crucial role in establishing a complex regulatory network. The logical modeling approach of René Thomas has been applied to analyze the behavior of estrogen receptor-alpha (ER-α) associated Biological Regulatory Network (BRN) for a small part of complex events that leads to BC metastasis. Methods A discrete model was constructed using the kinetic logic formalism and its set of logical parameters were obtained using the model checking technique implemented in the SMBioNet software which is consistent with biological observations. The discrete model was further enriched with continuous dynamics by converting it into an equivalent Petri Net (PN) to analyze the logical parameters of the involved entities. Results In-silico based discrete and continuous modeling of ER-α associated signaling network involved in BC provides information about behaviors and gene-gene interaction in detail. The dynamics of discrete model revealed, imperative behaviors represented as cyclic paths and trajectories leading to pathogenic states such as metastasis. Results suggest that the increased expressions of receptors ER-α, IGF-1R and EGFR slow down the activity of tumor suppressor genes (TSGs) such as BRCA1, p53 and Mdm2 which can lead to metastasis. Therefore, IGF-1R and EGFR are considered as important inhibitory targets to control the metastasis in BC. Conclusion The in-silico approaches allow us to increase our understanding of the functional properties of living organisms. It opens new avenues of investigations of multiple inhibitory targets (ER-α, IGF-1R and EGFR) for wet lab experiments as well as provided valuable insights in the treatment of cancers such as BC.

  9. Soft Boolean algebra%软布尔代数

    Institute of Scientific and Technical Information of China (English)

    刘卫锋

    2013-01-01

    将软集理论应用到布尔代数中,提出了软布尔代数、软布尔子代数、软布尔代数的软理想、软理想布尔代数等概念,研究了它们的相关性质,并初步讨论了软布尔代数与几类布尔代数的模糊子代数的关系。%The soft set theory is applied to the Boolean algebra.The concepts of soft Boolean algebra, soft Boolean sub-algebra, soft ideal of soft Boolean algebra and idealistic soft Boolean algebra are presented and some related algebraic properties are discussed.The relations between soft Boolean algebra and several kinds of fuzzy subalgebras of Boolean algebra are preliminarily investigated.

  10. A complexity theory based on Boolean algebra

    DEFF Research Database (Denmark)

    Skyum, Sven; Valiant, Leslie

    1985-01-01

    A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...

  11. Demonstrating Boolean Logic Using Simple Electrical Circuits

    Science.gov (United States)

    McElhaney, Kevin W.

    2004-01-01

    While exploring the subject of geometric proofs, boolean logic operators AND and OR can be used to allow students to visualize their true-or-false patterns. An activity in the form of constructing electrical circuits is illustrated to explain the concept.

  12. A Boolean Map Theory of Visual Attention

    Science.gov (United States)

    Huang, Liqiang; Pashler, Harold

    2007-01-01

    A theory is presented that attempts to answer two questions. What visual contents can an observer consciously access at one moment? Answer: only one feature value (e.g., green) per dimension, but those feature values can be associated (as a group) with multiple spatially precise locations (comprising a single labeled Boolean map). How can an…

  13. Some Aspects of Boolean Valued Analysis

    OpenAIRE

    Kusraev, A. G.; Kutateladze, S. S.

    2015-01-01

    This is a survey of some recent applications of Boolean valued analysis to operator theory and harmonic analysis. Under consideration are pseudoembedding operators, the noncommutative Wickstead problem, the Radon-Nikodym Theorem for JB-algebras, and the Bochner Theorem for lattice-valued positive definite mappings on locally compact groups.

  14. Boolean difference equations. I - Formulation and dynamic behavior

    Science.gov (United States)

    Dee, D.; Ghil, M.

    1984-01-01

    In many biological and physical systems, feedback mechanisms depend on a set of thresholds associated with the state variables. Each feedback has a characteristic time scale. It is suggested that delay-difference equations for Boolean-valued variables are an appropriate mathematical framework for such situations: the feedback thresholds result in the discrete, on-off character of the variables, and the interaction time scales of the feedbacks are expressed as delays. The initial-value problem for Boolean delay equations (B-Delta-Es) is formulated, and shown to have unique solutions for all times. Examples of periodic and aperiodic solutions are given. Aperiodic solutions have increasing complexity which depends on time t roughly as t to the l-1 power, l being the number of delays. Stability of solutions is defined, and some examples of stability analysis are given; additional stability questions are raised. The present formulation of (B-Delta-Es) is compared with related work and generalizations are suggested.

  15. Regulatory and information support for evaluation of biological productivity of Ukrainian forests and climate change

    Science.gov (United States)

    Lakyda, Petro; Vasylyshyn, Roman; Lakyda, Ivan

    2013-04-01

    Stabilization and preservation of the planet's climate system today is regarded as one of the most important global political-economic, environmental and social problems of mankind. Rising concentration of carbon dioxide in the planet's atmosphere due to anthropogenic impact is the main reason leading to global climate change. Due to the above mentioned, social demands on forests are changing their biosphere role and function of natural sink of greenhouse gases becomes top priority. It is known that one of the most essential components of biological productivity of forests is their live biomass. Absorption, long-term sequestration of carbon and generation of oxygen are secured by its components. System research of its parametric structure and development of regulatory and reference information for assessment of aboveground live biomass components of trees and stands of the main forest-forming tree species in Ukraine began over twenty-five years ago at the department of forest mensuration and forest inventory of National University of Life and Environmental Sciences of Ukraine, involving staff from other research institutions. Today, regulatory and reference materials for evaluation of parametric structure of live biomass are developed for trees of the following major forest-forming tree species of Ukraine: Scots pine of natural and artificial origin, Crimean pine, Norway spruce, silver fir, pedunculate oak, European beech, hornbeam, ash, common birch, aspen and black alder (P.I. Lakyda et al., 2011). An ongoing process on development of similar regulatory and reference materials for forest stands of the abovementioned forest-forming tree species of Ukraine is secured by scientists of departments of forest management, and forest mensuration and forest inventory. The total experimental research base is 609 temporary sample plots, where 4880 model trees were processed, including 3195 model trees with estimates of live biomass components. Laboratory studies conducted

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

    Directory of Open Access Journals (Sweden)

    Arellano Gustavo

    2011-12-01

    Full Text Available Abstract 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

  17. Boolean modeling identifies Greatwall/MASTL as an important regulator in the AURKA network of neuroblastoma.

    Science.gov (United States)

    Dahlhaus, Meike; Burkovski, Andre; Hertwig, Falk; Mussel, Christoph; Volland, Ruth; Fischer, Matthias; Debatin, Klaus-Michael; Kestler, Hans A; Beltinger, Christian

    2016-02-01

    Aurora Kinase A (AURKA) is often overexpressed in neuroblastoma (NB) with poor outcome. The causes of AURKA overexpression in NB are unknown. Here, we describe a gene regulatory network consisting of core regulators of AURKA protein expression and activation during mitosis to identify potential causes. This network was transformed to a dynamic Boolean model. Simulated activation of the serine/threonine protein kinase Greatwall (GWL, encoded by MASTL) that attenuates the pivotal AURKA inhibitor PP2A, predicted stabilization of AURKA. Consistent with this notion, gene set enrichment analysis showed enrichment of mitotic spindle assembly genes and MYCN target genes in NB with high GWL/MASTL expression. In line with the prediction of GWL/MASTL enhancing AURKA, elevated expression of GWL/MASTL was associated with NB risk factors and poor survival of patients. These results establish Boolean network modeling of oncogenic pathways in NB as a useful means for guided discovery in this enigmatic cancer.

  18. Energy and criticality in random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Andrecut, M. [Institute for Biocomplexity and Informatics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, T2N 1N4 (Canada)], E-mail: mandrecu@ucalgary.ca; Kauffman, S.A. [Institute for Biocomplexity and Informatics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, T2N 1N4 (Canada)

    2008-06-30

    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.

  19. Boolean representations of simplicial complexes and matroids

    CERN Document Server

    Rhodes, John

    2015-01-01

    This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context.   Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...

  20. Fast Vertical Mining Using Boolean Algebra

    Directory of Open Access Journals (Sweden)

    Hosny M. Ibrahim

    2015-01-01

    Full Text Available The vertical association rules mining algorithm is an efficient mining method, which makes use of support sets of frequent itemsets to calculate the support of candidate itemsets. It overcomes the disadvantage of scanning database many times like Apriori algorithm. In vertical mining, frequent itemsets can be represented as a set of bit vectors in memory, which enables for fast computation. The sizes of bit vectors for itemsets are the main space expense of the algorithm that restricts its expansibility. Therefore, in this paper, a proposed algorithm that compresses the bit vectors of frequent itemsets will be presented. The new bit vector schema presented here depends on Boolean algebra rules to compute the intersection of two compressed bit vectors without making any costly decompression operation. The experimental results show that the proposed algorithm, Vertical Boolean Mining (VBM algorithm is better than both Apriori algorithm and the classical vertical association rule mining algorithm in the mining time and the memory usage.

  1. Efficient Analog Circuits for Boolean Satisfiability

    OpenAIRE

    Yin, Xunzhao; Sedighi, Behnam; Varga, Melinda; Ercsey-Ravasz, Maria; Toroczkai, Zoltan; Hu, Xiaobo Sharon

    2016-01-01

    Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative solutions to tackle such problems. Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed (Nature Physics, 7(12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT). This solver shows polynomial ana...

  2. Regulatory T Cells in Colorectal Cancer: From Biology to Prognostic Relevance

    Directory of Open Access Journals (Sweden)

    Dimitrios Mougiakakos

    2011-03-01

    Full Text Available Regulatory T cells (Tregs were initially described as "suppressive" lymphocytes in the 1980s. However, it took almost 20 years until the concept of Treg-mediated immune control in its present form was finally established. Tregs are obligatory for self-tolerance and defects within their population lead to severe autoimmune disorders. On the other hand Tregs may promote tolerance for tumor antigens and even hamper efforts to overcome it. Intratumoral and systemic accumulation of Tregs has been observed in various types of cancer and is often linked to worse disease course and outcome. Increase of circulating Tregs, as well as their presence in mesenteric lymph nodes and tumor tissue of patients with colorectal cancer de facto suggests a strong involvement of Tregs in the antitumor control. This review will focus on the Treg biology in view of colorectal cancer, means of Treg accumulation and the controversies regarding their prognostic significance. In addition, a concise overview will be given on how Tregs and their function can be targeted in cancer patients in order to bolster an inherent immune response and/or increase the efficacy of immunotherapeutic approaches.

  3. Role of regulatory T cells in pathogenesis and biological therapy of multiple sclerosis.

    Science.gov (United States)

    Buc, Milan

    2013-01-01

    Multiple sclerosis (MS) is an inflammatory disease in which the myelin sheaths around the axons of the brain and spinal cord are damaged, leading to demyelination and scarring as well as a broad spectrum of signs and symptoms. It is caused by an autoimmune response to self-antigens in a genetically susceptible individual induced by unknown environmental factors. Principal cells of the immune system that drive the immunopathological processes are T cells, especially of TH1 and TH17 subsets. However, in recent years, it was disclosed that regulatory T cells took part in, too. Subsequently, there was endeavour to develop ways how to re-establish their physiological functions. In this review, we describe known mechanisms of action, efficacy, and side-effects of contemporary and emerging MS immunotherapeutical agents on Treg cells and other cells of the immune system involved in the immunopathogenesis of the disease. Furthermore, we discuss how laboratory immunology can offer physicians its help in the diagnosis process and decisions what kind of biological therapy should be used.

  4. Role of Regulatory T Cells in Pathogenesis and Biological Therapy of Multiple Sclerosis

    Directory of Open Access Journals (Sweden)

    Milan Buc

    2013-01-01

    Full Text Available Multiple sclerosis (MS is an inflammatory disease in which the myelin sheaths around the axons of the brain and spinal cord are damaged, leading to demyelination and scarring as well as a broad spectrum of signs and symptoms. It is caused by an autoimmune response to self-antigens in a genetically susceptible individual induced by unknown environmental factors. Principal cells of the immune system that drive the immunopathological processes are T cells, especially of TH1 and TH17 subsets. However, in recent years, it was disclosed that regulatory T cells took part in, too. Subsequently, there was endeavour to develop ways how to re-establish their physiological functions. In this review, we describe known mechanisms of action, efficacy, and side-effects of contemporary and emerging MS immunotherapeutical agents on Treg cells and other cells of the immune system involved in the immunopathogenesis of the disease. Furthermore, we discuss how laboratory immunology can offer physicians its help in the diagnosis process and decisions what kind of biological therapy should be used.

  5. Regulatory T Cells in Colorectal Cancer: From Biology to Prognostic Relevance

    Energy Technology Data Exchange (ETDEWEB)

    Mougiakakos, Dimitrios [Department of Oncology and Pathology, Immune and Gene Therapy Unit, Cancer Centre Karolinska, CCK R8:01, 17176 Stockholm (Sweden)

    2011-03-29

    Regulatory T cells (Tregs) were initially described as “suppressive” lymphocytes in the 1980s. However, it took almost 20 years until the concept of Treg-mediated immune control in its present form was finally established. Tregs are obligatory for self-tolerance and defects within their population lead to severe autoimmune disorders. On the other hand Tregs may promote tolerance for tumor antigens and even hamper efforts to overcome it. Intratumoral and systemic accumulation of Tregs has been observed in various types of cancer and is often linked to worse disease course and outcome. Increase of circulating Tregs, as well as their presence in mesenteric lymph nodes and tumor tissue of patients with colorectal cancer de facto suggests a strong involvement of Tregs in the antitumor control. This review will focus on the Treg biology in view of colorectal cancer, means of Treg accumulation and the controversies regarding their prognostic significance. In addition, a concise overview will be given on how Tregs and their function can be targeted in cancer patients in order to bolster an inherent immune response and/or increase the efficacy of immunotherapeutic approaches.

  6. Discrete interference modeling via boolean algebra.

    Science.gov (United States)

    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.

  7. Boolean Logic Optimization in Majority-Inverter Graphs

    OpenAIRE

    Amarù, Luca; Gaillardon, Pierre-Emmanuel; De Micheli, Giovanni

    2015-01-01

    We present a Boolean logic optimization framework based on Majority-Inverter Graph (MIG). An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. Current MIG optimization is supported by a consistent algebraic framework. However, when algebraic methods cannot improve a result quality, stronger Boolean methods are needed to attain further optimization. For this purpose, we propose MIG Boolean methods exploiting the error masking property of m...

  8. ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS

    OpenAIRE

    Ali Muhammad Ali Rushdi; Adnan Ahmad Alsogati

    2013-01-01

    A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s). Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable a...

  9. Using Boolean Constraint Propagation for Sub-clause Deduction

    OpenAIRE

    Darras, Sylvain; Dequen, Gilles; Devendeville, Laure; Mazure, Bertrand; Ostrowski, Richard; Sais, Lahkdar

    2005-01-01

    Boolean Constraint Propagation (BCP) is recognized as one of the most use- ful technique for efficient satisfiability checking. In this paper a new extension of the scope of boolean constraint propagation is proposed. It makes an original use of BCP to achieve further reduction of boolean formulas. Considering the impli- cation graph generated by the constraint propagation process as a resolution tree, sub-clauses from the original formula can be deduced. Then, we show how such extension can ...

  10. From Boolean Network Model to Continuous Model Helps in Design of Functional Circuits

    OpenAIRE

    Bin Shao; Xiang Liu; Dongliang Zhang; Jiayi Wu; Qi Ouyang

    2015-01-01

    Computational circuit design with desired functions in a living cell is a challenging task in synthetic biology. To achieve this task, numerous methods that either focus on small scale networks or use evolutionary algorithms have been developed. Here, we propose a two-step approach to facilitate the design of functional circuits. In the first step, the search space of possible topologies for target functions is reduced by reverse engineering using a Boolean network model. In the second step, ...

  11. Detection and reconstruction of error control codes for engineered and biological regulatory systems.

    Energy Technology Data Exchange (ETDEWEB)

    May, Elebeoba Eni; Rintoul, Mark Daniel; Johnston, Anna Marie; Pryor, Richard J.; Hart, William Eugene; Watson, Jean-Paul

    2003-10-01

    A fundamental challenge for all communication systems, engineered or living, is the problem of achieving efficient, secure, and error-free communication over noisy channels. Information theoretic principals have been used to develop effective coding theory algorithms to successfully transmit information in engineering systems. Living systems also successfully transmit biological information through genetic processes such as replication, transcription, and translation, where the genome of an organism is the contents of the transmission. Decoding of received bit streams is fairly straightforward when the channel encoding algorithms are efficient and known. If the encoding scheme is unknown or part of the data is missing or intercepted, how would one design a viable decoder for the received transmission? For such systems blind reconstruction of the encoding/decoding system would be a vital step in recovering the original message. Communication engineers may not frequently encounter this situation, but for computational biologists and biotechnologist this is an immediate challenge. The goal of this work is to develop methods for detecting and reconstructing the encoder/decoder system for engineered and biological data. Building on Sandia's strengths in discrete mathematics, algorithms, and communication theory, we use linear programming and will use evolutionary computing techniques to construct efficient algorithms for modeling the coding system for minimally errored engineered data stream and genomic regulatory DNA and RNA sequences. The objective for the initial phase of this project is to construct solid parallels between biological literature and fundamental elements of communication theory. In this light, the milestones for FY2003 were focused on defining genetic channel characteristics and providing an initial approximation for key parameters, including coding rate, memory length, and minimum distance values. A secondary objective addressed the question of

  12. Case studies of community college non-science majors: Effects of self-regulatory interventions on biology self-efficacy and biological literacy

    Science.gov (United States)

    Maurer, Matthew J.

    Science literacy has been at the heart of current reform efforts in science education. The focus on developing essential skills needed for individual ability to be literate in science has been at the forefront of most K--12 science curricula. Reform efforts have begun to stretch into the postsecondary arena as well, with an ever increasing dialogue regarding the need for attention to science literacy by college students, especially non-science majors. This study set out to investigate how the use of self-regulatory interventions (specifically, goal setting, concept mapping, and reflective writing) affected student biology self-efficacy and biological literacy. This study employed a qualitative research design, analyzing three case studies. Participants in the study received ten self-regulatory interventions as a set of portfolio assignments. Portfolio work was qualitatively analyzed and coded for self-efficacy, as well as evidence of biological literacy. A biology self-efficacy survey was administered pre- and post- to provide a means of self-efficacy data triangulation. Literacy data was supported via a biological literacy rubric, constructed specifically for this study. Results indicated that mastery experiences were the source of biology self-efficacy. Self-efficacy for specific tasks increased over time, and changes in self-efficacy were corroborated by the self-efficacy survey. Students were found to express biological literacy at nominal, functional, or conceptual levels depending on the specific task. This was supported by data from the biological literacy rubric scores. Final conclusions and implications for the study indicated the need for further research with more samples of students in similar and different contexts. Given the fact that the literature in this area is sparse, the results obtained here have only begun to delve into this area of research. Generalization to other biology courses or contexts outside of the one presented in this study was

  13. Combinational Logic-Level Verification using Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif

    1997-01-01

    Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties...... of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level verification problem which is, given two combinational circuits, to determine whether they implement the same Boolean functions. Based on all combinational circuits in the ISCAS 85 and LGSynth 91...

  14. A Generalization of J-Boolean Like Rings%J-Boolean like 环的扩张

    Institute of Scientific and Technical Information of China (English)

    秦蕊

    2014-01-01

    对 J-Boolean like环进行了扩张,并且将 J-Boolean like环与广义矩阵环和Morita Context环联系起来,进而探索了部分环为 J-Boolean like环时应具备的条件,且给出若干相关例子。%The paper mainly explored the generalization of J-Boolean like rings ,and connected J-Boolean like rings with generalized matrix rings and Morita Context rings ,then studied the conditions when a part of other rings became J-Boolean like rings ,and listed some examples .

  15. Control of random Boolean networks via average sensitivity of Boolean functions

    Institute of Scientific and Technical Information of China (English)

    Chen Shi-Jian; Hong Yi-Guang

    2011-01-01

    In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method.

  16. Detecting small attractors of large Boolean networks by function-reduction-based strategy.

    Science.gov (United States)

    Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin

    2016-04-01

    Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.

  17. Reverse engineering Boolean networks: from Bernoulli mixture models to rule based systems.

    Directory of Open Access Journals (Sweden)

    Mehreen Saeed

    Full Text Available A Boolean network is a graphical model for representing and analyzing the behavior of gene regulatory networks (GRN. In this context, the accurate and efficient reconstruction of a Boolean network is essential for understanding the gene regulation mechanism and the complex relations that exist therein. In this paper we introduce an elegant and efficient algorithm for the reverse engineering of Boolean networks from a time series of multivariate binary data corresponding to gene expression data. We call our method ReBMM, i.e., reverse engineering based on Bernoulli mixture models. The time complexity of most of the existing reverse engineering techniques is quite high and depends upon the indegree of a node in the network. Due to the high complexity of these methods, they can only be applied to sparsely connected networks of small sizes. ReBMM has a time complexity factor, which is independent of the indegree of a node and is quadratic in the number of nodes in the network, a big improvement over other techniques and yet there is little or no compromise in accuracy. We have tested ReBMM on a number of artificial datasets along with simulated data derived from a plant signaling network. We also used this method to reconstruct a network from real experimental observations of microarray data of the yeast cell cycle. Our method provides a natural framework for generating rules from a probabilistic model. It is simple, intuitive and illustrates excellent empirical results.

  18. A regulatory perspective of clinical trial applications for biological products with particular emphasis on Advanced Therapy Medicinal Products (ATMPs).

    Science.gov (United States)

    Jones, David R; McBlane, James W; McNaughton, Graham; Rajakumaraswamy, Nishanthan; Wydenbach, Kirsty

    2013-08-01

    The safety of trial subjects is the tenet that guides the regulatory assessment of a Clinical Trial Authorization application and applies equally to trials involving small molecules and those with biological/biotechnological products, including Advanced Therapy Medicinal Products. The objective of a regulator is to ensure that the potential risk faced by a trial subject is outweighed by the potential benefit to them from taking part in the trial. The focus of the application review is to assess whether risks have been identified and appropriate steps taken to alleviate these as much as possible. Other factors are also taken into account during a review, such as regulatory requirements, and emerging non-clinical and clinical data from other trials on the same or similar products. This paper examines the regulatory review process of a Clinical Trial Authorization application from the perspectives of Quality, Non-Clinical and Clinical Regulatory Assessors at the Medicines and Healthcare products Regulatory Agency. It should be noted that each perspective has highlighted specific issues from their individual competence and that these can be different between the disciplines.

  19. Constructions of vector output Boolean functions with high generalized nonlinearity

    Institute of Scientific and Technical Information of China (English)

    KE Pin-hui; ZHANG Sheng-yuan

    2008-01-01

    Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean functions with high generalized nonlinearity using the sample space. The relation between the resilient order and generalized nonlinearity is also discussed.

  20. Boolean Queries and Term Dependencies in Probabilistic Retrieval Models.

    Science.gov (United States)

    Croft, W. Bruce

    1986-01-01

    Proposes approach to integrating Boolean and statistical systems where Boolean queries are interpreted as a means of specifying term dependencies in relevant set of documents. Highlights include series of retrieval experiments designed to test retrieval strategy based on term dependence model and relation of results to other work. (18 references)…

  1. Towards Truly Boolean Arrays in Data-Parallel Array Processing

    NARCIS (Netherlands)

    C. Grelck; H. Luyat

    2013-01-01

    We investigate several dense bit-wise implementations of Boolean arrays in the context of the functional data-parallel array programming language SAC. A particular problem arises in compiler or directive based parallelisation as the scheduling of loops over Boolean arrays is unaware of the restricte

  2. Reasoning formalism in Boolean operator fuzzy logic

    Institute of Scientific and Technical Information of China (English)

    邓安生; 刘叙华

    1995-01-01

    Based on the newly introduced concepts of true-level and false-level, the formal structure of reasoning in Boolean operator fuzzy logic is presented. As a generalization of the theory of epistemic process in open logic, a formalism is also proposed to describe human reasoning with uncertain, inconsistent and insufficient knowledge, which can characterize the knowledge increment and revision, as well as the epistemic evolution. The formalism provides an explanation to the dynamic properties of human reasoning, i. e. continuous revision and combination of beliefs.

  3. The Boolean algebra and central Galois algebras

    Directory of Open Access Journals (Sweden)

    George Szeto

    2001-01-01

    Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb   for all   x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.

  4. Towards boolean operations with thermal photons

    CERN Document Server

    Ben-Abdallah, Philippe

    2016-01-01

    The Boolean algebra is the natural theoretical framework for a classical information treatment. The basic logical operations are usually performed using logic gates. In this Letter we demonstrate that NOT, OR and AND gates can be realized exploiting the near-field radiative interaction in N-body systems with phase change materials. With the recent development of a photon thermal transistor and thermal memory, this result paves the way for a full information treatment and smart solutions for active thermal management at nanoscale with photons.

  5. A systems biology approach identifies a regulatory network in parotid acinar cell terminal differentiation.

    Directory of Open Access Journals (Sweden)

    Melissa A Metzler

    Full Text Available The transcription factor networks that drive parotid salivary gland progenitor cells to terminally differentiate, remain largely unknown and are vital to understanding the regeneration process.A systems biology approach was taken to measure mRNA and microRNA expression in vivo across acinar cell terminal differentiation in the rat parotid salivary gland. Laser capture microdissection (LCM was used to specifically isolate acinar cell RNA at times spanning the month-long period of parotid differentiation.Clustering of microarray measurements suggests that expression occurs in four stages. mRNA expression patterns suggest a novel role for Pparg which is transiently increased during mid postnatal differentiation in concert with several target gene mRNAs. 79 microRNAs are significantly differentially expressed across time. Profiles of statistically significant changes of mRNA expression, combined with reciprocal correlations of microRNAs and their target mRNAs, suggest a putative network involving Klf4, a differentiation inhibiting transcription factor, which decreases as several targeting microRNAs increase late in differentiation. The network suggests a molecular switch (involving Prdm1, Sox11, Pax5, miR-200a, and miR-30a progressively decreases repression of Xbp1 gene transcription, in concert with decreased translational repression by miR-214. The transcription factor Xbp1 mRNA is initially low, increases progressively, and may be maintained by a positive feedback loop with Atf6. Transfection studies show that Xbp1 activates the Mist1 promoter [corrected]. In addition, Xbp1 and Mist1 each activate the parotid secretory protein (Psp gene, which encodes an abundant salivary protein, and is a marker of terminal differentiation.This study identifies novel expression patterns of Pparg, Klf4, and Sox11 during parotid acinar cell differentiation, as well as numerous differentially expressed microRNAs. Network analysis identifies a novel stemness arm, a

  6. Social insect colony as a biological regulatory system: Information flow in dominance networks

    OpenAIRE

    Nandi, Anjan K.; Sumana, Annagiri; Bhattacharya, Kunal

    2014-01-01

    Social insects provide an excellent platform to investigate flow of information in regulatory systems since their successful social organization is essentially achieved by effective information transfer through complex connectivity patterns among the colony members. Network representation of such behavioural interactions offers a powerful tool for structural as well as dynamical analysis of the underlying regulatory systems. In this paper, we focus on the dominance interaction networks in the...

  7. Boolean Algebra. Geometry Module for Use in a Mathematics Laboratory Setting.

    Science.gov (United States)

    Brotherton, Sheila; And Others

    This module is recommended as an honors unit to follow a unit on logic. There are four basic parts: (1) What is a Boolean Algebra; (2) Using Boolean Algebra to Prove Theorems; (3) Using Boolean Algebra to Simplify Logical Statements; and (4) Circuit Problems with Logic and Boolean Algebra. Of these, sections 1, 2, and 3 are primarily written…

  8. Evolution of regulatory networks towards adaptability and stability in a changing environment

    Science.gov (United States)

    Lee, Deok-Sun

    2014-11-01

    Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

  9. Intervention in Context-Sensitive Probabilistic Boolean Networks Revisited

    Directory of Open Access Journals (Sweden)

    Babak Faryabi

    2009-01-01

    Full Text Available An approximate representation for the state space of a context-sensitive probabilistic Boolean network has previously been proposed and utilized to devise therapeutic intervention strategies. Whereas the full state of a context-sensitive probabilistic Boolean network is specified by an ordered pair composed of a network context and a gene-activity profile, this approximate representation collapses the state space onto the gene-activity profiles alone. This reduction yields an approximate transition probability matrix, absent of context, for the Markov chain associated with the context-sensitive probabilistic Boolean network. As with many approximation methods, a price must be paid for using a reduced model representation, namely, some loss of optimality relative to using the full state space. This paper examines the effects on intervention performance caused by the reduction with respect to various values of the model parameters. This task is performed using a new derivation for the transition probability matrix of the context-sensitive probabilistic Boolean network. This expression of transition probability distributions is in concert with the original definition of context-sensitive probabilistic Boolean network. The performance of optimal and approximate therapeutic strategies is compared for both synthetic networks and a real case study. It is observed that the approximate representation describes the dynamics of the context-sensitive probabilistic Boolean network through the instantaneously random probabilistic Boolean network with similar parameters.

  10. Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function

    Science.gov (United States)

    Martin, O. C.; Krzywicki, A.; Zagorski, M.

    2016-07-01

    Living cells can maintain their internal states, react to changing environments, grow, differentiate, divide, etc. All these processes are tightly controlled by what can be called a regulatory program. The logic of the underlying control can sometimes be guessed at by examining the network of influences amongst genetic components. Some associated gene regulatory networks have been studied in prokaryotes and eukaryotes, unveiling various structural features ranging from broad distributions of out-degrees to recurrent "motifs", that is small subgraphs having a specific pattern of interactions. To understand what factors may be driving such structuring, a number of groups have introduced frameworks to model the dynamics of gene regulatory networks. In that context, we review here such in silico approaches and show how selection for phenotypes, i.e., network function, can shape network structure.

  11. PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE

    Directory of Open Access Journals (Sweden)

    Maria Angeles Gallego

    2014-11-01

    Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.

  12. Complementing ODE-Based System Analysis Using Boolean Networks Derived from an Euler-Like Transformation.

    Science.gov (United States)

    Stötzel, Claudia; Röblitz, Susanna; Siebert, Heike

    2015-01-01

    In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs) into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.

  13. Complementing ODE-Based System Analysis Using Boolean Networks Derived from an Euler-Like Transformation.

    Directory of Open Access Journals (Sweden)

    Claudia Stötzel

    Full Text Available In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.

  14. Low doses of ionizing radiation: Biological effects and regulatory control. Invited papers and discussions. Proceedings of an international conference

    International Nuclear Information System (INIS)

    The levels and biological effects resulting from exposure to ionizing radiation are continuously reviewed by the United Nations Committee on the Effects of Atomic Radiation (UNSCEAR). Since its creation in 1928, the International Commission on Radiological Protection (ICRP) has issued recommendations on protection against ionizing radiation. The UNSCEAR estimates and the ICRP recommendations have served as the basis for national and international safety standards on radiation safety, including those developed by the International Atomic Energy Agency (IAEA) and the World Health Organization (WHO). Concerning health effects of low doses of ionizing radiation, the international standards are based on the plausible assumption that, above the unavoidable background radiation dose, the probability of effects increases linearly with dose, i.e. on a 'linear, no threshold' (LNT) assumption. However, in recent years the biological estimates of health effects of low doses of ionizing radiation and the regulatory approach to the control of low level radiation exposure have been much debated. To foster information exchange on the relevant issues, an International Conference on Low Doses of Ionizing Radiation: Biological Effects and Regulatory Control, jointly sponsored by the IAEA and WHO in co-operation with UNSCEAR, was held from 17-21 November 1997 at Seville, Spain. These Proceedings contain the invited special reports, keynote papers, summaries of discussions, session summaries and addresses presented at the opening and closing of the Conference

  15. Ordered Boolean List (OBL): reducing the footprint for evaluating Boolean expressions.

    Science.gov (United States)

    Rossignac, Jaroslaw Jarek

    2011-09-01

    An Expanded Boolean Expression (EBE) does not contain any XOR or EQUAL operators. The occurrence of each variable is a different literal. We provide a linear time algorithm that converts an EBE of n literals into a logically equivalent Ordered Boolean List (OBL) and show how to use the OBL to evaluate the EBE in n steps and O(log log n) space, if the values of the literals are each read once in the order prescribed by the OBL. (An evaluation workspace of 5 bits suffices for all EBEs of up to six billion literals.) The primary application is the SIMD architecture, where the same EBE is evaluated in parallel for different input vectors when rendering solid models on the GPU directly from their Constructive Solid Geometry (CSG) representation. We compare OBL to the Reduced Ordered Binary Decision Diagram (ROBDD) and suggest possible applications of OBL to logic verification and to circuit design. PMID:21737862

  16. Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif

    1999-01-01

    The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...

  17. 78 FR 68840 - Public Workshop: Follow-On Biologics: Impact of Recent Legislative and Regulatory Naming...

    Science.gov (United States)

    2013-11-15

    ... characteristics of the product, such as chemical structure and pharmacological properties. In the United States... as the World Health Organisation (WHO).''). The concept of a ``similar biological medicinal...

  18. 布尔代数的软商布尔代数%Soft quotient Boolean algebra of Boolean algebra

    Institute of Scientific and Technical Information of China (English)

    刘卫锋

    2015-01-01

    The concepts of soft congruence relation,soft quotient algebra and soft quotient Boolean algebra of Boolean algebra are defined,and it is proved that soft congruence relation and soft ideal of Boolean algebra can be determined by each other.Then soft quotient Boolean algebra of Boolean algebra is obtained from soft proper ideal of Boolean algebra. Finally,the nature of preserving soft congruence relation of soft homomorphism of Boolean algebras is proved.%定义了布尔代数的软合同关系、软商代数和软商布尔代数等概念,证明了布尔代数的软合同关系与软理想相互确定,进而由布尔代数的软真理想得到布尔代数的软商布尔代数。最后,证明了布尔代数的软同态具有保软合同性。

  19. Computer-assisted curation of a human regulatory core network from the biological literature

    NARCIS (Netherlands)

    Thomas, P.; Durek, P.; Solt, I.; Klinger, B.; Witzel, F.; Schulthess, P.; Mayer, Y.; Tikk, D.; Blüthgen, N.; Leser, U.

    2015-01-01

    Motivation: A highly interlinked network of transcription factors (TFs) orchestrates the context-dependent expression of human genes. ChIP-chip experiments that interrogate the binding of particular TFs to genomic regions are used to reconstruct gene regulatory networks at genome-scale, but are plag

  20. Non-human primate regulatory T cells: Current biology and implications for transplantation

    NARCIS (Netherlands)

    E.M. Dons (Eefje); G. Raimondi (Giorgio); D.K.C. Cooper; A.W. Thomson (Angus)

    2010-01-01

    textabstractRegulatory T cells (Treg) offer potential for improving long-term outcomes in cell and organ transplantation. The non-human primate model is a valuable resource for addressing issues concerning the transfer of Treg therapy to the clinic. Herein, we discuss the properties of non-human pri

  1. Supercriticality for Annealed Approximations of Boolean Networks

    CERN Document Server

    Mountford, Thomas

    2010-01-01

    We consider a model proposed by Derrida and Pomeau (1986) and recently studied by Chatterjee and Durrett (2009); it is defined as an approximation to S. Kauffman's boolean networks (1969). The model starts with the choice of a random directed graph on $n$ vertices; each node has $r$ input nodes pointing at it. A discrete time threshold contact process is then considered on this graph: at each instant, each site has probability $q$ of choosing to receive input; if it does, and if at least one of its inputs were occupied by a $1$ at the previous instant, then it is labeled with a $1$; in all other cases, it is labeled with a $0$. $r$ and $q$ are kept fixed and $n$ is taken to infinity. Improving a result of Chatterjee and Durrett, we show that if $qr > 1$, then the time of persistence of the dynamics is exponential in $n$.

  2. Multipath Detection Using Boolean Satisfiability Techniques

    Directory of Open Access Journals (Sweden)

    Fadi A. Aloul

    2011-01-01

    Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.

  3. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.

  4. Robust Boolean Operation for Sculptured Models

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    To enhance the ability of current modeling system, an uniformed representation is designed to represent wire-frame, solid, surface models. We present an algorithm for Boolean operation between the models under this representation. Accuracy, efficiency and robustness are the main consideration. The geometric information is represented with trimmed parametric patches and trimmed parametric splines. The topological information is represented with an extended half-edge data structure. In the process of intersection calculation, hierarchy intersection method is applied for unified classification. Tracing the intersection curve to overcome degenerate cases that occur frequently in practice. The algorithm has been implemented as the modeling kernel of a feature based modeling system named GS-CAD98, which was developed on Windows/NT platform.

  5. Polynomial threshold functions and Boolean threshold circuits

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2013-01-01

    secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...... bound for PTFs that holds regardless of degree, thereby extending known lower bounds for THRMAJ circuits. We generalize two-party unbounded error communication complexity to the multi-party number-on-the-forehead setting, and show that communication lower bounds for 3-player protocols would yield size...... lower bounds for THRTHR circuits. We obtain several other results about PTFs. These include relationships between weight and degree of PTFs, and a degree lower bound for PTFs of constant length. We also consider a variant of PTFs over the max-plus algebra. We show that they are connected to PTFs over...

  6. Random Boolean Networks and Attractors of their Intersecting Circuits

    OpenAIRE

    Demongeot, Jacques; Elena, Adrien; Noual, Mathilde; Sené, Sylvain

    2011-01-01

    International audience The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the "immunetworks" involved in the control of the immune system. As a result, we show that the small number of attract...

  7. Inferring Biologically Relevant Models: Nested Canalyzing Functions

    CERN Document Server

    Hinkelmann, Franziska

    2010-01-01

    Inferring dynamic biochemical networks is one of the main challenges in systems biology. Given experimental data, the objective is to identify the rules of interaction among the different entities of the network. However, the number of possible models fitting the available data is huge and identifying a biologically relevant model is of great interest. Nested canalyzing functions, where variables in a given order dominate the function, have recently been proposed as a framework for modeling gene regulatory networks. Previously we described this class of functions as an algebraic toric variety. In this paper, we present an algorithm that identifies all nested canalyzing models that fit the given data. We demonstrate our methods using a well-known Boolean model of the cell cycle in budding yeast.

  8. Regulatory inhibition of biological tissue mineralization by calcium phosphate through post-nucleation shielding by fetuin-A

    Science.gov (United States)

    Chang, Joshua C.; Miura, Robert M.

    2016-04-01

    In vertebrates, insufficient availability of calcium and inorganic phosphate ions in extracellular fluids leads to loss of bone density and neuronal hyper-excitability. To counteract this problem, calcium ions are usually present at high concentrations throughout bodily fluids—at concentrations exceeding the saturation point. This condition leads to the opposite situation where unwanted mineral sedimentation may occur. Remarkably, ectopic or out-of-place sedimentation into soft tissues is rare, in spite of the thermodynamic driving factors. This fortunate fact is due to the presence of auto-regulatory proteins that are found in abundance in bodily fluids. Yet, many important inflammatory disorders such as atherosclerosis and osteoarthritis are associated with this undesired calcification. Hence, it is important to gain an understanding of the regulatory process and the conditions under which it can go awry. In this manuscript, we extend mean-field continuum classical nucleation theory of the growth of clusters to encompass surface shielding. We use this formulation to study the regulation of sedimentation of calcium phosphate salts in biological tissues through the mechanism of post-nuclear shielding of nascent mineral particles by binding proteins. We develop a mathematical description of this phenomenon using a countable system of hyperbolic partial differential equations. A critical concentration of regulatory protein is identified as a function of the physical parameters that describe the system.

  9. Regulatory inhibition of biological tissue mineralization by calcium phosphate through post-nucleation shielding by fetuin-A.

    Science.gov (United States)

    Chang, Joshua C; Miura, Robert M

    2016-04-21

    In vertebrates, insufficient availability of calcium and inorganic phosphate ions in extracellular fluids leads to loss of bone density and neuronal hyper-excitability. To counteract this problem, calcium ions are usually present at high concentrations throughout bodily fluids-at concentrations exceeding the saturation point. This condition leads to the opposite situation where unwanted mineral sedimentation may occur. Remarkably, ectopic or out-of-place sedimentation into soft tissues is rare, in spite of the thermodynamic driving factors. This fortunate fact is due to the presence of auto-regulatory proteins that are found in abundance in bodily fluids. Yet, many important inflammatory disorders such as atherosclerosis and osteoarthritis are associated with this undesired calcification. Hence, it is important to gain an understanding of the regulatory process and the conditions under which it can go awry. In this manuscript, we extend mean-field continuum classical nucleationtheory of the growth of clusters to encompass surface shielding. We use this formulation to study the regulation of sedimentation of calcium phosphate salts in biological tissues through the mechanism of post-nuclear shielding of nascent mineral particles by binding proteins. We develop a mathematical description of this phenomenon using a countable system of hyperbolic partial differential equations. A critical concentration of regulatory protein is identified as a function of the physical parameters that describe the system. PMID:27389239

  10. A transition calculus for Boolean functions. [logic circuit analysis

    Science.gov (United States)

    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.

  11. Construction and enumeration of Boolean functions with maximum algebraic immunity

    Institute of Scientific and Technical Information of China (English)

    ZHANG WenYing; WU ChuanKun; LIU XiangZhong

    2009-01-01

    Algebraic immunity is a new cryptographic criterion proposed against algebraic attacks. In order to resist algebraic attacks, Boolean functions used in many stream ciphers should possess high algebraic immunity. This paper presents two main results to find balanced Boolean functions with maximum algebraic immunity. Through swapping the values of two bits, and then generalizing the result to swap some pairs of bits of the symmetric Boolean function constructed by Dalai, a new class of Boolean functions with maximum algebraic immunity are constructed. Enumeration of such functions is also given. For a given function p(x) with deg(p(x)) < [n/2], we give a method to construct functions in the form p(x)+q(x) which achieve the maximum algebraic immunity, where every term with nonzero coefficient in the ANF of q(x) has degree no less than [n/2].

  12. Boolean Burritos: How the Faculty Ate Up Keyword Searching.

    Science.gov (United States)

    York, Sherry

    1999-01-01

    Describes an activity that librarians can use to acquaint teachers with keyword searching and Boolean operators to more successfully use the library's online catalog. Uses food ingredients to represent various possible combinations. (LRW)

  13. Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems

    CERN Document Server

    Yamakami, Tomoyuki

    2010-01-01

    Constraint satisfaction problems (or CSPs) have been extensively studied in AI, database theory, graph theory, etc. From an approximation viewpoint, it has been important to approximate the total number of assignments that satisfy all given Boolean constraints. There is a trichotomy theorem for such approximate counting for (non-weighted) Boolean CSPs; namely, all such counting problems are neatly classified into three categories under polynomial-time approximation-preserving reductions [Dyer, Goldberg, and Jerrum, 2010]. We extend this result to approximate counting for complex-weighted Boolean CSPs, provided that all arity-1 constraints are freely available to use. This makes a significant progress in the quest for the approximation classification of all counting Boolean CSPs in the most general form. To deal with complex weights, we employ proof techniques along the line of solving Holant problems [Valiant, 2002, 2008]. Our result also gives an approximation version of the dichotomy theorem of the complexi...

  14. Automatic Ranked Output from Boolean Searches in SIRE

    Science.gov (United States)

    Noreault, Terry; And Others

    1977-01-01

    This study examined the effectiveness using an automatic algorithm to rank the results of Boolean searches of an inverted file design document retrieval system. Relevant documents were ranked significantly higher than nonrelevant documents on output lists. (Author/KP)

  15. Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms and Requirements

    OpenAIRE

    Audemard, Gilles; Bertoli, Piergiorgio; Cimatti, Alessandro; Kornilowicz, Artur; Sebastiani, Roberto

    2002-01-01

    In the last years we have witnessed an impressive advance in the efficiency of boolean solving techniques, which has brought large previously intractable problems at the reach of state-of-the-art solvers. Unfortunately, simple boolean expressions are not expressive enough for representing many real-world problems, which require handling also integer or real values and operators. On the other hand, mathematical solvers, like computer-algebra systems or constraint solvers, cannot handle efficie...

  16. IMS Algorithm for Learning Representations in Boolean Neural Networks

    OpenAIRE

    Biswas, Nripendra N; Murthy, TVMK; Chandrasekhar, M.

    1991-01-01

    A new algorithm for learning representations in Boolean neural networks, where the inputs and outputs are binary bits, is presented. The algorithm has become feasible because of a newly discovered theorem which states that any non-linearly separable Boolean function can be expressed as a convergent series of linearly separable functions connected by the logical OR (+) and the logical INHIBIT (-) operators. The formation of the series is carried out by many important properties exhibited by th...

  17. Inadmissible Class of Boolean Functions under Stuck-at Faults

    OpenAIRE

    Das, Debesh K.; Chowdhury, Debabani; Bhattacharya, Bhargab B; Sasao, Tsutomu

    2013-01-01

    Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root functions, which can never appear as faulty response in irredundant two-level circuits even when any arbitrary multiple stuck-at faults are injected. Conversely, we show that any other Boolean function can appear as a faulty response from an irredundant realization ...

  18. Boolean Equi-propagation for Optimized SAT Encoding

    CERN Document Server

    Metodi, Amit; Lagoon, Vitaly; Stuckey, Peter J

    2011-01-01

    We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings. We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.

  19. Regulatory activities

    International Nuclear Information System (INIS)

    This publication, compiled in 8 chapters, presents the regulatory system developed by the Nuclear Regulatory Authority (NRA) of the Argentine Republic. The following activities and developed topics in this document describe: the evolution of the nuclear regulatory activity in Argentina; the Argentine regulatory system; the nuclear regulatory laws and standards; the inspection and safeguards of nuclear facilities; the emergency systems; the environmental systems; the environmental monitoring; the analysis laboratories on physical and biological dosimetry, prenatal irradiation, internal irradiation, radiation measurements, detection techniques on nuclear testing, medical program on radiation protection; the institutional relations with national and international organization; the training courses and meeting; the technical information

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

    Science.gov (United States)

    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.

  1. Unlimited multistability and Boolean logic in microbial signalling.

    Science.gov (United States)

    Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca; Soyer, Orkun S

    2015-07-01

    The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and allow their engineering through synthetic biology.

  2. Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

    Directory of Open Access Journals (Sweden)

    Natalie Berestovsky

    Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

  3. Finding missing interactions of the Arabidopsis thaliana root stem cell niche gene regulatory network

    Directory of Open Access Journals (Sweden)

    Eugenio eAzpeitia

    2013-04-01

    Full Text Available AbstractOver the last few decades, the Arabidopsis thaliana root stem cell niche has become a model system for the study of plant development and the stem cell niche. Currently, many of the molecular mechanisms involved in root stem cell niche maintenance and development have been described. A few years ago, we published a gene regulatory network model integrating this information. This model suggested that there were missing components or interactions. Upon updating the model, the observed stable gene configurations of the root stem cell niche could not be recovered, indicating that there are additional missing components or interactions in the model. In fact, due to the lack of experimental data, gene regulatory networks inferred from published data are usually incomplete. However, predicting the location and nature of the missing data is a not trivial task. Here, we propose a set of procedures for detecting and predicting missing interactions in Boolean networks. We used these procedures to predict putative missing interactions in the A. thaliana root stem cell niche network model. Using our approach, we identified three necessary interactions to recover the reported gene activation configurations that have been experimentally uncovered for the different cell types within the root stem cell niche: 1 a regulation of PHABULOSA to restrict its expression domain to the vascular cells, 2 a self-regulation of WOX5, possibly by an indirect mechanism through the auxin signalling pathway and 3 a positive regulation of JACKDAW by MAGPIE. The procedures proposed here greatly reduce the number of possible Boolean functions that are biologically meaningful and experimentally testable and that do not contradict previous data. We believe that these procedures can be used on any Boolean network. However, because the procedures were designed for the specific case of the root stem cell niche, formal demonstrations of the procedures should be shown in future

  4. Efficient Analog Circuits for Boolean Satisfiability

    CERN Document Server

    Yin, Xunzhao; Varga, Melinda; Ercsey-Ravasz, Maria; Toroczkai, Zoltan; Hu, Xiaobo Sharon

    2016-01-01

    Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative solutions to tackle such problems. Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed (Nature Physics, 7(12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT). This solver shows polynomial analog time-complexity on even the hardest benchmark $k$-SAT ($k \\geq 3$) formulas, but at an energy cost through exponentially driven auxiliary variables. With some modifications to the CTDS equations, here we present a novel analog hardware SAT solver, AC-SAT, implementing the CTDS. AC-SAT is intended to be used as a co-processor, and with its modular design can be readily extended to different problem sizes. The circuit is designed and simulated based on a 32nm CMOS technology. SPICE simulation results show speedup factor...

  5. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

    CERN Document Server

    Glasser, Christian; Selivanov, Victor

    2008-01-01

    The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: - The classes of the Boolean hierarchy over level $\\Sigma_1$ of the dot-depth hierarchy are decidable in $NL$ (previously only the decidability was known). The same remains true if predicates mod $d$ for fixed $d$ are allowed. - If modular predicates for arbitrary $d$ are allowed, then the classes of the Boolean hierarchy over level $\\Sigma_1$ are decidable. - For the restricted case of a two-letter alphabet, the classes of the Boolean hierarchy over level $\\Sigma_2$ of the Straubing-Th\\'erien hierarchy are decidable in $NL$. This is the first decidability result for this hierarchy. - The membership problems for all mentioned Boolean-hierarchy classes are logspace many-one hard for $NL$. - T...

  6. Second moment method for a family of boolean CSP

    CERN Document Server

    Boufkhad, Yacine

    2011-01-01

    The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first moment method on the number of solutions permits to compute upper bounds on any boolean CSP, the second moment method used for computing lower bounds proves to be more tricky and in most cases gives only the trivial lower bound 0. In this paper, we define a subclass of boolean CSP covering the monotone versions of many known NP-Complete boolean CSPs. We give a method for computing non trivial lower bounds for any member of this subclass. This is achieved thanks to an application of the second moment method to some selected solutions called characteristic solutions that depend on the boolean CSP considered. We apply, as an example, this method to establish that the threshold r_{k} of monotone 1-in-k-SAT is \\log k/k\\leq r_{k}\\leq\\log^{2}k/k

  7. MicroRNA-1 properties in cancer regulatory networks and tumor biology.

    Science.gov (United States)

    Weiss, Martin; Brandenburg, Lars-Ove; Burchardt, Martin; Stope, Matthias B

    2016-08-01

    Short non-coding microRNAs have been identified to orchestrate crucial mechanisms in cancer progression and treatment resistance. MicroRNAs are involved in posttranscriptional modulation of gene expression and therefore represent promising targets for anticancer therapy. As mircoRNA-1 (miR-1) exerted to be predominantly downregulated in the majority of examined tumors, miR-1 is classified to be a tumor suppressor with high potential to diminish tumor development and therapy resistance. Here we review the complex functionality of miR-1 in tumor biology. PMID:27286699

  8. Dynamic regulatory on/off minimization for biological systems under internal temporal perturbations

    Directory of Open Access Journals (Sweden)

    Kleessen Sabrina

    2012-03-01

    Full Text Available Abstract Background Flux balance analysis (FBA together with its extension, dynamic FBA, have proven instrumental for analyzing the robustness and dynamics of metabolic networks by employing only the stoichiometry of the included reactions coupled with adequately chosen objective function. In addition, under the assumption of minimization of metabolic adjustment, dynamic FBA has recently been employed to analyze the transition between metabolic states. Results Here, we propose a suite of novel methods for analyzing the dynamics of (internally perturbed metabolic networks and for quantifying their robustness with limited knowledge of kinetic parameters. Following the biochemically meaningful premise that metabolite concentrations exhibit smooth temporal changes, the proposed methods rely on minimizing the significant fluctuations of metabolic profiles to predict the time-resolved metabolic state, characterized by both fluxes and concentrations. By conducting a comparative analysis with a kinetic model of the Calvin-Benson cycle and a model of plant carbohydrate metabolism, we demonstrate that the principle of regulatory on/off minimization coupled with dynamic FBA can accurately predict the changes in metabolic states. Conclusions Our methods outperform the existing dynamic FBA-based modeling alternatives, and could help in revealing the mechanisms for maintaining robustness of dynamic processes in metabolic networks over time.

  9. Coevolution of information processing and topology in hierarchical adaptive random Boolean networks

    Science.gov (United States)

    Górski, Piotr J.; Czaplicka, Agnieszka; Hołyst, Janusz A.

    2016-02-01

    Random Boolean Networks (RBNs) are frequently used for modeling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive random Boolean Network (HARBN) as a system consisting of distinct adaptive RBNs (ARBNs) - subnetworks - connected by a set of permanent interlinks. We investigate mean node information, mean edge information as well as mean node degree. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. The main natural feature of ARBNs, i.e. their adaptability, is preserved in HARBNs and they evolve towards critical configurations which is documented by power law distributions of network attractor lengths. The mean information processed by a single node or a single link increases with the number of interlinks added to the system. The mean length of network attractors and the mean steady-state connectivity possess minima for certain specific values of the quotient between the density of interlinks and the density of all links in networks. It means that the modular network displays extremal values of its observables when subnetworks are connected with a density a few times lower than a mean density of all links.

  10. Boolean Modeling of Cellular and Molecular Pathways Involved in Influenza Infection.

    Science.gov (United States)

    Anderson, Christopher S; DeDiego, Marta L; Topham, David J; Thakar, Juilee

    2016-01-01

    Systems virology integrates host-directed approaches with molecular profiling to understand viral pathogenesis. Self-contained statistical approaches that combine expression profiles of genes with the available databases defining the genes involved in the pathways (gene-sets) have allowed characterization of predictive gene-signatures associated with outcome of the influenza virus (IV) infection. However, such enrichment techniques do not take into account interactions among pathways that are responsible for the IV infection pathogenesis. We investigate dendritic cell response to seasonal H1N1 influenza A/New Caledonia/20/1999 (NC) infection and infer the Boolean logic rules underlying the interaction network of ligand induced signaling pathways and transcription factors. The model reveals several novel regulatory modes and provides insights into mechanism of cross talk between NFκB and IRF mediated signaling. Additionally, the logic rule underlying the regulation of IL2 pathway that was predicted by the Boolean model was experimentally validated. Thus, the model developed in this paper integrates pathway analysis tools with the dynamic modeling approaches to reveal the regulation between signaling pathways and transcription factors using genome-wide transcriptional profiles measured upon influenza infection.

  11. Boolean Modeling of Cellular and Molecular Pathways Involved in Influenza Infection

    Science.gov (United States)

    Anderson, Christopher S.; DeDiego, Marta L.; Topham, David J.; Thakar, Juilee

    2016-01-01

    Systems virology integrates host-directed approaches with molecular profiling to understand viral pathogenesis. Self-contained statistical approaches that combine expression profiles of genes with the available databases defining the genes involved in the pathways (gene-sets) have allowed characterization of predictive gene-signatures associated with outcome of the influenza virus (IV) infection. However, such enrichment techniques do not take into account interactions among pathways that are responsible for the IV infection pathogenesis. We investigate dendritic cell response to seasonal H1N1 influenza A/New Caledonia/20/1999 (NC) infection and infer the Boolean logic rules underlying the interaction network of ligand induced signaling pathways and transcription factors. The model reveals several novel regulatory modes and provides insights into mechanism of cross talk between NFκB and IRF mediated signaling. Additionally, the logic rule underlying the regulation of IL2 pathway that was predicted by the Boolean model was experimentally validated. Thus, the model developed in this paper integrates pathway analysis tools with the dynamic modeling approaches to reveal the regulation between signaling pathways and transcription factors using genome-wide transcriptional profiles measured upon influenza infection. PMID:26981147

  12. Boolean Modeling of Cellular and Molecular Pathways Involved in Influenza Infection

    Directory of Open Access Journals (Sweden)

    Christopher S. Anderson

    2016-01-01

    Full Text Available Systems virology integrates host-directed approaches with molecular profiling to understand viral pathogenesis. Self-contained statistical approaches that combine expression profiles of genes with the available databases defining the genes involved in the pathways (gene-sets have allowed characterization of predictive gene-signatures associated with outcome of the influenza virus (IV infection. However, such enrichment techniques do not take into account interactions among pathways that are responsible for the IV infection pathogenesis. We investigate dendritic cell response to seasonal H1N1 influenza A/New Caledonia/20/1999 (NC infection and infer the Boolean logic rules underlying the interaction network of ligand induced signaling pathways and transcription factors. The model reveals several novel regulatory modes and provides insights into mechanism of cross talk between NFκB and IRF mediated signaling. Additionally, the logic rule underlying the regulation of IL2 pathway that was predicted by the Boolean model was experimentally validated. Thus, the model developed in this paper integrates pathway analysis tools with the dynamic modeling approaches to reveal the regulation between signaling pathways and transcription factors using genome-wide transcriptional profiles measured upon influenza infection.

  13. Periodic pattern detection in sparse boolean sequences

    Directory of Open Access Journals (Sweden)

    Hérisson Joan

    2010-09-01

    Full Text Available Abstract Background The specific position of functionally related genes along the DNA has been shown to reflect the interplay between chromosome structure and genetic regulation. By investigating the statistical properties of the distances separating such genes, several studies have highlighted various periodic trends. In many cases, however, groups built up from co-functional or co-regulated genes are small and contain wrong information (data contamination so that the statistics is poorly exploitable. In addition, gene positions are not expected to satisfy a perfectly ordered pattern along the DNA. Within this scope, we present an algorithm that aims to highlight periodic patterns in sparse boolean sequences, i.e. sequences of the type 010011011010... where the ratio of the number of 1's (denoting here the transcription start of a gene to 0's is small. Results The algorithm is particularly robust with respect to strong signal distortions such as the addition of 1's at arbitrary positions (contaminated data, the deletion of existing 1's in the sequence (missing data and the presence of disorder in the position of the 1's (noise. This robustness property stems from an appropriate exploitation of the remarkable alignment properties of periodic points in solenoidal coordinates. Conclusions The efficiency of the algorithm is demonstrated in situations where standard Fourier-based spectral methods are poorly adapted. We also show how the proposed framework allows to identify the 1's that participate in the periodic trends, i.e. how the framework allows to allocate a positional score to genes, in the same spirit of the sequence score. The software is available for public use at http://www.issb.genopole.fr/MEGA/Softwares/iSSB_SolenoidalApplication.zip.

  14. Piecewise linear and Boolean models of chemical reaction networks.

    Science.gov (United States)

    Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir

    2014-12-01

    Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.

  15. Control of Large-Scale Boolean Networks via Network Aggregation.

    Science.gov (United States)

    Zhao, Yin; Ghosh, Bijoy K; Cheng, Daizhan

    2016-07-01

    A major challenge to solve problems in control of Boolean networks is that the computational cost increases exponentially when the number of nodes in the network increases. We consider the problem of controllability and stabilizability of Boolean control networks, address the increasing cost problem by partitioning the network graph into several subnetworks, and analyze the subnetworks separately. Easily verifiable necessary conditions for controllability and stabilizability are proposed for a general aggregation structure. For acyclic aggregation, we develop a sufficient condition for stabilizability. It dramatically reduces the computational complexity if the number of nodes in each block of the acyclic aggregation is small enough compared with the number of nodes in the entire Boolean network.

  16. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Zakarias, Sarah Nouhad Haddad

    We present a protocol for securely computing a Boolean circuit $C$ in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming access to a preprocessing functionality that is not given the inputs to compute on. For a large number of players the work done...... by each player is the same as the work needed to compute the circuit in the clear, up to a constant factor. Our protocol is the first to obtain these properties for Boolean circuits. On the technical side, we develop new homomorphic authentication schemes based on asymptotically good codes...... with an additional multiplication property. We also show a new algorithm for verifying the product of Boolean matrices in quadratic time with exponentially small error probability, where previous methods would only give a constant error....

  17. Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

    Science.gov (United States)

    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.

  18. The Influence of Canalization on the Robustness of Boolean Networks

    CERN Document Server

    Kadelka, Claus; Laubenbacher, Reinhard

    2016-01-01

    Time- and state-discrete dynamical systems are frequently used to model molecular networks. This paper provides a collection of mathematical and computational tools for the study of robustness in Boolean network models. The focus is on networks governed by $k$-canalizing functions, a recently introduced class of Boolean functions that contains the well-studied class of nested canalizing functions. The activities and sensitivity of a function quantify the impact of input changes on the function output. This paper generalizes the latter concept to $c$-sensitivity and provides formulas for the activities and $c$-sensitivity of general $k$-canalizing functions as well as canalizing functions with more precisely defined structure. A popular measure for the robustness of a network, the Derrida value, can be expressed as a weighted sum of the $c$-sensitivities of the governing canalizing functions, and can also be calculated for a stochastic extension of Boolean networks. These findings provide a computationally eff...

  19. Optimal Computation of Symmetric Boolean Functions in Collocated Networks

    CERN Document Server

    Kowshik, Hemant

    2011-01-01

    We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block computation strategies for computing symmetric Boolean functions. We study three classes of functions: threshold functions, delta functions and interval functions. We provide exactly optimal strategies for the first two classes, and a scaling law order-optimal strategy with optimal preconstant for interval functions. We also extend the results to the case of integer measurements and certain integer-valued functions. We use lower bounds from communication complexity theory, and provide an achievable scheme using information theoretic tools. Next, we consider the case where nodes measurements are random and drawn from independent Bernoulli distributions. We address the problem of optimal function computation so as to minimize the expected total number of bits that are transmitted. In ...

  20. Boolean Logic: An Aid for Searching Computer Databases in Special Education and Rehabilitation.

    Science.gov (United States)

    Summers, Edward G.

    1989-01-01

    The article discusses using Boolean logic as a tool for searching computerized information retrieval systems in special education and rehabilitation technology. It includes discussion of the Boolean search operators AND, OR, and NOT; Venn diagrams; and disambiguating parentheses. Six suggestions are offered for development of good Boolean logic…

  1. HSP70 mediates survival in apoptotic cells-Boolean network prediction and experimental validation.

    Science.gov (United States)

    Vasaikar, Suhas V; Ghosh, Sourish; Narain, Priyam; Basu, Anirban; Gomes, James

    2015-01-01

    Neuronal stress or injury results in the activation of proteins, which regulate the balance between survival and apoptosis. However, the complex mechanism of cell signaling involving cell death and survival, activated in response to cellular stress is not yet completely understood. To bring more clarity about these mechanisms, a Boolean network was constructed that represented the apoptotic pathway in neuronal cells. FasL and neurotrophic growth factor (NGF) were considered as inputs in the absence and presence of heat shock proteins known to shift the balance toward survival by rescuing pro-apoptotic cells. The probabilities of survival, DNA repair and apoptosis as cellular fates, in the presence of either the growth factor or FasL, revealed a survival bias encoded in the network. Boolean predictions tested by measuring the mRNA level of caspase-3, caspase-8, and BAX in neuronal Neuro2a (N2a) cell line with NGF and FasL as external input, showed positive correlation with the observed experimental results for survival and apoptotic states. It was observed that HSP70 contributed more toward rescuing cells from apoptosis in comparison to HSP27, HSP40, and HSP90. Overexpression of HSP70 in N2a transfected cells showed reversal of cellular fate from FasL-induced apoptosis to survival. Further, the pro-survival role of the proteins BCL2, IAP, cFLIP, and NFκB determined by vertex perturbation analysis was experimentally validated through protein inhibition experiments using EM20-25, Embelin and Wedelolactone, which resulted in 1.27-, 1.26-, and 1.46-fold increase in apoptosis of N2a cells. The existence of a one-to-one correspondence between cellular fates and attractor states shows that Boolean networks may be employed with confidence in qualitative analytical studies of biological networks.

  2. Perturbation propagation in random and evolved Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Fretter, Christoph [Instistut fuer Informatik, Martin-Luther-Universitaet Halle-Wittenberg, Von-Seckendorffplatz 1, 06120 Halle (Germany); Szejka, Agnes; Drossel, Barbara [Institut fuer Festkoerperphysik, Technische Universitaet Darmstadt, Hochschulstrasse 6, 64289 Darmstadt (Germany)], E-mail: Christoph.Fretter@informatik.uni-halle.de

    2009-03-15

    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.

  3. Experimental Comparison of Schemes for Interpreting Boolean Queries

    OpenAIRE

    Lee, Whay C.; Edward A Fox

    1988-01-01

    The standard interpretation of the logical operators in a Boolean retrieval system is in general too strict. A standard Boolean query rarely comes close to retrieving all and only those documents which are relevant to the user. An AND query is often too narrow and an OR query is often too broad. The choice of the AND results in retrieving on the left end of a typical average recall-precision graph, while the choice of the OR results in retrieving on the right end, implying a tradeoff between ...

  4. ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS

    Directory of Open Access Journals (Sweden)

    Ali Muhammad Ali Rushdi

    2013-01-01

    Full Text Available A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s. Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable at a latter instance t2 to its value at an earlier instance t1. This equation remains valid when the times t1 and t2 are both augmented by any integral multiple of the underlying time period. In other words, there are infinitely many versions of a reduced scalar equation, any of which is useful for deducing information about the cyclic behavior of the network. However, to obtain correct information about the transient behavior of the network, one must find the true reduced scalar equation for which instances t1 and t2 are minimal. This study investigates the nature, derivation and utilization of reduced scalar equations. It relies on Boolean-algebraic manipulations for the derivation of such equations and suggests that this derivation can be facilitated by seeking certain orthogonality relations among certain successive (albeit not necessarily consecutive instances of the same scalar variable. We demonstrate, contrary to previously published assumptions or assertions, that there is typically no common reduced scalar equation for all the scalar variables. Each variable usually satisfies its own distinct reduced scalar equation. We also demonstrate that the derivation of a reduced scalar equation is achieved not only by proving it but also by disproving an immediately preceding version of it when such a version might exist. We also demonstrate that, despite the useful insight supplied by the reduced scalar equations, they do not provide a total solution like the

  5. Some Properties of Inclusions of Multisets and Contractive Boolean Operators

    OpenAIRE

    Hyvernat, Pierre

    2011-01-01

    10 pages, including appendix Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and characterize the preorder in terms of the simpler pointwise inclusion and the existence of a special increasing boolean operator f:B^n -> B^n. We also show that contrary to increasing boolean operators, the relevant operators are no...

  6. On Kolmogorov's superpositions and Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

    Beiu, V.

    1998-12-31

    The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.

  7. A Boolean Approach to Airline Business Model Innovation

    DEFF Research Database (Denmark)

    Hvass, Kristian Anders

    Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....

  8. Structured Development and Promotion of a Research Field: Hormesis in Biology, Toxicology, and Environmental Regulatory Science.

    Science.gov (United States)

    Mushak, Paul; Elliott, Kevin C

    2015-12-01

    The ability of powerful and well-funded interest groups to steer scientific research in ways that advance their goals has become a significant social concern. This steering ability is increasingly being recognized in the peer-reviewed scientific literature and in findings of deliberative scientific bodies. This paper provides a case study that illustrates some of the major strategies that can be used to structure and advance a controversial research field. It focuses on hormesis, described as a type of dose-response relationship in toxicology and biology showing low-dose stimulation but high-dose inhibition, or the reverse. Hormesis proponents tout its significance, arguing that substances toxic at high doses and beneficial at lower doses should be regulated less stringently. We identify five strategies employed by hormesis proponents to foster its acceptance: (1) creating institutions focused on supporting hormesis; (2) developing terminology, study designs, and data interpretations that cast it in a favorable light; (3) using bibliometric techniques and surveys to attract attention; (4) aggressively advocating for the phenomenon and challenging critics; and (5) working with outside interest groups to apply the hormesis phenomenon in the economic and political spheres. We also suggest a number of oversight strategies that can be implemented to help promote credible and socially responsible research in cases like this one.

  9. A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem

    CERN Document Server

    Morgado, Antonio

    2008-01-01

    Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that satisfies the maximum number of quartets. A number of solutions have been proposed for the MQC problem, including Dynamic Programming, Constraint Programming, and more recently Answer Set Programming (ASP). ASP is currently the most efficient approach for optimally solving the MQC problem. This paper proposes encoding the MQC problem with pseudo-Boolean (PB) constraints. The use of PB allows solving the MQC problem with efficient PB solvers, and also allows considering different modeling approaches for the MQC problem. Initial results are promising, and suggest that PB can be an effective alternative for solving the MQC problem.

  10. Pointwise Approximation for the Iterated Boolean Sums of Bernstein Operators

    Institute of Scientific and Technical Information of China (English)

    HUO Xiao-yan; LI Cui-xiang; YAO Qiu-mei

    2013-01-01

    In this paper,with the help of modulus of smoothness ω2r(4)(f,t),we discuss the pointwise approximation properties for the iterated Boolean sums of Bernstein operator Bnn and obtain direct and inverse theorems when 1-1/r ≤ λ ≤ 1,r ∈ N.

  11. Linear Strategy for Boolean Ring Based Theorem Proving

    Institute of Scientific and Technical Information of China (English)

    WU Jinzhao; LIU Zhuojun

    2000-01-01

    Two inference rules are discussed in boolean ring based theorem proving, and linear strategy is developed. It is shown that both of them are complete for linear strategy. Moreover, by introducing a partial ordering on atoms, pseudo O-linear and O-linear strategies are presented. The former is complete, the latter, however, is complete for clausal theorem proving.

  12. Unlimited multistability and Boolean logic in microbial signalling

    DEFF Research Database (Denmark)

    Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca;

    2015-01-01

    further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two...

  13. Boolean linear differential operators on elementary cellular automata

    Science.gov (United States)

    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.

  14. Complexity of Identification and Dualization of Positive Boolean Functions

    NARCIS (Netherlands)

    J.C. Bioch (Cor); T. Ibaraki

    1995-01-01

    textabstractWe consider in this paper the problem of identifying min T(f{hook}) and max F(f{hook}) of a positive (i.e., monotone) Boolean function f{hook}, by using membership queries only, where min T(f{hook}) (max F(f{hook})) denotes the set of minimal true vectors (maximal false vectors) of f{hoo

  15. New Considerations for Spectral Classification of Boolean Switching Functions

    Directory of Open Access Journals (Sweden)

    J. E. Rice

    2011-01-01

    Full Text Available This paper presents some new considerations for spectral techniques for classification of Boolean functions. These considerations incorporate discussions of the feasibility of extending this classification technique beyond n=5. A new implementation is presented along with a basic analysis of the complexity of the problem. We also note a correction to results in this area that were reported in previous work.

  16. Superatomic Boolean algebras constructed from strongly unbounded functions

    CERN Document Server

    Martinez, Juan Carlos

    2010-01-01

    Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\\kappa,\\lambda$ are infinite cardinals such that $\\kappa^{+++} \\leq \\lambda$, $\\kappa^{_{{\\omega}_1}\\concatenation \\$ and $\\_{{\\omega}_2}\\concatenation \\$ can be cardinal sequences of superatomic Boolean algebras.

  17. Constant-overhead secure computation of Boolean circuits using preprocessing

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Zakarias, S.

    2013-01-01

    We present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same...

  18. Graphical interpretation of Boolean operators for protein NMR assignments

    NARCIS (Netherlands)

    Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy

    2008-01-01

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-

  19. On the Prime Whales of a Boolean Algebra

    OpenAIRE

    Holland, Jason

    2013-01-01

    In this note, we introduce objects called prime whales and use them to represent a Boolean algebra as an algebra of sets in a way that is analogous to Stone's Representation Theorem. We also characterize the existence of prime whales in terms of the existence of prime ideals.

  20. Boolean approaches to graph embeddings related to VLSI

    Institute of Scientific and Technical Information of China (English)

    刘彦佩

    2001-01-01

    This paper discusses the development of Boolean methods in some topics on graph em-beddings which are related to VLSI. They are mainly the general theory of graph embeddability, the orientabilities of a graph and the rectilinear layout of an electronic circuit.

  1. Sparse combinatorial inference with an application in cancer biology

    OpenAIRE

    Mukherjee, Sach; Pelech, Steven; Neve, Richard M.; Kuo, Wen-Lin; Ziyad, Safiyyah; Spellman, Paul T.; Joe W Gray; Speed, Terence P.

    2008-01-01

    Motivation: Combinatorial effects, in which several variables jointly influence an output or response, play an important role in biological systems. In many settings, Boolean functions provide a natural way to describe such influences. However, biochemical data using which we may wish to characterize such influences are usually subject to much variability. Furthermore, in high-throughput biological settings Boolean relationships of interest are very often sparse, in the sense of being embedde...

  2. Difference equation for tracking perturbations in systems of Boolean nested canalyzing functions.

    Science.gov (United States)

    Dimitrova, Elena S; Yordanov, Oleg I; Matache, Mihaela T

    2015-06-01

    This paper studies the spread of perturbations through networks composed of Boolean functions with special canalyzing properties. Canalyzing functions have the property that at least for one value of one of the inputs the output is fixed, irrespective of the values of the other inputs. In this paper the focus is on partially nested canalyzing functions, in which multiple, but not all inputs have this property in a cascading fashion. They naturally describe many relationships in real networks. For example, in a gene regulatory network, the statement "if gene A is expressed, then gene B is not expressed regardless of the states of other genes" implies that A is canalyzing. On the other hand, the additional statement "if gene A is not expressed, and gene C is expressed, then gene B is automatically expressed; otherwise gene B's state is determined by some other type of rule" implies that gene B is expressed by a partially nested canalyzing function with more than two variables, but with two canalyzing variables. In this paper a difference equation model of the probability that a network node's value is affected by an initial perturbation over time is developed, analyzed, and validated numerically. It is shown that the effect of a perturbation decreases towards zero over time if the Boolean functions are canalyzing in sufficiently many variables. The maximum dynamical impact of a perturbation is shown to be comparable to the average impact for a wide range of values of the average sensitivity of the network. Percolation limits are also explored; these are parameter values which generate a transition of the expected perturbation effect to zero as other parameters are varied, so that the initial perturbation does not scale up with the parameters once the percolation limits are reached.

  3. Regulatory and biosafety issues in relation to transgenic animals in food and agriculture, feeds containing genetically modified organisms (GMO) and veterinary biologics

    International Nuclear Information System (INIS)

    Development of an effective regulatory system for genetically engineered animals and their products has been the subject of increasing discussion among researchers, industry and policy developers, as well as the public. Since transgenesis and cloning are relatively new scientific techniques, transgenic animals are new organisms for which there is limited information. The issues associated with the regulation and biosafety of transgenic animals pertain to environmental impact, human food safety, animal health and welfare, trade and ethics. To regulate this new and powerful technology predicated on limited background information is a challenge not only for the regulators, but also for the developers of such animals, who strive to prove that the animals are safe and merit bio-equivalency to their conventional counterparts. In principle, an effective regulatory sieve should permit safe products while forming a formidable barrier for those assessed of posing an unacceptable risk. Adoption of transgenic technology for use in agriculture will depend upon various factors that range from perceived benefits for humans and animals, to safe propagation, animal welfare considerations and integrity of species, as well as effects on bio-diversity. A regulatory framework designed to address the concerns connected with the environmental release of transgenic animals needs to also take into account the ability of genetically modified animals to survive and compete with conventional populations. Regulatory initiatives for biotechnology-derived animals and their products should ensure high standards for human and animal health; a sound scientific basis for evaluation; transparency and public involvement; and maintenance of genetic diversity. Feeds obtained by use of biotechnology have to be evaluated for animal and human safety by using parameters that define their molecular characterization, nutritional qualities and toxicological aspects, while veterinary biologics derived from

  4. Boolean network representation of contagion dynamics during a financial crisis

    Science.gov (United States)

    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.

  5. Minimization of Boolean complexity in human concept learning.

    Science.gov (United States)

    Feldman, J

    2000-10-01

    One of the unsolved problems in the field of human concept learning concerns the factors that determine the subjective difficulty of concepts: why are some concepts psychologically simple and easy to learn, while others seem difficult, complex or incoherent? This question was much studied in the 1960s but was never answered, and more recent characterizations of concepts as prototypes rather than logical rules leave it unsolved. Here I investigate this question in the domain of Boolean concepts (categories defined by logical rules). A series of experiments measured the subjective difficulty of a wide range of logical varieties of concepts (41 mathematically distinct types in six families--a far wider range than has been tested previously). The data reveal a surprisingly simple empirical 'law': the subjective difficulty of a concept is directly proportional to its Boolean complexity (the length of the shortest logically equivalent propositional formula)--that is, to its logical incompressibility. PMID:11034211

  6. On designated-weight Boolean functions with highest algebraic immunity

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    Algebraic immunity has been considered as one of cryptographically significant properties for Boolean functions. In this paper, we study ∑d-1 i=0 (ni)-weight Boolean functions with algebraic immunity achiev-ing the minimum of d and n - d + 1, which is highest for the functions. We present a simpler sufficient and necessary condition for these functions to achieve highest algebraic immunity. In addition, we prove that their algebraic degrees are not less than the maximum of d and n - d + 1, and for d = n1 +2 their nonlinearities equalthe minimum of ∑d-1 i=0 (ni) and ∑ d-1 i=0 (ni). Lastly, we identify two classes of such functions, one having algebraic degree of n or n-1.

  7. borealis - A generalized global update algorithm for Boolean optimization problems

    CERN Document Server

    Zhu, Zheng; Katzgraber, Helmut G

    2016-01-01

    Optimization problems with Boolean variables that fall into the nondeterministic polynomial (NP) class are of fundamental importance in computer science, mathematics, physics and industrial applications. Most notably, solving constraint-satisfaction problems, which are related to spin-glass-like Hamiltonians in physics, remains a difficult numerical task. As such, there has been great interest in designing efficient heuristics to solve these computationally difficult problems. Inspired by parallel tempering Monte Carlo in conjunction with the rejection-free isoenergetic cluster algorithm developed for Ising spin glasses, we present a generalized global update optimization heuristic that can be applied to different NP-complete problems with Boolean variables. The global cluster updates allow for a wide-spread sampling of phase space, thus considerably speeding up optimization. By carefully tuning the pseudo-temperature (needed to randomize the configurations) of the problem, we show that the method can efficie...

  8. High Quality Test Pattern Generation and Boolean Satisfiability

    CERN Document Server

    Eggersglüß, Stephan

    2012-01-01

    This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT).  A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects. The aim of the techniques and methodologies presented in this book is to improve SAT-based ATPG, in order to make it applicable in industrial practice. Readers will learn to improve the performance and robustness of the overall test generation process, so that the ATPG algorithm reliably will generate test patterns for most targeted faults in acceptable run time to meet the high fault coverage demands of industry. The techniques and improvements presented in this book provide the following advantages: Provides a comprehensive introduction to test generation and Boolean Satisfiability (SAT); Describes a...

  9. Mapping knowledge to boolean dynamic systems in Bateson's epistemology.

    Science.gov (United States)

    Malloy, Thomas E; Jensen, Gary C; Song, Timothy

    2005-01-01

    Gregory Bateson (1972, 1979) established an epistemology that integrates mind and nature as a necessary unity, a unity in which learning and evolution share fundamental principles and in which criteria for mental process are explicitly specified. E42 is a suite of freely available Java applets that constitute an online research lab for creating and interacting with simulations of the Boolean systems developed by Kauffman (1993) in his study of evolution where he proposed that self-organization and natural selection are co-principles "weaving the tapestry of life." This paper maps Boolean systems, developed in the study of evolution, onto Bateson's epistemology in general and onto his criteria of mental process in particular.

  10. Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

    CERN Document Server

    Creignou, Nadia; Thomas, Michael

    2009-01-01

    Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation has been shown to be SigmaP2-complete in general. We consider variants obtained by restricting the allowed connectives in the formulae to certain sets of Boolean functions. We give a complete classification of the complexity for all considerable sets of Boolean functions. In this way, we identify easier cases, namely NP-complete and polynomial cases; and we highlight sources of intractability. Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.

  11. Boolean Ring and Its Spectrum%布尔环及其素谱

    Institute of Scientific and Technical Information of China (English)

    曲伟

    2012-01-01

    利用交换代数、拓扑等相关知识,讨论了布尔代数、布尔格、布尔环三者之间的对应关系,给出了布尔环及其素谱的一些性质并证明了由布尔环诱导出的布尔格与布尔环上素谱的既开又闲的子集构成的格同构.%In this paper,we show that Boolean rings,Boolean lattices and Boolean algebra are essentially the same. Moreover, every Boolean lattice induced by Boolean ring is isomorphic to the lattice of open and closed subsets of the Boolean ring's spectrum.

  12. Interval soft Boolean algebras%区间软布尔代数

    Institute of Scientific and Technical Information of China (English)

    刘卫锋; 杜迎雪; 许宏伟

    2014-01-01

    将区间软集应用于布尔代数之中,定义了区间软布尔代数、区间软布尔子代数、区间理想软布尔代数和区间软布尔代数的区间软同态等概念,并研究了它们的相关性质。推广了软布尔代数及其相关结论。%The interval soft set is applied to the Boolean algebras.The concepts of interval soft Boolean algebras, inter-val soft Boolean subalgebras, interval idealistic soft Boolean algebras and interval soft homomorphism between interval soft Boolean algebras are defined and some related properties are discussed.Soft Boolean algebras and related results are generalized.

  13. Worst-Case Groundness Analysis Using Definite Boolean Functions

    OpenAIRE

    Genaim, Samir; Codish, Michael; Howe, Jacob M.

    2004-01-01

    This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the number of clauses but sub-exponential in the size of the program. For Pos, we strengthen a previous res...

  14. Reduction of Database Independence to Dividing in Atomless Boolean Algebras

    OpenAIRE

    Hyttinen, Tapani; Paolini, Gianluca

    2014-01-01

    We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov [4], the former case of independence can be seen as the discrete version of the latter.

  15. Mapping Complex Networks: Exploring Boolean Modeling of Signal Transduction Pathways

    OpenAIRE

    Bhardwaj, Gaurav; Wells, Christine P.; Albert, Reka; van Rossum, Damian B.; Patterson, Randen L

    2009-01-01

    In this study, we explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signaling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP3R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomization of ...

  16. Boolean Functions, Projection Operators and Quantum Error Correcting Codes

    OpenAIRE

    Aggarwal, Vaneet; Calderbank, A. Robert

    2006-01-01

    This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and non-additive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5,6,2)) code found by Rains [21]. It also extends to o...

  17. Matroids, hereditary collections and simplicial complexes having boolean representations

    OpenAIRE

    Rhodes, John; Silva, Pedro V.

    2012-01-01

    Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\\vee$-generated lattices. The lattice of flats, defined for hereditary collections, lattices and matrices, plays a central role in the theory. The representations constitute a lattice and the minimal and strictly join irreducible elements are studied, as well as various closure operators.

  18. Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice

    OpenAIRE

    Heba I. Mustafa

    2013-01-01

    The concept of soft sets based on complete atomic Boolean lattice, which can be seen as a generalization of soft sets, is introduced. Some operations on these soft sets are discussed, and new types of soft sets such as full, keeping infimum, and keeping supremum are defined and supported by some illustrative examples. Two pairs of new soft rough approximation operators are proposed and the relationship among soft set is investigated, and their related properties are given. We show that Järvin...

  19. Yes/No/Maybe: A Boolean attempt at feedback

    OpenAIRE

    12130478 - Louw, Henk; 10095519 - Van Rooy, Albertus Jacobus

    2010-01-01

    This paper describes an experiment in which Boolean feedback (a kind of checklist) was used to provide feedback on the paragraph structures of first year students in an Academic Literacy course. We begin by introducing the major problems with feedback on L2 writing and establishing why a focus on paragraph structures in particular is of importance. The experiment conducted was a two-draft assignment in which three different kinds of feedback (technique A: handwritten comments, B: consciousnes...

  20. A Boolean Approach to Airline Business Model Innovation

    OpenAIRE

    Hvass, Kristian

    2012-01-01

    Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities le...

  1. A Boolean algebra approach to the construction of snarks

    OpenAIRE

    Fiol Mora, Miquel Àngel

    1991-01-01

    This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored. A natural generalization of the concept of "color", that describes in a simple way the coloring ("0" or "1") of any set of (semi)edges, is introduced. This approach allows us to apply the Boolean logic theory to find an ample family of snarks, which includes many of the previous known constructions and also some interesting ones. Peer Reviewed

  2. Boolean logic device done with DFB laser diode

    OpenAIRE

    Hurtado Villavieja, Antonio; González Marcos, Ana; Martín Pereda, José Antonio

    2004-01-01

    We present simulation results on how power output-input characteristic Instability in Distributed FeedBack -DFB semiconductor laser diode SLA can be employed to implemented Boolean logic device. Two configurations of DFB Laser diode under external optical injection, either in the transmission or in the reflective mode of operation, is used to implement different Optical Logic Cells (OLCs), called the Q- and the P-Device OLCs. The external optical injection correspond to two inputs data plus a...

  3. Regulatory Anatomy

    DEFF Research Database (Denmark)

    Hoeyer, Klaus

    2015-01-01

    This article proposes the term “safety logics” to understand attempts within the European Union (EU) to harmonize member state legislation to ensure a safe and stable supply of human biological material for transplants and transfusions. With safety logics, I refer to assemblages of discourses, le...... they arise. In short, I expose the regulatory anatomy of the policy landscape....

  4. Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.

    Science.gov (United States)

    Klarner, Hannes; Siebert, Heike

    2015-01-01

    This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.

  5. Global Avalanche Characteristics of Boolean Functions by Concatenation

    Institute of Scientific and Technical Information of China (English)

    Mingsheng Ren

    2016-01-01

    In order to measure the correlation propeties of two Boolean functions, the global avalanche characteristics of Boolean functions constructed by concatenation are discussed, i.e., f1‖f2 and f1‖f2‖f3‖f4. Firstly, for the function f = f1‖f2 , the cross⁃correlation function of f1 , f2 in the special condition are studied. In this case, f, f1 , f2 must be in desired form. By computing their sum⁃of⁃squares indicators, the cross⁃correlation function between f1 , f2 is obtained. Secondly, for the function g = f1‖f2‖f3‖f4 , by analyzing the relation among their auto⁃correlation functions, their sum⁃of⁃squares indicators are investigated. Based on them, the sum⁃of⁃squares indicators of functions obtained by Canteaut et al. are investigated. The results show that the correlation property of g is good when the correlation properties of Boolean functions f1 , f2 , f3 , f4 are good.

  6. Binary higher order neural networks for realizing Boolean functions.

    Science.gov (United States)

    Zhang, Chao; Yang, Jie; Wu, Wei

    2011-05-01

    In order to more efficiently realize Boolean functions by using neural networks, we propose a binary product-unit neural network (BPUNN) and a binary π-ς neural network (BPSNN). The network weights can be determined by one-step training. It is shown that the addition " σ," the multiplication " π," and two kinds of special weighting operations in BPUNN and BPSNN can implement the logical operators " ∨," " ∧," and " ¬" on Boolean algebra 〈Z(2),∨,∧,¬,0,1〉 (Z(2)={0,1}), respectively. The proposed two neural networks enjoy the following advantages over the existing networks: 1) for a complete truth table of N variables with both truth and false assignments, the corresponding Boolean function can be realized by accordingly choosing a BPUNN or a BPSNN such that at most 2(N-1) hidden nodes are needed, while O(2(N)), precisely 2(N) or at most 2(N), hidden nodes are needed by existing networks; 2) a new network BPUPS based on a collaboration of BPUNN and BPSNN can be defined to deal with incomplete truth tables, while the existing networks can only deal with complete truth tables; and 3) the values of the weights are all simply -1 or 1, while the weights of all the existing networks are real numbers. Supporting numerical experiments are provided as well. Finally, we present the risk bounds of BPUNN, BPSNN, and BPUPS, and then analyze their probably approximately correct learnability. PMID:21427020

  7. MILES FORMULAE FOR BOOLEAN MODELS OBSERVED ON LATTICES

    Directory of Open Access Journals (Sweden)

    Joachim Ohser

    2011-05-01

    Full Text Available The densities of the intrinsic volumes – in 3D the volume density, surface density, the density of the integral of the mean curvature and the density of the Euler number – are a very useful collection of geometric characteristics of random sets. Combining integral and digital geometry we develop a method for efficient and simultaneous calculation of the intrinsic volumes of random sets observed in binary images in arbitrary dimensions. We consider isotropic and reflection invariant Boolean models sampled on homogeneous lattices and compute the expectations of the estimators of the intrinsic volumes. It turns out that the estimator for the surface density is proved to be asymptotically unbiased and thusmultigrid convergent for Boolean models with convex grains. The asymptotic bias of the estimators for the densities of the integral of the mean curvature and of the Euler number is assessed for Boolean models of balls of random diameters. Miles formulae with corresponding correction terms are derived for the 3D case.

  8. Local digital estimators of intrinsic volumes for Boolean models and in the design based setting

    DEFF Research Database (Denmark)

    Svane, Anne Marie

    In order to estimate the specific intrinsic volumes of a planar Boolean model from a binary image, we consider local digital algorithms based on weigted sums of 2×2 configuration counts. For Boolean models with balls as grains, explicit formulas for the bias of such algorithms are derived...... for the bias obtained for Boolean models are applied to existing algorithms in order to compare their accuracy....

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  11. Post-transcriptional Boolean computation by combining aptazymes controlling mRNA translation initiation and tRNA activation.

    Science.gov (United States)

    Klauser, Benedikt; Saragliadis, Athanasios; Ausländer, Simon; Wieland, Markus; Berthold, Michael R; Hartig, Jörg S

    2012-09-01

    In cellular systems environmental and metabolic signals are integrated for the conditional control of gene expression. On the other hand, artificial manipulation of gene expression is of high interest for metabolic and genetic engineering. Especially the reprogramming of gene expression patterns to orchestrate cellular responses in a predictable fashion is considered to be of great importance. Here we introduce a highly modular RNA-based system for performing Boolean logic computation at a post-transcriptional level in Escherichia coli. We have previously shown that artificial riboswitches can be constructed by utilizing ligand-dependent Hammerhead ribozymes (aptazymes). Employing RNA self-cleavage as the expression platform-mechanism of an artificial riboswitch has the advantage that it can be applied to control several classes of RNAs such as mRNAs, tRNAs, and rRNAs. Due to the highly modular and orthogonal nature of these switches it is possible to combine aptazyme regulation of activating a suppressor tRNA with the regulation of mRNA translation initiation. The different RNA classes can be controlled individually by using distinct aptamers for individual RNA switches. Boolean logic devices are assembled by combining such switches in order to act on the expression of a single mRNA. In order to demonstrate the high modularity, a series of two-input Boolean logic operators were constructed. For this purpose, we expanded our aptazyme toolbox with switches comprising novel behaviours with respect to the small molecule triggers thiamine pyrophosphate (TPP) and theophylline. Then, individual switches were combined to yield AND, NOR, and ANDNOT gates. This study demonstrates that post-transcriptional aptazyme-based switches represent versatile tools for engineering advanced genetic devices and circuits without the need for regulatory protein cofactors. PMID:22777205

  12. Robust Design of Biological Circuits: Evolutionary Systems Biology Approach

    OpenAIRE

    Bor-Sen Chen; Chih-Yuan Hsu; Jing-Jia Liou

    2011-01-01

    Artificial gene circuits have been proposed to be embedded into microbial cells that function as switches, timers, oscillators, and the Boolean logic gates. Building more complex systems from these basic gene circuit components is one key advance for biologic circuit design and synthetic biology. However, the behavior of bioengineered gene circuits remains unstable and uncertain. In this study, a nonlinear stochastic system is proposed to model the biological systems with intrinsic parameter ...

  13. Three New Construction Methods of the Highly Nonlinear Balanced Boolean Function

    Institute of Scientific and Technical Information of China (English)

    TANXinglie; SHEKun; JIQingbing; ZHOUMingtian; SHENChangxiang

    2003-01-01

    Nonlinearity is a nonlinear criterion of Boolean function. In this paper, some useful definitions and theorems are introduced, and then three new ways to construct the highly nonlinear balanced boolean function are given by ways of concatenating, dividing, modifying and alternating, which are proven to be very effective.

  14. Comparing Boolean and Probabilistic Information Retrieval Systems Across Queries and Disciplines.

    Science.gov (United States)

    Losee, Robert M.

    1997-01-01

    Suggests a method that allows searchers to analytically compare the Boolean and probabilistic information retrieval approaches. Sample performance figures are provided for queries using the Boolean strategy, and for probabilistic systems. The variation of performance across sublanguages and queries is examined, as well as the performance of models…

  15. Boolean Operators and the Naive End-User: Moving to AND.

    Science.gov (United States)

    Proctor, Edward

    2002-01-01

    Discusses the confusion among end users in using Boolean operators when searching electronic resources. Highlights include search engines; site-specific search engines; the counterintuitive nature of Boolean logic; hidden defaults; the problem of conceptualization; reprogramming defaults; and a lack of user education. (LRW)

  16. Freestyle Vs. Boolean: A Comparison of Partial and Exact Match Retrieval Systems.

    Science.gov (United States)

    Paris, Lee Anne H.; Tibbo, Helen R.

    1998-01-01

    Compares results of traditional Boolean searching with those of Freestyle, LEXIS/NEXIS's natural language application. Study found that though the Boolean searches had better results more often, neither method demonstrated superior performance for every query, suggesting that different queries demand different techniques. Concludes that further…

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

    Science.gov (United States)

    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…

  18. Boolean Functions, Quantum Gates, Hamilton Operators, Spin Systems and Computer Algebra

    OpenAIRE

    Hardy, Yorick; Steeb, Willi-Hans

    2014-01-01

    We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a quantum gate is also described with the Hamilton operator expressed as spin system. Computer algebra implementations are provided.

  19. A Graphical Filter/Flow Representation of Boolean Queries: A Prototype Implementation and Evaluation.

    Science.gov (United States)

    Young, Degi; Shneiderman, Ben

    1993-01-01

    Literature showing the disadvantages of Boolean logic in online searching is reviewed, and research comparing the Filter/Flow visual interface (i.e., a graphical representation of Boolean operators) with a text-only interface is described. A significant difference in the total number of correct queries is reported that favored Filter/Flow. (16…

  20. Disjunctive normal forms for any class of Boolean algebras with operators

    OpenAIRE

    Khaled, Mohamed

    2015-01-01

    Disjunctive normal forms can provide elegant and constructive proofs of many standard results such as completeness, decidability and so on. They were also used to show non atomicity of some free algebras of specific Boolean algebras with operators. Here, we generalize the normal forms for any class of Boolean algebras with operators.

  1. On the 2m-variable symmetric Boolean functions with maximum algebraic immunity

    Institute of Scientific and Technical Information of China (English)

    QU LongJiang; LI Chao

    2008-01-01

    The properties of the 2m-variable symmetric Boolean functions with maximum al-gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.

  2. A Theoretical Framework for Defining Similarity Measures for Boolean Search Request Formulations, Including Some Experimental Results.

    Science.gov (United States)

    Radecki, Tadeusz

    1985-01-01

    Reports research results into a methodology for determining similarity between queries characterized by Boolean search request formulations and discusses similarity measures for Boolean combinations of index terms. Rationale behind these measures is outlined, and conditions ensuring their equivalence are identified. Results of an experiment…

  3. The value of less connected agents in Boolean networks

    Science.gov (United States)

    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

  4. Boolean approaches to graph embeddings related to VLSI

    Institute of Scientific and Technical Information of China (English)

    LIU; Yanpei(

    2001-01-01

    [1]Hu, T. C., Kuh, S. E., Theory and concepts of circuit layout, in VLSI Circuit Layout: Theory and Design, New York:IEEE Press, 1985, 3-18.[2]Liu Yanpei, Embeddability in Graphs, Boston-Beijing: Kluwer Science, 1995.[3]Liu Yanpei, Some combinatorial optimization problems arising from VLSI circuit design, Applied Math. -JCU, 1993, 38:218-235.[4]Liu Yanpei, Marchioro, P. , Petreschi, R., At most single bend embeddings of cubic graphs, Applied Math. -CJU, 1994,39: 127-142.[5]Liu Yanpei, Marchioro, P. , Petreschi, R. et al. , Theoretical results on at most 1-bend embeddability of graphs, Acta Math.Appl. Sinica, 1992, 8: 188-192.[6]Liu Yanpei, Morgana, A., Simeone, B., General theoretical results on rectilinear embeddability of graphs, Acta Math. Ap- pl. Simca, 1991, 7: 187-192.[7]Calamoneri, T., Petreschi, R., Liu Yanpei, Optimally Extending Bistandard Graphs on the Orthogonal Grid, ASCM2000 Symposium, Tailand, Dec.17-21, 2000.[8]Liu Yanpei, Morgana, A., Simeone, B., A graph partition problem, Acta Math. Appl. Sinica, 1996, 12: 393-400.[9]Liu Yanpei, Morgana, A. , Simeone, B. , A linear algorithm for 2-bend embeddings of planar graphs in the two dimensional grid, Discrete Appl. Math., 1998, 81: 69-91.[10]Liu Yanpei, Boolean approach to planar embeddings of a graph, Acta Math. Sinica, New Series, 1989, 5: 64-79.[11]Hammer, P. L., Liu Yanpei, Simeone, B., Boolean approaches to combinatorial optimization, J. Math. Res. Expos.,1990, 10: 300-312, 455-468, 619-628.[12]Liu Yanpei, Boolean planarity characterization of graphs, Acta Math. Sinica, New Series, 1988, 4: 316-329.[13]Liu Yanpei, Boolean characterizations of planarity and planar embeddings of graphs, Ann. O. R., 1990, 24: 165-174.

  5. Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice

    Directory of Open Access Journals (Sweden)

    Heba I. Mustafa

    2013-01-01

    Full Text Available The concept of soft sets based on complete atomic Boolean lattice, which can be seen as a generalization of soft sets, is introduced. Some operations on these soft sets are discussed, and new types of soft sets such as full, keeping infimum, and keeping supremum are defined and supported by some illustrative examples. Two pairs of new soft rough approximation operators are proposed and the relationship among soft set is investigated, and their related properties are given. We show that Järvinen's approximations can be viewed as a special case of our approximation. If , then our soft approximations coincide with crisp soft rough approximations (Feng et al. 2011.

  6. Boolean Variables in Economic Models Solved by Linear Programming

    Directory of Open Access Journals (Sweden)

    Lixandroiu D.

    2014-12-01

    Full Text Available The article analyses the use of logical variables in economic models solved by linear programming. Focus is given to the presentation of the way logical constraints are obtained and of the definition rules based on predicate logic. Emphasis is also put on the possibility to use logical variables in constructing a linear objective function on intervals. Such functions are encountered when costs or unitary receipts are different on disjunct intervals of production volumes achieved or sold. Other uses of Boolean variables are connected to constraint systems with conditions and the case of a variable which takes values from a finite set of integers.

  7. Self-organized networks of competing boolean agents

    Science.gov (United States)

    Paczuski; Bassler; Corral

    2000-04-01

    A model of Boolean agents competing in a market is presented where each agent bases his action on information obtained from a small group of other agents. The agents play a competitive game that rewards those in the minority. After a long time interval, the poorest player's strategy is changed randomly, and the process is repeated. Eventually the network evolves to a stationary but intermittent state where random mutation of the worst strategy can change the behavior of the entire network, often causing a switch in the dynamics between attractors of vastly different lengths. PMID:11019043

  8. Symmetric Groups and Quotient Complexity of Boolean Operations

    OpenAIRE

    Bell, Jason; Brzozowski, Janusz; Moreira, Nelma; Reis, Rogério

    2013-01-01

    The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition semigroups of the minimal deterministic automata accepting L and L' are the symmetric groups S_m and S_n of degrees m and n, respectively. Denote by o any binary boolean operation that is not a constant and not a function of one argument only. For m,n ...

  9. From Exact Learning to Computing Boolean Functions and Back Again

    CERN Document Server

    Goschin, Sergiu

    2012-01-01

    The goal of the paper is to relate complexity measures associated with the evaluation of Boolean functions (certificate complexity, decision tree complexity) and learning dimensions used to characterize exact learning (teaching dimension, extended teaching dimension). The high level motivation is to discover non-trivial relations between exact learning of an unknown concept and testing whether an unknown concept is part of a concept class or not. Concretely, the goal is to provide lower and upper bounds of complexity measures for one problem type in terms of the other.

  10. Graphical interpretation of Boolean operators for protein NMR assignments.

    Science.gov (United States)

    Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy

    2008-09-01

    We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal. PMID:18762868

  11. Bebop to the Boolean boogie an unconventional guide to electronics

    CERN Document Server

    Maxfield, Clive

    2003-01-01

    From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour

  12. On the construction of cryptographically strong Boolean functions with desirable trade-off

    Institute of Scientific and Technical Information of China (English)

    REN Kui; PARK Jaemin; KIM Kwangjo

    2005-01-01

    This paper proposes a practical algorithm for systematically generating strong Boolean functions (f:GF(2)n→GF(2))with cryptographic meaning. This algorithm takes bent function as input and directly outputs the resulted Boolean function in terms of truth table sequence. This algorithm was used to develop two classes of balanced Boolean functions, one of which has very good cryptographic properties: nl(f)=22k-1-2k+2k-2 (n=2k), with the sum-of-squares avalanche characteristic off satisfying σf=24k+23k+2+23k+23k-2 and the absolute avalanche characteristic of △f satisfying △f=2k+1. This is the best result up to now compared to existing ones. Instead of bent sequences, starting from random Boolean functions was also tested in the algorithm. Experimental results showed that starting from bent sequences is highly superior to starting from random Boolean functions.

  13. Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.

    Science.gov (United States)

    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.

  14. Direct relations between morphology and transport in Boolean models.

    Science.gov (United States)

    Scholz, Christian; Wirner, Frank; Klatt, Michael A; Hirneise, Daniel; Schröder-Turk, Gerd E; Mecke, Klaus; Bechinger, Clemens

    2015-10-01

    We study the relation of permeability and morphology for porous structures composed of randomly placed overlapping circular or elliptical grains, so-called Boolean models. Microfluidic experiments and lattice Boltzmann simulations allow us to evaluate a power-law relation between the Euler characteristic of the conducting phase and its permeability. Moreover, this relation is so far only directly applicable to structures composed of overlapping grains where the grain density is known a priori. We develop a generalization to arbitrary structures modeled by Boolean models and characterized by Minkowski functionals. This generalization works well for the permeability of the void phase in systems with overlapping grains, but systematic deviations are found if the grain phase is transporting the fluid. In the latter case our analysis reveals a significant dependence on the spatial discretization of the porous structure, in particular the occurrence of single isolated pixels. To link the results to percolation theory we performed Monte Carlo simulations of the Euler characteristic of the open cluster, which reveals different regimes of applicability for our permeability-morphology relations close to and far away from the percolation threshold.

  15. Chemical Visualization of Boolean Functions: A Simple Chemical Computer

    Science.gov (United States)

    Blittersdorf, R.; Müller, J.; Schneider, F. W.

    1995-08-01

    We present a chemical realization of the Boolean functions AND, OR, NAND, and NOR with a neutralization reaction carried out in three coupled continuous flow stirred tank reactors (CSTR). Two of these CSTR's are used as input reactors, the third reactor marks the output. The chemical reaction is the neutralization of hydrochloric acid (HCl) with sodium hydroxide (NaOH) in the presence of phenolphtalein as an indicator, which is red in alkaline solutions and colorless in acidic solutions representing the two binary states 1 and 0, respectively. The time required for a "chemical computation" is determined by the flow rate of reactant solutions into the reactors since the neutralization reaction itself is very fast. While the acid flow to all reactors is equal and constant, the flow rate of NaOH solution controls the states of the input reactors. The connectivities between the input and output reactors determine the flow rate of NaOH solution into the output reactor, according to the chosen Boolean function. Thus the state of the output reactor depends on the states of the input reactors.

  16. Evolution of a designless nanoparticle network into reconfigurable Boolean logic

    Science.gov (United States)

    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.

  17. Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations

    CERN Document Server

    Heckel, Reinhard; Bossert, Martin

    2011-01-01

    Consider a large Boolean network with a feed forward structure. Given a probability distribution for the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network? To identify these nodes, a notion that quantifies the determinative power of an input over states in the network is needed. We argue that the mutual information (MI) between a subset of the inputs X = {X_1, ..., X_n} of node i and the function f_i(X)$ associated with node i quantifies the determinative power of this subset of inputs over node i. To study the relation of determinative power to sensitivity to perturbations, we relate the MI to measures of perturbations, such as the influence of a variable, in terms of inequalities. The result shows that, maybe surprisingly, an input that has large influence does not necessarily have large determinative power. The main tool for the analysis is Fourier analysis of Boolean functions. Whether a function is sensitive to perturbations or not...

  18. Direct relations between morphology and transport in Boolean models

    Science.gov (United States)

    Scholz, Christian; Wirner, Frank; Klatt, Michael A.; Hirneise, Daniel; Schröder-Turk, Gerd E.; Mecke, Klaus; Bechinger, Clemens

    2015-10-01

    We study the relation of permeability and morphology for porous structures composed of randomly placed overlapping circular or elliptical grains, so-called Boolean models. Microfluidic experiments and lattice Boltzmann simulations allow us to evaluate a power-law relation between the Euler characteristic of the conducting phase and its permeability. Moreover, this relation is so far only directly applicable to structures composed of overlapping grains where the grain density is known a priori. We develop a generalization to arbitrary structures modeled by Boolean models and characterized by Minkowski functionals. This generalization works well for the permeability of the void phase in systems with overlapping grains, but systematic deviations are found if the grain phase is transporting the fluid. In the latter case our analysis reveals a significant dependence on the spatial discretization of the porous structure, in particular the occurrence of single isolated pixels. To link the results to percolation theory we performed Monte Carlo simulations of the Euler characteristic of the open cluster, which reveals different regimes of applicability for our permeability-morphology relations close to and far away from the percolation threshold.

  19. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

    Directory of Open Access Journals (Sweden)

    Gijs Kant

    2012-10-01

    Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.

  20. Evolution of a designless nanoparticle network into reconfigurable Boolean logic.

    Science.gov (United States)

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

  1. Understanding regulatory networks requires more than computing a multitude of graph statistics. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin et al.

    Science.gov (United States)

    Tkačik, Gašper

    2016-07-01

    The article by O. Martin and colleagues provides a much needed systematic review of a body of work that relates the topological structure of genetic regulatory networks to evolutionary selection for function. This connection is very important. Using the current wealth of genomic data, statistical features of regulatory networks (e.g., degree distributions, motif composition, etc.) can be quantified rather easily; it is, however, often unclear how to interpret the results. On a graph theoretic level the statistical significance of the results can be evaluated by comparing observed graphs to "randomized" ones (bravely ignoring the issue of how precisely to randomize!) and comparing the frequency of appearance of a particular network structure relative to a randomized null expectation. While this is a convenient operational test for statistical significance, its biological meaning is questionable. In contrast, an in-silico genotype-to-phenotype model makes explicit the assumptions about the network function, and thus clearly defines the expected network structures that can be compared to the case of no selection for function and, ultimately, to data.

  2. Genomics and medicine: an anticipation. From Boolean Mendelian genetics to multifactorial molecular medicine.

    Science.gov (United States)

    Kaplan, J C; Junien, C

    2000-12-01

    The major impact of the completion of the human genome sequence will be the understanding of diseases, with deduced therapy. In the field of genetic disorders, we will complete the catalogue of monogenic diseases, also called Mendelian diseases because they obey the Boolean logic of Mendel's laws. The major challenge now is to decipher the polygenic and multifactorial etiology of common diseases, such as cancer, cardio-vascular, nutritional, allergic, auto-immune and degenerative diseases. In fact, every gene, when mutated, is a potential disease gene, and we end up with the new concept of 'reverse medicine'; i.e., deriving new diseases or pathogenic pathways from the knowledge of the structure and function of every gene. By going from sequence to function (functional genomics and proteomics) we will gain insight into basic mechanisms of major functions such as cell proliferation, differentiation and development, which are perturbed in many pathological processes. By learning the meaning of some non-coding and of regulatory sequences our understanding will gain in complexity, generating a molecular and supramolecular integrated physiology, helping to build a molecular patho-physiology of the different syndromes. Besides those cognitive advances, there are also other issues at stake, such as: progress in diagnostic and prediction (predictive medicine); progress in therapy (pharmacogenomics and gene-based therapy); ethical issues; impact on business.

  3. Genetic flexibility of regulatory networks.

    Science.gov (United States)

    Hunziker, Alexander; Tuboly, Csaba; Horváth, Péter; Krishna, Sandeep; Semsey, Szabolcs

    2010-07-20

    Gene regulatory networks are based on simple building blocks such as promoters, transcription factors (TFs) and their binding sites on DNA. But how diverse are the functions that can be obtained by different arrangements of promoters and TF binding sites? In this work we constructed synthetic regulatory regions using promoter elements and binding sites of two noninteracting TFs, each sensing a single environmental input signal. We show that simply by combining these three kinds of elements, we can obtain 11 of the 16 Boolean logic gates that integrate two environmental signals in vivo. Further, we demonstrate how combination of logic gates can result in new logic functions. Our results suggest that simple elements of transcription regulation form a highly flexible toolbox that can generate diverse functions under natural selection.

  4. Evolutionary approaches for the reverse-engineering of gene regulatory networks: A study on a biologically realistic dataset

    Directory of Open Access Journals (Sweden)

    Gidrol Xavier

    2008-02-01

    Full Text Available Abstract Background Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interactions may be modelled by a Bayesian Network (BN that represents the presence of direct interactions from regulators to regulees by conditional probability distributions. We used enhanced evolutionary algorithms to stochastically evolve a set of candidate BN structures and found the model that best fits data without prior knowledge. Results We proposed various evolutionary strategies suitable for the task and tested our choices using simulated data drawn from a given bio-realistic network of 35 nodes, the so-called insulin network, which has been used in the literature for benchmarking. We assessed the inferred models against this reference to obtain statistical performance results. We then compared performances of evolutionary algorithms using two kinds of recombination operators that operate at different scales in the graphs. We introduced a niching strategy that reinforces diversity through the population and avoided trapping of the algorithm in one local minimum in the early steps of learning. We show the limited effect of the mutation operator when niching is applied. Finally, we compared our best evolutionary approach with various well known learning algorithms (MCMC, K2, greedy search, TPDA, MMHC devoted to BN structure learning. Conclusion We studied the behaviour of an evolutionary approach enhanced by niching for the learning of gene regulatory networks with BN. We show that this approach outperforms classical structure learning methods in elucidating the original model. These results were obtained for the learning of a bio-realistic network and, more importantly, on various small datasets. This is a suitable approach for learning transcriptional regulatory networks from real datasets without prior knowledge.

  5. New scaling relation for information transfer in biological networks.

    Science.gov (United States)

    Kim, Hyunju; Davies, Paul; Walker, Sara Imari

    2015-12-01

    We quantify characteristics of the informational architecture of two representative biological networks: the Boolean network model for the cell-cycle regulatory network of the fission yeast Schizosaccharomyces pombe (Davidich et al. 2008 PLoS ONE 3, e1672 (doi:10.1371/journal.pone.0001672)) and that of the budding yeast Saccharomyces cerevisiae (Li et al. 2004 Proc. Natl Acad. Sci. USA 101, 4781-4786 (doi:10.1073/pnas.0305937101)). We compare our results for these biological networks with the same analysis performed on ensembles of two different types of random networks: Erdös-Rényi and scale-free. We show that both biological networks share features in common that are not shared by either random network ensemble. In particular, the biological networks in our study process more information than the random networks on average. Both biological networks also exhibit a scaling relation in information transferred between nodes that distinguishes them from random, where the biological networks stand out as distinct even when compared with random networks that share important topological properties, such as degree distribution, with the biological network. We show that the most biologically distinct regime of this scaling relation is associated with a subset of control nodes that regulate the dynamics and function of each respective biological network. Information processing in biological networks is therefore interpreted as an emergent property of topology (causal structure) and dynamics (function). Our results demonstrate quantitatively how the informational architecture of biologically evolved networks can distinguish them from other classes of network architecture that do not share the same informational properties. PMID:26701883

  6. The role of all-trans retinoic acid in the biology of Foxp3+ regulatory T cells

    OpenAIRE

    Liu, Zhong-Min; Wang, Kun-Peng; Ma, Jilin; Guo Zheng, Song

    2015-01-01

    Regulatory T (Treg) cells are necessary for immune system homeostasis and the prevention of autoimmune diseases. Foxp3 is specifically expressed in Treg cells and plays a key role in their differentiation and function. Foxp3+ Treg cells are consisted of naturally occurring, thymus-derived Treg (nTreg) and peripheral-induced Treg (iTreg) cells that may have different functional characteristics or synergistic roles. All-trans retinoic acid (atRA), a vitamin A metabolite, regulates a wide range ...

  7. Feedback control design for the complete synchronisation of two coupled Boolean networks

    Science.gov (United States)

    Li, Fangfei

    2016-09-01

    In the literatures, to design state feedback controllers to make the response Boolean network synchronise with the drive Boolean network is rarely considered. Motivated by this, feedback control design for the complete synchronisation of two coupled Boolean networks is investigated in this paper. A necessary condition for the existence of a state feedback controller achieving the complete synchronisation is established first. Then, based on the necessary condition, the feedback control law is proposed. Finally, an example is worked out to illustrate the proposed design procedure.

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

    Science.gov (United States)

    Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.

    2016-07-01

    We present a characterization of short-term stability of Kauffman's N K (random) Boolean networks under arbitrary distributions of transfer functions. Given such a Boolean network where each transfer function is drawn from the same distribution, we present a formula that determines whether short-term chaos (damage spreading) will happen. Our main technical tool which enables the formal proof of this formula is the Fourier analysis of Boolean functions, which describes such functions as multilinear polynomials over the inputs. Numerical simulations on mixtures of threshold functions and nested canalyzing functions demonstrate the formula's correctness.

  9. Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes

    Institute of Scientific and Technical Information of China (English)

    Hao CHEN; Liang MA; Jianhua LI

    2011-01-01

    Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

  10. Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

    OpenAIRE

    Drucker, Andrew

    2012-01-01

    We study the circuit complexity of Boolean operators, i.e., collections of Boolean functions defined over a common input. Our focus is the well-studied model in which arbitrary Boolean functions are allowed as gates, and in which a circuit's complexity is measured by its depth and number of wires. We show sharp limitations of several existing lower-bound methods for this model. First, we study an information-theoretic lower-bound method due to Cherukhin, that yields bounds of form $\\Omega_d(n...

  11. Boolean functions of an odd number of variables with maximum algebraic immunity

    Institute of Scientific and Technical Information of China (English)

    LI Na; QI WenFeng

    2007-01-01

    In this paper, we study Boolean functions of an odd number of variables with maximum algebraic immunity, We identify three classes of such functions, and give some necessary conditions of such functions, which help to examine whether a Boolean function of an odd number of variables has the maximum algebraic immunity. Further, some necessary conditions for such functions to have also higher nonlinearity are proposed, and a class of these functions are also obtained. Finally,we present a sufficient and necessary condition for Boolean functions of an odd number of variables to achieve maximum algebraic immunity and to be also 1-resilient.

  12. [Life as regulatory activity and self-realization: debate surrounding the concept of biological regulation in Goldstein and Canguilhem].

    Science.gov (United States)

    Ostachuk, Agustín

    2015-12-01

    The influence of Kurt Goldstein on the thinking of Georges Canguilhem extended throughout his entire work. This paper seeks to examine this relationship in order to conduct a study of the norm as a nexus or connection between the concept and life. Consequently, this work will be a reflection on the approach to life as a regulatory activity and self-realization. For this, it will be necessary to redefine the concepts of health and disease, and make a crossover between the two. At the end of this trajectory, it will be found that these concepts can explain the identity between the concept and life, which leads to the unexpected conclusion that the cure is ultimately self-healing. PMID:25807361

  13. ZKBoo: Faster Zero-Knowledge for Boolean Circuits

    DEFF Research Database (Denmark)

    Giacomelli, Irene; Orlandi, Claudio; Madsen, Jesper

    2016-01-01

    In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-of- concept implementation. As an highlight, we can generate (resp. verify) a non-interactive proof for the SHA-1 circuit in approximately 13......ms (resp. 5ms), with a proof size of 444KB. Our techniques are based on the “MPC-in-the-head” approach to zero-knowledge of Ishai et al. (IKOS), which has been successfully used to achieve significant asymp- totic improvements. Our contributions include: ◦ A thorough analysis of the different...... such that y = φ (x)” (where φ is a circuit and y a public value); ◦ A case study, where we provide explicit protocols, implementations and benchmarking of zero-knowledge protocols for the SHA-1 and SHA-256 circuits....

  14. Sampled-Data State Feedback Stabilization of Boolean Control Networks.

    Science.gov (United States)

    Liu, Yang; Cao, Jinde; Sun, Liangjie; Lu, Jianquan

    2016-04-01

    In this letter, we investigate the sampled-data state feedback control (SDSFC) problem of Boolean control networks (BCNs). Some necessary and sufficient conditions are obtained for the global stabilization of BCNs by SDSFC. Different from conventional state feedback controls, new phenomena observed the study of SDSFC. Based on the controllability matrix, we derive some necessary and sufficient conditions under which the trajectories of BCNs can be stabilized to a fixed point by piecewise constant control (PCC). It is proved that the global stabilization of BCNs under SDSFC is equivalent to that by PCC. Moreover, algorithms are given to construct the sampled-data state feedback controllers. Numerical examples are given to illustrate the efficiency of the obtained results.

  15. Complete Boolean Satisfiability Solving Algorithms Based on Local Search

    Institute of Scientific and Technical Information of China (English)

    Wen-Sheng Guo; Guo-Wu Yang; William N.N.Hung; Xiaoyu Song

    2013-01-01

    Boolean satisfiability (SAT) is a well-known problem in computer science,artificial intelligence,and operations research.This paper focuses on the satisfiability problem of Model RB structure that is similar to graph coloring problems and others.We propose a translation method and three effective complete SAT solving algorithms based on the characterization of Model RB structure.We translate clauses into a graph with exclusive sets and relative sets.In order to reduce search depth,we determine search order using vertex weights and clique in the graph.The results show that our algorithms are much more effective than the best SAT solvers in numerous Model RB benchmarks,especially in those large benchmark instances.

  16. Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems

    CERN Document Server

    Yamakami, Tomoyuki

    2011-01-01

    We give a unified treatment to optimization problems that can be expressed in the form of nonnegative-real-weighted Boolean constraint satisfaction problems. Creignou, Khanna, Sudan, Trevisan, and Williamson studied the complexity of approximating their optimal solutions whose optimality is measured by the sums of outcomes of constraints. To explore a wider range of optimization constraint satisfaction problems, following an early work of Marchetti-Spaccamela and Romano, we study the case where the optimality is measured by products of constraints' outcomes. We completely classify those problems into three categories: PO problems, NPO-hard problems, and intermediate problems that lie between the former two categories. To prove this trichotomy theorem, we analyze characteristics of nonnegative-real-weighted constraints using a variant of the notion of T-constructibility developed earlier for complex-weighted counting constraint satisfaction problems.

  17. Boolean Algebra Application in Analysis of Flight Accidents

    Directory of Open Access Journals (Sweden)

    Casandra Venera BALAN

    2015-12-01

    Full Text Available Fault tree analysis is a deductive approach for resolving an undesired event into its causes, identifying the causes of a failure and providing a framework for a qualitative and quantitative evaluation of the top event. An alternative approach to fault tree analysis methods calculus goes to logical expressions and it is based on a graphical representation of the data structure for a logic - based binary decision diagram representation. In this analysis, such sites will be reduced to a minimal size and arranged in the sense that the variables appear in the same order in each path. An event can be defined as a statement that can be true or false. Therefore, Boolean algebra rules allow restructuring of a Fault Tree into one equivalent to it, but simpler.

  18. The Properties of 2-Summable Boolean Function and 3-Summable Boolean Function%可求和布尔函数的性质

    Institute of Scientific and Technical Information of China (English)

    曾利全; 许道云

    2016-01-01

    可求和布尔函数是临界布尔函数判定理论中比较重要的内容之一。该类函数有一个参数k , k表示布尔函数存在k个成真点X1,X2,…Xk和k个成假点Y1,Y2,…Yk ,并且它们的和相等。本文主要研究了n元2-可求和布尔函数和n元3-可求和布尔函数的基本性质。%One of the most important theorem in recognition of threshold function is the k- asummable Boolean function for all k≥2, where k is the number of true point of the Boolean function, say X1,X2,…Xk , and the number of false point of the Boolean function, say, Y1,Y2,…Yk ,such that∑ki=1Xi =∑ki=1Yi . It is shown that the basic properties of 2-summable Boolean function and 3-summable Boolean function.

  19. Understanding gene regulatory mechanisms by integrating ChIP-seq and RNA-seq data: statistical solutions to biological problems

    OpenAIRE

    ClaudiaAngelini; ValerioCosta

    2014-01-01

    The availability of omic data produced from international consortia, as well as from worldwide laboratories, is offering the possibility both to answer long-standing questions in biomedicine/molecular biology and to formulate novel hypotheses to test. However, the impact of such data is not fully exploited due to a limited availability of multi-omic data integration tools and methods. In this paper, we discuss the interplay between gene expression and epigenetic markers/transcription factors....

  20. A Boolean delay equation model of ENSO variability

    Science.gov (United States)

    Saunders, Amira; Ghil, Michael

    2001-12-01

    Boolean delay equations (BDEs) provide a mathematical framework to formulate and analyze conceptual models of complex multi-component systems. This framework is used here to construct a simple conceptual model for the El-Niño/Southern Oscillation (ENSO) phenomenon. ENSO involves the coupling of atmospheric and oceanic processes that are far from being completely understood. Our BDE model uses Boolean variables to represent key atmospheric and oceanic quantities and equations that involve logical operators to describe their evolution. Two distinct time-delay parameters, one for the local atmosphere-ocean coupling effects and the other for oceanic wave propagation, are introduced. Over a range of physically relevant delay values, this truly minimal model captures two essential features of ENSO’s interannual variability - its regularity and its tendency to phase-lock to the annual cycle. Oscillations with average cycle length that is an integer multiple of the seasonal cycle are prevalent and range from 2 to 7 years. Transition zones - where the average period lengths are noninteger rational multiples of the forcing period - exhibit Devil’s staircases, a signature of the quasi-periodic (QP) route to chaos. Our BDE model thus validates results from previous studies of the interaction of the seasonal cycle with ENSO’s “delayed oscillator”. It gives therewith support to the view that the observed irregularity results predominantly from low-order chaotic processes rather than from stochastic weather noise. Moreover, in the transition zone between the two integer periodicities of 2 and 3 years, a heretofore unsuspected, self-similar “fractal sunburst” pattern emerges in phase-parameter space. This pattern provides a distinct and more complex scenario than the QP route to chaos found in earlier, more detailed ENSO models. Period selection in this 2-3-year transitional region seems to play a key role in ENSO’s irregularity, as well as in the appearance of

  1. Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

    Directory of Open Access Journals (Sweden)

    Vladimir A. Emelichev

    2002-11-01

    Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained.

  2. A CHARACTERISTIC SET METHOD FOR SOLVING BOOLEAN EQUATIONS AND APPLICATIONS IN CRYPTANALYSIS OF STREAM CIPHERS

    Institute of Scientific and Technical Information of China (English)

    Fengjuan CHAI; Xiao-Shan GAO; Chunming YUAN

    2008-01-01

    This paper presents a characteristic set method for solving Boolean equations, which is more efficient and has better properties than the general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.

  3. Invariance Under Quasi-isometries of Subcritical and Supercritical Behavior in the Boolean Model of Percolation

    Science.gov (United States)

    Coletti, Cristian F.; Miranda, Daniel; Mussini, Filipe

    2016-02-01

    In this work we study the Poisson Boolean model of percolation in locally compact Polish metric spaces and we prove the invariance of subcritical and supercritical phases under mm-quasi-isometries. More precisely, we prove that if a metric space M is mm-quasi-isometric to another metric space N and the Poisson Boolean model in M exhibits any of the following: (a) a subcritical phase; (b) a supercritical phase; or (c) a phase transition, then respectively so does the Poisson Boolean model of percolation in N. Then we use these results in order to understand the phase transition phenomenon in a large family of metric spaces. Indeed, we study the Poisson Boolean model of percolation in the context of Riemannian manifolds, in a large family of nilpotent Lie groups and in Cayley graphs. Also, we prove the existence of a subcritical phase in Gromov spaces with bounded growth at some scale.

  4. Boolean and advanced searching for EDGAR data on www.sec.gov

    Data.gov (United States)

    Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.

  5. Constructing Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on an Odd Number of Variables

    Science.gov (United States)

    Peng, Jie; Kan, Haibin

    It is well known that Boolean functions used in stream and block ciphers should have high algebraic immunity to resist algebraic attacks. Up to now, there have been many constructions of Boolean functions achieving the maximum algebraic immunity. In this paper, we present several constructions of rotation symmetric Boolean functions with maximum algebraic immunity on an odd number of variables which are not symmetric, via a study of invertible cyclic matrices over the binary field. In particular, we generalize the existing results and introduce a new method to construct all the rotation symmetric Boolean functions that differ from the majority function on two orbits. Moreover, we prove that their nonlinearities are upper bounded by 2^{n-1}-\\binom{n-1}{\\lfloor\\frac{n}{2}\\rfloor}+2(n-6).

  6. A Critical Review of Biosimilars in IBD: The Confluence of Biologic Drug Development, Regulatory Requirements, Clinical Outcomes, and Big Business.

    Science.gov (United States)

    Ha, Christina Y; Kornbluth, Asher

    2016-10-01

    On February 9, 2016, the Food and Drug Administration Arthritis Advisory Committee recommended by a vote of 21 to 3, that the biosimilar to infliximab, CT-P13, be approved for rheumatoid arthritis and ankylosing spondylitis and, by extrapolation, for all the indications for which infliximab is currently approved, including adult and pediatric ulcerative colitis and Crohn's disease. On April 5, 2016, the Food and Drug Administration concurred with this recommendation and approved CT-P13 (Inflectra; Pfizer Inc.) for all diseases for which infliximab had previously been approved, including adult and pediatric moderate to severe ulcerative colitis and pediatric and adult moderate to severe and fistulizing Crohn's disease. This was despite the absence of any randomized controlled trials studying the infliximab biosimilar in any inflammatory bowel disease. This highly controversial approach has been criticized by various rheumatology and gastroenterology professional societies around the world. This review will cover the stepwise approach to biosimilar development, issues of extrapolation and interchangeability, and conclude with a discussion of the regulatory, intellectual property issues, and financial implications, which will all intersect in the decision and ability to prescribe a biosimilar or reference anti-tumor necrosis factor drug. PMID:27564646

  7. Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions

    DEFF Research Database (Denmark)

    Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne

    2005-01-01

    We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic.......We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....

  8. SAT-based Distributed Reactive Control Protocol Synthesis for Boolean Networks

    OpenAIRE

    Sahin, Yunus Emre; Ozay, Necmiye

    2016-01-01

    This paper considers the synthesis of distributed reactive control protocols for a Boolean network in a distributed manner. We start with a directed acyclic graph representing a network of Boolean subsystems and a global contract, given as an assumption-guarantee pair. Assumption captures the environment behavior, and guarantee is the requirements to be satisfied by the system. Local assumption-guarantee contracts, together with local control protocols ensuring these local contracts, are comp...

  9. Feedback control and output feedback control for the stabilisation of switched Boolean networks

    Science.gov (United States)

    Li, Fangfei; Yu, Zhaoxu

    2016-02-01

    This paper presents the feedback control and output feedback control for the stabilisation of switched Boolean network. A necessary condition for the existence of a state feedback controller for the stabilisation of switched Boolean networks under arbitrary switching signal is derived first, and constructive procedures for feedback control and output feedback control design are provided. An example is introduced to show the effectiveness of this paper.

  10. Reconstructing an atomic orthomodular lattice from the poset of its Boolean sublattices

    OpenAIRE

    Constantin, Carmen; Doering, Andreas

    2013-01-01

    We show that an atomic orthomodular lattice L can be reconstructed up to isomorphism from the poset B(L) of Boolean subalgebras of L. A motivation comes from quantum theory and the so-called topos approach, where one considers the poset of Boolean sublattices of L=P(H), the projection lattice of the algebra B(H) of bounded operators on Hilbert space.

  11. Characteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

    OpenAIRE

    Wang, Shiping; Zhu, Qingxin; Zhu, William; Min, Fan

    2012-01-01

    Covering is an important type of data structure while covering-based rough sets provide an efficient and systematic theory to deal with covering data. In this paper, we use boolean matrices to represent and axiomatize three types of covering approximation operators. First, we define two types of characteristic matrices of a covering which are essentially square boolean ones, and their properties are studied. Through the characteristic matrices, three important types of covering approximation ...

  12. The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

    OpenAIRE

    Meier, Arne; Schneider, Thomas

    2010-01-01

    The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite family, have an easier satisfiability problem; sometimes it is even tractable. All these fragments restrict the use of Boolean operators in one way or another. We look at systematic and more general restrictions of the Boolean operators and establish ...

  13. Cost-Optimal Execution of Trees of Boolean Operators with Shared Streams

    OpenAIRE

    Casanova, Henri; Lim, Lipyeow; Robert, Yves; Vivien, Frédéric; Zaidouni, Dounia

    2013-01-01

    The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors to a query processing device, such as a smartphone, over one or more network interfaces. Retrieving a data item incurs a cost, e.g., an energy expense that depletes the smartphone's battery. Since the query tree contains boolean operators, part of the tree can be shortcircuited depending on t...

  14. Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables

    KAUST Repository

    Chikalov, Igor

    2013-01-01

    In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.

  15. Probabilistic Boolean Network Modelling and Analysis Framework for mRNA Translation.

    Science.gov (United States)

    Zhao, Yun-Bo; Krishnan, J

    2016-01-01

    mRNA translation is a complex process involving the progression of ribosomes on the mRNA, resulting in the synthesis of proteins, and is subject to multiple layers of regulation. This process has been modelled using different formalisms, both stochastic and deterministic. Recently, we introduced a Probabilistic Boolean modelling framework for mRNA translation, which possesses the advantage of tools for numerically exact computation of steady state probability distribution, without requiring simulation. Here, we extend this model to incorporate both random sequential and parallel update rules, and demonstrate its effectiveness in various settings, including its flexibility in accommodating additional static and dynamic biological complexities and its role in parameter sensitivity analysis. In these applications, the results from the model analysis match those of TASEP model simulations. Importantly, the proposed modelling framework maintains the stochastic aspects of mRNA translation and provides a way to exactly calculate probability distributions, providing additional tools of analysis in this context. Finally, the proposed modelling methodology provides an alternative approach to the understanding of the mRNA translation process, by bridging the gap between existing approaches, providing new analysis tools, and contributing to a more robust platform for modelling and understanding translation.

  16. Determining a singleton attractor of a boolean network with nested canalyzing functions.

    Science.gov (United States)

    Akutsu, Tatsuya; Melkman, Avraham A; Tamura, Takeyuki; Yamamoto, Masaki

    2011-10-01

    In this article, we study the problem of finding a singleton attractor for several biologically important subclasses of Boolean networks (BNs). The problem of finding a singleton attractor in a BN is known to be NP-hard in general. For BNs consisting of n nested canalyzing functions, we present an O(1.799(n)) time algorithm. The core part of this development is an O(min(2(k/2) · 2(m/2), 2(k)) · poly(k, m)) time algorithm for the satisfiability problem for m nested canalyzing functions over k variables. For BNs consisting of chain functions, a subclass of nested canalyzing functions, we present an O(1.619(n)) time algorithm and show that the problem remains NP-hard, even though the satisfiability problem for m chain functions over k variables is solvable in polynomial time. Finally, we present an o(2(n)) time algorithm for bounded degree BNs consisting of canalyzing functions.

  17. Damage Spreading in Spatial and Small-world Random Boolean Networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.

    2014-02-18

    The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

  18. Molecular chaperone activity and biological regulatory actions of the TPR-domain immunophilins FKBP51 and FKBP52.

    Science.gov (United States)

    Erlejman, Alejandra G; Lagadari, Mariana; Harris, Diondra C; Cox, Marc B; Galigniana, Mario D

    2014-05-01

    Immunophilins comprise a family of intracellular proteins with peptidyl-prolyl-(cis/trans)-isomerase activity. These foldases are abundant, ubiquitous, and able to bind immunosuppressant drugs, from which the term immunophilin derives. Family members are found in abundance in virtually all organisms and subcellular compartments, and their amino acid sequences are conserved phylogenetically. Immunophilins possess the ability to function as molecular chaperones favoring the proper folding and biological regulation of their biological actions. Their ability to interact via their TPR domains with the 90-kDa heat-shock protein, and through this chaperone, with several signalling cascade factors is of particular importance. Among the family members, the highly homologous proteins FKBP51 and FKBP52 were first characterized due to their ability to interact with steroid hormone receptors. Since then, much progress has been made in understanding the mechanisms by which they regulate receptor signaling and the resulting roles they play not only in endocrine processes, but also in cell architecture, neurodifferentiation, and tumor progression. In this article we review the most relevant features of these two immunophilins and their potential as pharmacologic targets.

  19. In silico design and in vivo implementation of yeast gene Boolean gates.

    Science.gov (United States)

    Marchisio, Mario A

    2014-01-01

    In our previous computational work, we showed that gene digital circuits can be automatically designed in an electronic fashion. This demands, first, a conversion of the truth table into Boolean formulas with the Karnaugh map method and, then, the translation of the Boolean formulas into circuit schemes organized into layers of Boolean gates and Pools of signal carriers. In our framework, gene digital circuits that take up to three different input signals (chemicals) arise from the composition of three kinds of basic Boolean gates, namely YES, NOT, and AND. Here we present a library of YES, NOT, and AND gates realized via plasmidic DNA integration into the yeast genome. Boolean behavior is reproduced via the transcriptional control of a synthetic bipartite promoter that contains sequences of the yeast VPH1 and minimal CYC1 promoters together with operator binding sites for bacterial (i.e. orthogonal) repressor proteins. Moreover, model-driven considerations permitted us to pinpoint a strategy for re-designing gates when a better digital performance is required. Our library of well-characterized Boolean gates is the basis for the assembly of more complex gene digital circuits. As a proof of concepts, we engineered two 2-input OR gates, designed by our software, by combining YES and NOT gates present in our library.

  20. An attractor-based complexity measurement for Boolean recurrent neural networks.

    Directory of Open Access Journals (Sweden)

    Jérémie Cabessa

    Full Text Available 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.

  1. An attractor-based complexity measurement for Boolean recurrent neural networks.

    Science.gov (United States)

    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.

  2. Examination of the regulatory frameworks applicable to biologic drugs (including stem cells and their progeny) in Europe, the U.S., and Australia: part I--a method of manual documentary analysis.

    Science.gov (United States)

    Ilic, Nina; Savic, Snezana; Siegel, Evan; Atkinson, Kerry; Tasic, Ljiljana

    2012-12-01

    Recent development of a wide range of regulatory standards applicable to production and use of tissues, cells, and other biologics (or biologicals), as advanced therapies, indicates considerable interest in the regulation of these products. The objective of this study was to analyze and compare high-tier documents within the Australian, European, and U.S. biologic drug regulatory environments using qualitative methodology. Cohort 1 of the selected 18 high-tier regulatory documents from the European Medicines Agency (EMA), the U.S. Food and Drug Administration (FDA), and the Therapeutic Goods Administration (TGA) regulatory frameworks were subject to a manual documentary analysis. These documents were consistent with the legal requirements for manufacturing and use of biologic drugs in humans and fall into six different categories. Manual analysis included a terminology search. The occurrence, frequency, and interchangeable use of different terms and phrases were recorded in the manual documentary analysis. Despite obvious differences, manual documentary analysis revealed certain consistency in use of terminology across analyzed frameworks. Phrase search frequencies have shown less uniformity than the search of terms. Overall, the EMA framework's documents referred to "medicinal products" and "marketing authorization(s)," the FDA documents discussed "drug(s)" or "biologic(s)," and the TGA documents referred to "biological(s)." Although high-tier documents often use different terminology they share concepts and themes. Documents originating from the same source have more conjunction in their terminology although they belong to different frameworks (i.e., Good Clinical Practice requirements based on the Declaration of Helsinki, 1964). Automated (software-based) documentary analysis should be obtained for the conceptual and relational analysis.

  3. Expression-based network biology identifies alteration in key regulatory pathways of type 2 diabetes and associated risk/complications.

    Science.gov (United States)

    Sengupta, Urmi; Ukil, Sanchaita; Dimitrova, Nevenka; Agrawal, Shipra

    2009-01-01

    Type 2 diabetes mellitus (T2D) is a multifactorial and genetically heterogeneous disease which leads to impaired glucose homeostasis and insulin resistance. The advanced form of disease causes acute cardiovascular, renal, neurological and microvascular complications. Thus there is a constant need to discover new and efficient treatment against the disease by seeking to uncover various novel alternate signalling mechanisms that can lead to diabetes and its associated complications. The present study allows detection of molecular targets by unravelling their role in altered biological pathways during diabetes and its associated risk factors and complications. We have used an integrated functional networks concept by merging co-expression network and interaction network to detect the transcriptionally altered pathways and regulations involved in the disease. Our analysis reports four novel significant networks which could lead to the development of diabetes and other associated dysfunctions. (a) The first network illustrates the up regulation of TGFBRII facilitating oxidative stress and causing the expression of early transcription genes via MAPK pathway leading to cardiovascular and kidney related complications. (b) The second network demonstrates novel interactions between GAPDH and inflammatory and proliferation candidate genes i.e., SUMO4 and EGFR indicating a new link between obesity and diabetes. (c) The third network portrays unique interactions PTPN1 with EGFR and CAV1 which could lead to an impaired vascular function in diabetic nephropathy condition. (d) Lastly, from our fourth network we have inferred that the interaction of beta-catenin with CDH5 and TGFBR1 through Smad molecules could contribute to endothelial dysfunction. A probability of emergence of kidney complication might be suggested in T2D condition. An experimental investigation on this aspect may further provide more decisive observation in drug target identification and better understanding of

  4. Expression-based network biology identifies alteration in key regulatory pathways of type 2 diabetes and associated risk/complications.

    Directory of Open Access Journals (Sweden)

    Urmi Sengupta

    Full Text Available Type 2 diabetes mellitus (T2D is a multifactorial and genetically heterogeneous disease which leads to impaired glucose homeostasis and insulin resistance. The advanced form of disease causes acute cardiovascular, renal, neurological and microvascular complications. Thus there is a constant need to discover new and efficient treatment against the disease by seeking to uncover various novel alternate signalling mechanisms that can lead to diabetes and its associated complications. The present study allows detection of molecular targets by unravelling their role in altered biological pathways during diabetes and its associated risk factors and complications. We have used an integrated functional networks concept by merging co-expression network and interaction network to detect the transcriptionally altered pathways and regulations involved in the disease. Our analysis reports four novel significant networks which could lead to the development of diabetes and other associated dysfunctions. (a The first network illustrates the up regulation of TGFBRII facilitating oxidative stress and causing the expression of early transcription genes via MAPK pathway leading to cardiovascular and kidney related complications. (b The second network demonstrates novel interactions between GAPDH and inflammatory and proliferation candidate genes i.e., SUMO4 and EGFR indicating a new link between obesity and diabetes. (c The third network portrays unique interactions PTPN1 with EGFR and CAV1 which could lead to an impaired vascular function in diabetic nephropathy condition. (d Lastly, from our fourth network we have inferred that the interaction of beta-catenin with CDH5 and TGFBR1 through Smad molecules could contribute to endothelial dysfunction. A probability of emergence of kidney complication might be suggested in T2D condition. An experimental investigation on this aspect may further provide more decisive observation in drug target identification and better

  5. An autonomous in vivo dual selection protocol for boolean genetic circuits.

    Science.gov (United States)

    Beneš, David; Sosík, Petr; Rodríguez-Patón, Alfonso

    2015-01-01

    Success in synthetic biology depends on the efficient construction of robust genetic circuitry. However, even the direct engineering of the simplest genetic elements (switches, logic gates) is a challenge and involves intense lab work. As the complexity of biological circuits grows, it becomes more complicated and less fruitful to rely on the rational design paradigm, because it demands many time-consuming trial-and-error cycles. One of the reasons is the context-dependent behavior of small assembly parts (like BioBricks), which in a complex environment often interact in an unpredictable way. Therefore, the idea of evolutionary engineering (artificial directed in vivo evolution) based on screening and selection of randomized combinatorial genetic circuit libraries became popular. In this article we build on the so-called dual selection technique. We propose a plasmid-based framework using toxin-antitoxin pairs together with the relaxase conjugative protein, enabling an efficient autonomous in vivo evolutionary selection of simple Boolean circuits in bacteria (E. coli was chosen for demonstration). Unlike previously reported protocols, both on and off selection steps can run simultaneously in various cells in the same environment without human intervention; and good circuits not only survive the selection process but are also horizontally transferred by conjugation to the neighbor cells to accelerate the convergence rate of the selection process. Our directed evolution strategy combines a new dual selection method with fluorescence-based screening to increase the robustness of the technique against mutations. As there are more orthogonal toxin-antitoxin pairs in E. coli, the approach is likely to be scalable to more complex functions. In silico experiments based on empirical data confirm the high search and selection capability of the protocol.

  6. Learning Techniques for Automatic Test Pattern Generation using Boolean Satisfiability

    Directory of Open Access Journals (Sweden)

    Liu Xin

    2013-07-01

    Full Text Available Automatic Test Pattern Generation (ATPG is one of the core problems in testing of digital circuits. ATPG algorithms based on Boolean Satisfiability (SAT turned out to be very powerful, due to great advances in the performance of satisfiability solvers for propositional logic in the last two decades. SAT-based ATPG clearly outperforms classical approaches especially for hard-to-detect faults. But its inaccessibility of structural information and don’t care, there exists the over-specification problem of input patterns. In this paper we present techniques to delve into an additional layer to make use of structural properties of the circuit and value justification relations to a generic SAT algorithm. It joins binary decision graphs (BDD and SAT techniques to improve the efficiency of ATPG. It makes a study of inexpensive reconvergent fanout analysis of circuit to gather information on the local signal correlation by using BDD learning, then uses the above learned information to restrict and focus the overall search space of SAT-based ATPG. The learning technique is effective and lightweight. Experimental results show the effectiveness of the approach.

  7. Optimal computation of symmetric Boolean functions in Tree networks

    CERN Document Server

    Kowshik, Hemant

    2010-01-01

    In this paper, we address the scenario where nodes with sensor data are connected in a tree network, and every node wants to compute a given symmetric Boolean function of the sensor data. We first consider the problem of computing a function of two nodes with integer measurements. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total number of bits to be exchanged to perform the desired computation. We establish lower bounds using fooling sets, and provide a novel scheme which attains the lower bounds, using information theoretic tools. For a class of functions called sum-threshold functions, this scheme is shown to be optimal. We then turn to tree networks and derive a lower bound for the number of bits exchanged on each link by viewing it as a two node problem. We show that the protocol of recursive innetwork aggregation achieves this lower bound in the case of sumthreshold functions. Thus we have provided a communication and in-network computation stra...

  8. Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?

    Directory of Open Access Journals (Sweden)

    Saurabh Vashishtha

    Full Text Available There is a growing appreciation for the network biology that regulates the coordinated expression of molecular and cellular markers however questions persist regarding the identifiability of these networks. Here we explore some of the issues relevant to recovering directed regulatory networks from time course data collected under experimental constraints typical of in vivo studies. NetSim simulations of sparsely connected biological networks were used to evaluate two simple feature selection techniques used in the construction of linear Ordinary Differential Equation (ODE models, namely truncation of terms versus latent vector projection. Performance was compared with ODE-based Time Series Network Identification (TSNI integral, and the information-theoretic Time-Delay ARACNE (TD-ARACNE. Projection-based techniques and TSNI integral outperformed truncation-based selection and TD-ARACNE on aggregate networks with edge densities of 10-30%, i.e. transcription factor, protein-protein cliques and immune signaling networks. All were more robust to noise than truncation-based feature selection. Performance was comparable on the in silico 10-node DREAM 3 network, a 5-node Yeast synthetic network designed for In vivo Reverse-engineering and Modeling Assessment (IRMA and a 9-node human HeLa cell cycle network of similar size and edge density. Performance was more sensitive to the number of time courses than to sample frequency and extrapolated better to larger networks by grouping experiments. In all cases performance declined rapidly in larger networks with lower edge density. Limited recovery and high false positive rates obtained overall bring into question our ability to generate informative time course data rather than the design of any particular reverse engineering algorithm.

  9. General theory of genotype to phenotype mapping: derivation of epigenetic landscapes from N-node complex gene regulatory networks.

    Science.gov (United States)

    Villarreal, Carlos; Padilla-Longoria, Pablo; Alvarez-Buylla, Elena R

    2012-09-14

    We propose a systematic methodology to construct a probabilistic epigenetic landscape of cell-fate attainment associated with N-node Boolean genetic regulatory networks. The general derivation proposed here is exemplified with an Arabidopsis thaliana network underlying floral organ determination grounded on qualitative experimental data.

  10. Regulatory effect of evodiamine on the malignant biological behaviors and Wnt/β-catenin signaling pathway of colorectal cancer cell lines HT29

    Institute of Scientific and Technical Information of China (English)

    Yuan-HuiWang; Zhen-Hua Zhou

    2016-01-01

    Objective:To study the regulatory effect of evodiamine on the malignant biological behaviors and Wnt/β-catenin signaling pathway of colorectal cancer cell lines HT29.Methods:Colorectal cancer cell lines HT29 were cultured and divided into blank control group and evodiamine group, and after different treatment, cell viability, proportion of different cell cycle as well as the contents of VEGFA, VEGFB, VEGFC, MMP3, MMP14, Wnt andβ-catenin were detected.Results: (1) Cell viability: MTT value of evodiamine group was significantly lower than that of blank control group; (2) Cell cycle: proportion of both S phase and G2/M phase of evodiamine group were lower than those of blank control group, and proportion of G0/G1 phase was higher than that of blank control group; (3) VEGF and MMP contents: VEGFA, VEGFB, VEGFC, MMP3 and MMP14 contents of evodiamine group were lower than those of blank control group; (4) Wnt/β-catenin signaling pathway: Wnt andβ-catenin contents of evodiamine group were lower than those of blank control group.Conclusion:Evodiamine can inhibit the proliferation of colorectal cancer cell lines HT29 and down-regulate the expression of VEGF and MMP, and the effect may be achieved by inhibiting the activation of Wnt/β-catenin signaling pathway.

  11. Robust method for infrared small-target detection based on Boolean map visual theory.

    Science.gov (United States)

    Qi, Shengxiang; Ming, Delie; Ma, Jie; Sun, Xiao; Tian, Jinwen

    2014-06-20

    In this paper, we present an infrared small target detection method based on Boolean map visual theory. The scheme is inspired by the phenomenon that small targets can often attract human attention due to two characteristics: brightness and Gaussian-like shape in the local context area. Motivated by this observation, we perform the task under a visual attention framework with Boolean map theory, which reveals that an observer's visual awareness corresponds to one Boolean map via a selected feature at any given instant. Formally, the infrared image is separated into two feature channels, including a color channel with the original gray intensity map and an orientation channel with the orientation texture maps produced by a designed second order directional derivative filter. For each feature map, Boolean maps delineating targets are computed from hierarchical segmentations. Small targets are then extracted from the target enhanced map, which is obtained by fusing the weighted Boolean maps of the two channels. In experiments, a set of real infrared images covering typical backgrounds with sky, sea, and ground clutters are tested to verify the effectiveness of our method. The results demonstrate that it outperforms the state-of-the-art methods with good performance.

  12. Creating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code

    CERN Document Server

    Hsieh, J Y; Hsieh, Jin-Yuan; Li, Che-Ming

    2004-01-01

    In this work we consider a quantum single-error-correcting scheme derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of the present error-correction is to create specific linear Boolean functions which can transform the sixteen error syndromes occurring in the error-correcting code onto their mappings so that one Bell state is corrected whenever the other four in the finite block are measured. The Boolean function is performed under the effect of its associated sequence of basic quantum unilateral and bilateral operations. Previously, the Boolean function is created in use of the Monte Carlo computer search method. We introduce here a systematic scenario for creating the Boolean function and its associated sequence of operations so that we can do the job in an analytical way without any trial and error effort. Consequently, all possible Boolean functions can in principle be created by ...

  13. Mammalian synthetic biology: emerging medical applications

    OpenAIRE

    Kis, Zoltán; Pereira, Hugo Sant'Ana; Homma, Takayuki; Pedrigi, Ryan M.; Krams, Rob

    2015-01-01

    In this review, we discuss new emerging medical applications of the rapidly evolving field of mammalian synthetic biology. We start with simple mammalian synthetic biological components and move towards more complex and therapy-oriented gene circuits. A comprehensive list of ON–OFF switches, categorized into transcriptional, post-transcriptional, translational and post-translational, is presented in the first sections. Subsequently, Boolean logic gates, synthetic mammalian oscillators and tog...

  14. Hypertext vs Boolean-Based Searching in a Bibliographic Database Environment: A Direct Comparison of Searcher Performance.

    Science.gov (United States)

    Wolfram, Dietmar; Dimitroff, Alexandra

    1998-01-01

    Describes a study that compared a hypertext-based bibliographic retrieval system with a traditional Boolean-based system. Results, conducted with novice and experienced searchers, revealed that the Boolean system performed better for tasks with a large number of relevant items, and that searcher experience level did not play a significant role.…

  15. On (2m + 1)-variable symmetric Boolean functions with submaximum algebraic immunity 2m-1

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    All (2m +1)-variable symmetric Boolean functions with submaximal algebraic immunity 2m-1 are described and constructed. The total number of such Boolean functions is 32 ·22m-3 +3m-2 · 24 - 2 for m≥2.

  16. Controllability of Boolean networks via input controls under Harvey's update scheme

    Science.gov (United States)

    Luo, Chao; Zhang, Xiaolin; Shao, Rui; Zheng, YuanJie

    2016-02-01

    In this article, the controllability of Boolean networks via input controls under Harvey's update scheme is investigated. First, the model of Boolean control networks under Harvey's stochastic update is proposed, by means of semi-tensor product approach, which is converted into discrete-time linear representation. And, a general formula of control-depending network transition matrix is provided. Second, based on discrete-time dynamics, controllability of the proposed model is analytically discussed by revealing the necessary and sufficient conditions of the reachable sets, respectively, for three kinds of controls, i.e., free Boolean control sequence, input control networks, and close-loop control. Examples are showed to demonstrate the effectiveness and feasibility of the proposed scheme.

  17. TESTING HISTOLOGICAL IMAGES OF MAMMARY TISSUES ON COMPATIBILITY WITH THE BOOLEAN MODEL OF RANDOM SETS

    Directory of Open Access Journals (Sweden)

    Tomáš Mrkvička

    2011-03-01

    Full Text Available Methods for testing the Boolean model assumption from binary images are briefly reviewed. Two hundred binary images of mammary cancer tissue and 200 images of mastopathic tissue were tested individually on the Boolean model assumption. In a previous paper, it had been found that a Monte Carlo method based on the approximation of the envelopes by a multi-normal distribution with the normalized intrinsic volume densities of parallel sets as a summary statistics had the highest power for this purpose. Hence, this method was used here as its first application to real biomedical data. It was found that mastopathic tissue deviates from the Boolean model significantly more strongly than mammary cancer tissue does.

  18. Pulse-transmission Oscillators: Autonomous Boolean Models and the Yeast Cell Cycle

    Science.gov (United States)

    Sevim, Volkan; Gong, Xinwei; Socolar, Joshua

    2010-03-01

    Models of oscillatory gene expression typically involve a constitutively expressed or positively autoregulated gene which is repressed by a negative feedback loop. In Boolean representations of such systems, which include the repressilator and relaxation oscillators, dynamical stability stems from the impossibility of satisfying all of the Boolean rules at once. We consider a different class of networks, in which oscillations are due to the transmission of a pulse of gene activation around a ring. Using autonomous Boolean modeling methods, we show how the circulating pulse can be stabilized by decoration of the ring with certain feedback and feed-forward motifs. We then discuss the relation of these models to ODE models of transcriptional networks, emphasizing the role of explicit time delays. Finally, we show that a network recently proposed as a generator of cell cycle oscillations in yeast contains the motifs required to support stable transmission oscillations.

  19. Influence and interaction indexes for pseudo-Boolean functions: a unified least squares approach

    CERN Document Server

    Marichal, Jean-Luc

    2012-01-01

    The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified degree. We first observe that this property still holds if we consider approximations by pseudo-Boolean functions depending only on specified variables. We then show that the Banzhaf influence index can also be obtained from the latter approximation problem. Considering certain weighted versions of this approximation problem, we introduce a class of weighted Banzhaf influence indexes, analyze their most important properties, and point out similarities between the weighted Banzhaf influence index and the corresponding weighted Banzhaf interaction index.

  20. Searching for Information in an Online Public Access Catalogue (OPAC): The Impacts of Information Search Expertise on the use of Boolean Operators

    Science.gov (United States)

    Dinet, Jrme; Favart, Monik; Passerault, Jean-Michel

    2004-01-01

    Boolean systems still constitute most of the installed base of online public access catalogues (OPACs) in the French universities even if many studies have shown that Boolean operators are not frequently used by non-librarian users (by contrast with professional librarians). The first study examined the use of Boolean operators by French…

  1. The Complexity of Satisfiability for Sub-Boolean Fragments of ALC

    OpenAIRE

    A. Meier and T. Schneider

    2010-01-01

    The standard reasoning problem, concept satisfiability, in the basic description logic ALCis PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families,have an easier satisfiability problem; sometimes it is even tractable.All these fragments restrict the use of Boolean operators in one way or another.We look at systematic and more general restrictionsof the Boolean operators and establish the ...

  2. Fuzzy Boolean Algebras Based on Implication Operator%基于蕴涵算子上的模糊布尔代数

    Institute of Scientific and Technical Information of China (English)

    陈华新

    2011-01-01

    文中给出R-模糊布尔代数的定义,讨论了其与模糊布尔代数的关系,证明在一定的条件下,有限个R-模糊布尔代数的交(并)还是R-模糊布尔代数,R-模糊布尔代数的同态像(原像)仍是R-模糊布尔代数.%In this paper ,we introduce the definition of fuzzy Boolean algebra. Based on that, the differences and connection between R-fuzzy Boolean algebra and fuzzy Boolean algebra are discussed. Furhtermore, it is proved that the finite intersection (union) of R-fuzzy Boolean algebra is still R-fuzzy Boolean algebra , and the homomorphic image (preimage) of R-fuzzy Boolean algebra is still R-fuzzy Boolean algebra.

  3. A new separation algorithm for the Boolean quadric and cut polytopes

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros; Letchford, Adam N.

    2014-01-01

    A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...

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

    Science.gov (United States)

    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…

  5. Relational Understanding and Paths of Reasoning through a Boolean Lattice Classification of Quadrilaterals

    Science.gov (United States)

    Karakonstantis, J.; Patronis, T.

    2010-01-01

    In this article we study a specific lattice classification of converse quadrilaterals, based on the relations between diagonals. This lattice contains 16 = 2[superscript 4] elements, which form a hypercube, and therefore it is a Boolean lattice. "Complementary" species of quadrilaterals thus appear and may be related in the lattice diagram. We…

  6. Chaos Control in Random Boolean Networks by Reducing Mean Damage Percolation Rate

    Institute of Scientific and Technical Information of China (English)

    JIANG Nan; CHEN Shi-Jian

    2011-01-01

    Chaos control in random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase. However, controlled nodes are only viewed as passive blocks to prevent perturbation spread. We propose a new control method in which controlled nodes can exert an active impact on the network.Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions. Simulation results showy that the number of nodes needed to achieve control is largely reduced compared to the previous method. Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control.%Chaos control in random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase.However, controlled nodes are only viewed as passive blocks to prevent perturbation spread.We propose a new control method in which controlled nodes can exert an active impact on the network.Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions.Simulation results show that the number of nodes needed to achieve control is largely reduced compared to the previous method.Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control

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

    Science.gov (United States)

    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…

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

    Science.gov (United States)

    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.

  9. Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type

    Science.gov (United States)

    Matoušek, Milan; Pták, Pavel

    2015-12-01

    Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.

  10. On a Boolean-valued Model of the Strict Implication System(Continuous)

    Institute of Scientific and Technical Information of China (English)

    LI Na; LIU Hua-ke

    2004-01-01

    The reference [4] proved the consistency of S 1 and S 2 among Lewis'five strict implicationsystems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S 3 , S 4 and S 5 in Lewis'five strictimplication systems is not decided. This paper makes use of the properties : (1) the equivalence of the modal systems S 3 andP 3 , S 4 and P 4 ; (2) the modal systems P 3 and P 4 all contained the modal axiom T(□p) ; (3) the modal axiom T is correspondence to the reflexiveproperty in VB . Hence, the paper proves: (a) |A S 31|=1 ; (b) |A S 41|=1 ;(c) |A S 51|=1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB ). Therefore, the paper finallyproves that the Boolean-valued model VB of the ZFC axiomsystem in set theory is also a Boolean-valued model of Lewis'the strict implication system S 3 , S 4 and S 5 .

  11. Composing Boolean Search Statements: Self-Confidence, Concept Analysis, Search Logic, and Errors.

    Science.gov (United States)

    Nahl, Diane; Harada, Violet H.

    1996-01-01

    A study of 191 juniors and seniors from 6 Oahu high schools tested their ability to interpret and construct search statements after reading brief instructions on concept analysis, Boolean operators, and search statement format. On average, students made two errors per statement; scores and types of errors are examined for influences of gender and…

  12. Systolic arrays for binary image processing by using Boolean differential operators

    Science.gov (United States)

    Shmerko, V. P.; Yanushkevich, S. N.; Kochergov, E. G.

    1993-11-01

    A matrix form of the Boolean differential temporal (parametric) operators is proposed. The procedures of preliminary binary image processing (logic filtering, finding of contours) are constructed on this base. This presentation of the operators allows to synthesize the algorithms having a mapping into an architecture of systolic arrays.

  13. Application of fuzzy logic to Boolean models for digital soil assessment

    NARCIS (Netherlands)

    Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.

    2011-01-01

    Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between t

  14. Influence of a Structure on System's Dynamics on Example of Boolean Networks

    OpenAIRE

    Kirillova, O.

    1999-01-01

    In this work we study the Boolean Networks of different geometric shape and lattice organization. It was revealed that no only a spatial shape but also type of lattice are very important for definition of the structure-dynamics relation. The regular structures do not give a critical regime in the investigated cases. Hierarchy together with the irregular structure reveals characteristic features of criticality.

  15. Practical Enhanced Boolean Retrieval: Experiences with the SMART and SIRE Systems.

    Science.gov (United States)

    Fox, Edward A.; Koll, Matthew B.

    1988-01-01

    Provides an overview of methods for improving the effectiveness of Boolean retrieval systems, including document clustering, relevance feedback, weighted term searching, ranked output, and fuzzy set theory. The discussion of experimental studies with the SMART and SIRE systems focuses on the implementation and results of these methods. (69…

  16. Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt

    2007-01-01

    We consider constant depth circuits augmented with few exact threshold gates with arbitrary weights. We prove strong (up to exponential) size lower bounds for such circuits computing symmetric Boolean functions. Our lower bound is expressed in terms of a natural parameter, the balance, of symmetr...

  17. Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

    Directory of Open Access Journals (Sweden)

    Vladimir A. Emelichev

    2002-07-01

    Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained. MSC: 90C29, 90C31

  18. Analysis and control of Boolean networks a semi-tensor product approach

    CERN Document Server

    Cheng, Daizhan; Li, Zhiqiang

    2010-01-01

    This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.

  19. On a Probabilistic Approach to Determining the Similarity between Boolean Search Request Formulations.

    Science.gov (United States)

    Radecki, Tadeusz

    1982-01-01

    Presents and discusses the results of research into similarity measures for search request formulations which employ Boolean combinations of index terms. The use of a weighting mechanism to indicate the importance of attributes in a search formulation is described. A 16-item reference list is included. (JL)

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

    Directory of Open Access Journals (Sweden)

    Ivana Dragović

    2015-01-01

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

  1. A unified biological modeling and simulation system for analyzing biological reaction networks

    Science.gov (United States)

    Yu, Seok Jong; Tung, Thai Quang; Park, Junho; Lim, Jongtae; Yoo, Jaesoo

    2013-12-01

    In order to understand the biological response in a cell, a researcher has to create a biological network and design an experiment to prove it. Although biological knowledge has been accumulated, we still don't have enough biological models to explain complex biological phenomena. If a new biological network is to be created, integrated modeling software supporting various biological models is required. In this research, we design and implement a unified biological modeling and simulation system, called ezBioNet, for analyzing biological reaction networks. ezBioNet designs kinetic and Boolean network models and simulates the biological networks using a server-side simulation system with Object Oriented Parallel Accelerator Library framework. The main advantage of ezBioNet is that a user can create a biological network by using unified modeling canvas of kinetic and Boolean models and perform massive simulations, including Ordinary Differential Equation analyses, sensitivity analyses, parameter estimates and Boolean network analysis. ezBioNet integrates useful biological databases, including the BioModels database, by connecting European Bioinformatics Institute servers through Web services Application Programming Interfaces. In addition, we employ Eclipse Rich Client Platform, which is a powerful modularity framework to allow various functional expansions. ezBioNet is intended to be an easy-to-use modeling tool and a simulation system for understanding the control mechanism by monitoring the change of each component in a biological network. The simulation result can be managed and visualized on ezBioNet, which is available free of charge at http://ezbionet.sourceforge.net or http://ezbionet.cbnu.ac.kr.

  2. Prediction of regulatory elements

    DEFF Research Database (Denmark)

    Sandelin, Albin

    2008-01-01

    Finding the regulatory mechanisms responsible for gene expression remains one of the most important challenges for biomedical research. A major focus in cellular biology is to find functional transcription factor binding sites (TFBS) responsible for the regulation of a downstream gene. As wet...

  3. Ω-fuzzy subalgebra of Boolean algebra%布尔代数的Ω-模糊子代数

    Institute of Scientific and Technical Information of China (English)

    刘卫锋

    2013-01-01

    Ω-fuzzy subalgebra of Boolean algebra and its properties were discussed in this paper .Ω-fuzzy subalgebra of Boolean algebra was defined and two judging theorems of Ω-fuzzy subalgebra of Boolean algebra were given , and it was stated that intersection-images and inverse-images under Boolean algebra homomorphism of Ω-fuzzy subalgebra of Boolean algebra were respectively Ω-fuzzy subalgebra of Boolean algebra . Then , by defining three operations ⊕ ,ⓧ , over RΩ where RΩexpressed all mappings from set Ωto Boolean algebra R ,a Boolean algebra was obtained ,and fuzzy subalgebra and Ω-fuzzy subalgebra about RΩwere researched .%  研究布尔代数的Ω-模糊子代数及其性质。定义布尔代数的Ω-模糊子代数,给出布尔代数的Ω-模糊子代数的两个简化判定定理,并证明布尔代数的Ω-模糊子代数的交、同态像和同态逆像等也是布尔代数的Ω-模糊子代数。然后,令RΩ表示集合Ω到布尔代数R的所有映射的集合,通过在 RΩ上定义3种运算磑,磗,,得到布尔代数枙RΩ,磑,磗,, I0,I1枛,并研究与其相关的模糊子代数和Ω-模糊子代数。

  4. Synthetic biology, concerns and risks: looking for a (constitutionally oriented) regulatory framework and a system of governance for a new emerging technology

    OpenAIRE

    Colussi, Ilaria Anna

    2013-01-01

    The Doctoral thesis is about the relationship between synthetic biology and the law. It aims at elaborating a model of governance and regulation against the risks of synthetic biology, using the "prudent vigilance" approach and the human rights frame. Synthetic biology occupies a relevant position among the new emerging technologies. The potential applications of this field of research, characterized by the adoption of an engineering approach to life, together with a trend to converg...

  5. Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles

    Science.gov (United States)

    With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate t...

  6. Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions

    CERN Document Server

    Kötzing, Timo; Sudholt, Dirk; Wagner, Markus

    2010-01-01

    With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on the class of linear pseudo-Boolean functions defined on binary strings of length 'n'. Our investigations point out how the progress according to function values is stored in pheromone. We provide a general upper bound of O((n^3 \\log n)/ \\rho) for two ACO variants on all linear functions, where (\\rho) determines the pheromone update strength. Furthermore, we show improved bounds for two well-known linear pseudo-Boolean functions called OneMax and BinVal and give additional insights using an experimental study.

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

    Science.gov (United States)

    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.

  8. Modeling boolean decision rules applied to multiple-observer decision strategies.

    Science.gov (United States)

    Maguire, W

    1996-01-01

    A model that derives multiple-observer decision strategy ROC curves for boolean decision rules applied to binary decisions of two or three observers is presented. It is assumed that covert decision variables consistent with ROC models of observer performance underlie decisions and that readers' decision criteria are in a fixed relationship. The specific parameters of individual ROC curves and the correlational structure that describes interobserver agreement have dramatic effects upon the relative benefits to be derived from different boolean strategies. A common strategy employed in clinical practice, in which the overall decision is positive if any observer makes a positive decision, is most effective when the readers are of similar ability, when they adopt similar decision criteria, when interreader agreement is greater for negative than for positive cases, and when the individual ROC slope is observer decision strategies can be evaluated using the model equations. A bootstrap method for testing model-associated hypotheses is described. PMID:8717599

  9. Closure Properties of Classes of Spatio-Temporal Objects for Boolean Set Operations

    OpenAIRE

    Haesevoets, Sofie; Kuijpers, Bart

    2000-01-01

    We study a model for spatio-temporal objects, introduced by Chomicki and Revesz, in which spatio-temporal data is specified by a spatial reference object together with a geometric transformation that determines the movement of the reference object in time. We give complete results concerning closure under Boolean set operators for the different classes of spatio-temporal objects introduced by these authors (In particular, we also answer a conjecture by Chomicki and Revesz negatively). Since o...

  10. Cost-Optimal Execution of Boolean Query Trees with Shared Streams

    OpenAIRE

    Casanova, Henri; Lim, Lipyeow; Robert, Yves; Vivien, Frédéric; Zaidouni, Dounia

    2014-01-01

    International audience The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors, which incurs a cost, e.g., an energy expense that depletes the battery of a mobile query processing device. The objective is to determine the order in which predicates should be evaluated so as to shortcut part of the query evaluation and minimize the expected cost....

  11. A quantum speedup in machine learning: Finding a N-bit Boolean function for a classification

    OpenAIRE

    Yoo, Seokwon; Bang, Jeongho; Lee, Changhyoup; Lee, Jinhyoung

    2013-01-01

    We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate sol...

  12. A language for real time simulation of processes with boolean inputs and outputs

    OpenAIRE

    Fernández Camacho, Eduardo; García Franquelo, Leopoldo; Lozano, J.

    1983-01-01

    This paper deals with the problem of real time simulation of processes with boolean inputs and outputs. A language for this purpose and the programs that processes it is presented. The language allows the description of processes with simultaneous evolutions as a timed petri net type of description is used. Random failures can also be Introduced in the behaviour of the model. The language allows the control of a semlgraphic CRT in order to facilitate the task of following the model behaviour.

  13. The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices

    Institute of Scientific and Technical Information of China (English)

    LIU Jian-ping; CHEN Jin-song

    2013-01-01

    Let Gn(C) be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and GC (Jn) the set of all primitive matrices in Gn(C). In this paper, some necessary and suffi cient conditions for A in the semigroup Gn(C) to be primitive are given. We also show that GC (Jn) is a subsemigroup of Gn(C).

  14. Using computer algebra and SMT solvers in algebraic biology

    Science.gov (United States)

    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.

  15. Boolean Combinations of Implicit Functions for Model Clipping in Computer-Assisted Surgical Planning.

    Science.gov (United States)

    Zhan, Qiqin; Chen, Xiaojun

    2016-01-01

    This paper proposes an interactive method of model clipping for computer-assisted surgical planning. The model is separated by a data filter that is defined by the implicit function of the clipping path. Being interactive to surgeons, the clipping path that is composed of the plane widgets can be manually repositioned along the desirable presurgical path, which means that surgeons can produce any accurate shape of the clipped model. The implicit function is acquired through a recursive algorithm based on the Boolean combinations (including Boolean union and Boolean intersection) of a series of plane widgets' implicit functions. The algorithm is evaluated as highly efficient because the best time performance of the algorithm is linear, which applies to most of the cases in the computer-assisted surgical planning. Based on the above stated algorithm, a user-friendly module named SmartModelClip is developed on the basis of Slicer platform and VTK. A number of arbitrary clipping paths have been tested. Experimental results of presurgical planning for three types of Le Fort fractures and for tumor removal demonstrate the high reliability and efficiency of our recursive algorithm and robustness of the module.

  16. Boolean modeling of neural systems with point-process inputs and outputs.

    Science.gov (United States)

    Marmarelis, Vasilis Z; Zanos, Theodoros P; Courellis, Spiros H; Berger, Theodore W

    2006-01-01

    This paper presents a novel modeling approach for neural systems with point-process inputs and outputs (binary time-series of 0's and 1's) that utilizes Boolean operators of modulo-2 multiplication and addition, corresponding to the logical AND and OR operations respectively. The form of the employed mathematical model 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 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 accurate estimation of such models 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, even in the presence of considerable noise in the input and/or output, thus making the proposed approach an attractive candidate for modeling neural systems in a practical context. PMID:17946091

  17. Genetic Algorithm Combination of Boolean Constraint Programming for Solving Course of Action Optimization in Influence Nets

    Directory of Open Access Journals (Sweden)

    Yanguang Zhu

    2011-06-01

    Full Text Available A military decision maker is typically confronted by the task of determining optimal course of action under some constraints in complex uncertain situation. Thus, a new class of Combinational Constraint Optimization Problem (CCOP is formalized, that is utilized to solve this complex Operation Optimization Problem. The object function of CCOP is modeled by Influence net, and the constraints of CCOP relate to resource and collaboration. These constraints are expressed by Pseudo-Boolean and Boolean constraints. Thus CCOP holds a complex mathematical configuration, which is expressed as a 0 1 integer optimization problem with compositional constraints and unobvious optimal object function. A novel method of Genetic Algorithm (GA combination of Boolean Constraint Programming (BCP is proposed to solve CCOP. The constraints of CCOP can be easily reduced and transformed into Disjunctive Normal Form (DNF by BCP. The DNF representation then can be used to drive GA so as to solve CCOP. Finally, a numerical experiment is given to demonstrate the effectiveness of above method.

  18. Integer programming-based method for designing synthetic metabolic networks by Minimum Reaction Insertion in a Boolean model.

    Directory of Open Access Journals (Sweden)

    Wei Lu

    Full Text Available In this paper, we consider the Minimum Reaction Insertion (MRI problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."

  19. Integer programming-based method for designing synthetic metabolic networks by Minimum Reaction Insertion in a Boolean model.

    Science.gov (United States)

    Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya

    2014-01-01

    In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."

  20. Regulatory and bio-safety issues in relation to transgenic animals in food and agriculture, feeds containing GMO and veterinary biologics

    International Nuclear Information System (INIS)

    The development of an effective regulatory system for genetically engineered animals and their products has been a subject of increasing discussions among researchers, industry and policy developers, as well as the public. Transgenic technology alters an animal's genome to achieve desired production or health effects of commercial or societal value. Since transgenesis itself is a relatively new scientific approach, transgenic animals are new organisms for which there is no existing information relevant to their performance under domestication or to their behavior in the wild, nor is there any firm basis for predicting their potential. The issues associated with the regulation and biosafety of transgenic animals pertain to environmental impact, human food safety, animal health and welfare, trade, and ethics. Many concerns related to genetic modifications in animals or plants focus on safety of the human food chain. Given the present public perception of animal biotechnology in general, transgenic animals are viewed with varying degrees of optimism and skepticism. In light of these divergent views the question that remains to be answered is how to develop regulations that safeguard the public concerns and at the same time allow this technology to benefit agriculture, in a manner that neither 'restricts' nor 'facilitates'. Transgenic animals are produced for four basic reasons: to improve animal health, to increase productivity and improve product quality, to mitigate the environmental impact of foodanimal production, and to produce therapeutics. To date, scientists have been able to add, delete, silence or partially activate genes of interest. To regulate such a powerful technology predicated on limited background information is a challenge not only to the regulators, but also to the developers who strive to prove that these animals are safe by demonstrating bioequivalency to their conventional counterparts. The regulations are based on the principle of substantial

  1. Unmasking risk loci: DNA methylation illuminates the biology of cancer predisposition: analyzing DNA methylation of transcriptional enhancers reveals missed regulatory links between cancer risk loci and genes.

    Science.gov (United States)

    Aran, Dvir; Hellman, Asaf

    2014-02-01

    Paradoxically, DNA sequence polymorphisms in cancer risk loci rarely correlate with the expression of cancer genes. Therefore, the molecular mechanism underlying an individual's susceptibility to cancer has remained largely unknown. However, recent evaluations of the correlations between DNA methylation and gene expression levels across healthy and cancerous genomes have revealed enrichment of disease-related DNA methylation variations within disease-associated risk loci. Moreover, it appears that transcriptional enhancers embedded in cancer risk loci often contain DNA methylation sites that closely define the expression of prominent cancer genes, despite the lack of significant correlations between gene expression levels and the surrounding disease-associated polymorphic sequences. We suggest that DNA methylation variations may obscure the effect of co-residing risk sequence alleles. Analysis of enhancer methylation data may help to reveal the regulatory circuits underlying predisposition to cancers and other common diseases.

  2. The one-way communication complexity of the Boolean Hidden Matching Problem

    CERN Document Server

    Kerenidis, I; Kerenidis, Iordanis; Raz, Ran

    2006-01-01

    We give a tight lower bound of Omega(\\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\\log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lower bound is obtained by Fourier analysis, using the Fourier coefficients inequality of Kahn Kalai and Linial [KKL88].

  3. Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function

    CERN Document Server

    Gavinsky, D; Kempe, J; Gavinsky, Dmitry; Kempe, Julia; Wolf, Ronald de

    2006-01-01

    We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary has a certain amount of classical storage, but is completely insecure if he has a similar amount of quantum storage.

  4. A quantum speedup in machine learning: finding an N-bit Boolean function for a classification

    International Nuclear Information System (INIS)

    We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)

  5. Quantum walks outside of boolean domain as a gate for one, two, or three qubits

    Science.gov (United States)

    Cavin, Thomas; Solenov, Dmitry

    Quantum computing needs entangling quantum gates to perform computation and error correction. We will discuss a novel way to implement quantum gates, such as CNOT, using quantum walks that are directed through a network of states outside of the boolean domain. In such implementations it is important to investigate walks on networks of different connectivities. Specifically, we will discuss solutions to non-symmetric linear chain networks and demonstrate how solutions to more complex networks that have branching, such as cubes, can be expressed in terms of linear chain solutions. We then show examples of implementing single qubit and two-qubit entangling gates.

  6. A quantum speedup in machine learning: finding an N-bit Boolean function for a classification

    Science.gov (United States)

    Yoo, Seokwon; Bang, Jeongho; Lee, Changhyoup; Lee, Jinhyoung

    2014-10-01

    We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution.

  7. Characterization Of any Non-linear Boolean function Using A Set of Linear Operators

    OpenAIRE

    Sahoo, Sudhakar; Choudhury, Pabitra Pal; Chakraborty, Mithun

    2008-01-01

    Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian Matrices. In this paper two different efforts have been made: first we try to systematize non-linear CA evolution in the light of deviant states and non-deviant states. For all the non-devian...

  8. The receptor mosaic hypothesis of the engram: possible relevance of Boolean network modeling.

    Science.gov (United States)

    Zoli, M; Guidolin, D; Fuxe, K; Agnati, L F

    1996-09-01

    In the past 15 years, several lines of evidence have shown that receptors for chemical signals can interact in domains of the plasma membrane and possibly form molecular circuits encoding logical operators. In this frame, the receptor mosaic hypothesis of the engram was advanced. According to this proposal, aggregates of different receptor species (mosaics) may form in neuronal membranes (typically synapses) and constitute a memory trace (engram) of its activity. In the present paper, we present an attempt to model the functioning of aggregates of interacting receptors in membrane domains by means of random Boolean networks. PMID:8968825

  9. Boolean Logic Gates From A Single Memristor Via Low-Level Sequential Logic

    OpenAIRE

    Gale, Ella; Costello, Ben de Lacy; Adamatzky, Andrew

    2014-01-01

    By using the memristor's memory to both store a bit and perform an operation with a second input bit, simple Boolean logic gates have been built with a single memristor. The operation makes use of the interaction of current spikes (occasionally called current transients) found in both memristors and other devices. The sequential time-based logic methodology allows two logical input bits to be used on a one-port by sending the bits separated in time. The resulting logic gate is faster than one...

  10. Variances as order parameter and complexity measure for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)

    2005-02-04

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.

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

    Energy Technology Data Exchange (ETDEWEB)

    Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)

    2014-10-06

    In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

  12. Simulation Performance of MMSE Iterative Equalization with Soft Boolean Value Propagation

    CERN Document Server

    Krishnamoorthy, Aravindh; Jandial, Ravi

    2011-01-01

    The performance of MMSE Iterative Equalization based on MAP-SBVP and COD-MAP algorithms (for generating extrinsic information) are compared for fading and non-fading communication channels employing serial concatenated convolution codes. MAP-SBVP is a convolution decoder using a conventional soft-MAP decoder followed by a soft-convolution encoder using the soft-boolean value propagation (SBVP). From the simulations it is observed that for MMSE Iterative Equalization, MAP-SBVP performance is comparable to COD-MAP for fading and non-fading channels.

  13. Dynamical Analysis of Protein Regulatory Network in Budding Yeast Nucleus

    Institute of Scientific and Technical Information of China (English)

    LI Fang-Ting; JIA Xun

    2006-01-01

    @@ Recent progresses in the protein regulatory network of budding yeast Saccharomyces cerevisiae have provided a global picture of its protein network for further dynamical research. We simplify and modularize the protein regulatory networks in yeast nucleus, and study the dynamical properties of the core 37-node network by a Boolean network model, especially the evolution steps and final fixed points. Our simulation results show that the number of fixed points N(k) for a given size of the attraction basin k obeys a power-law distribution N(k)∝k-2.024. The yeast network is more similar to a scale-free network than a random network in the above dynamical properties.

  14. Parallel processing of run-length-encoded Boolean imagery: RLE transformation, arithmetic, and global-reduce operations

    Science.gov (United States)

    Schmalz, Mark S.

    1993-09-01

    The processing of Boolean imagery compressed by runlength encoding (RLE) frequently exhibits greater computational efficiency than the processing of uncompressed imagery, due to the data reduction inherent in RLE. In a previous publication, we outlined general methods for developing operators that compute over RLE Boolean imagery. In this paper, we present sequential and parallel algorithms for a variety of operations over RLE imagery, including the customary arithmetic and logical Hadamard operations, as well as the global reduce functions of image sum and maximum. RLE neighborhood-based operations, as well as the more advanced RLE operations of linear transforms, connected component labelling, and pattern recognition are presented in the companion paper.

  15. pcaGoPromoter - An R Package for Biological and Regulatory Interpretation of Principal Components in Genome-Wide Gene Expression Data

    DEFF Research Database (Denmark)

    Hansen, Morten; Gerds, Thomas Alexander; Sedelin, Jacob Benedikt;

    2012-01-01

    Analyzing data obtained from genome-wide gene expression experiments is challenging due to the quantity of variables, the need for multivariate analyses, and the demands of managing large amounts of data. Here we present the R package pcaGoPromoter, which facilitates the interpretation of genome-...... a collection of tools for analyzing gene expression data. These tools give an overview of the input data via PCA, functional interpretation by gene ontology terms (biological processes), and an indication of the involvement of possible transcription factors.......Analyzing data obtained from genome-wide gene expression experiments is challenging due to the quantity of variables, the need for multivariate analyses, and the demands of managing large amounts of data. Here we present the R package pcaGoPromoter, which facilitates the interpretation of genome......-wide expression data and overcomes the aforementioned problems. In the first step, principal component analysis (PCA) is applied to survey any differences between experiments and possible groupings. The next step is the interpretation of the principal components with respect to both biological function...

  16. Implementation of Complete Boolean Logic Functions in Single Complementary Resistive Switch.

    Science.gov (United States)

    Gao, Shuang; Zeng, Fei; Wang, Minjuan; Wang, Guangyue; Song, Cheng; Pan, Feng

    2015-01-01

    The unique complementary switching behaviour of complementary resistive switches (CRSs) makes them very attractive for logic applications. The implementation of complete Boolean logic functions in a single CRS cell is certainly an extremely important step towards the commercialisation of related logic circuits, but it has not been accomplished to date. Here, we report two methods for the implementation of complete Boolean logic functions in a single CRS cell. The first method is based on the intrinsic switchable diode of a peculiar CRS cell that is composed of two anti-serial bipolar resistive switches with a rectifying high resistance state, while the second method is based directly on the complementary switching behaviour itself of any single CRS cell. The feasibilities of both methods have been theoretically predicted and then experimentally demonstrated on the basis of a Ta/Ta2O5/Pt/Ta2O5/Ta CRS cell. Therefore, these two methods-in particular the complementary switching behaviour itself-based method, which has natural immunity to the sneak-path issue of crossbar logic circuits-are believed to be capable of significantly advancing both our understanding and commercialization of related logic circuits. Moreover, peculiar CRS cells have been demonstrated to be feasible for tri-level storage, which can serve as an alternative method of realising ultra-high-density data storage.

  17. Antigen profiling analysis of vaccinia virus injected canine tumors: oncolytic virus efficiency predicted by boolean models.

    Science.gov (United States)

    Cecil, Alexander; Gentschev, Ivaylo; Adelfinger, Marion; Nolte, Ingo; Dandekar, Thomas; Szalay, Aladar A

    2014-01-01

    Virotherapy on the basis of oncolytic vaccinia virus (VACV) strains is a novel approach for cancer therapy. In this study we describe for the first time the use of dynamic boolean modeling for tumor growth prediction of vaccinia virus GLV-1h68-injected canine tumors including canine mammary adenoma (ZMTH3), canine mammary carcinoma (MTH52c), canine prostate carcinoma (CT1258), and canine soft tissue sarcoma (STSA-1). Additionally, the STSA-1 xenografted mice were injected with either LIVP 1.1.1 or LIVP 5.1.1 vaccinia virus strains.   Antigen profiling data of the four different vaccinia virus-injected canine tumors were obtained, analyzed and used to calculate differences in the tumor growth signaling network by type and tumor type. Our model combines networks for apoptosis, MAPK, p53, WNT, Hedgehog, TK cell, Interferon, and Interleukin signaling networks. The in silico findings conform with in vivo findings of tumor growth. Boolean modeling describes tumor growth and remission semi-quantitatively with a good fit to the data obtained for all cancer type variants. At the same time it monitors all signaling activities as a basis for treatment planning according to antigen levels. Mitigation and elimination of VACV- susceptible tumor types as well as effects on the non-susceptible type CT1258 are predicted correctly. Thus the combination of Antigen profiling and semi-quantitative modeling optimizes the therapy already before its start.

  18. Effective Boolean dynamics analysis to identify functionally important genes in large-scale signaling networks.

    Science.gov (United States)

    Trinh, Hung-Cuong; Kwon, Yung-Keun

    2015-11-01

    Efficiently identifying functionally important genes in order to understand the minimal requirements of normal cellular development is challenging. To this end, a variety of structural measures have been proposed and their effectiveness has been investigated in recent literature; however, few studies have shown the effectiveness of dynamics-based measures. This led us to investigate a dynamic measure to identify functionally important genes, and the effectiveness of which was verified through application on two large-scale human signaling networks. We specifically consider Boolean sensitivity-based dynamics against an update-rule perturbation (BSU) as a dynamic measure. Through investigations on two large-scale human signaling networks, we found that genes with relatively high BSU values show slower evolutionary rate and higher proportions of essential genes and drug targets than other genes. Gene-ontology analysis showed clear differences between the former and latter groups of genes. Furthermore, we compare the identification accuracies of essential genes and drug targets via BSU and five well-known structural measures. Although BSU did not always show the best performance, it effectively identified the putative set of genes, which is significantly different from the results obtained via the structural measures. Most interestingly, BSU showed the highest synergy effect in identifying the functionally important genes in conjunction with other measures. Our results imply that Boolean-sensitive dynamics can be used as a measure to effectively identify functionally important genes in signaling networks.

  19. Generalizations of Boolean imaging operations to the continuous-tone domain

    Science.gov (United States)

    Harrington, Steven J.

    1992-07-01

    In black-and-white printing the page image can be represented within a computer as an array of binary values indicating whether or not pixels should be inked. The Boolean operators of AND, OR, and EXCLUSIVE-OR are often used when adding new objects to the image array. For color printing the page may be represented as an array of `continuous-tone' color values, and the generalization of these logic functions to gray-scale or full-color images is, in general, not defined or understood. When incrementally composing a page image, new colors can replace old in an image buffer, or new colors and old can be combined according to some mixing function to form a composite color, which is stored. This paper examines the properties of the Boolean operations and suggests full-color functions that preserve the desired properties. These functions can be used to combine colored images in ways that preserve information about object shapes when the shapes overlap. The relationships between the proposed functions and physical models of color mixing are also discussed.

  20. (2,n) secret sharing scheme for gray and color images based on Boolean operation

    Institute of Scientific and Technical Information of China (English)

    DONG Lin; WANG DaoShun; LI ShunDong; DAI YiQi

    2012-01-01

    Traditional secret sharing (SS) schemes can reconstruct the secret precisely,but have high computation complexity.Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of contrast. Wang et al.proposed a (2,n)-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/2.In this paper,we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.'s binary (2,n)-SS scheme.Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image.The two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level processing.These proposed schemes have low computation complexity and almost ideal contrast.

  1. bent-negabent 函数的构造%Constructions of bent-negabent Boolean functions

    Institute of Scientific and Technical Information of China (English)

    卓泽朋; 崇金凤; 魏仕民

    2015-01-01

    给出了一种新的 negabent 函数的构造,基于此构造和已有的 bent 函数的构造,得到了一种 bent-negabent 函数的构造;分析了一类由4个函数级联所得函数的性质,给出了这类函数为 negabent 函数的必要条件;给出了bent-negabent 函数的一种直和构造。%A new method to construct negabent function was provided.Based on it,a construction of bent-negabent function was obtained.And then,the special Boolean function by concatenation was investigated.A necessary condi-tions for this Boolean function to be a negabent function was presented.Finally,the direct sum construction of bent-negabent function is given.

  2. A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs

    CERN Document Server

    Yamakami, Tomoyuki

    2010-01-01

    We determine the complexity of approximate counting of the total weight of assignments for complex-weighted Boolean constraint satisfaction problems (or CSPs), particularly, when degrees of instances are bounded from above by a given constant, provided that all arity-1 constraints are freely available. All degree-1 counting CSPs are solvable in polynomial time. When the degree is more than 2, we present a trichotomy theorem that classifies all bounded-degree counting CSPs into only three categories with a help of free arity-1 constraints. This classification extends to complex-weighted problems an earlier result of Dyer, Goldberg, Jalsenius, and Richerby (2010) on the complexity of the approximate counting of bounded-degree unweighted Boolean CSPs. The framework of the proof of our trichotomy theorem is based on a theory of signatures (Cai and Lu, 2007, 2008) used in Valiant's holographic algorithms. Despite the use of arbitrary complex-weight, our proof is rather elementary and intuitive by an extensive use ...

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

    Science.gov (United States)

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

  4. Boolean operations with implicit and parametric representation of primitives using R-functions.

    Science.gov (United States)

    Fougerolle, Yohan D; Gribok, Andrei; Foufou, Sebti; Truchetet, Frédéric; Abidi, Mongi A

    2005-01-01

    We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a Constructive Solid Geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition are used to refine an intermediary mesh around the intersection curves. The output is both an implicit equation and a mesh representing its solution. For the resulting object, an implicit equation with guaranteed differential properties is obtained by simple combinations of the primitives' implicit equations using R-functions. Depending on the chosen R-function, this equation is continuous and can be differentiable everywhere. The primitives' parametric representations are used to directly polygonize the resulting surface by generating vertices that belong exactly to the zero-set of the resulting implicit equation. The proposed approach has many potential applications, ranging from mechanical engineering to shape recognition and data compression. Examples of complex objects are presented and commented on to show the potential of our approach for shape modeling.

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

    Science.gov (United States)

    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.

  6. 高阶布尔网络的结构%Structure of higher order Boolean networks*

    Institute of Scientific and Technical Information of China (English)

    李志强; 赵寅; 程代展

    2011-01-01

    The higher order Boolean (control) network is introduced and its topological structure is studied.Using semi-tensor product of matrices,its dynamics is converted into two algebraic forms,which are standard discrete-time dynamic systems.The one-to-one correspondence of the network dynamics and its first algebraic form is proved,and certain topological structures,including fixed points,cycles,and transient time,of higher order Boolean (control) networks are revealed.The relationship between the original system and its second algebraic form is also studied.%介绍高阶布尔(控制)网络,并研究了其拓扑结构.以矩阵的半张量积作为工具,把高阶布尔网络的动态过程转化为2种标准离散事件动态系统的代数形式.证明了高阶布尔网络和第1代数形式的一一对应关系,并由此得到其拓扑结构(不动点、极限圈以及暂态期等).还研究了高阶布尔网络系统与它第2代数形式的关系.

  7. Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

    Directory of Open Access Journals (Sweden)

    Yih-Lon Lin

    2013-01-01

    Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

  8. On atomicity of free algebras in Boolean algebras with operators, and a new result on Pinter's free algebras

    OpenAIRE

    Ahmed, Tarek Sayed

    2013-01-01

    We give some general theorems on free algebras of varieties of Boolean algebras with operators; a hitherto new result is obtained for Pinter's substitution algebras. For n\\geq 3, and m>1, there is a generating set of the free algebra freely generated by m elements, which is not a free set of generators.

  9. Cytoskeletal logic: a model for molecular computation via Boolean operations in microtubules and microtubule-associated proteins.

    Science.gov (United States)

    Lahoz-Beltra, R; Hameroff, S R; Dayhoff, J E

    1993-01-01

    Adaptive behaviors and dynamic activities within living cells are organized by the cytoskeleton: intracellular networks of interconnected protein polymers which include microtubules (MTs), actin, intermediate filaments, microtubule associated proteins (MAPs) and other protein structures. Cooperative interactions among cytoskeletal protein subunit conformational states have been used to model signal transmission and information processing. In the present work we present a theoretical model for molecular computing in which Boolean logic is implemented in parallel networks of individual MTs interconnected by MAPs. Conformational signals propagate on MTs as in data buses and in the model MAPs are considered as Boolean operators, either as bit-lines (like MTs) where a signal can be transported unchanged between MTs ('BUS-MAP'), or as bit-lines where a Boolean operation is performed in one of the two MAP-MT attachments ('LOGIC-MAP'). Three logic MAPs have been defined ('NOT-MAP, 'AND-MAP', 'XOR-MAP') and used to demonstrate addition, subtraction and other arithmetic operations. Although our choice of Boolean logic is arbitrary, the simulations demonstrate symbolic manipulation in a connectionist system and suggest that MT-MAP networks can perform computation in living cells and are candidates for future molecular computing devices. PMID:8318677

  10. Fractal analysis as a complementary approach to predict the stability of drug delivery nano systems in aqueous and biological media: a regulatory proposal or a dream?

    Science.gov (United States)

    Demetzos, Costas; Pippa, Natassa

    2014-10-01

    The morphology of drug nanocarriers correlates with their functionality, which is mainly shuttled on their surface where most of the interactions and interfacial phenomena occur. The quantification of their morphological fingerprint requires an analytical tool that should be established based on experimental data and can be correlated with their stability. The morphological quantification picture of the advanced Drug Delivery nano Systems (aDDnSs) could be achieved via fractal analysis and by introducing a novel proposed parameter, defined as ωD. This parameter is based on mathematical limits determined experimentally and on already existing theories on the colloidal fractal aggregation process which can correlate the morphological characteristics of aDDnSs with their physicochemical stability in aqueous and biological media. This review article proposes the fractal analysis and the ωD as an analytical tool and prediction parameter, respectively, which are able to promote an attractive and alternative path for studying drug delivery nanocarriers. Moreover, these approaches could facilitate the scale up process of pharmaceutical industry, and could shed more light in the quantification of drug delivery nanosystems.

  11. The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks.

    Science.gov (United States)

    Greenbury, Sam F; Johnston, Iain G; Smith, Matthew A; Doye, Jonathan P K; Louis, Ard A

    2010-11-01

    We investigate how scale-free (SF) and Erdos-Rényi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we find that networks with SF(in) topologies, that is SF topology for incoming nodes and ER topology for outgoing nodes, are significantly more evolvable towards specific oscillatory targets than networks with ER topology for both incoming and outgoing nodes. Similar results are found for networks with SF(both) and SF(out) topologies. The functionality of the SF(out) topology, which most closely resembles the structure of biological gene networks (Babu et al., 2004), is compared to the ER topology in further detail through an extension to multiple target outputs, with either an oscillatory or a non-oscillatory nature. For multiple oscillatory targets of the same length, the differences between SF(out) and ER networks are enhanced, but for non-oscillatory targets both types of networks show fairly similar evolvability. We find that SF networks generate oscillations much more easily than ER networks do, and this may explain why SF networks are more evolvable than ER networks are for oscillatory phenotypes. In spite of their greater evolvability, we find that networks with SF(out) topologies are also more robust to mutations (mutational robustness) than ER networks. Furthermore, the SF(out) topologies are more robust to changes in initial conditions (environmental robustness). For both topologies, we find that once a population of networks has reached the target state, further neutral evolution can lead to an increase in both the mutational robustness and the environmental robustness to changes in initial conditions.

  12. Regulatory Snapshots: integrative mining of regulatory modules from expression time series and regulatory networks.

    Science.gov (United States)

    Gonçalves, Joana P; Aires, Ricardo S; Francisco, Alexandre P; Madeira, Sara C

    2012-01-01

    Explaining regulatory mechanisms is crucial to understand complex cellular responses leading to system perturbations. Some strategies reverse engineer regulatory interactions from experimental data, while others identify functional regulatory units (modules) under the assumption that biological systems yield a modular organization. Most modular studies focus on network structure and static properties, ignoring that gene regulation is largely driven by stimulus-response behavior. Expression time series are key to gain insight into dynamics, but have been insufficiently explored by current methods, which often (1) apply generic algorithms unsuited for expression analysis over time, due to inability to maintain the chronology of events or incorporate time dependency; (2) ignore local patterns, abundant in most interesting cases of transcriptional activity; (3) neglect physical binding or lack automatic association of regulators, focusing mainly on expression patterns; or (4) limit the discovery to a predefined number of modules. We propose Regulatory Snapshots, an integrative mining approach to identify regulatory modules over time by combining transcriptional control with response, while overcoming the above challenges. Temporal biclustering is first used to reveal transcriptional modules composed of genes showing coherent expression profiles over time. Personalized ranking is then applied to prioritize prominent regulators targeting the modules at each time point using a network of documented regulatory associations and the expression data. Custom graphics are finally depicted to expose the regulatory activity in a module at consecutive time points (snapshots). Regulatory Snapshots successfully unraveled modules underlying yeast response to heat shock and human epithelial-to-mesenchymal transition, based on regulations documented in the YEASTRACT and JASPAR databases, respectively, and available expression data. Regulatory players involved in functionally enriched

  13. Regulatory Snapshots: integrative mining of regulatory modules from expression time series and regulatory networks.

    Directory of Open Access Journals (Sweden)

    Joana P Gonçalves

    Full Text Available Explaining regulatory mechanisms is crucial to understand complex cellular responses leading to system perturbations. Some strategies reverse engineer regulatory interactions from experimental data, while others identify functional regulatory units (modules under the assumption that biological systems yield a modular organization. Most modular studies focus on network structure and static properties, ignoring that gene regulation is largely driven by stimulus-response behavior. Expression time series are key to gain insight into dynamics, but have been insufficiently explored by current methods, which often (1 apply generic algorithms unsuited for expression analysis over time, due to inability to maintain the chronology of events or incorporate time dependency; (2 ignore local patterns, abundant in most interesting cases of transcriptional activity; (3 neglect physical binding or lack automatic association of regulators, focusing mainly on expression patterns; or (4 limit the discovery to a predefined number of modules. We propose Regulatory Snapshots, an integrative mining approach to identify regulatory modules over time by combining transcriptional control with response, while overcoming the above challenges. Temporal biclustering is first used to reveal transcriptional modules composed of genes showing coherent expression profiles over time. Personalized ranking is then applied to prioritize prominent regulators targeting the modules at each time point using a network of documented regulatory associations and the expression data. Custom graphics are finally depicted to expose the regulatory activity in a module at consecutive time points (snapshots. Regulatory Snapshots successfully unraveled modules underlying yeast response to heat shock and human epithelial-to-mesenchymal transition, based on regulations documented in the YEASTRACT and JASPAR databases, respectively, and available expression data. Regulatory players involved in

  14. Reservoir computing with a single time-delay autonomous Boolean node.

    Science.gov (United States)

    Haynes, Nicholas D; Soriano, Miguel C; Rosin, David P; Fischer, Ingo; Gauthier, Daniel J

    2015-02-01

    We demonstrate reservoir computing with a physical system using a single autonomous Boolean logic element with time-delay feedback. The system generates a chaotic transient with a window of consistency lasting between 30 and 300 ns, which we show is sufficient for reservoir computing. We then characterize the dependence of computational performance on system parameters to find the best operating point of the reservoir. When the best parameters are chosen, the reservoir is able to classify short input patterns with performance that decreases over time. In particular, we show that four distinct input patterns can be classified for 70 ns, even though the inputs are only provided to the reservoir for 7.5 ns.

  15. ON THE SPECIFIC AREA OF INHOMOGENEOUS BOOLEAN MODELS. EXISTENCE RESULTS AND APPLICATIONS

    Directory of Open Access Journals (Sweden)

    Elena Villa

    2011-05-01

    Full Text Available The problem of the evaluation of the so-called specific area of a random closed set, in connection with its mean boundary measure, is mentioned in the classical book by Matheron on random closed sets (Matheron, 1975, p. 50; it is still an open problem, in general. We offer here an overview of some recent results concerning the existence of the specific area of inhomogeneous Boolean models, unifying results from geometric measure theory and from stochastic geometry. A discussion of possible applications to image analysis concerning the estimation of the mean surface density of random closed sets, and, in particular, to material science concerning birth-and-growth processes, is also provided.

  16. Identification of potential artificial groundwater recharge zones in Northwestern Saudi Arabia using GIS and Boolean logic

    Science.gov (United States)

    Zaidi, Faisal K.; Nazzal, Yousef; Ahmed, Izrar; Naeem, Muhammad; Jafri, Muhammad Kamran

    2015-11-01

    Identifying potential groundwater recharge zones is a pre-requisite for any artificial recharge project. The present study focuses on identifying the potential zones of Artificial Groundwater Recharge (AGR) in Northwestern Saudi Arabia. Parameters including slope, soil texture, vadose zone thickness, groundwater quality (TDS) and type of water bearing formation were integrated in a GIS environment using Boolean logic. The results showed that 17.90% of the total studied area is suitable for AGR. The identified zones were integrated with the land use/land cover map to avoid agricultural and inhabited lands which reduced the total potential area to 14.24%. Geomorphologically the wadi beds are the most suitable sites for recharge. On the basis of the potential AGR zones closeness to the available recharge water supply (rain water, desalinated sea water and treated waste water) the potential zones were classified as Category A (high priority) and Category B (low priority).

  17. The universal magnetic tunnel junction logic gates representing 16 binary Boolean logic operations

    Science.gov (United States)

    Lee, Junwoo; Suh, Dong Ik; Park, Wanjun

    2015-05-01

    The novel devices are expected to shift the paradigm of a logic operation by their own nature, replacing the conventional devices. In this study, the nature of our fabricated magnetic tunnel junction (MTJ) that responds to the two external inputs, magnetic field and voltage bias, demonstrated seven basic logic operations. The seven operations were obtained by the electric-field-assisted switching characteristics, where the surface magnetoelectric effect occurs due to a sufficiently thin free layer. The MTJ was transformed as a universal logic gate combined with three supplementary circuits: A multiplexer (MUX), a Wheatstone bridge, and a comparator. With these circuits, the universal logic gates demonstrated 16 binary Boolean logic operations in one logic stage. A possible further approach is parallel computations through a complimentary of MUX and comparator, capable of driving multiple logic gates. A reconfigurable property can also be realized when different logic operations are produced from different level of voltages applying to the same configuration of the logic gate.

  18. Combined spatial filtering and Boolean operators applied to the processing of real images

    Science.gov (United States)

    Feltmate, B. E.

    1982-06-01

    Several new and seemingly successful scene analysis techniques for application to real image processing are presented. These techniques consist of particular combinations of spatial low pass filtering, global thresholding and Boolean operators, specifically the AND, OR and NOT operators. These combinatorial operators, hereafter referred to as the Boolpass operators, perform the task of picture energy/information reduction, while retaining the fundamental picture primitives such as edges which characterize the images. Over 150 figures are included which illustrate the results obtained from application of the Boolpass techniques to eight different natural scenes. These results indicate that the Boolpass operators do display great potential as important components of a larger more comprehensive pattern recognition machine. Such a machine would encompass further processing (for target classification/recognition) of the resulting Boolpass operator information.

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

    Science.gov (United States)

    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.

  20. Ones and zeros understanding Boolean algebra digital circuits and the logic of sets

    CERN Document Server

    Gregg, John

    1998-01-01

    "Ones and Zeros explains, in lay terms, Boolean algebra, the suprisingly simple system of mathematical logic used in digital computer circuitry. Ones and Zeros follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. Readers will learn about the interesting history of the development of symbolic logic in particular, and the often misunderstood process of mathematical invention and scientific discovery, in general. Ones and Zeros also features practical exercises with answers, real-world examples of digital circuit design, and a reading list." "Ones and Zeros will be of particular interest to software engineers who want to gain a comprehensive understanding of computer hardware." "Outstanding features include: a history of mathematical logic, an explanation of the logic of digital circuits, and hands-on exercises and examples."--Jacket.

  1. Decisional Processes with Boolean Neural Network: the Emergence of Mental Schemes

    CERN Document Server

    Barnabei, Graziano; Conversano, Ciro; Lensi, Elena

    2010-01-01

    Human decisional processes result from the employment of selected quantities of relevant information, generally synthesized from environmental incoming data and stored memories. Their main goal is the production of an appropriate and adaptive response to a cognitive or behavioral task. Different strategies of response production can be adopted, among which haphazard trials, formation of mental schemes and heuristics. In this paper, we propose a model of Boolean neural network that incorporates these strategies by recurring to global optimization strategies during the learning session. The model characterizes as well the passage from an unstructured/chaotic attractor neural network typical of data-driven processes to a faster one, forward-only and representative of schema-driven processes. Moreover, a simplified version of the Iowa Gambling Task (IGT) is introduced in order to test the model. Our results match with experimental data and point out some relevant knowledge coming from psychological domain.

  2. Qualitative mathematical modelling of coupled coast and estuary morphodynamics: a modified Boolean network approach

    Science.gov (United States)

    French, J.; Burningham, H.

    2011-12-01

    A major challenge in coastal geomorphology is the prediction of morphological change at a meso-scale (10 to 100 km; 10 to 100 yr). This scale sits awkwardly between understanding of geomorphological processes at the micro-scale, and broader aspects of coastal evolution informed by the Holocene stratigraphic record. In this paper, we explore the potential of a new kind of qualitative mathematical model implemented at a system level. Qualitative models derive predictions from the structure of the system rather from the detailed physics of the underlying processes. Although systems thinking is well established in geomorphology methodologies for converting system diagrams into simulation tools have not been widely investigated. In a recent Defra-funded project in the UK, a Boolean network approach was piloted and applied to the simulation of generic aspects of estuary response to environmental and anthropogenic forcing. We build on this to present a generic approach to the construction of system diagrams for estuaries and adjacent open coasts and their conversion into a network graph. In a Boolean model, each node of this graph is assigned a binary value, the state of which is determined by a logical function that specifies the combined influence of other nodes to which it is connected. System evolution is simulated by specifying a set of initial conditions and repeatedly evaluating the logical functions until an equilibrium condition is reached (either a steady state or a cyclical sequence between two end states). In our enhanced Boolean scheme, changes in morphology are allowed to feed back into intrinsic process variables (e.g. estuary waves or tidal prism), although some processes are externally imposed (e.g. sea-level rise). Arbitrary time lags condition the response of morphology to a change in process, such that some landforms adjust more rapidly than others. We also present a simulator architecture based around a solver and externally specified model components

  3. 16 Boolean logics in three steps with two anti-serially connected memristors

    Science.gov (United States)

    Zhou, Yaxiong; Li, Yi; Xu, Lei; Zhong, Shujing; Sun, Huajun; Miao, Xiangshui

    2015-06-01

    Memristor based logic gates that can execute memory and logic operations are regarded as building blocks for non Von Neumann computation architecture. In this letter, Ta/GeTe/Ag memristors were fabricated and showed reproducible binary switches between high-resistance and low-resistance states. Utilizing a structure with two anti-serially connected memristors, we propose a logic operation methodology, based on which arbitrary Boolean logic can be realized in three steps, and the logic result can be nonvolatilely stored. A functionally complete logic operation: NAND is further verified by HSPICE simulation and experiments. The implementation of logic-in-memory unit may stimulate the development of future massive parallel computing.

  4. On the Extension of Pseudo-Boolean Functions for the Aggregation of Interacting Criteria

    CERN Document Server

    Grabisch, Michel; Vansnick, Jean-Claude

    2008-01-01

    The paper presents an analysis on the use of integrals defined for non-additive measures (or capacities) as the Choquet and the \\Sipos{} integral, and the multilinear model, all seen as extensions of pseudo-Boolean functions, and used as a means to model interaction between criteria in a multicriteria decision making problem. The emphasis is put on the use, besides classical comparative information, of information about difference of attractiveness between acts, and on the existence, for each point of view, of a ``neutral level'', allowing to introduce the absolute notion of attractive or repulsive act. It is shown that in this case, the Sipos integral is a suitable solution, although not unique. Properties of the Sipos integral as a new way of aggregating criteria are shown, with emphasis on the interaction among criteria.

  5. Order-to-chaos transition in the hardness of random Boolean satisfiability problems

    Science.gov (United States)

    Varga, Melinda; Sumi, Róbert; Toroczkai, Zoltán; Ercsey-Ravasz, Mária

    2016-05-01

    Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical systems as diverse as fluids, chemical reactions, and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of constraint satisfaction problems that include scheduling, circuit design, routing, database problems, and even Sudoku. In particular, we present a study of the emergence of hardness in Boolean satisfiability (k -SAT), a canonical class of constraint satisfaction problems, by using an analog deterministic algorithm based on a system of ordinary differential equations. Problem hardness is defined through the escape rate κ , an invariant measure of transient chaos of the dynamical system corresponding to the analog algorithm, and it expresses the rate at which the trajectory approaches a solution. We show that for a given density of constraints and fixed number of Boolean variables N , the hardness of formulas in random k -SAT ensembles has a wide variation, approximable by a lognormal distribution. We also show that when increasing the density of constraints α , hardness appears through a second-order phase transition at αχ in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic. A similar behavior is found in 4-SAT as well, however, such a transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter κ ˜NB |α - αχ|1-γ with 0 <γ <1 . We demonstrate that the transition is generated by the appearance of metastable basins in the solution space as the density of constraints α is increased.

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

    Science.gov (United States)

    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.

  7. A universal algorithm for genome-wide in silicio identification of biologically significant gene promoter putative cis-regulatory-elements; identification of new elements for reactive oxygen species and sucrose signaling in Arabidopsis.

    Science.gov (United States)

    Geisler, Matt; Kleczkowski, Leszek A; Karpinski, Stanislaw

    2006-02-01

    Short motifs of many cis-regulatory elements (CREs) can be found in the promoters of most Arabidopsis genes, and this raises the question of how their presence can confer specific regulation. We developed a universal algorithm to test the biological significance of CREs by first identifying every Arabidopsis gene with a CRE and then statistically correlating the presence or absence of the element with the gene expression profile on multiple DNA microarrays. This algorithm was successfully verified for previously characterized abscisic acid, ethylene, sucrose and drought responsive CREs in Arabidopsis, showing that the presence of these elements indeed correlates with treatment-specific gene induction. Later, we used standard motif sampling methods to identify 128 putative motifs induced by excess light, reactive oxygen species and sucrose. Our algorithm was able to filter 20 out of 128 novel CREs which significantly correlated with gene induction by either heat, reactive oxygen species and/or sucrose. The position, orientation and sequence specificity of CREs was tested in silicio by analyzing the expression of genes with naturally occurring sequence variations. In three novel CREs the forward orientation correlated with sucrose induction and the reverse orientation with sucrose suppression. The functionality of the predicted novel CREs was experimentally confirmed using Arabidopsis cell-suspension cultures transformed with short promoter fragments or artificial promoters fused with the GUS reporter gene. Our genome-wide analysis opens up new possibilities for in silicio verification of the biological significance of newly discovered CREs, and allows for subsequent selection of such CREs for experimental studies.

  8. Toxicogenomics in regulatory ecotoxicology

    Science.gov (United States)

    Ankley, Gerald T.; Daston, George P.; Degitz, Sigmund J.; Denslow, Nancy D.; Hoke, Robert A.; Kennedy, Sean W.; Miracle, Ann L.; Perkins, Edward J.; Snape, Jason; Tillitt, Donald E.; Tyler, Charles R.; Versteeg, Donald

    2006-01-01

    Recently, we have witnessed an explosion of different genomic approaches that, through a combination of advanced biological, instrumental, and bioinformatic techniques, can yield a previously unparalleled amount of data concerning the molecular and biochemical status of organisms. Fueled partially by large, well-publicized efforts such as the Human Genome Project, genomic research has become a rapidly growing topical area in multiple biological disciplines. Since 1999, when the term “toxicogenomics” was coined to describe the application of genomics to toxicology (1), a rapid increase in publications on the topic has occurred (Figure 1). The potential utility of toxicogenomics in toxicological research and regulatory activities has been the subject of scientific discussions and, as with any new technology, has evoked a wide range of opinion (2–6). VIEWPOINT © 2006 american chemical Society july 1, 2006 / EnvironmEntal SciEncE & tEchnology n 4055 The purpose of this feature article is to consider the roles of toxicogenomics in the field of regulatory ecotoxicology, explore current limitations in the science and practice of genomics, and propose possible avenues to approach and resolve some of the major challenges. A significant amount of input to our analysis came from a workshop sponsored by the Society of Environmental Toxicology and Chemistry (SETAC) in Pellston, Mich., in September 2005. A complete list of names and affiliations of the experts participating in that workshop is provided online in Table 1 of the Supporting Information for this paper.

  9. Smart Detector Cell: A Scalable All-Spin Circuit for Low Power Non-Boolean Pattern Recognition

    Science.gov (United States)

    Aghasi, Hamidreza; Iraei, Rouhollah Mousavi; Naeemi, Azad; Afshari, Ehsan

    2016-05-01

    We present a new circuit for non-Boolean recognition of binary images. Employing all-spin logic (ASL) devices, we design logic comparators and non-Boolean decision blocks for compact and efficient computation. By manipulation of fan-in number in different stages of the circuit, the structure can be extended for larger training sets or larger images. Operating based on the mainly similarity idea, the system is capable of constructing a mean image and compare it with a separate input image within a short decision time. Taking advantage of the non-volatility of ASL devices, the proposed circuit is capable of hybrid memory/logic operation. Compared with existing CMOS pattern recognition circuits, this work achieves a smaller footprint, lower power consumption, faster decision time and a lower operational voltage. To the best of our knowledge, this is the first fully spin-based complete pattern recognition circuit demonstrated using spintronic devices.

  10. 伪布尔链上的α、β算子%α,β Operators on Quasi-Boolean Chain

    Institute of Scientific and Technical Information of China (English)

    刘树人; 成央金

    2001-01-01

    At first,we propose the α operator and βoperator on quasi-boolean chain.Next investigate their properties and apply them to solve inqualities in one unknown.%提出了伪布尔链上的α和β算子,研究了它们的性质并应用这两种算子求解含一个变量的不等式.

  11. Boolean modeling of neural systems with point-process inputs and outputs. Part I: theory and simulations.

    Science.gov (United States)

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

    2009-08-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

  12. 在仿射等价类中找具有好的密码学性质的布尔函数%Find Better Boolean Functions in the Affine Equivalence Class

    Institute of Scientific and Technical Information of China (English)

    陈卫红; 李娜

    2005-01-01

    The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this paper to find Boolean functions with higherorder correlation immunity or satisfying higher order propagation criterion in an affine equiv-alence class. 8 AES s-box functions are not better Boolean functions in their affine equiva-lence class.

  13. Boolean and brain-inspired computing using spin-transfer torque devices

    Science.gov (United States)

    Fan, Deliang

    Several completely new approaches (such as spintronic, carbon nanotube, graphene, TFETs, etc.) to information processing and data storage technologies are emerging to address the time frame beyond current Complementary Metal-Oxide-Semiconductor (CMOS) roadmap. The high speed magnetization switching of a nano-magnet due to current induced spin-transfer torque (STT) have been demonstrated in recent experiments. Such STT devices can be explored in compact, low power memory and logic design. In order to truly leverage STT devices based computing, researchers require a re-think of circuit, architecture, and computing model, since the STT devices are unlikely to be drop-in replacements for CMOS. The potential of STT devices based computing will be best realized by considering new computing models that are inherently suited to the characteristics of STT devices, and new applications that are enabled by their unique capabilities, thereby attaining performance that CMOS cannot achieve. The goal of this research is to conduct synergistic exploration in architecture, circuit and device levels for Boolean and brain-inspired computing using nanoscale STT devices. Specifically, we first show that the non-volatile STT devices can be used in designing configurable Boolean logic blocks. We propose a spin-memristor threshold logic (SMTL) gate design, where memristive cross-bar array is used to perform current mode summation of binary inputs and the low power current mode spintronic threshold device carries out the energy efficient threshold operation. Next, for brain-inspired computing, we have exploited different spin-transfer torque device structures that can implement the hard-limiting and soft-limiting artificial neuron transfer functions respectively. We apply such STT based neuron (or 'spin-neuron') in various neural network architectures, such as hierarchical temporal memory and feed-forward neural network, for performing "human-like" cognitive computing, which show more than

  14. Realisation of all 16 Boolean logic functions in a single magnetoresistance memory cell

    Science.gov (United States)

    Gao, Shuang; Yang, Guang; Cui, Bin; Wang, Shouguo; Zeng, Fei; Song, Cheng; Pan, Feng

    2016-06-01

    Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis loop. These results may provide a helpful solution for the final commercialisation of MRAM-based stateful logic circuits in the near future.Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis

  15. Synthetic biological networks

    International Nuclear Information System (INIS)

    Despite their obvious relationship and overlap, the field of physics is blessed with many insightful laws, while such laws are sadly absent in biology. Here we aim to discuss how the rise of a more recent field known as synthetic biology may allow us to more directly test hypotheses regarding the possible design principles of natural biological networks and systems. In particular, this review focuses on synthetic gene regulatory networks engineered to perform specific functions or exhibit particular dynamic behaviors. Advances in synthetic biology may set the stage to uncover the relationship of potential biological principles to those developed in physics. (review article)

  16. Qualitative networks: a symbolic approach to analyze biological signaling networks

    Directory of Open Access Journals (Sweden)

    Henzinger Thomas A

    2007-01-01

    Full Text Available Abstract Background A central goal of Systems Biology is to model and analyze biological signaling pathways that interact with one another to form complex networks. Here we introduce Qualitative networks, an extension of Boolean networks. With this framework, we use formal verification methods to check whether a model is consistent with the laboratory experimental observations on which it is based. If the model does not conform to the data, we suggest a revised model and the new hypotheses are tested in-silico. Results We consider networks in which elements range over a small finite domain allowing more flexibility than Boolean values, and add target functions that allow to model a rich set of behaviors. We propose a symbolic algorithm for analyzing the steady state of these networks, allowing us to scale up to a system consisting of 144 elements and state spaces of approximately 1086 states. We illustrate the usefulness of this approach through a model of the interaction between the Notch and the Wnt signaling pathways in mammalian skin, and its extensive analysis. Conclusion We introduce an approach for constructing computational models of biological systems that extends the framework of Boolean networks and uses formal verification methods for the analysis of the model. This approach can scale to multicellular models of complex pathways, and is therefore a useful tool for the analysis of complex biological systems. The hypotheses formulated during in-silico testing suggest new avenues to explore experimentally. Hence, this approach has the potential to efficiently complement experimental studies in biology.

  17. Damage spreading in spatial and small-world random boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Qiming [Los Alamos National Laboratory; Teuscher, Christof [Los Alamos National Laboratory

    2008-01-01

    Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.

  18. Order-to-chaos transition in the hardness of random Boolean satisfiability problems

    Science.gov (United States)

    Varga, Melinda; Sumi, Robert; Ercsey-Ravasz, Maria; Toroczkai, Zoltan

    Transient chaos is a phenomenon characterizing the dynamics of phase space trajectories evolving towards an attractor in physical systems. We show that transient chaos also appears in the dynamics of certain algorithms searching for solutions of constraint satisfaction problems (e.g., Sudoku). We present a study of the emergence of hardness in Boolean satisfiability (k-SAT) using an analog deterministic algorithm. Problem hardness is defined through the escape rate κ, an invariant measure of transient chaos, and it expresses the rate at which the trajectory approaches a solution. We show that the hardness in random k-SAT ensembles has a wide variation approximable by a lognormal distribution. We also show that when increasing the density of constraints α, hardness appears through a second-order phase transition at αc in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic, however, such transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter. We demonstrate that the transition is generated by the appearance of non-solution basins in the solution space as the density of constraints is increased.

  19. Construction of a fuzzy and Boolean logic gates based on DNA.

    Science.gov (United States)

    Zadegan, Reza M; Jepsen, Mette D E; Hildebrandt, Lasse L; Birkedal, Victoria; Kjems, Jørgen

    2015-04-17

    Logic gates are devices that can perform logical operations by transforming a set of inputs into a predictable single detectable output. The hybridization properties, structure, and function of nucleic acids can be used to make DNA-based logic gates. These devices are important modules in molecular computing and biosensing. The ideal logic gate system should provide a wide selection of logical operations, and be integrable in multiple copies into more complex structures. Here we show the successful construction of a small DNA-based logic gate complex that produces fluorescent outputs corresponding to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics.

  20. Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain.

    Science.gov (United States)

    Frolov, Alexander A; Húsek, Dušan; Polyakov, Pavel Yu

    2016-03-01

    An usual task in large data set analysis is searching for an appropriate data representation in a space of fewer dimensions. One of the most efficient methods to solve this task is factor analysis. In this paper, we compare seven methods for Boolean factor analysis (BFA) in solving the so-called bars problem (BP), which is a BFA benchmark. The performance of the methods is evaluated by means of information gain. Study of the results obtained in solving BP of different levels of complexity has allowed us to reveal strengths and weaknesses of these methods. It is shown that the Likelihood maximization Attractor Neural Network with Increasing Activity (LANNIA) is the most efficient BFA method in solving BP in many cases. Efficacy of the LANNIA method is also shown, when applied to the real data from the Kyoto Encyclopedia of Genes and Genomes database, which contains full genome sequencing for 1368 organisms, and to text data set R52 (from Reuters 21578) typically used for label categorization.

  1. Boolean operations of STL models based on edge-facet intersection

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    For the data processing of the Rapid Prototyping Manufacturing, Boolean operation can offer a versatile tool for editing or modifying the STL model, adding the artificial construction, and creating the complex assistant support structure to meet the special technical requests. The topological structure of STL models was built firstly in order to obtain the neighborhood relationship among the triangular facets. The intersection test between every edge of one solid and every facet of another solid Was taken to get the intersection points. According to the matching relationship of the triangle index recorded in the data structure of the intersection points, the intersection segments array and the intersection loop were traced out. Each intersected triangle was subdivided by the Constrained Delaunay Triangulations. The intersected surfaces were divided into several surface patches along the intersection loops. The inclusion prediction between the surface patch and the other solid was taken by testing whether the candidate point Was inside or outside the solid region of the slice. Detecting the loops for determination of the valid intersection lines greatly increases the efficiency and the reliability of the process.

  2. Quantum-state filtering applied to the discrimination of Boolean functions

    CERN Document Server

    Bergou, J A; Bergou, Janos A.; Hillery, Mark

    2005-01-01

    Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum state filtering. We derived previously the optimal strategy for the case of N non-orthogonal states, {|\\psi_{1} >, ..., |\\psi_{N} >}, for distinguishing |\\psi_1 > from the set {|\\psi_2 >, ..., |\\psi_N >} and the corresponding optimal success and failure probabilities. In a previous paper [PRL 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill in the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algor...

  3. Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas

    CERN Document Server

    Giunchiglia, E; Tacchella, A; 10.1613/jair.1959

    2011-01-01

    Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as a set of clauses. Deduction starts by inferring new clauses by resolution, and goes on until the empty clause is generated or satisfiability of the set of clauses is proven, e.g., because no new clauses can be generated. In this paper, we restrict our attention to the problem of evaluating Quantified Boolean Formulas (QBFs). In this setting, the above outlined deduction process is known to be sound and complete if given a formula in CNF and if a form of resolution, called Q-resolution, is used. We introduce Q-resolution on terms, to be used for formulas in disjunctive normal form. We show that the computation performed by most of the available procedures for QBFs --based on the Davis-Logemann-Loveland procedure (DLL) for propositional satisfiability-- corresponds to a tree...

  4. Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions.

    Science.gov (United States)

    Sezener, Can Eren; Oztop, Erhan

    2015-08-01

    Boolean functions (BFs) are central in many fields of engineering and mathematics, such as cryptography, circuit design, and combinatorics. Moreover, they provide a simple framework for studying neural computation mechanisms of the brain. Many representation schemes for BFs exist to satisfy the needs of the domain they are used in. In neural computation, it is of interest to know how many input lines a neuron would need to represent a given BF. A common BF representation to study this is the so-called polynomial sign representation where [Formula: see text] and 1 are associated with true and false, respectively. The polynomial is treated as a real-valued function and evaluated at its parameters, and the sign of the polynomial is then taken as the function value. The number of input lines for the modeled neuron is exactly the number of terms in the polynomial. This letter investigates the minimum number of terms, that is, the minimum threshold density, that is sufficient to represent a given BF and more generally aims to find the maximum over this quantity for all BFs in a given dimension. With this work, for the first time exact results for four- and five-variable BFs are obtained, and strong bounds for six-variable BFs are derived. In addition, some connections between the sign representation framework and bent functions are derived, which are generally studied for their desirable cryptographic properties.

  5. Memory-Based Boolean Game and Self-Organized Phenomena on Networks

    Institute of Scientific and Technical Information of China (English)

    HUANG Zi-Gang; WU Zhi-Xi; GUAN Jian-Yue; WANG Ying-Hai

    2006-01-01

    @@ We study a memory-based Boolean game (MBBG) taking place on a regular ring, wherein each agent acts according to its local optimal states of the last M time steps recorded in memory, and the agents in the minority are rewarded. One free parameter p between 0 and 1 is introduced to denote the strength of the agent willing to make a decision according to its memory. It is found that giving proper willing strength p, the MBBG system can spontaneously evolve to a state of performance better than the random game; while for larger p, the herd behaviour emerges to reduce the system profit. By analysing the dependence of dynamics of the system on the memory capacity M, we find that a higher memory capacity favours the emergence of the better performance state, and effectively restrains the herd behaviour, thus increases the system profit. Considering the high cost of long-time memory, the enhancement of memory capacity for restraining the herd behaviour is also discussed,and M = 5 is suggested to be a good choice.

  6. Computer-aided design of modular protein devices: Boolean AND gene activation

    Science.gov (United States)

    Salis, H.; Kaznessis, Y. N.

    2006-12-01

    Many potentially useful synthetic gene networks require the expression of an engineered gene if and only if two different DNA-binding proteins exist in sufficient concentration. While some natural and engineered systems activate gene expression according to a logical AND-like behavior, they often utilize allosteric or cooperative protein-protein interactions, rendering their components unsuitable for a toolbox of modular parts for use in multiple applications. Here, we develop a quantitative model to demonstrate that a small system of interacting fusion proteins, called a protein device, can activate an engineered gene according to the Boolean AND behavior while using only modular protein domains and DNA sites. The fusion proteins are created from transactivating, DNA-binding, non-DNA binding, and protein-protein interaction domains along with the corresponding peptide ligands. Using a combined kinetic and thermodynamic model, we identify the characteristics of the molecular components and their rates of constitutive production that maximize the fidelity of AND behavior. These AND protein devices facilitate the creation of complex genetic programs and may be used to create gene therapies, biosensors and other biomedical and biotechnological applications that turn on gene expression only when multiple DNA-binding proteins are simultaneously present.

  7. Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms

    Science.gov (United States)

    Tamura, Takeyuki; Akutsu, Tatsuya

    The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor, which is also called a fixed point, is NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where singleton attractors correspond to steady states. Though a naive algorithm can detect a singleton attractor for an AND/OR BN in O(n 2n) time, no O((2-ε)n) (ε > 0) time algorithm was known even for an AND/OR BN with non-restricted indegree, where n is the number of nodes in a BN. In this paper, we present an O(1.787n) time algorithm for detecting a singleton attractor of a given AND/OR BN, along with related results. We also show that detection of a singleton attractor in a BN with maximum indegree two is NP-hard and can be polynomially reduced to a satisfiability problem.

  8. Modelling Nonstationary Gene Regulatory Processes

    Directory of Open Access Journals (Sweden)

    Marco Grzegorcyzk

    2010-01-01

    Full Text Available An important objective in systems biology is to infer gene regulatory networks from postgenomic data, and dynamic Bayesian networks have been widely applied as a popular tool to this end. The standard approach for nondiscretised data is restricted to a linear model and a homogeneous Markov chain. Recently, various generalisations based on changepoint processes and free allocation mixture models have been proposed. The former aim to relax the homogeneity assumption, whereas the latter are more flexible and, in principle, more adequate for modelling nonlinear processes. In our paper, we compare both paradigms and discuss theoretical shortcomings of the latter approach. We show that a model based on the changepoint process yields systematically better results than the free allocation model when inferring nonstationary gene regulatory processes from simulated gene expression time series. We further cross-compare the performance of both models on three biological systems: macrophages challenged with viral infection, circadian regulation in Arabidopsis thaliana, and morphogenesis in Drosophila melanogaster.

  9. Emerging principles of regulatory evolution

    OpenAIRE

    Prud'homme, Benjamin; Gompel, Nicolas; Carroll, Sean B.

    2007-01-01

    Understanding the genetic and molecular mechanisms governing the evolution of morphology is a major challenge in biology. Because most animals share a conserved repertoire of body-building and -patterning genes, morphological diversity appears to evolve primarily through changes in the deployment of these genes during development. The complex expression patterns of developmentally regulated genes are typically controlled by numerous independent cis-regulatory elements (CREs). It has been prop...

  10. Modular genetic regulatory networks increase organization during pattern formation.

    Science.gov (United States)

    Mohamadlou, Hamid; Podgorski, Gregory J; Flann, Nicholas S

    2016-08-01

    Studies have shown that genetic regulatory networks (GRNs) consist of modules that are densely connected subnetworks that function quasi-autonomously. Modules may be recognized motifs that comprise of two or three genes with particular regulatory functions and connectivity or be purely structural and identified through connection density. It is unclear what evolutionary and developmental advantages modular structure and in particular motifs provide that have led to this enrichment. This study seeks to understand how modules within developmental GRNs influence the complexity of multicellular patterns that emerge from the dynamics of the regulatory networks. We apply an algorithmic complexity to measure the organization of the patterns. A computational study was performed by creating Boolean intracellular networks within a simulated epithelial field of embryonic cells, where each cell contains the same network and communicates with adjacent cells using contact-mediated signaling. Intracellular networks with random connectivity were compared to those with modular connectivity and with motifs. Results show that modularity effects network dynamics and pattern organization significantly. In particular: (1) modular connectivity alone increases complexity in network dynamics and patterns; (2) bistable switch motifs simplify both the pattern and network dynamics; (3) all other motifs with feedback loops increase multicellular pattern complexity while simplifying the network dynamics; (4) negative feedback loops affect the dynamics complexity more significantly than positive feedback loops.

  11. Latent phenotypes pervade gene regulatory circuits.

    OpenAIRE

    Payne, Joshua L.; Wagner, Andreas

    2014-01-01

    BACKGROUND Latent phenotypes are non-adaptive byproducts of adaptive phenotypes. They exist in biological systems as different as promiscuous enzymes and genome-scale metabolic reaction networks, and can give rise to evolutionary adaptations and innovations. We know little about their prevalence in the gene expression phenotypes of regulatory circuits, important sources of evolutionary innovations. RESULTS Here, we study a space of more than sixteen million three-gene model regulatory circ...

  12. Latent phenotypes pervade gene regulatory circuits

    OpenAIRE

    Payne, Joshua L.; Wagner, Andreas

    2014-01-01

    Background Latent phenotypes are non-adaptive byproducts of adaptive phenotypes. They exist in biological systems as different as promiscuous enzymes and genome-scale metabolic reaction networks, and can give rise to evolutionary adaptations and innovations. We know little about their prevalence in the gene expression phenotypes of regulatory circuits, important sources of evolutionary innovations. Results Here, we study a space of more than sixteen million three-gene model regulatory circuit...

  13. Boolean Modeling Reveals the Necessity of Transcriptional Regulation for Bistability in PC12 Cell Differentiation.

    Science.gov (United States)

    Offermann, Barbara; Knauer, Steffen; Singh, Amit; Fernández-Cachón, María L; Klose, Martin; Kowar, Silke; Busch, Hauke; Boerries, Melanie

    2016-01-01

    The nerve growth factor NGF has been shown to cause cell fate decisions toward either differentiation or proliferation depending on the relative activity of downstream pERK, pAKT, or pJNK signaling. However, how these protein signals are translated into and fed back from transcriptional activity to complete cellular differentiation over a time span of hours to days is still an open question. Comparing the time-resolved transcriptome response of NGF- or EGF-stimulated PC12 cells over 24 h in combination with protein and phenotype data we inferred a dynamic Boolean model capturing the temporal sequence of protein signaling, transcriptional response and subsequent autocrine feedback. Network topology was optimized by fitting the model to time-resolved transcriptome data under MEK, PI3K, or JNK inhibition. The integrated model confirmed the parallel use of MAPK/ERK, PI3K/AKT, and JNK/JUN for PC12 cell differentiation. Redundancy of cell signaling is demonstrated from the inhibition of the different MAPK pathways. As suggested in silico and confirmed in vitro, differentiation was substantially suppressed under JNK inhibition, yet delayed only under MEK/ERK inhibition. Most importantly, we found that positive transcriptional feedback induces bistability in the cell fate switch. De novo gene expression was necessary to activate autocrine feedback that caused Urokinase-Type Plasminogen Activator (uPA) Receptor signaling to perpetuate the MAPK activity, finally resulting in the expression of late, differentiation related genes. Thus, the cellular decision toward differentiation depends on the establishment of a transcriptome-induced positive feedback between protein signaling and gene expression thereby constituting a robust control between proliferation and differentiation.

  14. Adaptive Dynamics of Regulatory Networks: Size Matters

    Directory of Open Access Journals (Sweden)

    Martinetz Thomas

    2009-01-01

    Full Text Available To accomplish adaptability, all living organisms are constructed of regulatory networks on different levels which are capable to differentially respond to a variety of environmental inputs. Structure of regulatory networks determines their phenotypical plasticity, that is, the degree of detail and appropriateness of regulatory replies to environmental or developmental challenges. This regulatory network structure is encoded within the genotype. Our conceptual simulation study investigates how network structure constrains the evolution of networks and their adaptive abilities. The focus is on the structural parameter network size. We show that small regulatory networks adapt fast, but not as good as larger networks in the longer perspective. Selection leads to an optimal network size dependent on heterogeneity of the environment and time pressure of adaptation. Optimal mutation rates are higher for smaller networks. We put special emphasis on discussing our simulation results on the background of functional observations from experimental and evolutionary biology.

  15. Adaptive Dynamics of Regulatory Networks: Size Matters

    Directory of Open Access Journals (Sweden)

    2009-03-01

    Full Text Available To accomplish adaptability, all living organisms are constructed of regulatory networks on different levels which are capable to differentially respond to a variety of environmental inputs. Structure of regulatory networks determines their phenotypical plasticity, that is, the degree of detail and appropriateness of regulatory replies to environmental or developmental challenges. This regulatory network structure is encoded within the genotype. Our conceptual simulation study investigates how network structure constrains the evolution of networks and their adaptive abilities. The focus is on the structural parameter network size. We show that small regulatory networks adapt fast, but not as good as larger networks in the longer perspective. Selection leads to an optimal network size dependent on heterogeneity of the environment and time pressure of adaptation. Optimal mutation rates are higher for smaller networks. We put special emphasis on discussing our simulation results on the background of functional observations from experimental and evolutionary biology.

  16. Making the AGREE tool more user-friendly: the feasibility of a user guide based on Boolean operators.

    Science.gov (United States)

    Scott, N Ann; Moga, Carmen; Harstall, Christa

    2009-12-01

    Rationale, aims and objectives The Appraisal of Guidelines Research and Evaluation (AGREE) instrument is a generic tool for assessing guideline quality. This feasibility study aimed to reduce the ambiguity and subjectivity associated with AGREE item scoring, and to augment the tool's capacity to differentiate between good- and poor-quality guidelines. Methods A literature review was conducted to ascertain what AGREE instrument adjustments had been reported to date. The AGREE User Guide was then modified by: 1 constructing a detailed set of instructions, or dictionary, using Boolean operators, and 2 overlaying seven criteria to categorize guideline quality. The feasibility of the Boolean-based dictionary was tested by three appraisers using three randomly selected guidelines on low back pain management. The dictionary was then revised and re-tested. Results Of the 52 published studies identified, 14% had modified the instrument by adding or deleting items and 35% had adopted strategies, such as using a consensus approach, to overcome inconsistencies and ensure identical item scoring among appraisers. For the feasibility test, Pearson correlation coefficients ranged from 0.27 to 0.81. Revision and re-testing of the dictionary increased the level of agreement (range 0.41 to 0.94). Application of the revised dictionary not only decreased the variability of the domain scores, but also reduced the tool's reliability among inexperienced appraisers. Conclusion Appraisers found the Boolean-based AGREE User Guide easier to use than the original, which improved their confidence in the tool. Good reliability was achieved in the feasibility test, but the reliability and validity of some of the changes will require further evaluation. PMID:20367706

  17. 布尔函数与形态算子关系的研究%On the Relationship between Boolean Function and Morphology Operator

    Institute of Scientific and Technical Information of China (English)

    段汕; 罗敬; 徐文; 贺兴

    2013-01-01

      以布尔代数理论和欧式空间中二值形态变换理论为基础,通过布尔函数引入一个结构化映射,对二值形态变换的基本运算(腐蚀、膨胀)进行了描述,探讨了布尔函数与形态变换的关系,以期为二值形态变换的扩展提供新的途径。%This paper presents binary morphological transformation ( corrosion and expansion) on the basis of the Boolean algebra theory and the theory of binary morphological transformation in Euclidean space, and introduces a structural mapping resting on Boolean function, then researches the relationship between Boolean function and morphological transformation, which will provide a new way for extending morphological transformation.

  18. Linking network topology to function. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin, A. Krzywicki and M. Zagorski

    Science.gov (United States)

    di Bernardo, Diego

    2016-07-01

    The review by Martin et al. deals with a long standing problem at the interface of complex systems and molecular biology, that is the relationship between the topology of a complex network and its function. In biological terms the problem translates to relating the topology of gene regulatory networks (GRNs) to specific cellular functions. GRNs control the spatial and temporal activity of the genes encoded in the cell's genome by means of specialised proteins called Transcription Factors (TFs). A TF is able to recognise and bind specifically to a sequence (TF biding site) of variable length (order of magnitude of 10) found upstream of the sequence encoding one or more genes (at least in prokaryotes) and thus activating or repressing their transcription. TFs can thus be distinguished in activator and repressor. The picture can become more complex since some classes of TFs can form hetero-dimers consisting of a protein complex whose subunits are the individual TFs. Heterodimers can have completely different binding sites and activity compared to their individual parts. In this review the authors limit their attention to prokaryotes where the complexity of GRNs is somewhat reduced. Moreover they exploit a unique feature of living systems, i.e. evolution, to understand whether function can shape network topology. Indeed, prokaryotes such as bacteria are among the oldest living systems that have become perfectly adapted to their environment over geological scales and thus have reached an evolutionary steady-state where the fitness of the population has reached a plateau. By integrating in silico analysis and comparative evolution, the authors show that indeed function does tend to shape the structure of a GRN, however this trend is not always present and depends on the properties of the network being examined. Interestingly, the trend is more apparent for sparse networks, i.e. where the density of edges is very low. Sparsity is indeed one of the most prominent features

  19. Linking network topology to function. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin, A. Krzywicki and M. Zagorski

    Science.gov (United States)

    di Bernardo, Diego

    2016-07-01

    The review by Martin et al. deals with a long standing problem at the interface of complex systems and molecular biology, that is the relationship between the topology of a complex network and its function. In biological terms the problem translates to relating the topology of gene regulatory networks (GRNs) to specific cellular functions. GRNs control the spatial and temporal activity of the genes encoded in the cell's genome by means of specialised proteins called Transcription Factors (TFs). A TF is able to recognise and bind specifically to a sequence (TF biding site) of variable length (order of magnitude of 10) found upstream of the sequence encoding one or more genes (at least in prokaryotes) and thus activating or repressing their transcription. TFs can thus be distinguished in activator and repressor. The picture can become more complex since some classes of TFs can form hetero-dimers consisting of a protein complex whose subunits are the individual TFs. Heterodimers can have completely different binding sites and activity compared to their individual parts. In this review the authors limit their attention to prokaryotes where the complexity of GRNs is somewhat reduced. Moreover they exploit a unique feature of living systems, i.e. evolution, to understand whether function can shape network topology. Indeed, prokaryotes such as bacteria are among the oldest living systems that have become perfectly adapted to their environment over geological scales and thus have reached an evolutionary steady-state where the fitness of the population has reached a plateau. By integrating in silico analysis and comparative evolution, the authors show that indeed function does tend to shape the structure of a GRN, however this trend is not always present and depends on the properties of the network being examined. Interestingly, the trend is more apparent for sparse networks, i.e. where the density of edges is very low. Sparsity is indeed one of the most prominent features

  20. The algebraic immunity and the optimal algebraic immunity functions of a class of correlation immune H Boolean functions

    Directory of Open Access Journals (Sweden)

    Huang Jinglian

    2016-01-01

    Full Text Available We put forward an efficient method to study the algebraic immunity of H Boolean functions with Hamming weight of 2n-1 + 2n-2, getting the existence of the higher-order algebraic immunity functions with correlation immunity. We also prove the existing problem of the above 2-order algebraic immunity functions and the optimal algebraic immunity functions. Meanwhile, we solve the compatibility of algebraic immunity and correlation immunity. What is more, the main theoretical results are verified through the examples and are revealed to be correct. Such researches are important in cryptographic primitive designs, and have significance and role in the theory and application range of cryptosystems.