WorldWideScience

Sample records for boolean biological regulatory

  1. Boolean modeling in systems biology: an overview of methodology and applications

    International Nuclear Information System (INIS)

    Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)

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

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

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

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

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

  7. Boolean nested canalizing functions: a comprehensive analysis

    CERN Document Server

    Li, Yuan; Murrugarra, David; Aguilar, Boris; Laubenbacher, Reinhard

    2012-01-01

    Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a property inspired by the concept of canalization in evolutionary biology. It has been shown that networks comprised of nested canalizing functions have dynamic properties that make them suitable for modeling molecular regulatory networks, namely a small number of (large) attractors, as well as relatively short limit cycles. This paper contains a detailed analysis of this class of functions, based on a novel normal form as polynomial functions over the Boolean field. The concept of layer is introduced that stratifies variables into different classes depending on their level of dominance. Using this layer concept a closed form formula is derived for the number of nested canalizing functions with a given number of variables. Additional metrics analyzed in...

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

  9. A Boolean-based systems biology approach to predict novel genes associated with cancer: Application to colorectal cancer

    Directory of Open Access Journals (Sweden)

    Reverter Antonio

    2011-02-01

    Full Text Available Abstract Background Cancer has remarkable complexity at the molecular level, with multiple genes, proteins, pathways and regulatory interconnections being affected. We introduce a systems biology approach to study cancer that formally integrates the available genetic, transcriptomic, epigenetic and molecular knowledge on cancer biology and, as a proof of concept, we apply it to colorectal cancer. Results We first classified all the genes in the human genome into cancer-associated and non-cancer-associated genes based on extensive literature mining. We then selected a set of functional attributes proven to be highly relevant to cancer biology that includes protein kinases, secreted proteins, transcription factors, post-translational modifications of proteins, DNA methylation and tissue specificity. These cancer-associated genes were used to extract 'common cancer fingerprints' through these molecular attributes, and a Boolean logic was implemented in such a way that both the expression data and functional attributes could be rationally integrated, allowing for the generation of a guilt-by-association algorithm to identify novel cancer-associated genes. Finally, these candidate genes are interlaced with the known cancer-related genes in a network analysis aimed at identifying highly conserved gene interactions that impact cancer outcome. We demonstrate the effectiveness of this approach using colorectal cancer as a test case and identify several novel candidate genes that are classified according to their functional attributes. These genes include the following: 1 secreted proteins as potential biomarkers for the early detection of colorectal cancer (FXYD1, GUCA2B, REG3A; 2 kinases as potential drug candidates to prevent tumor growth (CDC42BPB, EPHB3, TRPM6; and 3 potential oncogenic transcription factors (CDK8, MEF2C, ZIC2. Conclusion We argue that this is a holistic approach that faithfully mimics cancer characteristics, efficiently predicts

  10. Comparison of Control Approaches in Genetic Regulatory Networks by Using Stochastic Master Equation Models, Probabilistic Boolean Network Models and Differential Equation Models and Estimated Error Analyzes

    Science.gov (United States)

    Caglar, Mehmet Umut; Pal, Ranadip

    2011-03-01

    Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.

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

  12. Boolean network model predicts knockout mutant phenotypes of fission yeast.

    Directory of Open Access Journals (Sweden)

    Maria I Davidich

    Full Text Available BOOLEAN NETWORKS (OR: networks of switches are extremely simple mathematical models of biochemical signaling networks. Under certain circumstances, Boolean networks, despite their simplicity, are capable of predicting dynamical activation patterns of gene regulatory networks in living cells. For example, the temporal sequence of cell cycle activation patterns in yeasts S. pombe and S. cerevisiae are faithfully reproduced by Boolean network models. An interesting question is whether this simple model class could also predict a more complex cellular phenomenology as, for example, the cell cycle dynamics under various knockout mutants instead of the wild type dynamics, only. Here we show that a Boolean network model for the cell cycle control network of yeast S. pombe correctly predicts viability of a large number of known mutants. So far this had been left to the more detailed differential equation models of the biochemical kinetics of the yeast cell cycle network and was commonly thought to be out of reach for models as simplistic as Boolean networks. The new results support our vision that Boolean networks may complement other mathematical models in systems biology to a larger extent than expected so far, and may fill a gap where simplicity of the model and a preference for an overall dynamical blueprint of cellular regulation, instead of biochemical details, are in the focus.

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

  14. Fast Gr\\"obner Basis Computation for Boolean Polynomials

    CERN Document Server

    Hinkelmann, Franziska

    2010-01-01

    We introduce the Macaulay2 package BooleanGB, which computes a Gr\\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.

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

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

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

  18. Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Andersen, Henrik Reif; Hulgaard, Henrik

    2002-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. Two algorithms are described for transforming...

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

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

  1. Monotone Boolean functions

    International Nuclear Information System (INIS)

    Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years

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

  3. Boolean Expression Diagrams

    DEFF Research Database (Denmark)

    Andersen, Henrik Reif; Hulgaard, Henrik

    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...... properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One closely mimics the BDD apply-operator while the other can exploit the structural information of the Boolean expression. The efficacy of the BED representation is demonstrated by verifying that the...

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

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

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

  7. Boolean filters of distributive lattices

    Directory of Open Access Journals (Sweden)

    M. Sambasiva Rao

    2013-07-01

    Full Text Available In this paper we introduce the notion of Boolean filters in a pseudo-complemented distributive lattice and characterize the class of all Boolean filters. Further a set of equivalent conditions are derived for a proper filter to become a prime Boolean filter. Also a set of equivalent conditions is derived for a pseudo-complemented distributive lattice to become a Boolean algebra. Finally, a Boolean filter is characterized in terms of congruences.

  8. Boolean Models of Biosurfactants Production in Pseudomonas fluorescens

    Science.gov (United States)

    Richard, Adrien; Rossignol, Gaelle; Comet, Jean-Paul; Bernot, Gilles; Guespin-Michel, Jannine; Merieau, Annabelle

    2012-01-01

    Cyclolipopeptides (CLPs) are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene () and not restored by complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained. PMID:22303435

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

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

    Science.gov (United States)

    Kaushik, Aman Chandra; Sahi, Shakti

    2015-06-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 and kinetic simulation of GPR142 was carried out in order to determine the dynamic interactions. The major objective of this work was to design a GPR142 biochemical pathway using both systems biology as well as biological circuits synthetically. The term 'synthetically' refers to building biological circuits for cell signaling pathway especially for hormonal pathway disease. The focus of the paper is on logical components and logical circuits whereby using these applications users can create complex virtual circuits. Logic gates process represents only true or false and investigates whether biological regulatory circuits are active or inactive. The basic gates used are AND, NAND, OR, XOR and NOT gates and Integrated circuit composition of many such basic gates and some derived gates. Biological circuits may have a futuristic application in biomedical sciences which may involve placing a micro chip in human cells to modulate the down or up regulation of hormonal disease. PMID:25972988

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

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

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

  15. Random Boolean Networks

    OpenAIRE

    Drossel, Barbara

    2007-01-01

    This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and problems to solve, the basic concepts are introduced and important results concerning phase diagrams, numbers of relevant nodes and attractor properties are derived.

  16. 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. PMID:26965665

  17. Fault Tolerant Boolean Satisfiability

    CERN Document Server

    Roy, A

    2011-01-01

    A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming unavailable). The concept of delta-models was introduced by Ginsberg, Parkes and Roy (AAAI 1998), where it was proved that finding delta-models for general Boolean formulas is NP-complete. In this paper, we extend that result by studying the complexity of finding delta-models for classes of Boolean formulas which are known to have polynomial time satisfiability solvers. In particular, we examine 2-SAT, Horn-SAT, Affine-SAT, dual-Horn-SAT, 0-valid and 1-valid SAT. We see a wide variation in the complexity of finding delta-models, e.g., while 2-SAT and Affine-SAT have polynomial time tests for delta-models, testing w...

  18. Computational complexity of Boolean functions

    International Nuclear Information System (INIS)

    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.

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

  20. Algorithms for Weighted Boolean Optimization

    OpenAIRE

    Manquinho, Vasco; Marques-Silva, Joao; Planes Cid, Jordi

    2009-01-01

    The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, different algorithms have been proposed for PBO and for MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT and viceversa. This papers proposes Weighted Boolean Optimization (WBO), a new uni- fied framework that aggregates and extends PBO and MaxSAT. In addition, the paper proposes...

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

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

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

  4. Investigating Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Neruda, Roman; Frolov, A. A.

    - : ACM, 2008 - (Ding, C.; Li, T.; Zhu, S.), s. 18-25 ISBN 978-1-60558-307-5. [DMMT'08. Workshop in Conjunction with SIGKDD 2008 /14./. Las Vegas (US), 24.08.2008-24.08.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * nonnegative matrix factorization * neural networks * information retrieval * data mining * binary data Subject RIV: BB - Applied Statistics, Operational Research http://users.cs.fiu.edu/~taoli/kdd08-workshop/DMMT08-Proceedings.pdf

  5. Fault Tolerant Boolean Satisfiability

    OpenAIRE

    Roy, A

    2011-01-01

    A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming unavailable). The concept of delta-models was introduced by Ginsberg, Parkes and Roy (AAAI 1998...

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

  7. Geometric Operators on Boolean Functions

    DEFF Research Database (Denmark)

    Frisvad, Jeppe Revall; Falster, Peter

    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. Cardinal invariants on Boolean algebras

    CERN Document Server

    Monk, J Donald

    2014-01-01

    This book is concerned with cardinal number valued functions defined for any Boolean algebra. Examples of such functions are independence, which assigns to each Boolean algebra the supremum of the cardinalities of its free subalgebras, and cellularity, which gives the supremum of cardinalities of sets of pairwise disjoint elements. Twenty-one such functions are studied in detail, and many more in passing. The questions considered are the behaviour of these functions under algebraic operations such as products, free products, ultraproducts, and their relationships to one another. Assuming familiarity with only the basics of Boolean algebras and set theory, through simple infinite combinatorics and forcing, the book reviews current knowledge about these functions, giving complete proofs for most facts. A special feature of the book is the attention given to open problems, of which 185 are formulated. Based on Cardinal Functions on Boolean Algebras (1990) and Cardinal Invariants on Boolean Algebras (1996) by the...

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

  11. What does biologically meaningful mean? A perspective on gene regulatory network validation

    OpenAIRE

    Walhout, Albertha JM

    2011-01-01

    Gene regulatory networks (GRNs) are rapidly being delineated, but their quality and biological meaning are often questioned. Here, I argue that biological meaning is challenging to define and discuss reasons why GRN validation should be interpreted cautiously.

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

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

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

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

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

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

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

  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. Cardinal invariants on Boolean algebras

    CERN Document Server

    Monk, J Donald

    2009-01-01

    Deals with cardinal number valued functions defined for any Boolean algebra. This title considers the behavior of these functions under algebraic operations such as products, free products, ultraproducts, and their relationships to one another. It covers topics such as ultraproducts and Fedorchukis theorem

  1. Boolean-Valued Belief Functions

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2002-01-01

    Roč. 31, č. 2 (2002), s. 153-181. ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002

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

  3. Boolean Delay Equations: A simple way of looking at complex systems

    OpenAIRE

    Ghil, Michael; Zaliapin, Ilya; Coluzzi, Barbara

    2006-01-01

    Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time. They represent therewith metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit ...

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

  5. Algorithms for Finding Small Attractors in Boolean Networks

    Directory of Open Access Journals (Sweden)

    Hayashida Morihiro

    2007-01-01

    Full Text Available A Boolean network is a model used to study the interactions between different genes in genetic regulatory networks. In this paper, we present several algorithms using gene ordering and feedback vertex sets to identify singleton attractors and small attractors in Boolean networks. We analyze the average case time complexities of some of the proposed algorithms. For instance, it is shown that the outdegree-based ordering algorithm for finding singleton attractors works in time for , which is much faster than the naive time algorithm, where is the number of genes and is the maximum indegree. We performed extensive computational experiments on these algorithms, which resulted in good agreement with theoretical results. In contrast, we give a simple and complete proof for showing that finding an attractor with the shortest period is NP-hard.

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

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

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

  9. 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. PMID:26701126

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

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

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

  13. 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…

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

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

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

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

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

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

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

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

  2. Translating Pseudo-Boolean Constraints into CNF

    CERN Document Server

    Aavani, Amir

    2011-01-01

    A Pseudo-Boolean constraint is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a new algorithm for translating Pseudo-Boolean constraints into CNF clauses. The CNF produced by the proposed encoding has small size, and we also characterize the constraints for which one can expect the SAT solvers to perform well on the produced CNF. We show that there are many constraints for which the proposed encoding has a good performance.

  3. Clinical and regulatory perspectives on biosimilar therapies and intended copies of biologics in rheumatology.

    Science.gov (United States)

    Mysler, Eduardo; Pineda, Carlos; Horiuchi, Takahiko; Singh, Ena; Mahgoub, Ehab; Coindreau, Javier; Jacobs, Ira

    2016-05-01

    Biologics are vital to the management of patients with rheumatic and musculoskeletal diseases such as rheumatoid arthritis and other inflammatory and autoimmune conditions. Nevertheless, access to these highly effective treatments remains an unmet medical need for many people around the world. As patents expire for existing licensed biologic (originator) products, biosimilar products can be approved by regulatory authorities and enter clinical use. Biosimilars are highly similar copies of originator biologics approved through defined and stringent regulatory processes after having undergone rigorous analytical, non-clinical, and clinical evaluations. The introduction of high-quality, safe, and effective biosimilars has the potential to expand access to these important medicines. Biosimilars are proven to be similar to the originator biologic in terms of safety and efficacy and to have no clinically meaningful differences. In contrast, "intended copies" are copies of originator biologics that have not undergone rigorous comparative evaluations according to the World Health Organization recommendations, but are being commercialized in some countries. There is a lack of information about the efficacy and safety of intended copies compared with the originator. Furthermore, they may have clinically significant differences in formulation, dosages, efficacy, or safety. In this review, we explore the differences between biosimilars and intended copies and describe key concepts related to biosimilars. Familiarity with these topics may facilitate decision making about the appropriate use of biosimilars for patients with rheumatic and musculoskeletal diseases. PMID:26920148

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

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

  6. Sensitivity versus block sensitivity of Boolean functions

    CERN Document Server

    Virza, Madars

    2010-01-01

    Determining relationship between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 (s(f))^2+ 1/2 s(f). The best known separation previously was bs(f) = 1/2 (s(f))^2 due to Rubinstein (1995). We also report results of computer search for functions with at most 12 variables.

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

  8. Early history of regulatory requirements for poultry biologics in the United States.

    Science.gov (United States)

    Espeseth, David A; Lasher, Hiram

    2010-12-01

    Congress passed the Virus-Serum-Toxin Act in 1913, giving the U.S. Department of Agriculture (USDA) authority to prevent the importation or interstate shipment of worthless, contaminated, dangerous, or harmful veterinary biological products. The passage of this act marked the beginning of regulatory requirements for veterinary biological products in the United States. In 1913, only a few biologics establishments produced products for the poultry industry. The first license issued by the USDA for a poultry product was in 1918 to the University of California, Berkeley, for fowlpox vaccine. The list of biological products for poultry grew slowly in the 1920s. However, this began to change with the licensing of laryngotracheitis vaccine in 1933; pigeonpox vaccine in 1939; several Newcastle disease vaccines (inactivated in 1946, Roakin strain in 1948, B1 strain in 1950, and La Sota strain in 1952); and the first bronchitis vaccine in 1953. With the development of these and other new products, the biologics industry began to move its emphasis on hog cholera serum and virus to one based on the production of numerous new vaccines and bacterial products. The USDA's approach to the regulation of biologics in the early 1950s was still geared to the production of hog cholera products; however, as a result of the intervention of a group of dedicated poultry scientists, who were concerned about the poor performance of Newcastle disease vaccines, this soon changed. This presentation describes the initiation and development of modern standards for poultry biologics that occurred as a result of this intervention. The development and improvement of standards and regulatory requirements to address mycoplasma, leukosis, and other extraneous virus contaminations in chicken embryo origin products are reviewed. The licensing of products to meet new and emerging disease problems in the poultry industry and the close interaction among research scientists, poultry industry, biologics

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

    Science.gov (United States)

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

    2016-04-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 throughin silicotheoretical studies with the aim to guide and complement furtherin vitroandin vivoexperimental efforts. Clearly, what counts is the resultin vivo, not only in terms of maximal productivity but also robustness against environmental perturbations. Engineering an organism towards an increased production flux, however, often compromises that robustness. In this contribution, we review and investigate how various analytical approaches used in metabolic engineering and synthetic biology are related to concepts developed by systems and control engineering. While trade-offs between production optimality and cellular robustness have already been studied diagnostically and statically, the dynamics also matter. Integration of the dynamic design aspects of control engineering with the more diagnostic aspects of metabolic, hierarchical control and regulation analysis is leading to the new, conceptual and operational framework required for the design of robust and productive dynamic pathways. PMID:27075000

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

  12. Forced synchronization of autonomous dynamical Boolean networks

    International Nuclear Information System (INIS)

    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

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

  15. Spatiotemporal network motif reveals the biological traits of developmental gene regulatory networks in Drosophila melanogaster

    Directory of Open Access Journals (Sweden)

    Kim Man-Sun

    2012-05-01

    Full Text Available Abstract Background Network motifs provided a “conceptual tool” for understanding the functional principles of biological networks, but such motifs have primarily been used to consider static network structures. Static networks, however, cannot be used to reveal time- and region-specific traits of biological systems. To overcome this limitation, we proposed the concept of a “spatiotemporal network motif,” a spatiotemporal sequence of network motifs of sub-networks which are active only at specific time points and body parts. Results On the basis of this concept, we analyzed the developmental gene regulatory network of the Drosophila melanogaster embryo. We identified spatiotemporal network motifs and investigated their distribution pattern in time and space. As a result, we found how key developmental processes are temporally and spatially regulated by the gene network. In particular, we found that nested feedback loops appeared frequently throughout the entire developmental process. From mathematical simulations, we found that mutual inhibition in the nested feedback loops contributes to the formation of spatial expression patterns. Conclusions Taken together, the proposed concept and the simulations can be used to unravel the design principle of developmental gene regulatory networks.

  16. New Measure of Boolean Factor Analysis Quality

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    Vol. 1. Heidelberg: Springer, 2011 - (Dobnikar, A.; Lotrič, U.; Šter, B.), s. 100-109. (Lecture Notes in Computer Science. 6593). ISBN 978-3-642-20281-0. ISSN 0302-9743. [ICANNGA'2011. International Conference /10./. Ljubljana (SI), 14.04.2011-16.04.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * information gain * expectation-maximization * associative memory * neural network application * Boolean matrix factorization * bars problem * Hopfield neural network Subject RIV: IN - Informatics, Computer Science

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

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

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

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

  1. Boolean Queries Optimization by Genetic Algorithms

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav

    2005-01-01

    Roč. 15, - (2005), s. 395-409. ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research

  2. Evolutionary Algorithms for Boolean Queries Optimization

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.

    2006-01-01

    Roč. 3, č. 1 (2006), s. 15-20. ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics

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

  4. 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…

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

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Shah Imran

    2011-07-01

    Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our

  11. "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

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

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

  14. Boolean network robotics: a proof of concept

    CERN Document Server

    Roli, Andrea; Pinciroli, Carlo; Birattari, Mauro

    2011-01-01

    Dynamical systems theory and complexity science provide powerful tools for analysing artificial agents and robots. Furthermore, they have been recently proposed also as a source of design principles and guidelines. Boolean networks are a prominent example of complex dynamical systems and they have been shown to effectively capture important phenomena in gene regulation. From an engineering perspective, these models are very compelling, because they can exhibit rich and complex behaviours, in spite of the compactness of their description. In this paper, we propose the use of Boolean networks for controlling robots' behaviour. The network is designed by means of an automatic procedure based on stochastic local search techniques. We show that this approach makes it possible to design a network which enables the robot to accomplish a task that requires the capability of navigating the space using a light stimulus, as well as the formation and use of an internal memory.

  15. Chaos synchronization of two stochastically coupled random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Hung, Y.-C. [Department of Physics, National Sun Yat-sen University, Kaohsiung, Taiwan (China) and Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)]. E-mail: d9123801@student.nsysu.edu.tw; Ho, M.-C. [Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)]. E-mail: t1603@nknucc.nknu.edu.tw; Lih, J.-S. [Department of Physics and Geoscience, National Pingtung University of Education, Pingtung, Taiwan (China); Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China); Jiang, I-M. [Department of Physics, National Sun Yat-sen University, Kaohsiung, Taiwan (China); Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)

    2006-07-24

    In this Letter, we study the chaos synchronization of two stochastically coupled random Boolean networks (RBNs). Instead of using the 'site-by-site and all-to-all' coupling, the coupling mechanism we consider here is that: the nth cell in a network is linked by an arbitrarily chosen cell in the other network with probability {rho}, and it possesses no links with probability 1-{rho}. The mechanism is useful to investigate the coevolution of biological species via horizontal genetic exchange. We show that the density evolution of networks can be described by two deterministic coupled polynomial maps. The complete synchronization occurs when the coupling parameter exceeds a critical value. Moreover, the reverse bifurcations in inhomogeneous condition are observed and under our discussion.

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

  17. Using Genetic Algorithms for Boolean Queries Optimization

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Snášel, Václav; Owais, S.S.J.; Krömer, P.

    Calgary: ACTA Press, 2005 - (Hamza, M.), s. 178-184 ISBN 0-88986-510-8. [IASTED International Conference on Internet and Multimedia Systems and Applications /9./. Honolulu (US), 15.08.2005-17.08.2005] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : genetic algorithms * information retrieval * Boolean query * genetic programming Subject RIV: BA - General Mathematics

  18. On the Implementation of Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Snášel, V.; Krömer, P.; Platoš, J.; Húsek, Dušan

    Los Alamitos: IEEE, 2008, s. 554-558. ISBN 978-0-7695-3299-8. [ETID '08. International Workshop on Evolutionary Techniques /2./, in collocation with DEXA 2008 International Conference /19./. Turin (IT), 01.09.2008-05.09.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science

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

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

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

  2. 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, ...

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

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

    International Nuclear Information System (INIS)

    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

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

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

  8. Learning Boolean functions with concentrated spectra

    Science.gov (United States)

    Mixon, Dustin G.; Peterson, Jesse

    2015-08-01

    This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample complexity of learning in this case. Next, we propose a computationally efficient method of empirical risk minimization, and we apply this method to the MNIST database of handwritten digits. These results demonstrate the effectiveness of our model for modern classification tasks. We conclude with a list of open problems for future investigation.

  9. Boolean Factor Analysis by Attractor Neural Network

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

    2007-01-01

    Roč. 18, č. 3 (2007), s. 698-707. ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007

  10. Neural Network Boolean Factor Analysis and Applications

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Frolov, A.; Polyakov, P.Y.; Snášel, V.

    -: WSEAS Press, 2007 - (Katehakis, M.; And ina, D.; Mastorakis, M.), s. 30-35. (Electrical and Computer Engineering Series). ISBN 978-960-6766-21-3. [CIMMACS'07. WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics. Tenerife (ES), 14.12.2007-16.12.2007] R&D Projects: GA MŠk 1M0567; GA AV ČR 1ET100300414; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : Hopfield neural network * boolean factor analysis * unsupervised learning * dimension reduction * data mining Subject RIV: BB - Applied Statistics, Operational Research

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

  12. Solving the Satisfiability Problem Through Boolean Networks

    OpenAIRE

    Roli, Andrea; Milano, Michela

    2011-01-01

    In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework f...

  13. Solving the Satisfiability Problem Through Boolean Networks

    CERN Document Server

    Roli, Andrea

    2011-01-01

    In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework for local search algorithms.

  14. Representations of Boolean Functions by Perceptron Networks

    Czech Academy of Sciences Publication Activity Database

    Kůrková, Věra

    Prague : Institute of Computer Science AS CR, 2014 - (Kůrková, V.; Bajer, L.; Peška, L.; Vojtáš, R.; Holeňa, M.; Nehéz, M.), s. 68-70 ISBN 978-80-87136-19-5. [ITAT 2014. European Conference on Information Technologies - Applications and Theory /14./. Demänovská dolina (SK), 25.09.2014-29.09.2014] R&D Projects: GA MŠk(CZ) LD13002 Institutional support: RVO:67985807 Keywords : perceptron networks * model complexity * Boolean functions Subject RIV: IN - Informatics, Computer Science

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

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

    Science.gov (United States)

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

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

  17. 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. PMID:26997659

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

  19. A systems biology model of the regulatory network in Populus leaves reveals interacting regulators and conserved regulation

    OpenAIRE

    Hvidsten Torgeir R; Jansson Stefan; Street Nathaniel

    2011-01-01

    Abstract Background Green plant leaves have always fascinated biologists as hosts for photosynthesis and providers of basic energy to many food webs. Today, comprehensive databases of gene expression data enable us to apply increasingly more advanced computational methods for reverse-engineering the regulatory network of leaves, and to begin to understand the gene interactions underlying complex emergent properties related to stress-response and development. These new systems biology methods ...

  20. Multiple Sequence Alignment using Boolean Algebra and Fuzzy Logic:A Comparative Study

    Directory of Open Access Journals (Sweden)

    Nivit Gill

    2011-09-01

    Full Text Available Multiple sequence alignment is the most fundamental and essential task of computational biology, and forms the base for other tasks of bioinformatics. In this paper, two different approaches to sequence alignment have been discussed and compared. The first method employs Boolean algebra which is a two-valued logic whereas the second is based on Fuzzy logic which is a multi-valued logic. Both the methods perform sequence matching by direct comparison method using the operations of Boolean algebra and fuzzy logic respectively. To ensure the optimal alignment, dynamic programming is employed to align multiple sequences progressively. Both the methods are implemented and then tested on various sets of real genome sequences taken from NCBI bank. The processing time for both the methods on these data sets have been computed and compared.

  1. Terse Integer Linear Programs for Boolean Optimization

    Directory of Open Access Journals (Sweden)

    Christoph Buchheim

    2009-05-01

    Full Text Available We present a new polyhedral approach to nonlinear Boolean optimization. Compared to other methods, it produces much smaller integer programming models, making it more efficient from a practical point of view. We mainly obtain this by two different ideas: first, we do not require the objective function to be in any normal form. The transformation into a normal form usually leads to the introduction of many additional variables or constraints. Second, we reduce the problem to the degree-two case in a very efficient way, by slightly extending the dimension of the original variable space. The resulting model turns out to be closely related to the maximum cut problem; we show that the corresponding polytope is a face of a suitable cut polytope in most cases. In particular, our separation problem reduces to the one for the maximum cut problem. In practice, the approach appears to be very competitive for unconstrained Boolean optimization problems. First experimental results, which have been obtained for some particularly hard instances of the Max-SAT Evaluation 2007, show that our very general implementation can outperform even special-purpose Max-SAT solvers. The software is accessible online under “we.logoptimize.it”.

  2. SPABBATS: A pathway-discovery method based on Boolean satisfiability that facilitates the characterization of suppressor mutants

    Directory of Open Access Journals (Sweden)

    Tholen Stefan

    2011-01-01

    Full Text Available Abstract Background Several computational methods exist to suggest rational genetic interventions that improve the productivity of industrial strains. Nonetheless, these methods are less effective to predict possible genetic responses of the strain after the intervention. This problem requires a better understanding of potential alternative metabolic and regulatory pathways able to counteract the targeted intervention. Results Here we present SPABBATS, an algorithm based on Boolean satisfiability (SAT that computes alternative metabolic pathways between input and output species in a reconstructed network. The pathways can be constructed iteratively in order of increasing complexity. SPABBATS allows the accumulation of intermediates in the pathways, which permits discovering pathways missed by most traditional pathway analysis methods. In addition, we provide a proof of concept experiment for the validity of the algorithm. We deleted the genes for the glutamate dehydrogenases of the Gram-positive bacterium Bacillus subtilis and isolated suppressor mutant strains able to grow on glutamate as single carbon source. Our SAT approach proposed candidate alternative pathways which were decisive to pinpoint the exact mutation of the suppressor strain. Conclusions SPABBATS is the first application of SAT techniques to metabolic problems. It is particularly useful for the characterization of metabolic suppressor mutants and can be used in a synthetic biology setting to design new pathways with specific input-output requirements.

  3. Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks

    CERN Document Server

    Gorski, Piotr J; Holyst, Janusz A

    2015-01-01

    Random Boolean networks (RBNs) are frequently employed for modelling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive RBN (HARBN) as a system consisting of distinct adaptive RBNs - subnetworks - connected by a set of permanent interlinks. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. We investigate mean node information, mean edge information as well as a mean node degree as functions of model parameters and demonstrate HARBN's ability to describe complex hierarchical systems.

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

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

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

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

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

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

  10. Consistent stabilizability of switched Boolean networks.

    Science.gov (United States)

    Li, Haitao; Wang, Yuzhen

    2013-10-01

    This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs. PMID:23787170

  11. Boolean delay equations: A simple way of looking at complex systems

    Science.gov (United States)

    Ghil, Michael; Zaliapin, Ilya; Coluzzi, Barbara

    2008-12-01

    Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time; such BDEs can be seen therefore as metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil’s staircases and “fractal sunbursts.” All known solutions of dissipative BDEs have stationary variance. BDE systems of this type, both free and forced, have been used as highly idealized models of climate change on interannual, interdecadal and paleoclimatic time scales. BDEs are also being used as flexible, highly efficient models of colliding cascades of loading and failure in earthquake modeling and prediction, as well as in genetics. In this paper we review the theory of systems of BDEs and illustrate their applications to climatic and solid-earth problems. The former have used small systems of BDEs, while the latter have used large hierarchical networks of BDEs. We moreover introduce BDEs with an infinite number of variables distributed in space (“partial BDEs”) and discuss connections with other types of discrete dynamical systems, including cellular automata and Boolean networks. This research-and-review paper concludes with a set of open questions.

  12. Boolean Delay Equations: A Simple Way of Looking at Interactions and Extreme Events

    Science.gov (United States)

    Ghil, Michael

    2013-04-01

    Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time; such BDEs can be seen therefore as metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts.'' BDE systems have been used as highly idealized models of climate change on several time scales, as well as in earthquake modeling and prediction, and in genetics. BDEs with an infinite number of variables on a regular spatial grid have been called "partial BDEs" and we discuss connections with other types of discrete dynamical systems, including cellular automata and Boolean networks. We present recent BDE work on damage propagation in networks, with an emphasis on production-chain models. This formalism turns out to be well adapted to investigating propagation of an initial damage due to a climatic or other natural disaster. It thus serves to study economic impacts of extreme events, as well as extreme disruption of a network of interactions.

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

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

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

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

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

  18. 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. PMID:25493848

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

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

  1. 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)

  2. 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)

  3. Boolean functions with a vertex-transitive group of automorphisms

    Czech Academy of Sciences Publication Activity Database

    Savický, Petr

    -, submitted 2015 (2016) R&D Projects: GA ČR GAP202/10/1333 Institutional support: RVO:67985807 Keywords : Boolean Functions * hypercube * isometric transformation * vertex-transitive group of automorphisms Subject RIV: BA - General Mathematics

  4. Linear Programming Formulation of the Boolean Satisfiability Problem

    CERN Document Server

    Diaby, Moustapha

    2008-01-01

    In this paper, we present a new, graph-based modeling approach and a polynomial-sized linear programming (LP) formulation of the Boolean satisfiability problem (SAT). The approach is illustrated with a numerical example.

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

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

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

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

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

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

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

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

  14. Measuring Mutual Information in Random Boolean Networks

    CERN Document Server

    Luque, B; Luque, Bartolo; Ferrera, Antonio

    1999-01-01

    During the last few years an area of active research in the field of complex systems is that of their information storing and processing abilities. Common opinion has it that the most interesting beaviour of these systems is found ``at the edge of chaos'', which would seem to suggest that complex systems may have inherently non-trivial information proccesing abilities in the vicinity of sharp phase transitions. A comprenhensive, quantitative understanding of why this is the case is however still lacking. Indeed, even ``experimental'' (i.e., often numerical) evidence that this is so has been questioned for a number of systems. In this paper we will investigate, both numerically and analitically, the behavior of Random Boolean Networks (RBN's) as they undergo their order-disorder phase transition. We will use a simple mean field approximation to treat the problem, and without lack of generality we will concentrate on a particular value for the connectivity of the system. In spite of the simplicity of our argume...

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

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

    Science.gov (United States)

    2013-11-15

    ... Patent Term Restoration Act of 1984, Public Law 98-417, 98 Stat. 1585 (codified as amended in scattered... diseases as cancer, diabetes, and multiple sclerosis.\\2\\ ``Biologics'' include, for ] example, vaccines....''). \\30\\ FTC FOB Report, supra note 11, at 12; accord Mandy Jackson, Pharma Recovering from Patent...

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

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

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

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

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

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

  3. 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. PMID:26336114

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

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

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

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

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

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

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

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

  13. HSP70 mediates survival in apoptotic cells – Boolean network prediction and experimental validation

    Directory of Open Access Journals (Sweden)

    Suhas Vasaikar

    2015-08-01

    Full Text Available Neuronal stress or injury results in the activation of proteins, which regulate the balance between survival and apoptosis. However, the complex mechanism of cell signalling 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 towards 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 expression 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 towards 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-fold, 1.26-fold 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.

  14. 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. PMID:26775877

  15. Milk Leptin Surge and Biological Rhythms of Leptin and Other Regulatory Proteins in Breastmilk

    Science.gov (United States)

    Nozhenko, Yuriy; Asnani-Kishnani, Madhu; Rodríguez, Ana M.; Palou, Andreu

    2015-01-01

    A significant number of chronic diseases are linked to perinatal nutrition, and prevention may be associated to naturally occurring components of breast milk. One key hormone in breast milk is leptin, related with the protection from obesity in the adulthood, thus knowing its changes through the day or lactation is crucial. We aimed to investigate the daily rhythms in the milk levels of leptin, together with other two related hormones, ghrelin and adiponectin, during lactation (days 5, 10 and 15) in rat dams, and the relation with morphometric parameters (dams and pups). Summarizing the main results, the existence of biological rhythms, but not daily and maybe circasemidian, was confirmed for the three hormones at the earliest period of lactation. The correlations performed generally showed a possible dependence of milk hormone levels on plasma levels at the early phase of lactation, while with the progression of lactation this dependence may fade and the hormone levels are suggested to be more dependent on mammary gland production/maturation. There was also a correlation between milk leptin and adiponectin levels, especially in the first half of lactation, suggesting a possible parallel regulation. Interestingly, we describe a milk leptin surge around the mid of lactation (at day 10) which may be related with pup´s growth (males and females) and with the well-known (in the literature) plasma leptin surge in pups. All this knowledge may be crucial for future applications in the development of formula milk and in relation with the role of leptin surge during lactation. PMID:26680765

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

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

  18. On the Road to Genetic Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.

    2007-01-01

    Roč. 17, č. 6 (2007), s. 675-688. ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007

  19. On the Road to Genetic Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.

    2007-01-01

    Roč. 17, č. 6 (2007), s. 675-688. ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithm s * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007

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

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

  2. 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 as...

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

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

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

  6. Systems Biology Approach to the Dissection of the Complexity of Regulatory Networks in the S. scrofa Cardiocirculatory System

    Directory of Open Access Journals (Sweden)

    Paolo Martini

    2013-11-01

    Full Text Available Genome-wide experiments are routinely used to increase the understanding of the biological processes involved in the development and maintenance of a variety of pathologies. Although the technical feasibility of this type of experiment has improved in recent years, data analysis remains challenging. In this context, gene set analysis has emerged as a fundamental tool for the interpretation of the results. Here, we review strategies used in the gene set approach, and using datasets for the pig cardiocirculatory system as a case study, we demonstrate how the use of a combination of these strategies can enhance the interpretation of results. Gene set analyses are able to distinguish vessels from the heart and arteries from veins in a manner that is consistent with the different cellular composition of smooth muscle cells. By integrating microRNA elements in the regulatory circuits identified, we find that vessel specificity is maintained through specific miRNAs, such as miR-133a and miR-143, which show anti-correlated expression with their mRNA targets.

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

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

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

  13. Estimation of Boolean Factor Analysis Performance by Informational Gain

    Czech Academy of Sciences Publication Activity Database

    Frolov, A.; Húsek, Dušan; Polyakov, P.Y.

    Berlin : Springer, 2010 - (Snášel, V.; Szczepaniak, P.; Abraham, A.; Kacprzyk, J.), s. 83-94 ISBN 978-3-642-10686-6. - (Advances in Intelligent and Soft Computing. 67). [AWIC 2009. Atlantic Web Intelligence Conference /6./. Prague (CZ), 09.09.2009-11.09.2009] Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * informational gain * Hopfield-like network Subject RIV: IN - Informatics, Computer Science

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

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

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

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

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

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

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

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

  3. Boolean Functions with a Simple Certificate for CNF Complexity

    Czech Academy of Sciences Publication Activity Database

    Čepek, O.; Kučera, P.; Savický, Petr

    2012-01-01

    Roč. 160, 4-5 (2012), s. 365-382. ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant ostatní: GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012

  4. Constant communication complexity protocols for multiparty accumulative boolean functions

    CERN Document Server

    pal, S P; Kumar, S; Das, Sima; Kumar, Somesh; pal, Sudebkumar Prasant

    2005-01-01

    Generalizing a boolean function from Cleve and Buhrman \\cite{cb:sqec}, we consider the class of {\\it accumulative boolean functions} of the form $f_B(X_1,X_2,..., X_m)=\\bigoplus_{i=1}^n t_B(x_i^1x_i^2... x_i^m)$, where $X_j=(x^j_1,x^j_2,..., x^j_n), 1\\leq j\\leq m$ and $t_B(x_i^1x_i^2... x_i^m)=1$ for input $m$-tuples $x_i^1x_i^2...x_i^m\\in B\\subseteq A\\subseteq \\{0,1\\}^n$, and 0, otherwise. Here the set $A$ is the promise set for function $f_B$. The input vectors $X_j, 1\\leq j\\leq m$ are given to the $m\\geq 2$ parties respectively, who communicate classical bits in a distributed environment so that one of them (say Alice) comes up with the value of the function. We algebraically characterize entanglement assisted LOCC protocols requiring only $m-1$ cbits of communication, for certain classes of such multiparty boolean functions for $m\\geq 2$ parties under appropriate uniform parity promise restrictions on input $m$-tuples $x_i^1x_i^2...x_i^m, 1\\leq i\\leq n$. In contrast, for certain $m$-party accumulative boo...

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

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

  8. Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean Functions

    CERN Document Server

    Maitra, S; Maitra, Subhamoy; Mukhopadhyay, Partha

    2004-01-01

    Boolean functions are important building blocks in cryptography for their wide application in both stream and block cipher systems. For cryptanalysis of such systems one tries to find out linear functions that are correlated to the Boolean functions used in the crypto system. Let $f$ be an $n$-variable Boolean function and its Walsh spectra is denoted by $W_f(\\omega)$ at the point $\\omega \\in \\{0, 1\\}^n$. The Boolean function is available in the form of an oracle. We like to find an $\\omega$ such that $W_f(\\omega) \

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

    International Nuclear Information System (INIS)

    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. (paper)

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

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

  12. 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...... arise. In short, I expose the regulatory anatomy of the policy landscape....

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

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

  15. Expectation-Maximization Approach to Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    Piscataway: IEEE, 2011, s. 559-566. ISBN 978-1-4244-9636-5. [IJCNN 2011. International Joint Conference on Neural Networks. San Jose (US), 31.07.2011-05.08.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * bars problem * dendritic inhibition * expectation-maximization * neural network application * statistics Subject RIV: IN - Informatics, Computer Science

  16. Neural Network Based Boolean Factor Analysis of Parliament Voting

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Polyakov, P.Y.; Húsek, Dušan; Řezanková, H.

    Heidelberg : Springer, 2006 - (Rizzi, A.; Vichi, M.), s. 861-868 ISBN 3-7908-1708-2. [COMPSTAT 2006. Symposium /17./. Rome (IN), 28.08.2006-01.09.2006] R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Grant ostatní: RFBR(RU) 05-07-90049 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural networks * social networks Subject RIV: BB - Applied Statistics, Operational Research

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

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

  19. Dimensionality Reduction in Boolean Data: Comparison of Four BMF Methods

    Czech Academy of Sciences Publication Activity Database

    Bartl, E.; Bělohlávek, R.; Osicka, P.; Řezanková, Hana

    Berlin: Springer, 2015 - (Masulli, F.; Petrosino, A.; Rovetta, S.), s. 118-133. (Lecture Notes in Computer Science. 7627). ISBN 978-3-662-48576-7. ISSN 0302-9743. [CHDD 2012. Clustering High-Dimensional Data. International Workshop /1./. Naples (IT), 15.05.2012-15.05.2012] R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk CZ.1.07/2.3.00/20.0059 Keywords : binary data * dimensionality reduction * Boolean factor analysis * matrix decomposition Subject RIV: BB - Applied Statistics, Operational Research

  20. Two Expectation-Maximization Algorithms for Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    2014-01-01

    Roč. 130, 23 April (2014), s. 83-97. ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014

  1. C*-algebras associated to Boolean dynamical systems

    OpenAIRE

    Pardo Espino, Enrique

    2016-01-01

    The goal of this talk is to present the C*-algebra $C^*(\\mathcal{B}, \\mathcal{L}, \\theta)$ of a Boolean dynamical system $(\\mathcal{B}, \\mathcal{L}, \\theta)$, that generalizes the $C^*$-algebra associated to a labelled graph introduced by Bates and Pask, and to determine its simplicity, its gauge invariant ideals, as well as compute its K-Theory. This is a joint work with Toke Meier Carlsen (Department of Science and Technology, University of the Faroe Islands) and Eduard Ortega (Departme...

  2. Comparison of Two Neural Networks Approaches to Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Polyakov, P.Y.; Frolov, A. A.; Húsek, Dušan

    Los Alamitos: IEEE Computer Society, 2009 - (Snášel, V.; Pokorný, J.; Pichappan, P.; El-Qawasmeh, E.), s. 316-321 ISBN 978-1-4244-4614-8. [NDT 2009. International Conference on Networked Digital Technologies /1./. Ostrava (CZ), 29.07.2009-31.07.2009] R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * artificial inteligence * neural networks * multivariate statistics * Boolean factor analysis * Hopfield-like neural networks * feed forward neural network Subject RIV: BB - Applied Statistics, Operational Research

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

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

  5. The number system hidden inside the Boolean satisfiability problem

    OpenAIRE

    Cho, Keum-Bae

    2014-01-01

    The Boolean satisfiability (SAT) problem is the first known example of an NP-complete problem, and thousands of NP-compete problems have been identified by reducing the SAT to the problems. Researchers have tried to find a definite mathematical expression that distinguishes among NL-complete, P-complete, and NP-complete problems such as 2-SAT, Horn-SAT, and 3-SAT. In this paper, we introduce the natural number system hidden inside the SAT structure. We reduce a SAT instance to an integer-prog...

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

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

  8. 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)

  9. 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…

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

  11. 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…

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

  13. 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. PMID:26565348

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

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

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

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

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

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

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

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

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

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

  5. Boolean Factor Analysis by Expectation-Maximization Method

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.

    Heidelberg : Springer, 2013 - (Kudělka, M.; Pokorný, J.; Snášel, V.; Abraham, A.), s. 243-254 ISBN 978-3-642-31602-9. ISSN 2194-5357. - (Advances in Intelligent Systems and Computing. 179). [IHCI 2011. International Conference on Intelligent Human Computer Interaction /3./. Prague (CZ), 29.08.2011-31.08.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070 Institutional research plan: CEZ:AV0Z10300504 Keywords : neural networks * hidden pattern search * Boolean factor analysis * generative model * information redundancy * exceptation-maximization Subject RIV: IN - Informatics, Computer Science

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

  7. Improving the User Query for the Boolean Model Using Genetic Algorithms

    CERN Document Server

    Nassar, Mohammad Othman; Mashagba, Eman Al

    2011-01-01

    The Use of genetic algorithms in the Information retrieval (IR) area, especially in optimizing a user query in Arabic data collections is presented in this paper. Very little research has been carried out on Arabic text collections. Boolean model have been used in this research. To optimize the query using GA we used different fitness functions, different mutation strategies to find which is the best strategy and fitness function that can be used with Boolean model when the data collection is the Arabic language. Our results show that the best GA strategy for the Boolean model is the GA (M2, Precision) method.

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

  9. Improving the User Query for the Boolean Model UsingGenetic Algorithms

    Directory of Open Access Journals (Sweden)

    Mohammad Othman Nassar

    2011-09-01

    Full Text Available The Use of genetic algorithms in the Information retrieval (IR area, especially in optimizing a user query in Arabic data collections is presented in this paper. Very little research has been carried out on Arabic text collections. Boolean model have been used in this research. To optimize the query using GA we used different fitness functions, different mutation strategies to find which is the best strategy and fitness function that can be used with Boolean model when the data collection is the Arabic language. Our results show that the best GA strategy for the Boolean model is the GA (M2, Precision method.

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

  11. [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

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

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

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

  15. Damage spreading in spatial and small-world random Boolean networks

    Science.gov (United States)

    Lu, Qiming; Teuscher, Christof

    2014-02-01

    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 as 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 nonrandom 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 Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance 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 arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. 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.

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

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

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

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

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

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

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

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

  4. Automated Method for Building CNOT Based Quantum Circuits for Boolean Functions

    CERN Document Server

    Younes, A; Younes, Ahmed; Miller, Julian

    2003-01-01

    In this paper we discuss an efficient technique that can implement any given Boolean function as a quantum circuit. The method converts a truth table of a Boolean function to the corresponding quantum circuit using a minimal number of auxiliary qubits. We give examples of some circuits synthesized with this technique. A direct result that follows from the technique is a new way to convert any classical digital circuit to its classical reversible form.

  5. Effect and Regulatory Mechanism of Clock Gene Per1 on Biological Behaviors of Human Oral Squamous Carcinoma Cell.

    Science.gov (United States)

    Han-Xue, L I; Kai, Yang; Xiao-Juan, F U; Qin, Zhao

    2016-04-10

    Objective To investigate the effect and regulatory mechanism of clock gene Per1 on the proliferation,apoptosis,migration,and invasion of human oral squamous carcinoma SCC15 cells. Methods RNA interference was used to knock down Per1 gene in human oral squamous cell carcinoma SCC15 cell line. Changes of cell proliferation and apoptosis were analyzed by flow cytometry. Transwell assay was carried out to assess cell migration and invasion. Real-time polymerase chain reaction was used to detect the mRNA expressions of Ki-67,murine double minute 2(MDM2),c-Myc,p53,Bax,Bcl-2,metalloproteinase (MMP)2,MMP9,and vascular endothelial growth factor (VEGF). Results shRNA-mediated knockdown of Per1 promoted the proliferation,migration and invasion capacity,and inhibited cell apoptosis capacity of SCC15 cells (all PKi-67,MDM2,Bcl-2,MMP2,and MMP9 and decreased the mRNA expressions of c-Myc,p53,and Bax (all P0.05). Conclusions Clock gene Perl can regulate important tumor-related genes downstream such as Ki-67,MDM2,c-Myc,p53,Bax,Bcl-2,MMP2,and MMP9,and the aberrant expression of Per1 can affect tumor cell proliferation,apoptosis,migration and invasion. An in-depth study of Per1 may further clarify the mechanism of tumorigenesis and tumor development and thus provides new effective molecular targets for cancer treatment. PMID:27181891

  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. On Using Cutting Planes in Pseudo-Boolean Optimization

    Directory of Open Access Journals (Sweden)

    Vasco M. Manquinho

    2006-03-01

    Full Text Available Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP. However, cutting plane techniques are seldom used in Pseudo-Boolean Optimization (PBO algorithms. This paper addresses the utilization of Gomory mixed-integer and clique cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds and for learning new constraints. A side result of learning new constraints is that the utilization of cutting planes enables non-chronological backtracking. Besides cutting planes, the paper also shows that the utilization of search restarts in PBO can be effective in practice, allowing the computation of tighter lower bounds each time the search restarts. The more aggressive lower bounds result from the constraints learned due to the utilization of cutting planes. Experimental results show that the integration of cutting planes and search restarts in a SAT-based algorithm for PBO yields a competitive new solution for PBO.

  8. Pueblo: A Hybrid Pseudo-Boolean SAT Solver

    Directory of Open Access Journals (Sweden)

    Hossein M. Sheini

    2006-03-01

    Full Text Available This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflict-induced learning. Novel features of our approach include a light-weight and efficient hybrid learning and backjumping strategy for analyzing PB constraints and CNF clauses in order to simultaneously learn both a CNF clause and a PB constraint with minimum overhead and use both to determine the backtrack level. Several techniques for handling the original and learned PB constraints are introduced. Overall, our method benefits significantly from the pruning power of the learned PB constraints, while keeping the overhead of adding them into the problem low. In this paper, we also address two other methods for solving PB problems, namely Integer Linear Programming (ILP and pre-processing to CNF SAT, and present a thorough comparison between them and our hybrid method. Experimental comparison of our method against other hybrid approaches is also demonstrated. Additionally, we provide details of the MiniSAT-based implementation of our solver Pueblo to enable the reader to construct a similar one.

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

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

    Science.gov (United States)

    Gong, Xinwei

    This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing

  11. Stabilizing gene regulatory networks through feedforward loops

    Science.gov (United States)

    Kadelka, C.; Murrugarra, D.; Laubenbacher, R.

    2013-06-01

    The global dynamics of gene regulatory networks are known to show robustness to perturbations in the form of intrinsic and extrinsic noise, as well as mutations of individual genes. One molecular mechanism underlying this robustness has been identified as the action of so-called microRNAs that operate via feedforward loops. We present results of a computational study, using the modeling framework of stochastic Boolean networks, which explores the role that such network motifs play in stabilizing global dynamics. The paper introduces a new measure for the stability of stochastic networks. The results show that certain types of feedforward loops do indeed buffer the network against stochastic effects.

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

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

    International Nuclear Information System (INIS)

    The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations

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

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Ting; Xu, Jian-yi [Key Laboratory of Modern Acoustics, Department of Physics and Collaborative Innovation Center of Advanced Microstructures, Nanjing University, Nanjing 210093 (China); Cheng, Ying, E-mail: chengying@nju.edu.cn; Liu, Xiao-jun, E-mail: liuxiaojun@nju.edu.cn [Key Laboratory of Modern Acoustics, Department of Physics and Collaborative Innovation Center of Advanced Microstructures, Nanjing University, Nanjing 210093 (China); State Key Laboratory of Acoustics, Chinese Academy of Sciences, Beijing 100190 (China); Guo, Jian-zhong [School of Physics and Information Technology, Shaanxi Normal University, Xian 710119 (China)

    2015-03-16

    The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations.

  15. Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability

    CERN Document Server

    Belov, Anton

    2011-01-01

    This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from real-world industrial SAT application domains. The recently introduced SLS method CRSat has been shown to noticeably improve on previously suggested SLS techniques in solving such real-world instances by combining justification-based local search with limited Boolean constraint propagation on the non-clausal formula representation form of Boolean circuits. In this work, we study possibilities of further improving the performance of CRSat by exploiting circuit-level structural knowledge for developing new search heuristics for CRSat. To this end, we introduce and experimentally evaluate a variety of search heuristics, many of which are motivated by circuit-level heuristics originally developed in completely different contexts, e.g., for electronic design automation applications. To the best of our knowledge, most of the heuristics are novel in the context of SLS for S...

  16. 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......, resulting in a set of linear equations that the weights must satisfy in order to minimize the bias in high resolution. These results generalize to larger classes of random sets, as well as to the design based situation, where a fixed set is observed on a stationary isotropic lattice. Finally, the formulas...... for the bias obtained for Boolean models are applied to existing algorithms in order to compare their accuracy....

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

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

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

  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 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…

  2. 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…

  3. Challenging Conventional Assumptions of Automated Information Retrieval with Real Users: Boolean Searching and Batch Retrieval Evaluations.

    Science.gov (United States)

    Hersh, William; Turpin, Andrew; Price, Susan; Kraemer, Dale; Olson, Daniel; Chan, Benjamin; Sacherek, Lynetta

    2001-01-01

    Describes research conducted at the TREC (Text Retrieval Conference) interactive track that compared Boolean and natural language searching, showing they achieved comparable results; and assessed the validity of batch-oriented retrieval evaluations, showing that the results from batch evaluations were not comparable to those obtained in…

  4. 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…

  5. Learning and Unlearning in Hopfield-Like Neural Network Performing Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

    Berlin : Springer, 2010 - (Koronacki, J.; Ras, Z.; Wierzchon, S.; Kacprzyk, J.), s. 501-518 ISBN 978-3-642-05176-0. - (Studies in Computational Intelligence. 262) Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield-like neural network * spurious attractors * statistics * bingy data Subject RIV: IN - Informatics, Computer Science

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

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

  8. 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…

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

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

  11. Applying Boolean discrete methods in the production of a real-valued probabilistic programming model

    OpenAIRE

    Nix, Jonathan Darren

    2016-01-01

    In this paper we explore the application of some notable Boolean methods, namely the Disjunctive Normal Form representation of logic table expansions, and apply them to a real-valued logic model which utilizes quantities on the range [0,1] to produce a probabilistic programming of a game character's logic in mathematical form.

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

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

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

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

  16. Ω-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枛,并研究与其相关的模糊子代数和Ω-模糊子代数。

  17. A short Boolean derivation of mean failure frequency for any (also non-coherent) system

    International Nuclear Information System (INIS)

    For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.

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

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

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

  1. 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).

  2. On a hierarchy of Boolean functions hard to compute in constant depth

    OpenAIRE

    Bernasconi, Anna

    2001-01-01

    Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation.\\par This work represents a step in this direction: we define a combinatorial property that makes Boolean functions ''\\emphhard'' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds ...

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

  4. Boolean implication networks derived from large scale, whole genome microarray datasets

    OpenAIRE

    Sahoo, Debashis; Dill, David L.; Gentles, Andrew J.; Tibshirani, Robert; Plevritis, Sylvia K.

    2008-01-01

    We describe a method for extracting Boolean implications (if-then relationships) in very large amounts of gene expression microarray data. A meta-analysis of data from thousands of microarrays for humans, mice, and fruit flies finds millions of implication relationships between genes that would be missed by other methods. These relationships capture gender differences, tissue differences, development, and differentiation. New relationships are discovered that are preserved across all three sp...

  5. Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain

    Czech Academy of Sciences Publication Activity Database

    Frolov, A.; Húsek, Dušan; Polyakov, P.Y.

    2016-01-01

    Roč. 27, č. 3 (2016), s. 538-550. ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 4.291, year: 2014

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

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

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

  9. Boolean model of Yeast Apoptosis as a tool to study yeast and human apoptotic regulations

    Directory of Open Access Journals (Sweden)

    MarijaCvijovic

    2012-12-01

    Full Text Available Programmed cell death (PCD is an essential cellular mechanism that is evolutionary conserved, mediated through various pathways and acts by integrating different stimuli. Many diseases such as neurodegenerative diseases and cancers are found to be caused by, or associated with, regulations in the cell death pathways. Yeast Saccharomyces cerevisiae, is a unicellular eukaryotic organism that shares with human cells components and pathways of the PCD and is therefore used as a model organism. Boolean modelling is becoming promising approach to capture qualitative behaviour and describe essential properties of such complex networks. Here we present large literature-based and to our knowledge first Boolean model that combines pathways leading to apoptosis (a type of PCD in yeast. Analysis of the yeast model confirmed experimental findings of anti-apoptotic role of Bir1p and pro-apoptotic role of Stm1p and revealed activation of the stress protein kinase Hog proposing the maximal level of activation upon heat stress. In addition we extended the yeast model and created an in silico humanized yeast in which human pro- and anti-apoptotic regulators Bcl-2 family and Valosin-contain protein (VCP are included in the model. We showed that accumulation of Bax in in silico humanized yeast shows apoptotic markers and that VCP is essential target of Akt Signaling. The presented Boolean model provides comprehensive description of yeast apoptosis network behaviour. Extended model of humanized yeast gives new insights of how complex human disease like neurodegenration can initially be tested.

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

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

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

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

  14. 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].

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

  16. 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)

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

  18. Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks

    Directory of Open Access Journals (Sweden)

    Wai-Ki Ching

    2008-09-01

    Full Text Available A Boolean network (BN is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the importance of gene ordering. Especially, setting internal nodes ahead yields shorter computational time than setting external nodes ahead in various types of algorithms. We also present a heuristic algorithm which does not look for the optimal solution but for the solution whose computational time is shorter than that of the exact algorithms.

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

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

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

  2. Application of Neural Network Boolean Factor Analysis Procedure to Automatic Conference Papers Categorization

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Frolov, A. A.; Polyakov, P.Y.; Řezanková, H.; Snášel, V.

    Lisabon : Instituto Nacional de Estatística, 2008 - (Gomes, M.; Pinto Martins, J.; Silva, J.), s. 3739-3742 ISBN 978-972-673-992-0. [ISI 2007. Session of the International Statistical Institute /56./. Lisboa (PT), 22.08.2007-29.08.2007] R&D Projects: GA AV ČR 1ET100300414 Grant ostatní: RFBR(RU) 05-07-90049 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * document classification * automatic concepts search * unsupervised learning * neural network Subject RIV: BB - Applied Statistics, Operational Research

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

    International Nuclear Information System (INIS)

    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

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

    Science.gov (United States)

    Strahler, Alan H.; Jupp, David L. B.

    1990-01-01

    Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.

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

  6. Neural Network Based Boolean Factor Analysis: Efficient Tool for Automated Topics Search.

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Frolov, A. A.; Polyakov, P.Y.; Řezanková, H.

    Amman: Applied Science Private University, 2006 - (Issa, G.; El-Qawasmeh, E.; Raho, G.), s. 321-327 ISBN 9957-8592-0-X. [CSIT 2006. International Multiconference on Computer Science and Information Technology /4./. Amman (JO), 05.04.2006-07.04.2006] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural networks * associative memory * clustering * web searching * semantic web * information retrieval * document indexing * document classification * document processing * data mining * machine learning Subject RIV: BB - Applied Statistics, Operational Research

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

  8. Phosphorylation of Raf-1 serine 338-serine 339 is an essential regulatory event for Ras-dependent activation and biological signaling.

    OpenAIRE

    Diaz, B.; Barnard, D.; Filson, A; MacDonald, S; King, A.; Marshall, M.

    1997-01-01

    Activation of the Raf serine/threonine protein kinases is tightly regulated by multiple phosphorylation events. Phosphorylation of either tyrosine 340 or 341 in the catalytic domain of Raf-1 has been previously shown to induce the ability of the protein kinase to phosphorylate MEK. By using a combination of mitogenic and enzymatic assays, we found that phosphorylation of the adjacent residue, serine 338, and, to a lesser extent, serine 339 is essential for the biological and enzymatic activit...

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

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

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

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

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

  14. Quantum-state filtering applied to the discrimination of Boolean functions

    International Nuclear Information System (INIS)

    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 nonorthogonal states, { vertical bar ψ1>,..., vertical bar ψN>}, for distinguishing vertical bar ψ1> from the set { vertical bar ψ2>,..., vertical bar ψN>} and the corresponding optimal success and failure probabilities. In a previous paper [Phys. Rev. Lett. 90, 257901 (2003)], we sketched an application of the results to probabilistic quantum algorithms. Here we fill the gaps and give the complete derivation of the probabilistic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions

  15. 高阶布尔网络的结构%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代数形式的关系.

  16. Genetic and molecular biological studies of the products of nitrogen regulatory genes ntrB and ntrC of enteric bacteria

    International Nuclear Information System (INIS)

    EcoR1 restriction fragments of 4.1 kilobase pairs carrying wild type or mutant ntrB and ntrC genes of Salmonella typhimurium have been subcloned into a variety of plasmid vectors. In vivo and in vitro protein synthesis from the plasmids, as monitored by 35S-methionine labelling, has resulted in the identification of the ntrB and ntrC gene products as proteins with apparent molecular weights of 38 and 54 kilodaltons, respectively. Regulation of the gInA and ntrB promoters by purified ntrC product has been studied using a bacterial in vitro transcription/translation system. The reaction is programmed with templates carrying a fusion of the Salmonella gInA or ntrB structural gene and upstream promoter/regulatory sequences to lacZ. Use of such templates allows regulation to be monitored as changes in beta-galactosidase activity. Studies comparing regulation by a mutant form of the ntrC product, here called NtrC(Con), to regulation by the wild type protein, NtrC(wt), are discussed. Initial in vitro studies exploring activity of the ntrA product present in the S30's are described. Finally, the ntrA product is identified as a protein with an apparent molecular weight of 73 kilodaltons

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

  18. Cryptanalysis of a modified encryption scheme based on bent Boolean function and feedback with carry shift register

    Science.gov (United States)

    Stoyanov, B. P.; Kordov, K. M.

    2013-10-01

    We propose a modified encryption scheme based on 256 bit bent Boolean function and Feedback with Carry Shift Register. We estimated the output bits properties by the NIST, DIEHARD and ENT test packages. The results of the cryptanalysis show that the new cryptographic scheme provides an exclusive level of data security.

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

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

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

  2. 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).

  3. Attractor Neural Network Combined with Likelihood Maximization Algorithm for Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A.; Húsek, Dušan; Polyakov, P.Y.

    Vol. 1. Berlin: Springer, 2012 - (Wang, J.; Yen, G.; Polycarpou, M.), s. 1-10. (Lecture Notes in Computer Science. 7367). ISBN 978-3-642-31345-5. ISSN 0302-9743. [ISNN 2012. International Symposium on Neural Networks /9./. Shenyang (CN), 11.07.2012-14.07.2012] R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070 Institutional research plan: CEZ:AV0Z10300504 Keywords : Associative Neural Network * Likelihood Maximization * Boolean Factor Analysis * Binary Matrix factorization * Noise XOR Mixing * Plato Problem * Information Gain * Bars problem * Data Mining * Dimension Reduction * Hebbian Learning * Anti-Hebbian Learning Subject RIV: IN - Informatics, Computer Science

  4. The behavior of noise-resilient Boolean networks with diverse topologies

    International Nuclear Information System (INIS)

    The dynamics of noise-resilient Boolean networks with majority functions and diverse topologies is investigated. A wide class of possible topological configurations is parametrized as a stochastic blockmodel. For this class of networks, the dynamics always undergoes a phase transition from a non-ergodic regime, where a memory of its past states is preserved, to an ergodic regime, where no such memory exists and every microstate is equally probable. Both the average error on the network and the critical value of noise where the transition occurs are investigated analytically, and compared to numerical simulations. The results for 'partially dense' networks, comprising relatively few, but dynamically important nodes, which have a number of inputs that greatly exceeds the average for the entire network, give very general upper bounds on the maximum resilience against noise attainable on globally sparse systems

  5. Quantum tests for the linearity and permutation invariance of Boolean functions

    International Nuclear Information System (INIS)

    The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is ε-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order ε-2/3 calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.

  6. Statistical and algebraic analysis of a family of random Boolean equations

    International Nuclear Information System (INIS)

    The statistical and algebraic properties of a family of random Boolean equations are studied in this paper. Based on studying the mechanism of influence propagation from some variable fixed to 1, the giant strongly connected component and magnetization of solutions are investigated, which exhibit the splitting phenomenon of solution space and a ferromagnetic transition. Furthermore, by analyzing the semi-group property of the solution space and the influence of propagation from some variable fixed to 0, the scale of generating elements is calculated, which undergoes linear, polynomial and exponential phases. Compared with the analysis by statistical mechanics, it is suggested that these different phases of algebraic complexity correspond to the structural complexity of the solution space as replica symmetry, one-step replica symmetry breaking and further-step replica symmetry breaking phases. It is supposed that the structural complexity of solution space can be interpreted from the viewpoint of algebra

  7. Critical line in undirected Kauffman Boolean networks - the role of percolation

    International Nuclear Information System (INIS)

    We show that to describe correctly the position of the critical line in Kauffman random Boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of percolation transition is much simpler in random undirected networks than in the directed ones, we study the Kauffman model in undirected networks. We derive the mean field formula for the critical line in the giant components of these networks, and show that the critical line characterizing the whole network results from the fact that the ordered behavior of small clusters shields the chaotic behavior of the giant component. We also show a possible attitude towards the analytical description of the shielding effect. The theoretical derivations given in this paper very much tally with the numerical simulations done for classical random graphs

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

  9. An Efficient Higher Order And High Speed Kogge-Stone Based CSLA Using Common Boolean Logic

    Directory of Open Access Journals (Sweden)

    Kuppampati Prasad,

    2014-06-01

    Full Text Available Adders are the basic building blocks of any processor or data path application. In adder design carry generation is the critical path. In this paper, we propose An Efficient and high speed carry select adder by replacing Ripple Carry Adders with parallel prefix adders (Kogge-Stone for Cin=0 stage and common Boolean logic for Cin=1 stage. In this proposed method we can reduce delay and area by 3%, 26% and 5% for 16-bit , 5%, 34% and 14% for 32-bit, 8%, 41% and 19% for 64-bit and 9%,46% and 21% for 128-bit compare to the modified adders (Regular CSLA, Regular with BEC and Regular with CBL.

  10. Design of Logic Controllers Thanks to Symbolic Computation of Simultaneously Asserted Boolean Equations

    Directory of Open Access Journals (Sweden)

    Jean-Marc Roussel

    2014-01-01

    Full Text Available Formal methods can strongly contribute to improve dependability of controllers during design, by providing means to avoid flaws due to designers' omissions or specifications misinterpretations. This paper presents a synthesis method dedicated to logic controllers. Its goal is to obtain the control laws from specifications given in natural language by symbolic computation. The formal framework that underlies this method is the Boolean algebra of n-variable switching functions. In this algebra, thanks to relations and theorems presented in this paper, it is possible to formally express logical controllers specifications, to automatically detect inconsistencies in specifications, and to obtain automatically the set of solutions or to choose an optimal solution according to given optimization criteria. The application of this synthesis method to an example allows illustrating its main advantages.

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

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

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

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

  15. Decisional Processes with Boolean Neural Network: The Emergence of Mental Schemes

    International Nuclear Information System (INIS)

    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. (authors)

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

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

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

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

  20. Progress report on the regulatory cooperation program between the Norwegian Radiation Protection Authority and the Federal Medical Biological Agency of Russia. Final report of projects and other activities completed in 2008-2009 and plans for 2010-2011

    Energy Technology Data Exchange (ETDEWEB)

    Roudak, S. F.; Sneve, M. K.; Kiselev, M.; Shandala, N. K.

    2011-06-15

    This report sets out the progress made in the projects and related activities carried out in the period 2008 - 2009 within the Regulatory Cooperation Program between the Norwegian Radiation Protection Authority and the Federal Medical Biological Agency of Russia. The progress described follows directly from previous work carried out within the Regulatory Cooperation Program, as set out in earlier NRPA reports and in accordance with the Norwegian Government's Plan of Action to improve nuclear and radiation safety in Northwest Russia. The work was carried out by specialists of the Burnasyan Federal Medical Biophysical Centre, with support from other Russian organisations and specialists as well as experts from the NRPA. Five main projects are described, each of which has contributed to the improvement of regulatory supervision by the FMBA over the sites operated by SevRAO in the Northwest of Russia, including the Sites for Temporary Storage at Andreyev Bay and Gremikha, and the Regional Centre for Waste Conditioning and Long-term Storage at Saida Bay. The main activities of interest include recovery and secure the safe condition of spent nuclear fuel and radioactive waste from inadequate storage facilities and ensuring their continued future safe storage. The topics covered by these projects include: Control of Occupational Exposure and Optimisation During Hazardous Operations through the Development of Databases on Radiation Situation and Individual Occupational Exposure (DOSEMAP). The software for a mapping database of radiation situation parameters at SevRAO Facilities has been developed. A computer scheme of workshops in new Complex facilities for the spent nuclear fuel and radioactive waste management, the design of which is already available, has been developed. The software for the database on individual doses to the SevRAO workers has also been developed. Two draft guidance documents have been prepared: 'Application of the database on the radiation

  1. Apprehending multicellularity: regulatory networks, genomics and evolution

    OpenAIRE

    Aravind, L.; Anantharaman, Vivek; Venancio, Thiago M.

    2009-01-01

    The genomic revolution has provided the first glimpses of the architecture of regulatory networks. Combined with evolutionary information, the “network view” of life processes leads to remarkable insights into how biological systems have been shaped by various forces. This understanding is critical because biological systems, including regulatory networks, are not products of engineering but of historical contingencies. In this light, we attempt a synthetic overview of the natural history of ...

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

  3. APPLICATION OF THE OVERLAY WEIGHTED MODEL AND BOOLEAN LOGIC TO DETERMINE THE BEST LOCATIONS FOR ARTIFICIAL RECHARGE OF GROUNDWATER

    Directory of Open Access Journals (Sweden)

    Max Billib

    2011-12-01

    Full Text Available With population increase, lack of conventional fresh water resources and uncertainties due to climate change, there is growing interest in the arid and semi-arid areas to increase groundwater recharge with recycled water. Finding the best locations for artificial recharge of groundwater in such areas is one of the most crucial design steps to guarantee the long life and the sustainability of these projects. This study presents two ways to go about performing analysis; creating a suitability map to find out the suitability of every location on the map and another way is querying the created data sets to obtain a Boolean result of true or false map. These techniques have been applied on Sadat Industrial City which is located in a semi arid area in the western desert fringes of The Nile delta in the north west of Egypt. Thematic layers for number of parameters were prepared from some maps and satellite images and they have been classified, weighted and integrated in ArcGIS environment. By the means of the overlay weighted model in ArcGIS a suitability map which is classified into number of priority zones was obtained and it could be compared with the obtained true-false map of Boolean logic. Both methods suggested mostly the northern parts of the city for groundwater recharge; however the weighted model could give more accurate suitability map while Boolean logic suggested wider ranges of areas. This study recommends Boolean logic as a first estimator for locating the best locations as it is easier and not time consuming, while the overlay weighted model for more accurate results.

  4. Origin and Elimination of Two Global Spurious Attractors in Hopfield-Like Neural Network Performing Boolean Factor Analysis

    Czech Academy of Sciences Publication Activity Database

    Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.

    2010-01-01

    Roč. 73, č. 7-9 (2010), s. 1394-1404. ISSN 0925-2312 R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining Subject RIV: IN - Informatics, Computer Science Impact factor: 1.429, year: 2010

  5. 伪布尔链上的α、β算子%α,β 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.%提出了伪布尔链上的α和β算子,研究了它们的性质并应用这两种算子求解含一个变量的不等式.

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

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

  8. 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)

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

    Science.gov (United States)

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

    2014-02-01

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

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

  11. Regulatory Physiology

    Science.gov (United States)

    Lane, Helen W.; Whitson, Peggy A.; Putcha, Lakshmi; Baker, Ellen; Smith, Scott M.; Stewart, Karen; Gretebeck, Randall; Nimmagudda, R. R.; Schoeller, Dale A.; Davis-Street, Janis

    1999-01-01

    As noted elsewhere in this report, a central goal of the Extended Duration Orbiter Medical Project (EDOMP) was to ensure that cardiovascular and muscle function were adequate to perform an emergency egress after 16 days of spaceflight. The goals of the Regulatory Physiology component of the EDOMP were to identify and subsequently ameliorate those biochemical and nutritional factors that deplete physiological reserves or increase risk for disease, and to facilitate the development of effective muscle, exercise, and cardiovascular countermeasures. The component investigations designed to meet these goals focused on biochemical and physiological aspects of nutrition and metabolism, the risk of renal (kidney) stone formation, gastrointestinal function, and sleep in space. Investigations involved both ground-based protocols to validate proposed methods and flight studies to test those methods. Two hardware tests were also completed.

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

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

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

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

  16. A new class of hyper-bent Boolean functions in binomial forms

    CERN Document Server

    Wang, Baocheng; Qi, Yanfeng; Yang, Yixian; Xu, Maozhi

    2011-01-01

    Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\\pm 2^{\\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as S-box, block cipher and stream cipher. Further, they have been applied to coding theory, spread spectrum and combinatorial design. Hyper-bent functions, as a special class of bent functions, were introduced by Youssef and Gong in 2001, which have stronger properties and rarer elements. Many research focus on the construction of bent and hyper-bent functions. In this paper, we consider functions defined over $\\mathbb{F}_{2^n}$ by $f_{a,b}:=\\mathrm{Tr}_{1}^{n}(ax^{(2^m-1)})+\\mathrm{Tr}_{1}^{4}(bx^{\\frac{2^n-1}{5}})$, where $n=2m$, $m\\equiv 2\\pmod 4$, $a\\in \\mathbb{F}_{2^m}$ and $b\\in\\mathbb{F}_{16}$. When $a\\in \\mathbb{F}_{2^m}$ and $(b+1)(b^4+b...

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

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

  19. 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. PMID:26079754

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

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

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

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

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

  5. Comparison of Neural Network Boolean Factor Analysis Method with Some Other Dimension Reduction Methods on Bars Problem

    Czech Academy of Sciences Publication Activity Database

    Húsek, Dušan; Moravec, P.; Snášel, V.; Frolov, A.; Řezanková, H.; Polyakov, P.Y.

    Berlin : Springer, 2007 - (Ghosh, A.; De, R.), s. 235-243 ISBN 978-3-540-77045-9. - (Lecture Notes in Computer Science. 4815). [PReMI 2007. International Conference /2./. Kolkata (IN), 18.12.2007-22.12.2007] R&D Projects: GA MŠk(CZ) 1M0567; GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural network * dimension reduction * cluster analysis Subject RIV: BB - Applied Statistics, Operational Research

  6. Parameter Learning of Boolean Bayesian Networks%布尔型贝叶斯网络参数学习

    Institute of Scientific and Technical Information of China (English)

    吴永广; 周兴旺

    2015-01-01

    布尔型贝叶斯网络是一类由布尔型变量组成的网络,它能够以线性多变量函数描述,使计算和处理上灵活高效。通过运用连接树算法对络进行分块化处理的方法,可以提高算法的效率,然后以传统的最大似然估计方法对布尔型网络的参数进行学习。服从同一分布律的贝叶斯网络参数学习算法发展比较成熟,这类以狄利克雷或者高斯分布为基础的算法在应用领域中难以发挥其应有的价值。相比之下,基于布尔型贝叶斯网络下的参数学习更贴近于应用,在人工智能和数据挖掘等领域有很好的发展前景。%Boolean Bayesian network is a class of Bayesian networks which are made up of Boolean varia-bles. The method to describe the network with a multi-linear function is flexible and efficient to compute and process variables. By introducing Junction Tree algorithm,the network can be divided into blocks which can make it easy to calculate. Then the traditional maximum likelihood estimation method was used for learning Boolean networks. Parameter learning algorithm following the same distribution is more ma-ture,but this kind of algorithm based on Dirichlet or Gaussian distribution is difficult to play its proper val-ue in practice. In contrast,parameter learning based on Boolean networks gets close to applications. It has good prospects for development in areas such as artificial intelligence and data mining.

  7. Linear equations for the number of intervals which are isomorphic with Boolean lattices and the Dehn--Sommerville equations

    CERN Document Server

    Hegedüs, Gábor

    2010-01-01

    Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number of the cliques $K_{i+1}$, contained in the graph $G(P)$. Our main results are some linear equations connecting the numbers $f_i(P)$ and $b_i(L)$. We reprove the Dehn--Sommerville equations for simplicial polytopes. In our proof we use free resolutions and the theory of Stanley--Reisner rings.

  8. 布尔函数与形态算子关系的研究%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.

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

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

  11. Mutational Robustness of Gene Regulatory Networks

    OpenAIRE

    Dijk, van, G.; Mourik, van, J.A.; Ham, van, R.C.H.J.

    2012-01-01

    Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor – target gene interactions) but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e....

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

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

  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. 布尔函数的迹单项式逼近%Trace Function Monomials Approximation of Boolean Functions

    Institute of Scientific and Technical Information of China (English)

    祁传达; 袁小转; 邵辉

    2014-01-01

    A new spectrum of Boolean function was presented by monomial trace function instead of linear func -tion.The new spectrum was called as d-Walsh cyclic spectrum .Trace function monomials best approximation of Boole-an function was investigated and found by computing d-Walsh cyclic spectrum and the computational complexity was just 22n/n .By monomial trace function approximating the feedforward function of stream cipher , it is possible to com-mit a decimation attack on stream cipher , which may have important implications for cipher design and analysis .%提出了用单项迹函数代替线性函数来定义的布尔函数一种新的谱值,称之为布尔函数的d-Walsh循环谱,通过计算d-Walsh循环谱来研究布尔函数的最佳单项迹函数逼近,使用该方法的计算复杂性仅为22n/n 。利用单项迹函数逼近序列密码的前馈函数可实现对序列密码的采样攻击,对序列密码设计与分析具有重要意义。

  16. Some Applications of Quantum Walks to a General Class of Searches and the Computation of Boolean Functions

    Science.gov (United States)

    Cottrell, Seth S.

    In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are ''tuned'' so that their time step operators have degenerate eigenvalues, and only certain initial states are effective. More than that, the searches are never faster than order square root of N time. In this thesis the problem is defined rigorously, the causes for all of these patterns are identified, sufficient and necessary conditions for quadratic-speed searches for any connected subgraph are demonstrated, the tolerance of these conditions is investigated, and it is shown that (unfortunately) we can do no better than order square root of N time. Along the way, a useful formalism is established that may be useful in future work involving highly symmetric graphs. The tools and techniques so derived are then used to demonstrate that tree graphs can be used for the computation of Boolean functions. The philosophy of Farhi's work on the continuous-time NAND tree is applied to a discrete-time walk with any (AND, OR, NAND, or NOR) gate at each vertex. Tentative results show that the vast majority of possible Boolean functions on N bits can be calculated in order square root of N time.

  17. Using three-dimensional reconstructed microstructures for predicting intrinsic permeability of reservoir rocks based on a Boolean lattice gas method

    Energy Technology Data Exchange (ETDEWEB)

    Santos, L.O.E.; Philippi, P.C.; Fernandes, C.P. [Porous Media and Thermophysical Properties Laboratory LMPT, Mechanical Engineering Department, Federal University of Santa Catarina, 88040-900 , SC Florianopolis (Brazil); Damiani, M.C. [Engineering Simulation and Scientific Software ESSS, Parque Tecnologico de Florianopolis, Rodovia SC 401 km 001, 88030-000 , SC Florianopolis (Brazil)

    2002-07-01

    This paper presents a method for predicting the intrinsic permeability of porous media based on the integration of the local velocity field. Three-dimensional representations of the porous structure are reconstructed from two-dimensional binary images, after segmentation of digital images acquired from thin plates, commonly used in microscopy. Velocity field is calculated on these three-dimensional representations using a Boolean lattice gas method (LGA). Reconstruction is based on a Gaussian stochastic simulation. Mercury-intrusion results furnish auxiliary data that are used for the estimation of a critical percolation diameter and to establish a necessary condition for the binary source images to give accurate predictions of permeability, considering the intrinsic limitations of the reconstruction process. Reconstruction method and connection loss, resolution factor, adherence conditions and the effects of Boolean noise in the calculation of permeability are fully discussed. The method is used to simulate flows through several petroleum reservoir rocks, leading to intrinsic permeability prediction. Simulation is compared with experimental results. Considered as an intrinsic permeability prediction method based on the geometrical information that is possible to recovery from microscopy thin plates, three-dimensional reconstruction appears to be the most critical step in present simulation scheme.

  18. 基于布尔语义的Gentzen推导模型%Gentzen Deduction Model Based on Boolean Logic Semantics

    Institute of Scientific and Technical Information of China (English)

    陈博; 眭跃飞

    2015-01-01

    Deduction systems are important arts of searching technology. This paper gives a new correspondence between the propositional logic and Boolean algebra, where an inequation is corresponding to a Gentzen sequent, so that the inequation is true in every Boolean algebra if and only if the Gentzen sequent is provable. In information retrieval, the information inference can effectively turn into the operation on poset. Precisely, the logical language for the propositional logic contains operators Ø'Ù'Ú;the terms instead of formulas are defined (a|Øt|t1 Ù t2|t1 Ú t2 , where a is an element) and used to represent elements in Boolean algebra. This paper defines an assignment v using Boolean algebra as its domain, and assigns the terms to be the element in Boolean algebra. The sequence ΓÞΔ is satisfied if tv £tv. Finally, this paper gives a Gentzen system to prove the soundness and completeness theorem.%布尔模型是信息检索系统的一种基础模型。给出了命题逻辑和布尔代数间的一种新的对应关系,其中布尔代数中的不等式对应Gentzen系统中的矢列式,使得当一个不等式在任意布尔代数中为真,当且仅当它所对应的矢列式是可证的。并且使得在信息检索中,针对信息的推理可以有效地转为偏序集上的运算。讨论的命题逻辑语言的运算符为Ø、Ù、Ú;并且定义了项(a|Øt|t1Ù t2|t1Ú t2'其中a是一个元素)来替代原先的公式和表示布尔代数中的元素。此外,定义了以布尔代数为论域的赋值v,将命题逻辑中的项赋值为布尔代数中的元素,并且如果tv £t v ,则矢列式ΓÞ D为真。最后给出了Gentzen系统下的可靠性和完备性定理的证明。tÎΓtÎΔ

  19. Method of Transfer from Logical Schemes of Algorithms to Boolean Functions

    Science.gov (United States)

    Dyachenko, V. F.

    1964-01-01

    The author discusses a method for obtaining the Boolean functions describing the structure of a control circuit by means of AS operators whose sequence of operations is given in the form of a logical scheme or matrix scheme for an algorithm. An example of AS synthesis is given.

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

    OpenAIRE

    Arellano Gustavo; Argil Julián; Azpeitia Eugenio; Benítez Mariana; Carrillo Miguel; Góngora Pedro; Rosenblueth David A.; Alvarez-Buylla Elena R

    2011-01-01

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

  1. Image Restoration Research Based on Boolean Cloud Model Algorithm%基于布尔云模型算法的图像修复研究

    Institute of Scientific and Technical Information of China (English)

    王宝红; 郭水旺; 季钢

    2013-01-01

    Aiming at the deficiencies of the existing image restoration algorithm,Boolean cloud model algorithm is used.First the cloud model is constructed,cloud entropy to determine cloud Boolean relations,clouds appear,Boolean logic to calculate each cloud droplet collection of mutual information entropy,entropy of different results to determine value.Followed by the input and Boolean cloud state function determines the cloud model decision by input Boolean function can produce new clouds again,optimize cloud states choose different cloud entropy dynamic changes.Finally,the algorithm processes.simulation results show operator to connect natural repair image,smoothness,to maintain the overall continuous,and PSNR value.%针对现有图像修复算法的不足,采用布尔云模型算法.首先构造云模型,利用云熵确定云布尔关系.不同的云团值出现时,布尔逻辑计算每个云滴集合的互信息熵.通过比较熵的不同来确定结果值;接着在受输入和布尔函数决定后产生云态,云模型在受输入和布尔函数决定后,可以再次产生新的云团.对云态进行选择优化,其不同的云熵动态变化,最后给出了算法流程.仿真结果显示算法对修复图像连接自然,有光滑性,保持了整体连续,并且PSNR值较大.

  2. Testing Regulatory Consistency

    OpenAIRE

    Robert Breunig; Flavio M. Menezes

    2008-01-01

    We undertake an analysis of regulatory consistency using a database of publicly available regulatory decisions in Australia. We propose a simple exploratory model which allows us to test for regulatory consistency across jurisdictions and industries without detailed knowledge of the regulatory process. We compare two measures using our approach--the weighted average cost of capital and the proportion of firms’ revenue requirement claims disallowed by the regulator. We advocate use of the seco...

  3. Modeling formalisms in Systems Biology

    OpenAIRE

    Machado, C. D.; Costa, Rafael S.; Rocha, Miguel; Ferreira, E. C.; Tidor, Bruce; Rocha, I.

    2011-01-01

    Systems Biology has taken advantage of computational tools and high-throughput experimental data to model several biological processes. These include signaling, gene regulatory, and metabolic networks. However, most of these models are specific to each kind of network. Their interconnection demands a whole-cell modeling framework for a complete understanding of cellular systems. We describe the features required by an integrated framework for modeling, analyzing and simulating biological proc...

  4. INCLUSION RATIO BASED ESTIMATOR FOR THE MEAN LENGTH OF THE BOOLEAN LINE SEGMENT MODEL WITH AN APPLICATION TO NANOCRYSTALLINE CELLULOSE

    Directory of Open Access Journals (Sweden)

    Mikko Niilo-Rämä

    2014-06-01

    Full Text Available A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation of its variance is derived. The accuracies of the approximations are evaluated by means of simulation experiments. The novel method is compared to other methods and applied to real-world industrial data from nanocellulose crystalline.

  5. Boole代数上的几个新度量结构%Several New Metric Structures on Boolean Algebra

    Institute of Scientific and Technical Information of China (English)

    左卫兵; 娄妍

    2011-01-01

    设B是Boole代数,Ω是B到Boole代数{0,1}的全体格同态,μ是Ω上的概率测度,基于B中元素的尺寸的概念提出了元素之间的几个伪度量,建立了B上的度量结构,研究了其上运算的连续性及相互关系.%Let B be a Boolean algebra and ft the set of all homomorphisms from B into {0,1}, and μ be a probability measure on Ω. Based on the concept of sizes of elements of B several new metrics on the pairs of elements are introduced, and the metric structures on B are established, finally, the propositions of continuity of the operations on B are studied.

  6. T follicular regulatory cells.

    Science.gov (United States)

    Sage, Peter T; Sharpe, Arlene H

    2016-05-01

    Pathogen exposure elicits production of high-affinity antibodies stimulated by T follicular helper (Tfh) cells in the germinal center reaction. Tfh cells provide both costimulation and stimulatory cytokines to B cells to facilitate affinity maturation, class switch recombination, and plasma cell differentiation within the germinal center. Under normal circumstances, the germinal center reaction results in antibodies that precisely target foreign pathogens while limiting autoimmunity and excessive inflammation. In order to have this degree of control, the immune system ensures Tfh-mediated B-cell help is regulated locally in the germinal center. The recently identified T follicular regulatory (Tfr) cell subset can migrate to the germinal center and inhibit Tfh-mediated B-cell activation and antibody production. Although many aspects of Tfr cell biology are still unclear, recent data have begun to delineate the specialized roles of Tfr cells in controlling the germinal center reaction. Here we discuss the current understanding of Tfr-cell differentiation and function and how this knowledge is providing new insights into the dynamic regulation of germinal centers, and suggesting more efficacious vaccine strategies and ways to treat antibody-mediated diseases. PMID:27088919

  7. Modeling parsimonious putative regulatory networks: complexity and heuristic approach

    OpenAIRE

    Acuña, Vicente; Aravena, Andrés; Maass, Alejandro; Siegel, Anne

    2014-01-01

    International audience A relevant problem in systems biology is the description of the regulatory interactions between genes. It is observed that pairs of genes have significant correlation through several experimental conditions. The question is to find causal relationships that can explain this experimental evidence. A putative regulatory network can be represented by an oriented weighted graph, where vertices represent genes, arcs represent predicted regulatory interactions and the arc ...

  8. Biological Threats

    Science.gov (United States)

    ... Workplace Plans School Emergency Plans Main Content Biological Threats Biological agents are organisms or toxins that can ... for Disease Control and Prevention . Before a Biological Threat Unlike an explosion, a biological attack may or ...

  9. Logical Reduction of Biological Networks to Their Most Determinative Components.

    Science.gov (United States)

    Matache, Mihaela T; Matache, Valentin

    2016-07-01

    Boolean networks have been widely used as models for gene regulatory networks, signal transduction networks, or neural networks, among many others. One of the main difficulties in analyzing the dynamics of a Boolean network and its sensitivity to perturbations or mutations is the fact that it grows exponentially with the number of nodes. Therefore, various approaches for simplifying the computations and reducing the network to a subset of relevant nodes have been proposed in the past few years. We consider a recently introduced method for reducing a Boolean network to its most determinative nodes that yield the highest information gain. The determinative power of a node is obtained by a summation of all mutual information quantities over all nodes having the chosen node as a common input, thus representing a measure of information gain obtained by the knowledge of the node under consideration. The determinative power of nodes has been considered in the literature under the assumption that the inputs are independent in which case one can use the Bahadur orthonormal basis. In this article, we relax that assumption and use a standard orthonormal basis instead. We use techniques of Hilbert space operators and harmonic analysis to generate formulas for the sensitivity to perturbations of nodes, quantified by the notions of influence, average sensitivity, and strength. Since we work on finite-dimensional spaces, our formulas and estimates can be and are formulated in plain matrix algebra terminology. We analyze the determinative power of nodes for a Boolean model of a signal transduction network of a generic fibroblast cell. We also show the similarities and differences induced by the alternative complete orthonormal basis used. Among the similarities, we mention the fact that the knowledge of the states of the most determinative nodes reduces the entropy or uncertainty of the overall network significantly. In a special case, we obtain a stronger result than in previous

  10. Research and regulatory review

    International Nuclear Information System (INIS)

    To enable the regulatory review to be effectively undertaken by the regulatory body, there is a need for it to have ready access to information generated by research activities. Certain advantages have been seen to be gained by the regulatory body itself directly allocating and controlling some portion of these activities. The princial reasons for reaching this conclusion are summarised and a brief description of the Inspectorates directly sponsored programme outlined. (author)

  11. Computer algebra in systems biology

    CERN Document Server

    Laubenbacher, Reinhard

    2007-01-01

    Systems biology focuses on the study of entire biological systems rather than on their individual components. With the emergence of high-throughput data generation technologies for molecular biology and the development of advanced mathematical modeling techniques, this field promises to provide important new insights. At the same time, with the availability of increasingly powerful computers, computer algebra has developed into a useful tool for many applications. This article illustrates the use of computer algebra in systems biology by way of a well-known gene regulatory network, the Lac Operon in the bacterium E. coli.

  12. Research on non-line Boolean function realization technology%非线性布尔函数实现技术研究

    Institute of Scientific and Technical Information of China (English)

    常忠祥; 戴紫彬; 李伟; 刘楠; 戴强

    2014-01-01

    To improve the processing efficiency of nonline Boolean function in processor,a non-line Boolean function model was established based on extract shift and and-XOR.The model used the decimation shift operation for selecting the variables in-volved in operations,and-XOR operation was utilized to achieve different times and XOR between items.Finally,performances evaluation and adaptation functions were presented.The results showed that computational model of non-line Boolean function could significantly reduce the number of operations required by the non-line Boolean function.%为了提升处理器中非线性布尔函数处理效率,建立了以抽取移位和与-异或为基础的非线性布尔函数计算模型。利用抽取移位操作选择非线性布尔函数中参与运算的变量,利用与-异或操作实现不同次数与项之间的异或运算。对设计的单元进行了性能评估和函数适配,测试结果表明,设计的非线性布尔函数计算模型能够大幅降低实现非线性布尔函数所需的运算次数。

  13. 布尔运算在压缩机主机设计中应用%Application of Boolean Calculation in the Frame Design of Compressor

    Institute of Scientific and Technical Information of China (English)

    张勇; 冯丞科; 赵文雄; 李振波

    2012-01-01

    Boolean calculation is the basic algorithm of computer graphic. During the process of modelling by CAD design software and computer geometric modeling techniques, Boolean operation displays an important action as an useful tool. From the two aspects of the calculation of frame oil basin and clearance volume, the application of Boolean colculation in compressor design is specified. By using Boolean operation, the volume mentioned above,which is the significant parameter of frame,can be obtained efficiently and rapidly. Meanwhile,the problems of heavy workload and low efficiency existing in traditional calculation method are effectively solved, and the results are more accurate.%布尔运算是计算机图形学中的基本算法.在计算机几何造型技术与CAD设计软件建模过程中,布尔操作作为一个常用工具发挥着重要的作用.从压缩机主机机身油池容量及压缩缸端余隙容积的计算2个方面,阐述了布尔运算在压缩机主机设计中的运用.通过使用该方法,可以高效快捷的得到上述空间容积,获得主机的主要性能参数,同时有效地解决了传统计算方法工作量大、效率低等问题,并提高了计算结果的准确性.

  14. 基于布尔差别矩阵逻辑运算的属性约简%Attribute Reduction Based on Logical Operation of Boolean Discernibility Matrix

    Institute of Scientific and Technical Information of China (English)

    杨传健; 葛浩; 李龙澍

    2012-01-01

    In order to overcome the shortcomings of computing attribute reduction based on discernibility matrix,the decision tables was simplified,and the definition of Boolean discernibility matrix and the method of logical operation based on Boolean discernibility matrix were provided.The corresponding definitions of core attributes and attribute reduction based on Boolean discernibility matrix were put forward.It was proved that core attributes and attribute reduction acquired from the definitions are equivalent to the core attributes and attribute reduction based on positive region.Then,the algorithm for computing attribute reduction based on logical operation of Boolean discernibility matrix was designed,and its time and space complexity were all O(|C||U/C|2).Finally,the example and experiments were used to explain the feasibility and effectiveness of the method.%针对差别矩阵属性约简存在的不足,首先将决策表简化,并引入布尔差别矩阵定义及其逻辑运算方法;然后给出基于布尔差别矩阵核属性和属性约简的定义,同时证明了该核属性和属性约简与正区域的核属性和属性约简是等价的;接着,设计基于属性布尔差别矩阵逻辑运算的属性约简算法,算法的时间和空间复杂度均为O(|C||U/C|2)。最后,通过实例和实验验证本文算法的正确性和高效性。

  15. Small-scale universality and large-scale diversity. 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)

    Ispolatov, Yaroslav

    2016-07-01

    Martin et al. undertook an arduous task of reviewing vast literature on evolution and functionality of directed biological networks and gene networks in particular. The literature is assessed addressing a question of whether a set of features particular for gene networks is repeatedly recreated among unrelated species driven by selection pressure or has evolved once and is being inherited. To argue for the former mechanism, Martin and colleagues explore the following examples: Scale-free out-degree distribution.

  16. NRC regulatory agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has recently completed action or has proposed, or is considering action and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  17. NRC regulatory agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considering action, and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  18. NRC regulatory agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has proposed or is considering action and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  19. Nuclear Regulatory legislation

    International Nuclear Information System (INIS)

    This compilation of statutes and material pertaining to nuclear regulatory legislation through the 97th Congress, 2nd Session, has been prepared by the Office of the Executive Legal Director, U.S. Nuclear Regulatory Commission, with the assistance of staff, for use as an internal resource document

  20. NRC Regulatory Agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considering action, and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  1. NRC Regulatory Agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has recently completed action or has proposed, or is considering action and all petitions for rulemaking which have been received by the commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  2. Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods

    CERN Document Server

    Wollbold, Johannes; Ganter, Bernhard

    2008-01-01

    Our aim is to build a set of rules, such that reasoning over temporal dependencies within gene regulatory networks is possible. The underlying transitions may be obtained by discretizing observed time series, or they are generated based on existing knowledge, e.g. by Boolean networks or their nondeterministic generalization. We use the mathematical discipline of formal concept analysis (FCA), which has been applied successfully in domains as knowledge representation, data mining or software engineering. By the attribute exploration algorithm, an expert or a supporting computer program is enabled to decide about the validity of a minimal set of implications and thus to construct a sound and complete knowledge base. From this all valid implications are derivable that relate to the selected properties of a set of genes. We present results of our method for the initiation of sporulation in Bacillus subtilis. However the formal structures are exhibited in a most general manner. Therefore the approach may be adapte...

  3. Metanetworks of artificially evolved regulatory networks

    Science.gov (United States)

    Danacı, Burçin; Erzan, Ayşe

    2016-04-01

    We study metanetworks arising in genotype and phenotype spaces, in the context of a model population of Boolean graphs evolved under selection for short dynamical attractors. We define the adjacency matrix of a graph as its genotype, which gets mutated in the course of evolution, while its phenotype is its set of dynamical attractors. Metanetworks in the genotype and phenotype spaces are formed, respectively, by genetic proximity and by phenotypic similarity, the latter weighted by the sizes of the basins of attraction of the shared attractors. We find that evolved populations of Boolean graphs form tree-like giant clusters in genotype space, while random populations of Boolean graphs are typically so far removed from each other genetically that they cannot form a metanetwork. In phenotype space, the metanetworks of evolved populations are super robust both under the elimination of weak connections and random removal of nodes.

  4. Modelling coordination in biological systems

    OpenAIRE

    Clarke, David; Oliveira Costa, de, David; Arbab, Farhad

    2004-01-01

    We present an application of the Reo coordination paradigm to provide a compositional formal model for describing and reasoning about the behaviour of biological systems, such as regulatory gene networks. Reo governs the interaction and flow of data between components by allowing the construction of connector circuits which have a precise formal semantics. When applied to systems biology, the result is a graphical model, which is comprehensible, mathematically precise, and flexible

  5. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.

    Science.gov (United States)

    Semenov, Alexander; Zaikin, Oleg

    2016-01-01

    In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning. With each partitioning we associate a point in the special finite search space. The estimation of effectiveness of the particular partitioning is the value of predictive function in the corresponding point of this space. The problem of search for an effective partitioning can be formulated as a problem of optimization of the predictive function. We use metaheuristic algorithms (simulated annealing and tabu search) to move from point to point in the search space. In our computational experiments we found partitionings for SAT instances encoding problems of inversion of some cryptographic functions. Several of these SAT instances with realistic predicted solving time were successfully solved on a computing cluster and in the volunteer computing project SAT@home. The solving time agrees well with estimations obtained by the proposed method. PMID:27190753

  6. Transcription regulatory networks analysis using CAGE

    KAUST Repository

    Tegnér, Jesper N.

    2009-10-01

    Mapping out cellular networks in general and transcriptional networks in particular has proved to be a bottle-neck hampering our understanding of biological processes. Integrative approaches fusing computational and experimental technologies for decoding transcriptional networks at a high level of resolution is therefore of uttermost importance. Yet, this is challenging since the control of gene expression in eukaryotes is a complex multi-level process influenced by several epigenetic factors and the fine interplay between regulatory proteins and the promoter structure governing the combinatorial regulation of gene expression. In this chapter we review how the CAGE data can be integrated with other measurements such as expression, physical interactions and computational prediction of regulatory motifs, which together can provide a genome-wide picture of eukaryotic transcriptional regulatory networks at a new level of resolution. © 2010 by Pan Stanford Publishing Pte. Ltd. All rights reserved.

  7. Toward synthesizing executable models in biology.

    Science.gov (United States)

    Fisher, Jasmin; Piterman, Nir; Bodik, Rastislav

    2014-01-01

    Over the last decade, executable models of biological behaviors have repeatedly provided new scientific discoveries, uncovered novel insights, and directed new experimental avenues. These models are computer programs whose execution mechanistically simulates aspects of the cell's behaviors. If the observed behavior of the program agrees with the observed biological behavior, then the program explains the phenomena. This approach has proven beneficial for gaining new biological insights and directing new experimental avenues. One advantage of this approach is that techniques for analysis of computer programs can be applied to the analysis of executable models. For example, one can confirm that a model agrees with experiments for all possible executions of the model (corresponding to all environmental conditions), even if there are a huge number of executions. Various formal methods have been adapted for this context, for example, model checking or symbolic analysis of state spaces. To avoid manual construction of executable models, one can apply synthesis, a method to produce programs automatically from high-level specifications. In the context of biological modeling, synthesis would correspond to extracting executable models from experimental data. We survey recent results about the usage of the techniques underlying synthesis of computer programs for the inference of biological models from experimental data. We describe synthesis of biological models from curated mutation experiment data, inferring network connectivity models from phosphoproteomic data, and synthesis of Boolean networks from gene expression data. While much work has been done on automated analysis of similar datasets using machine learning and artificial intelligence, using synthesis techniques provides new opportunities such as efficient computation of disambiguating experiments, as well as the ability to produce different kinds of models automatically from biological data. PMID:25566538

  8. Towards Synthesizing Executable Models in Biology

    Directory of Open Access Journals (Sweden)

    Jasmin eFisher

    2014-12-01

    Full Text Available Over the last decade, executable models of biological behaviors have repeatedly provided new scientific discoveries, uncovered novel insights, and directed new experimental avenues. These models are computer programs whose execution mechanistically simulates aspects of the cell’s behaviors. If the observed behavior of the program agrees with the observed biological behavior, then the program explains the phenomena. This approach has proven beneficial for gaining new biological insights and directing new experimental avenues. One advantage of this approach is that techniques for analysis of computer programs can be applied to the analysis of executable models. For example, one can confirm that a model agrees with experiments for all possible executions of the model (corresponding to all environmental conditions, even if there are a huge number of executions. Various formal methods have been adapted for this context, for example, model checking or symbolic analysis of state spaces. To avoid manual construction of executable models, one can apply synthesis, a method to produce programs automatically from high-level specifications. In the context of biological modelling, synthesis would correspond to extracting executable models from experimental data. We survey recent results about the usage of the techniques underlying synthesis of computer programs for the inference of biological models from experimental data. We describe synthesis of biological models from curated mutation experiment data, inferring network connectivity models from phosphoproteomic data, and synthesis of Boolean networks from gene expression data. While much work has been done on automated analysis of similar datasets using machine learning and artificial intelligence, using synthesis techniques provides new opportunities such as efficient computation of disambiguating experiments, as well as the ability to produce different kinds of models automatically from biological data.

  9. Regulatory guidance document

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1994-05-01

    The Office of Civilian Radioactive Waste Management (OCRWM) Program Management System Manual requires preparation of the OCRWM Regulatory Guidance Document (RGD) that addresses licensing, environmental compliance, and safety and health compliance. The document provides: regulatory compliance policy; guidance to OCRWM organizational elements to ensure a consistent approach when complying with regulatory requirements; strategies to achieve policy objectives; organizational responsibilities for regulatory compliance; guidance with regard to Program compliance oversight; and guidance on the contents of a project-level Regulatory Compliance Plan. The scope of the RGD includes site suitability evaluation, licensing, environmental compliance, and safety and health compliance, in accordance with the direction provided by Section 4.6.3 of the PMS Manual. Site suitability evaluation and regulatory compliance during site characterization are significant activities, particularly with regard to the YW MSA. OCRWM`s evaluation of whether the Yucca Mountain site is suitable for repository development must precede its submittal of a license application to the Nuclear Regulatory Commission (NRC). Accordingly, site suitability evaluation is discussed in Chapter 4, and the general statements of policy regarding site suitability evaluation are discussed in Section 2.1. Although much of the data and analyses may initially be similar, the licensing process is discussed separately in Chapter 5. Environmental compliance is discussed in Chapter 6. Safety and Health compliance is discussed in Chapter 7.

  10. Regulatory guidance document

    International Nuclear Information System (INIS)

    The Office of Civilian Radioactive Waste Management (OCRWM) Program Management System Manual requires preparation of the OCRWM Regulatory Guidance Document (RGD) that addresses licensing, environmental compliance, and safety and health compliance. The document provides: regulatory compliance policy; guidance to OCRWM organizational elements to ensure a consistent approach when complying with regulatory requirements; strategies to achieve policy objectives; organizational responsibilities for regulatory compliance; guidance with regard to Program compliance oversight; and guidance on the contents of a project-level Regulatory Compliance Plan. The scope of the RGD includes site suitability evaluation, licensing, environmental compliance, and safety and health compliance, in accordance with the direction provided by Section 4.6.3 of the PMS Manual. Site suitability evaluation and regulatory compliance during site characterization are significant activities, particularly with regard to the YW MSA. OCRWM's evaluation of whether the Yucca Mountain site is suitable for repository development must precede its submittal of a license application to the Nuclear Regulatory Commission (NRC). Accordingly, site suitability evaluation is discussed in Chapter 4, and the general statements of policy regarding site suitability evaluation are discussed in Section 2.1. Although much of the data and analyses may initially be similar, the licensing process is discussed separately in Chapter 5. Environmental compliance is discussed in Chapter 6. Safety and Health compliance is discussed in Chapter 7

  11. Managing Regulatory Body Competence

    International Nuclear Information System (INIS)

    In 2001, the IAEA published TECDOC 1254, which examined the way in which the recognized functions of a regulatory body for nuclear facilities results in competence needs. Using the systematic approach to training (SAT), TECDOC 1254 provided a framework for regulatory bodies for managing training and developing and their maintaining their competence. It has been successfully used by many regulators. The IAEA has also introduced a methodology and an assessment tool - Guidelines for Systematic Assessment of Regulatory Competence Needs (SARCoN) - which provides practical guidance on analysing the training and development needs of a regulatory body and, through a gap analysis, guidance on establishing competence needs and how to meet them. In 2009, the IAEA established a steering committee (supported by a bureau) with the mission to advise the IAEA on how it could best assist Member States to develop suitable competence management systems for their regulatory bodies. The committee recommended the development of a safety report on managing staff competence as an integral part of a regulatory body's management system. This Safety Report was developed in response to this request. It supersedes TECDOC 1254, broadens its application to regulatory bodies for all facilities and activities, and builds upon the experience gained through the application of TECDOC 1254 and SARCoN and the feedback received from Member States. This Safety Report applies to the management of adequate competence as needs change, and as such is equally applicable to the needs of States 'embarking' on a nuclear power programme. It also deals with the special case of building up the competence of regulatory bodies as part of the overall process of establishing an 'embarking' State's regulatory system

  12. Modelling coordination in biological systems

    NARCIS (Netherlands)

    Clarke, D.G.; Oliveira Costa, D.F. de; Arbab, F.

    2004-01-01

    We present an application of the Reo coordination paradigm to provide a compositional formal model for describing and reasoning about the behaviour of biological systems, such as regulatory gene networks. Reo governs the interaction and flow of data between components by allowing the construction of

  13. Mutational robustness of gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Aalt D J van Dijk

    Full Text Available Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor-target gene interactions but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive. In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence.

  14. Fiscal 1998 achievement report on regional consortium research and development project. Regional consortium of venture business fostering type--Creation of key industries (Development of technologies for manufacturing and utilizing various biological regulatory substances using Hokkaido-produced biomasses as materials); 1998 nendo Dosan biomass wo genryo to shita kakushu seitai chosetsu kino busshitsu no seisan riyo gijutsu kaihatsu seika hokokusho

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2000-03-01

    The efforts aim to meet consumers' needs for products that will prevent lifestyle diseases or the like. For this purpose, substances answering the purpose are extracted from Hokkaido-produced agricultural and aquatic biomasses, and prepared for testing. Researches are conducted on how they behave in the enzyme, cell, and biological systems, and active substances are isolated and identified. In relation to the aquatic biomass, a technology is established of extracting and separating DHA (docosahexaenoic acid), EPA (eicosapentaenoic acid), taurine, etc., which are multivalent unsaturated fatty acids effective in preventing lifestyle diseases, from the unused parts of the squid. In relation to the agricultural biomass, antimicrobial active substances are extracted and separated from small fruit plants such as the chicory. Long-keeping foods are tentatively produced by the addition of dried powder of the chicory root tuber. In the elucidation of various biological regulatory substances contained in the Hokkaido-produced biomasses, they are tested for their abilities to resist microbes and active oxygen. Furthermore, verification tests are conducted by administering the substances to the senescence-accelerated mouse (SAM). (NEDO)

  15. Global Analysis of Photosynthesis Transcriptional Regulatory Networks

    OpenAIRE

    Imam, Saheed; Noguera, Daniel R.; Donohue, Timothy J.

    2014-01-01

    Photosynthesis is a crucial biological process that depends on the interplay of many components. This work analyzed the gene targets for 4 transcription factors: FnrL, PrrA, CrpK and MppG (RSP_2888), which are known or predicted to control photosynthesis in Rhodobacter sphaeroides. Chromatin immunoprecipitation followed by high-throughput sequencing (ChIP-seq) identified 52 operons under direct control of FnrL, illustrating its regulatory role in photosynthesis, iron homeostasis, nitrogen met...

  16. Global analysis of photosynthesis transcriptional regulatory networks.

    OpenAIRE

    Saheed Imam; Noguera, Daniel R.; Donohue, Timothy J.

    2014-01-01

    Photosynthesis is a crucial biological process that depends on the interplay of many components. This work analyzed the gene targets for 4 transcription factors: FnrL, PrrA, CrpK and MppG (RSP_2888), which are known or predicted to control photosynthesis in Rhodobacter sphaeroides. Chromatin immunoprecipitation followed by high-throughput sequencing (ChIP-seq) identified 52 operons under direct control of FnrL, illustrating its regulatory role in photosynthesis, iron homeostasis, nitrogen met...

  17. Technical Memory 2011. Nuclear Regulatory Authority

    International Nuclear Information System (INIS)

    The technical memory 2011 of the Nuclear Regulatory Authority of Argentine Republic, compile the papers published in the subject on radiation protection and nuclear safety presented in journals, technical reports, congress or meetings of these subjects by the ARN personnel during 2011. In this edition the documents are presented on: environmental protection; safety transport of radioactive materials; regulations; licensing of medical installations; biological radiation effects; therapeutic uses of ionizing radiation and radioprotection of patients; internal dosimetry; radioactive waste management

  18. Technical Memory 2010. Nuclear Regulatory Authority

    International Nuclear Information System (INIS)

    The technical memory 2010 of the Nuclear Regulatory Authority of Argentine Republic, compile the papers published in the subject on radiation protection and nuclear safety presented in journals, technical reports, congress or meetings of these subjects by the ARN personnel during 2010. In this edition the documents are presented on: environmental protection; safety transport of radioactive materials; regulations; licensing of medical installations; biological radiation effects; therapeutic uses of ionizing radiation and radioprotection of patients; internal dosimetry; radioactive waste management

  19. Dysfunctional T regulatory cells in multiple myeloma

    OpenAIRE

    Prabhala, Rao H.; Neri, Paola; Bae, Jooeun E.; Tassone, Pierfrancesco; Shammas, Masood A.; Allam, Charles K.; Daley, John F.; Chauhan, Dharminder; Blanchard, Elizabeth; Thatte, Hemant S.; Anderson, Kenneth C; Munshi, Nikhil C.

    2006-01-01

    Multiple myeloma (MM) is characterized by the production of monoclonal immunoglobulin and is associated with suppressed uninvolved immunoglobulins and dysfunctional T-cell responses. The biologic basis of this dysfunction remains ill defined. Because T regulatory (Treg) cells play an important role in suppressing normal immune responses, we evaluated the potential role of Treg cells in immune dysfunction in MM. We observed a significant increase in CD4+CD25+ T cells in patients with monoclona...

  20. NRC regulatory agenda

    International Nuclear Information System (INIS)

    The Regulatory Agenda is a quarterly compilation of all rules on which the NRC has recently completed action or has proposed, or is considering action and of all petitions for rulemaking that the NRC has received that are pending disposition

  1. Regulatory unbundling in telecommunications

    OpenAIRE

    Knieps, Günter

    2011-01-01

    Due to its dynamic nature, and the increasing importance of competitive sub-parts, the telecommunications sector provides particularly interesting insights for studying regulatory unbundling. Based on the theory of monopolistic bottle-necks the fallacies of overregulation by undue unbundling obligations are indicated. Neither the promotion of infrastructure competition by mandatory un-bundling of competitive subparts of telecommunications infrastructure, nor regulatory induced network fragmen...

  2. NRC regulatory initiatives

    Energy Technology Data Exchange (ETDEWEB)

    Johnson, T.C. [Nuclear Regulatory Commission (United States)

    1989-11-01

    The US Nuclear Regulatory Commission (NRC) is addressing several low-level waste disposal issues that will be important to waste generators and to States and Compacts developing new disposal capacity. These issues include Greater-Than-Class C (GTCC) waste, mixed waste, below regulatory concern (BRC) waste, and the low-level waste data base. This paper discusses these issues and their current status.

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

    Science.gov (United States)

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

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Teeraphan Laomettachit

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

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

    Science.gov (United States)

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

    2016-01-01

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

  6. ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra

    CERN Document Server

    Hinkelmann, Franziska; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

    2010-01-01

    Motivation: Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, bounded Petri nets, and agent-based models. Simulation is a common practice for analyzing discrete models, but many systems are far too large to capture all the relevant dynamical features through simulation alone. Results: We convert discrete models into algebraic models and apply tools from computational algebra to analyze their dynamics. The key feature of biological systems that is exploited by our algorithms is their sparsity: while the number of nodes in a biological network may be quite large, each node is affected only by a small number of other nodes. In our experience with models arising in systems biology and random models, this structure leads to fast computations when using algebraic models, and thus efficient analysis. Availability: All algorithms and methods are available in our package Analysis of Dynamic Algebraic Models (ADAM), a user friendly web-interf...

  7. TIGER: Toolbox for integrating genome-scale metabolic models, expression data, and transcriptional regulatory networks

    Directory of Open Access Journals (Sweden)

    Jensen Paul A

    2011-09-01

    Full Text Available Abstract Background Several methods have been developed for analyzing genome-scale models of metabolism and transcriptional regulation. Many of these methods, such as Flux Balance Analysis, use constrained optimization to predict relationships between metabolic flux and the genes that encode and regulate enzyme activity. Recently, mixed integer programming has been used to encode these gene-protein-reaction (GPR relationships into a single optimization problem, but these techniques are often of limited generality and lack a tool for automating the conversion of rules to a coupled regulatory/metabolic model. Results We present TIGER, a Toolbox for Integrating Genome-scale Metabolism, Expression, and Regulation. TIGER converts a series of generalized, Boolean or multilevel rules into a set of mixed integer inequalities. The package also includes implementations of existing algorithms to integrate high-throughput expression data with genome-scale models of metabolism and transcriptional regulation. We demonstrate how TIGER automates the coupling of a genome-scale metabolic model with GPR logic and models of transcriptional regulation, thereby serving as a platform for algorithm development and large-scale metabolic analysis. Additionally, we demonstrate how TIGER's algorithms can be used to identify inconsistencies and improve existing models of transcriptional regulation with examples from the reconstructed transcriptional regulatory network of Saccharomyces cerevisiae. Conclusion The TIGER package provides a consistent platform for algorithm development and extending existing genome-scale metabolic models with regulatory networks and high-throughput data.

  8. Master Regulators, Regulatory Networks, and Pathways of Glioblastoma Subtypes

    OpenAIRE

    Serdar Bozdag; Aiguo Li; Mehmet Baysan; Fine, Howard A.

    2014-01-01

    Glioblastoma multiforme (GBM) is the most common malignant brain tumor. GBM samples are classified into subtypes based on their transcriptomic and epigenetic profiles. Despite numerous studies to better characterize GBM biology, a comprehensive study to identify GBM subtype- specific master regulators, gene regulatory networks, and pathways is missing. Here, we used FastMEDUSA to compute master regulators and gene regulatory networks for each GBM subtype. We also ran Gene Set Enrichment Analy...

  9. US Competitiveness in Synthetic Biology.

    Science.gov (United States)

    Gronvall, Gigi Kwik

    2015-01-01

    Synthetic biology is an emerging technical field that aims to make biology easier to engineer; the field has applications in strategically important sectors for the US economy. While the United States currently leads in synthetic biology R&D, other nations are heavily investing in order to boost their economies, which will inevitably diminish the US leadership position. This outcome is not entirely negative--additional investments will expand markets--but it is critical that the US government take steps to remain competitive: There are applications from which the US population and economy may benefit; there are specific applications with importance for national defense; and US technical leadership will ensure that US experts have a leading role in synthetic biology governance, regulation, and oversight. Measures to increase competitiveness in S&T generally are broadly applicable for synthetic biology and should be pursued. However, the US government will also need to take action on fundamental issues that will affect the field's development, such as countering anti-GMO (genetically modified organism) sentiments and anti-GMO legislation. The United States should maintain its regulatory approach so that it is the product that is regulated, not the method used to create a product. At the same time, the United States needs to ensure that the regulatory framework is updated so that synthetic biology products do not fall into regulatory gaps. Finally, the United States needs to pay close attention to how synthetic biology applications may be governed internationally, such as through the Nagoya Protocol of the Convention on Biological Diversity, so that beneficial applications may be realized. PMID:26690379

  10. Boolean expression of object(property)-oriented concept lattice%面向对象(属性)概念格的布尔表达

    Institute of Scientific and Technical Information of China (English)

    石慧; 魏玲

    2015-01-01

    Formal concept analysis is an important method of knowledge representation and discovery.It is a method for data analysis used in finding,ordering and displaying of concepts.As a valid and potential tools in knowledge dis-covery,concept lattice theory has attracted much attention of artificial intelligence researchers around the world. Now,it have been applied in various research areas,such as machine learning,expert system,computer network, decision analysis,data mining,and so on.This paper introduced Boolean logic operation in FCA and used it to define the up and down approximate operation,and Boolean object(property)-oriented concept lattice in Boolean formal context.This method greatly simplified the process of constructing object(property)-oriented concept lattice.%形式概念分析是用于知识表示和知识发现的一个重要方法。将逻辑运算方法引入形式概念分析之中,利用布尔向量的逻辑运算定义了布尔形式背景中的上、下近似运算,给出了其性质。并定义了布尔面向对象(属性)概念格,证明了其与面向对象(属性)概念格的等价性。简化了构造面向对象(属性)概念格的过程。

  11. Controllability and observability of Boolean control networks%布尔控制网络的能控性与能观性

    Institute of Scientific and Technical Information of China (English)

    李志强; 宋金利

    2013-01-01

    Using the semi-tensor product,we convert the Boolean control network to its algebraic form.From the structure matrix of Boolean control network,the controllability and observability of the Boolean control network are discussed.A novel necessary and sufficient condition for controllability,which improves the recent results,is given.The new controllability condition eliminates the redundant computation of controllability matrix.The highest power of matrix is reduced from 2m+n to 2 n.Also,a sufficient condition for observability is obtained,which can be computed easily.A numerical example is presented to show the applicability of our controllability and observability condition.%利用矩阵的半张量积,布尔控制网络被转化为离散时间系统.本文从离散时间系统的结构矩阵出发,讨论了逻辑控制系统的能控能观性条件,得到了一个新的能控性条件.新的条件简化了原有能控性矩阵的计算复杂性,矩阵的最高阶数由原来的2m+n降到了2n.另外,还得到了检验布尔控制网络能观性的条件.与原有条件相比,新的条件更容易计算检验.最后,给出一个实例,检验给出的能控能观性判断条件的正确性.

  12. Constructing biological pathways by a two-step counting approach.

    Directory of Open Access Journals (Sweden)

    Hsiuying Wang

    Full Text Available Networks are widely used in biology to represent the relationships between genes and gene functions. In Boolean biological models, it is mainly assumed that there are two states to represent a gene: on-state and off-state. It is typically assumed that the relationship between two genes can be characterized by two kinds of pairwise relationships: similarity and prerequisite. Many approaches have been proposed in the literature to reconstruct biological relationships. In this article, we propose a two-step method to reconstruct the biological pathway when the binary array data have measurement error. For a pair of genes in a sample, the first step of this approach is to assign counting numbers for every relationship and select the relationship with counting number greater than a threshold. The second step is to calculate the asymptotic p-values for hypotheses of possible relationships and select relationships with a large p-value. This new method has the advantages of easy calculation for the counting numbers and simple closed forms for the p-value. The simulation study and real data example show that the two-step counting method can accurately reconstruct the biological pathway and outperform the existing methods. Compared with the other existing methods, this two-step method can provide a more accurate and efficient alternative approach for reconstructing the biological network.

  13. 布尔表达式的化简与并行排序网络验证%Boolean expression simplification and parallel sort network validation

    Institute of Scientific and Technical Information of China (English)

    王德才; 徐建国; 吴哲辉; 罗永亮; 王传民

    2009-01-01

    To design an effective tool that can be used to verify the correctness of a parallel sorting network, a Boolean expression sim-plification algorithm based on the [0,1] theory and Boolean function of the characteristics and the nature is put forward, based on this algorithm a validation tool is designed. The characteristics and the nature of [0,1] theory and Boolean function are discussed and the natures that are helpful to simplify of the operation are pointed out. The tool can be used for the design of parallel sorting networks based on the parameters of the network graphics, and it can automatically generate the Boolean expressions and simplify it. The tool's output will be helpful to analyze the network, and it can also be used to design and optimize the sort network. Finally, the validity of the tool is demonstrated by the application.%为设计出能够验证并行排序网络正确性的有效工具,根据[0,1]原理和布尔函数的特点和性质,提出一种布尔表达式的化简算法,并根据此算法设计出验证工具.对[0,1]原理和布尔函数的特点和性质进行了讨论,指出有利于化简操作的性质.设计出的工具能够根据并行排序网络的参数显示网络图形、自动生成布尔表达式并实现化简验证,工具的输出有利于对排序网络的分析,也可以用于辅助排序网络的设计和优化.实验结果表明了该工具的有效性.

  14. 基于故障的布尔表达式测试技术综述%Survey on Fault-based Testing Techniques for Boolean Expressions

    Institute of Scientific and Technical Information of China (English)

    孙昌爱; 程庆顺

    2013-01-01

    Boolean expressions play a key role in specifications and programs, and thus significantly affect the correctness of software. How to efficiently test Boolean expressions is an important issue. We first introduced the basic concepts and principle of fault-based testing. We then summarized several fault classes of Boolean expressions and discussed their detection hierarchies. Next, we reviewed several representative fault-based testing strategies for Boolean expressions, and proposed a comparison framework to compare them with respect to the applicability,fault detection capability and reduction of test suites. Finally,we pointed out several future issues based on our observations of limitations on the existing works,and briefly introduced our relevant work in this area%布尔表达式是软件规格说明与程序实现中的关键成份,严重影响软件的正确性.如何有效地测试布尔表达式是软件测试领域的一个重要研究方向.介绍了基于故障的软件测试的基本概念与原理,归纳了布尔表达式的各种故障类型,讨论了不同故障类型之间的检测包含关系;评述了几类代表性的面向布尔表达式的测试策略,提出了一种比较框架并比较了各种策略的适用情形、故障检测能力与测试用例精简程度.针对现有研究工作的不足,探讨了几个值得研究的问题,简要介绍了近年来此领域的研究工作.

  15. Nuclear Regulatory Legislation

    International Nuclear Information System (INIS)

    This compilation of statutes and material pertaining to nuclear regulatory legislation through the 100th Congress, 2nd Session, has been prepared by the Office of the General Counsel, US Nuclear Regulatory Commission, with the assistance of staff, for use as an internal resource document. Persons using this document are placed on notice that it may not be used as an authoritative citation in lieu of the primary legislative sources. Furthermore, while every effort has been made to ensure the completeness and accuracy of this material, neither the United States Government, the Nuclear Regulatory Commission, nor any of their employees makes any expressed or implied warranty or assumes liability for the accuracy or completeness of the material presented in this compilation

  16. Balanced Integrated Regulatory Oversight

    International Nuclear Information System (INIS)

    Reactor safety, protecting the public health and safety, and protecting the environment must always be the nuclear regulator's top priorities. Enabling the use of nuclear power for the benefit of society, while protecting the public and the environment requires the regulator to balance many factors. In addition, the regulator is only one part of the overall government that must consider many factors as it carries out its societal responsibilities. Some of the factors that must be balanced and the practical impacts on how the regulator carries out its responsibilities will be addressed. The first International Conference on Effective Regulatory Systems, held in Moscow, Russian Federation, in 2006, focused on safety and security challenges with a goal of improving regulatory effectiveness through cooperation and sharing of information and best practices. The challenge of meeting both safety and security objectives is one example of potentially competing programmes that must be balanced. Other balances that must be evaluated include the benefits of safety improvements compared to the cost of implementation, the use of deterministic and probabilistic approaches, communication openness balanced with the protection of information that could be used for detrimental purposes, and timeliness of regulatory decision making balanced with the need to perform quality work in support of oversight responsibilities. A balanced and integrated approach to regulatory oversight is vital to ensuring that the regulatory body remains effective in its mission to enable the use of nuclear power while protecting the public and the environment. This concept is applicable to nations beginning a nuclear programme as well as established and experienced regulatory bodies. (author)

  17. Rationales for regulatory activity

    Energy Technology Data Exchange (ETDEWEB)

    Perhac, R.M. [Univ. of Tennessee, Knoxville, TN (United States)

    1997-02-01

    The author provides an outline which touches on the types of concerns about risk evaluation which are addressed in the process of establishing regulatory guides. Broadly he says regulatory activity serves three broad constituents: (1) Paternalism (private risk); (2) Promotion of social welfare (public risks); (3) Protection of individual rights (public risks). He then discusses some of the major issues encountered in reaching a decision on what is an acceptable level of risk within each of these areas, and how one establishes such a level.

  18. Toxicogenomics in Regulatory Ecotoxicology

    Science.gov (United States)

    The potential utility of toxicogenomics in toxicological research and regulatory activities has been the subject of scientific discussions, and as with any new technology, there is a wide range of opinion. The purpose of this feature article is to consider roles of toxicogenomic...

  19. Comments on regulatory reform

    International Nuclear Information System (INIS)

    Nuclear regulatory reform is divided into two parts. The first part contains all those matters for which new legislation is required. The second part concerns all those matters that are within the power of the Commission under existing statutes. Recommendations are presented

  20. NRC regulatory agenda

    International Nuclear Information System (INIS)

    This document is a compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considered action, and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  1. NRC Regulatory Agenda

    International Nuclear Information System (INIS)

    This document compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considering action, and all petitions for rule making which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  2. NRC regulatory agenda

    International Nuclear Information System (INIS)

    This document provides a compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considering action, and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  3. Prediction of regulatory elements

    DEFF Research Database (Denmark)

    Sandelin, Albin

    2008-01-01

    -lab methods are time consuming and expensive, it is not realistic to identify TFBS for all uncharacterized genes in the genome by purely experimental means. Computational methods aimed at predicting potential regulatory regions can increase the efficiency of wet-lab experiments significantly. Here, methods...

  4. NRC Regulatory Agenda

    International Nuclear Information System (INIS)

    This document is a compilation of all rules on which the NRC has proposed or is considering action and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter

  5. Topology of transcriptional regulatory networks: testing and improving.

    Directory of Open Access Journals (Sweden)

    Dicle Hasdemir

    Full Text Available With the increasing amount and complexity of data generated in biological experiments it is becoming necessary to enhance the performance and applicability of existing statistical data analysis methods. This enhancement is needed for the hidden biological information to be better resolved and better interpreted. Towards that aim, systematic incorporation of prior information in biological data analysis has been a challenging problem for systems biology. Several methods have been proposed to integrate data from different levels of information most notably from metabolomics, transcriptomics and proteomics and thus enhance biological interpretation. However, in order not to be misled by the dominance of incorrect prior information in the analysis, being able to discriminate between competing prior information is required. In this study, we show that discrimination between topological information in competing transcriptional regulatory network models is possible solely based on experimental data. We use network topology dependent decomposition of synthetic gene expression data to introduce both local and global discriminating measures. The measures indicate how well the gene expression data can be explained under the constraints of the model network topology and how much each regulatory connection in the model refuses to be constrained. Application of the method to the cell cycle regulatory network of Saccharomyces cerevisiae leads to the prediction of novel regulatory interactions, improving the information content of the hypothesized network model.

  6. Regulatory Challenges for Cartilage Repair Technologies.

    Science.gov (United States)

    McGowan, Kevin B; Stiegman, Glenn

    2013-01-01

    In the United States, few Food and Drug Administration (FDA)-approved options exist for the treatment of focal cartilage and osteochondral lesions. Developers of products for cartilage repair face many challenges to obtain marketing approval from the FDA. The objective of this review is to discuss the necessary steps for FDA application and approval for a new cartilage repair product. FDA Guidance Documents, FDA Panel Meetings, scientific organization recommendations, and clinicaltrials.gov were reviewed to demonstrate the current thinking of FDA and the scientific community on the regulatory process for cartilage repair therapies. Cartilage repair therapies can receive market approval from FDA as medical devices, drugs, or biologics, and the specific classification of product can affect the nonclinical, clinical, and regulatory strategy to bring the product to market. Recent FDA guidance gives an outline of the required elements to bring a cartilage repair product to market, although these standards are often very general. As a result, companies have to carefully craft their study patient population, comparator group, and clinical endpoint to best showcase their product's attributes. In addition, regulatory strategy and manufacturing process validation need to be considered early in the clinical study process to allow for timely product approval following the completion of clinical study. Although the path to regulatory approval for a cartilage repair therapy is challenging and time-consuming, proper clinical trial planning and attention to the details can eventually save companies time and money by bringing a product to the market in the most expeditious process possible. PMID:26069647

  7. Computing fuzzy associations for the analysis of biological literature.

    Science.gov (United States)

    Perez-Iratxeta, Carolina; Keer, Harindar S; Bork, Peer; Andrade, Miguel A

    2002-06-01

    The increase of information in biology makes it difficult for researchers in any field to keep current with the literature. The MEDLINE database of scientific abstracts can be quickly scanned using electronic mechanisms. Potentially interesting abstracts can be selected by matching words joined by Boolean operators. However this means of selecting documents is not optimal. Nonspecific queries have to be effected, resulting in large numbers of irrelevant abstracts that have to be manually scanned To facilitate this analysis, we have developed a system that compiles a summary of subjects and related documents on the results of a MEDLINE query. For this, we have applied a fuzzy binary relation formalism that deduces relations between words present in a set of abstracts preprocessed with a standard grammatical tagger. Those relations are used to derive ensembles of related words and their associated subsets of abstracts. The algorithm can be used publicly at http:// www.bork.embl-heidelberg.de/xplormed/. PMID:12074170

  8. Regulatory and operating experience

    International Nuclear Information System (INIS)

    Regulatory and operating experience in the disposal of radioactive waste can be divided into three time periods, World War II and its aftermath, Post World War II till the end of the cold war, and crystal ball gazing into the future. In the first period, there was little regulatory guidance and operating practices, all conducted under wartime secrecy conditions, sometimes were not even up to the norms of the times. Environmental releases resulted in some seriously contaminated sites and high dosages to some offsite populations. Failure to consider even the storage of wastes in a systems context resulted in some stocks that were difficult to recover, treat and dispose of in a final manner. In the second period, increasing civilian uses of nuclear power and isotopes for medical, research, and industrial purposes and military pressure for increased production of Pu-239 resulted in large and more dispersed disposal of radioactive wastes. Regulatory regimes, following growing environmental consciousness, came into existence that minimized exposure to environmental contamination. Practices, in most instances, increasingly conformed to these regulatory demands. The future is unknowable. However, for high level wastes, except for thermodynamically stable forms, no technology can guarantee safety and present methodologies are calculated to produce doses orders of magnitude lower than regulatory limits. Therefore, it is possible that research will be limited to no higher technology than is reasonably achievable. Whereas for low level waste, where proof is practicably possible, as high technology as is reasonably achievable will be best in the long run. (author). 24 refs, 5 figs, 3 tabs

  9. 基于布尔矩阵的DeePWeb复杂模式匹配%Deeo Web Complex Schema Matching Based on Boolean Matrix

    Institute of Scientific and Technical Information of China (English)

    龚桂芬; 伏玉璨; 程远虎

    2011-01-01

    在正负关联规则中引入布尔矩阵的概念,在双重相关性挖掘算法的基础上提出一种Deep Web复杂模式匹配算法.将查询接口模式中的属性项转化成布尔矩阵,通过对矩阵进行正关联规则运算挖掘组属性,对矩阵进行负关联规则运算挖掘同义属性.实验结果表明该算法的执行效率较高.%This paper introduces the Boolean matrix into the both positive and negative association roles, based on the Duel Correlated Mining (DCM) algorithm, it presents a Deep Web complex schema matching algorithm.It transforms the attributes in the query interface schemas into a Boolean matrix, mines group attributes by positively calculating for matrix and mines synonymous attributes by negatively calculating for matrix.Experimental results show that the algorithm has higher efficiency.

  10. 求S盒布尔表达式的若干算法探讨%Different algorithms on computation of Boolean expression of S box

    Institute of Scientific and Technical Information of China (English)

    李晓东; 陶涛

    2012-01-01

    S盒是许多加密算法唯一的非线性部件,其安全性对这些算法的密码分析至关重要.S盒输出的布尔表达式(即模2域上的代数多项式)被用于衡量S盒的非线性度等用途.在已知S盒真值表情况下,对求S盒各输出布尔表达式的各种算法进行了探讨和总结.其中,折半异或法在普通PC计算机上只需要m2m-1次操作,其中m为S盒的输入位数,且不需要占用额外的内存.%S box is the only nonlinear component of many encryption algorithms, its security is important to the cryptanalysis of these algorithms. Output Boolean expression of the S box is used to measure the degree of the nonlinearity of S box. Known truth table, various algorithms on computing output Boolean expression of the S box are discussed and summarized. Among them, the fold XOR method only requires m2m-1 operations in PC computers where m is the input bit number of S box, and does not require additional memory.

  11. Algebraic Degree of a Class Boolean Function Annihilators%一类布尔函数零化子的代数次数

    Institute of Scientific and Technical Information of China (English)

    祁传达; 俞迎达

    2012-01-01

    The effectiveness of algebraic attacks of stream ciphers depends on the algebraic degrees of annihilators of nonlinear Boolean functions.But it remains a difficult problem to construct annihilators with low degree for a given Boolean function. In this paper, we give a new proof of a result on the existence of the n-k degree annihilators formulated by Zhang Wenying,et al,and correct an error in their original proof.%序列密码代数攻击的成效取决于所使用的非线性布尔函数零化子的代数次数,但如何构造一个给定函数的低次数零化子仍是一个难题.本文对张文英等人提出的关于一类布尔函数存在n-k次零化子的结论给出了新的证明,弥补了原文证明不严密的缺陷.

  12. Regulatory mechanisms link phenotypic plasticity to evolvability.

    Science.gov (United States)

    van Gestel, Jordi; Weissing, Franz J

    2016-01-01

    Organisms have a remarkable capacity to respond to environmental change. They can either respond directly, by means of phenotypic plasticity, or they can slowly adapt through evolution. Yet, how phenotypic plasticity links to evolutionary adaptability is largely unknown. Current studies of plasticity tend to adopt a phenomenological reaction norm (RN) approach, which neglects the mechanisms underlying plasticity. Focusing on a concrete question - the optimal timing of bacterial sporulation - we here also consider a mechanistic approach, the evolution of a gene regulatory network (GRN) underlying plasticity. Using individual-based simulations, we compare the RN and GRN approach and find a number of striking differences. Most importantly, the GRN model results in a much higher diversity of responsive strategies than the RN model. We show that each of the evolved strategies is pre-adapted to a unique set of unseen environmental conditions. The regulatory mechanisms that control plasticity therefore critically link phenotypic plasticity to the adaptive potential of biological populations. PMID:27087393

  13. Sparsity in Model Gene Regulatory Networks

    International Nuclear Information System (INIS)

    We propose a gene regulatory network model which incorporates the microscopic interactions between genes and transcription factors. In particular the gene's expression level is determined by deterministic synchronous dynamics with contribution from excitatory interactions. We study the structure of networks that have a particular '' function '' and are subject to the natural selection pressure. The question of network robustness against point mutations is addressed, and we conclude that only a small part of connections defined as '' essential '' for cell's existence is fragile. Additionally, the obtained networks are sparse with narrow in-degree and broad out-degree, properties well known from experimental study of biological regulatory networks. Furthermore, during sampling procedure we observe that significantly different genotypes can emerge under mutation-selection balance. All the preceding features hold for the model parameters which lay in the experimentally relevant range. (author)

  14. Time-dependent information transmission in a model regulatory circuit

    OpenAIRE

    Mancini, Francesca; Wiggins, Chris H.; Marsili, Matteo; Walczak, Aleksandra M

    2013-01-01

    Many biological regulatory systems process signals out of steady state and respond with a physiological delay. A simple model of regulation which respects these features shows how the ability of a delayed output to transmit information is limited: at short times by the timescale of the dynamic input, at long times by that of the dynamic output. We find that topologies of maximally informative networks correspond to commonly occurring biological circuits linked to stress response and that circ...

  15. XcisClique: analysis of regulatory bicliques

    Directory of Open Access Journals (Sweden)

    Grene Ruth

    2006-04-01

    Full Text Available Abstract Background Modeling of cis-elements or regulatory motifs in promoter (upstream regions of genes is a challenging computational problem. In this work, set of regulatory motifs simultaneously present in the promoters of a set of genes is modeled as a biclique in a suitably defined bipartite graph. A biologically meaningful co-occurrence of multiple cis-elements in a gene promoter is assessed by the combined analysis of genomic and gene expression data. Greater statistical significance is associated with a set of genes that shares a common set of regulatory motifs, while simultaneously exhibiting highly correlated gene expression under given experimental conditions. Methods XcisClique, the system developed in this work, is a comprehensive infrastructure that associates annotated genome and gene expression data, models known cis-elements as regular expressions, identifies maximal bicliques in a bipartite gene-motif graph; and ranks bicliques based on their computed statistical significance. Significance is a function of the probability of occurrence of those motifs in a biclique (a hypergeometric distribution, and on the new sum of absolute values statistic (SAV that uses Spearman correlations of gene expression vectors. SAV is a statistic well-suited for this purpose as described in the discussion. Results XcisClique identifies new motif and gene combinations that might indicate as yet unidentified involvement of sets of genes in biological functions and processes. It currently supports Arabidopsis thaliana and can be adapted to other organisms, assuming the existence of annotated genomic sequences, suitable gene expression data, and identified regulatory motifs. A subset of Xcis Clique functionalities, including the motif visualization component MotifSee, source code, and supplementary material are available at https://bioinformatics.cs.vt.edu/xcisclique/.

  16. Nuclear Regulatory Commission information digest

    International Nuclear Information System (INIS)

    The Nuclear Regulatory Commission information digest provides summary information regarding the US Nuclear Regulatory Commission, its regulatory responsibilities, and areas licensed by the commission. This is an annual publication for the general use of the NRC Staff and is available to the public. The digest is divided into two parts: the first presents an overview of the US Nuclear Regulatory Commission and the second provides data on NRC commercial nuclear reactor licensees and commercial nuclear power reactors worldwide

  17. Biology Notes.

    Science.gov (United States)

    School Science Review, 1982

    1982-01-01

    Presents procedures, exercises, demonstrations, and information on a variety of biology topics including labeling systems, biological indicators of stream pollution, growth of lichens, reproductive capacity of bulbous buttercups, a straw balance to measure transpiration, interaction of fungi, osmosis, and nitrogen fixation and crop production. (DC)

  18. Implementing Boolean Matrix Factorization

    Czech Academy of Sciences Publication Activity Database

    Neruda, Roman; Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A. A.

    Vol. Part I. Berlin : Springer, 2008 - (Kůrková, V.; Neruda, R.; Koutník, J.), s. 543-552 ISBN 978-3-540-87535-2. - (Lecture Notes in Computer Science. 5163). [ICANN 2008. International Conference on Artificial Neural Network s /18./. Prague (CZ), 03.09.2008-06.09.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : factor analysis * genetic algorithm * neural network s Subject RIV: IN - Informatics, Computer Science

  19. Systems Biology of the Fluxome

    Directory of Open Access Journals (Sweden)

    Miguel A. Aon

    2015-07-01

    Full Text Available The advent of high throughput -omics has made the accumulation of comprehensive data sets possible, consisting of changes in genes, transcripts, proteins and metabolites. Systems biology-inspired computational methods for translating metabolomics data into fluxomics provide a direct functional, dynamic readout of metabolic networks. When combined with appropriate experimental design, these methods deliver insightful knowledge about cellular function under diverse conditions. The use of computational models accounting for detailed kinetics and regulatory mechanisms allow us to unravel the control and regulatory properties of the fluxome under steady and time-dependent behaviors. This approach extends the analysis of complex systems from description to prediction, including control of complex dynamic behavior ranging from biological rhythms to catastrophic lethal arrhythmias. The powerful quantitative metabolomics-fluxomics approach will help our ability to engineer unicellular and multicellular organisms evolve from trial-and-error to a more predictable process, and from cells to organ and organisms.

  20. NRC regulatory agenda

    International Nuclear Information System (INIS)

    The NRC Regulatory Agenda is a compilation of all rules on which the NRC has recently completed action, or has proposed action, or is considering action, and all petitions for rulemaking which have been received by the Commission and are pending disposition by the Commission. The Regulatory Agenda is updated and issued each quarter. The rules on which final action has been taken since March 31, 1993 are: Repeal of NRC standards of conduct; Fitness-for-duty requirements for licensees who possess, use, or transport Category I material; Training and qualification of nuclear power plant personnel; Monitoring the effectiveness of maintenance at nuclear power plants; Licensing requirements for land disposal of radioactive wastes; and Licensees' announcements of safeguards inspections