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.

CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS

Directory of Open Access Journals (Sweden)

P. N. Bibilo

2016-01-01

Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.

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

International Nuclear Information System (INIS)

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

2016-01-01

Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

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.

A Construction of Boolean Functions with Good Cryptographic Properties

Science.gov (United States)

2014-01-01

be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum

Boolean integral calculus for digital systems

Science.gov (United States)

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

1985-01-01

The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.

Vector Boolean Functions: applications in symmetric cryptography

OpenAIRE

Álvarez Cubero, José Antonio

2015-01-01

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...

Boolean Functions with a Simple Certificate for CNF Complexity

Czech Academy of Sciences Publication Activity Database

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

2012-01-01

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

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.

Interpolative Boolean Networks

Directory of Open Access Journals (Sweden)

Vladimir Dobrić

2017-01-01

Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.

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

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.

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.

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

KAUST Repository

Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2013-01-01

In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization

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

Free Boolean Topological Groups

Directory of Open Access Journals (Sweden)

Ol’ga Sipacheva

2015-11-01

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

Properties of Boolean orthoposets

Science.gov (United States)

Tkadlec, Josef

1993-10-01

A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.

Nonlinear threshold Boolean automata networks and phase transitions

OpenAIRE

Demongeot, Jacques; Sené, Sylvain

2010-01-01

In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...

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

Science.gov (United States)

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

2017-08-02

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

Classical Boolean logic gates with quantum systems

International Nuclear Information System (INIS)

Renaud, N; Joachim, C

2011-01-01

An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.

A transition calculus for Boolean functions. [logic circuit analysis

Science.gov (United States)

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

1974-01-01

A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.

Complexity classifications for different equivalence and audit problems for Boolean circuits

OpenAIRE

Böhler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert

2010-01-01

We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.

Quantum tests for the linearity and permutation invariance of Boolean functions

Energy Technology Data Exchange (ETDEWEB)

Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)

2011-12-15

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

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

Correlation Immunity, Avalanche Features, and Other Cryptographic Properties of Generalized Boolean Functions

Science.gov (United States)

2017-09-01

satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized

To Boolean or Not To Boolean.

Science.gov (United States)

Hildreth, Charles R.

1983-01-01

This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)

Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications

OpenAIRE

Pan, Chenyun; Naeemi, Azad

2017-01-01

The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...

A complexity theory based on Boolean algebra

DEFF Research Database (Denmark)

Skyum, Sven; Valiant, Leslie

1985-01-01

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

Reliable dynamics in Boolean and continuous networks

International Nuclear Information System (INIS)

Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P

2012-01-01

We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)

Algebraic partial Boolean algebras

International Nuclear Information System (INIS)

Smith, Derek

2003-01-01

Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A 5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E 8

Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

DEFF Research Database (Denmark)

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

1999-01-01

The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...

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

Science.gov (United States)

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS

OpenAIRE

Ho, Juei-Ling

2009-01-01

Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...

Boolean algebra

CERN Document Server

Goodstein, R L

2007-01-01

This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.

Rational Verification in Iterated Electric Boolean Games

Directory of Open Access Journals (Sweden)

Youssouf Oualhadj

2016-07-01

Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.

Optimal stabilization of Boolean networks through collective influence

Science.gov (United States)

Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

2018-03-01

Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

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

International Nuclear Information System (INIS)

Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong

2015-01-01

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

Boolean orthoposets and two-valued states on them

Science.gov (United States)

Tkadlec, Josef

1992-06-01

A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.

Synchronization in an array of coupled Boolean networks

International Nuclear Information System (INIS)

Li, Rui; Chu, Tianguang

2012-01-01

This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.

Computing preimages of Boolean networks.

Science.gov (United States)

Klotz, Johannes; Bossert, Martin; Schober, Steffen

2013-01-01

In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.

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

Science.gov (United States)

Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M

2017-11-25

Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression

Elements of Boolean-Valued Dempster-Shafer Theory

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2000-01-01

Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics

On the Computation of Comprehensive Boolean Gröbner Bases

Science.gov (United States)

Inoue, Shutaro

We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.

An adaptable Boolean net trainable to control a computing robot

International Nuclear Information System (INIS)

Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.

1999-01-01

We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits

PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.

Directory of Open Access Journals (Sweden)

Liam G Fearnley

Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.

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

International Nuclear Information System (INIS)

Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh

2012-01-01

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

Algebraic model checking for Boolean gene regulatory networks.

Science.gov (United States)

Tran, Quoc-Nam

2011-01-01

We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

Science.gov (United States)

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

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

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

Boolean-Like and Frequentistic Nonstandard Semantics for First-Order Predicate Calculus without Functions

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2001-01-01

Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics

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

International Nuclear Information System (INIS)

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

2014-01-01

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

Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes

International Nuclear Information System (INIS)

Liu, M; Bassler, K E

2011-01-01

Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.

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.

SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis

International Nuclear Information System (INIS)

Worrell, R.B.

1985-01-01

Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully

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

Directory of Open Access Journals (Sweden)

Wensheng Guo

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

An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks

Science.gov (United States)

Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei

2013-01-01

Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840

Boolean gates on actin filaments

International Nuclear Information System (INIS)

Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew

2016-01-01

Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

Boolean gates on actin filaments

Energy Technology Data Exchange (ETDEWEB)

Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)

2016-01-08

Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.

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

International Nuclear Information System (INIS)

Schneeweiss, Winfrid G.

2009-01-01

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

Large Sets in Boolean and Non-Boolean Groups and Topology

Directory of Open Access Journals (Sweden)

Ol’ga V. Sipacheva

2017-10-01

Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.

Optical programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2011-11-10

Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.

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

Directory of Open Access Journals (Sweden)

Stalin Muñoz

2018-03-01

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

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

International Nuclear Information System (INIS)

Dridi, G; Julien, R; Hliwa, M; Joachim, C

2015-01-01

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)

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

Science.gov (United States)

Dridi, G; Julien, R; Hliwa, M; Joachim, C

2015-08-28

The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.

Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

NARCIS (Netherlands)

Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.

Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then

Summing Boolean Algebras

Institute of Scientific and Technical Information of China (English)

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

2004-01-01

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

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.

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

International Nuclear Information System (INIS)

Li, Fangfei; Lu, Xiwen

2013-01-01

In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.

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

Refinement monoids, equidecomposability types, and boolean inverse semigroups

CERN Document Server

Wehrung, Friedrich

2017-01-01

Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.

Causal structure of oscillations in gene regulatory networks: Boolean analysis of ordinary differential equation attractors.

Science.gov (United States)

Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S

2013-06-01

A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.

Boolean analysis reveals systematic interactions among low-abundance species in the human gut microbiome.

Directory of Open Access Journals (Sweden)

Jens Christian Claussen

2017-06-01

Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.

Adapted Boolean network models for extracellular matrix formation

Directory of Open Access Journals (Sweden)

Wollbold Johannes

2009-07-01

Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF�

3D Boolean operations in virtual surgical planning.

Science.gov (United States)

Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

2017-10-01

Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.

Random networks of Boolean cellular automata

Energy Technology Data Exchange (ETDEWEB)

Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche

1990-01-01

Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).

Random networks of Boolean cellular automata

International Nuclear Information System (INIS)

Miranda, Enrique

1990-01-01

Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. Conclusions Stochastic Boolean networks (SBNs are proposed as an efficient approach to modelling gene regulatory networks (GRNs. The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.

Controllability and observability of Boolean networks arising from biology

Science.gov (United States)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.

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.

The spruce budworm and forest: a qualitative comparison of ODE and Boolean models

Directory of Open Access Journals (Sweden)

Raina Robeva

2016-01-01

Full Text Available Boolean and polynomial models of biological systems have emerged recently as viable companions to differential equations models. It is not immediately clear however whether such models are capable of capturing the multi-stable behaviour of certain biological systems: this behaviour is often sensitive to changes in the values of the model parameters, while Boolean and polynomial models are qualitative in nature. In the past few years, Boolean models of gene regulatory systems have been shown to capture multi-stability at the molecular level, confirming that such models can be used to obtain information about the system’s qualitative dynamics when precise information regarding its parameters may not be available. In this paper, we examine Boolean approximations of a classical ODE model of budworm outbreaks in a forest and show that these models exhibit a qualitative behaviour consistent with that derived from the ODE models. In particular, we demonstrate that these models can capture the bistable nature of insect population outbreaks, thus showing that Boolean models can be successfully utilized beyond the molecular level.

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

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

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

Practical algorithms for linear boolean-width

NARCIS (Netherlands)

ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

2015-01-01

In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

Practical algorithms for linear Boolean-width

NARCIS (Netherlands)

ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.

2015-01-01

In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the

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

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

Science.gov (United States)

Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.

2006-01-01

BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…

Optimization-Based Approaches to Control of Probabilistic Boolean Networks

Directory of Open Access Journals (Sweden)

Koichi Kobayashi

2017-02-01

Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.

Document Ranking in E-Extended Boolean Logic

Czech Academy of Sciences Publication Activity Database

Holub, M.; Húsek, Dušan; Pokorný, J.

1996-01-01

Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic

Parallel object-oriented term rewriting : the booleans

NARCIS (Netherlands)

Rodenburg, P.H.; Vrancken, J.L.M.

As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism

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

Synthesizing biomolecule-based Boolean logic gates.

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2013-02-15

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.

Synthesizing Biomolecule-based Boolean Logic Gates

Science.gov (United States)

Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari

2012-01-01

One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588

On the Boolean extension of the Birnbaum importance to non-coherent systems

International Nuclear Information System (INIS)

Aliee, Hananeh; Borgonovo, Emanuele; Glaß, Michael; Teich, Jürgen

2017-01-01

The Birnbaum importance measure plays a central role in reliability analysis. It has initially been introduced for coherent systems, where several of its properties hold and where its computation is straightforward. This work introduces a Boolean expression for the notion of criticality that allows the seamless extension of the Birnbaum importance to non-coherent systems. As a key feature, the novel definition makes the computation and encoding straightforward with well-established techniques such as Binary Decision Diagrams (BDDs) or Fault Trees (FTs). Several examples and a case study illustrate the findings. - Highlights: • We propose a Boolean expression for the notion of criticality in coherent and non-coherent systems. • The notion is connected with the Birnbaum importance measure. • The connection with Andrew's and Beeson extension is discussed. • The Boolean expression allows straightforward encoding in Binary Decision Diagrams.

Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

Science.gov (United States)

Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

2012-08-29

Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential

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

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

International Nuclear Information System (INIS)

Zheng, Jinbin

2014-01-01

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software

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

Energy Technology Data Exchange (ETDEWEB)

Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)

2014-10-06

In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.

Graphene-based non-Boolean logic circuits

Science.gov (United States)

Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.

2013-10-01

Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.

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

Unlimited multistability and Boolean logic in microbial signalling

DEFF Research Database (Denmark)

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

2015-01-01

The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation...... seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two...

Comparison of Boolean analysis and standard phylogenetic methods using artificially evolved and natural mt-tRNA sequences from great apes.

Science.gov (United States)

Ari, Eszter; Ittzés, Péter; Podani, János; Thi, Quynh Chi Le; Jakó, Eena

2012-04-01

Boolean analysis (or BOOL-AN; Jakó et al., 2009. BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction. Mol. Phylogenet. Evol. 52, 887-97.), a recently developed method for sequence comparison uses the Iterative Canonical Form of Boolean functions. It considers sequence information in a way entirely different from standard phylogenetic methods (i.e. Maximum Parsimony, Maximum-Likelihood, Neighbor-Joining, and Bayesian analysis). The performance and reliability of Boolean analysis were tested and compared with the standard phylogenetic methods, using artificially evolved - simulated - nucleotide sequences and the 22 mitochondrial tRNA genes of the great apes. At the outset, we assumed that the phylogeny of Hominidae is generally well established, and the guide tree of artificial sequence evolution can also be used as a benchmark. These offer a possibility to compare and test the performance of different phylogenetic methods. Trees were reconstructed by each method from 2500 simulated sequences and 22 mitochondrial tRNA sequences. We also introduced a special re-sampling method for Boolean analysis on permuted sequence sites, the P-BOOL-AN procedure. Considering the reliability values (branch support values of consensus trees and Robinson-Foulds distances) we used for simulated sequence trees produced by different phylogenetic methods, BOOL-AN appeared as the most reliable method. Although the mitochondrial tRNA sequences of great apes are relatively short (59-75 bases long) and the ratio of their constant characters is about 75%, BOOL-AN, P-BOOL-AN and the Bayesian approach produced the same tree-topology as the established phylogeny, while the outcomes of Maximum Parsimony, Maximum-Likelihood and Neighbor-Joining methods were equivocal. We conclude that Boolean analysis is a promising alternative to existing methods of sequence comparison for phylogenetic reconstruction and congruence analysis. Copyright © 2012 Elsevier Inc. All

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

Science.gov (United States)

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Free Boolean algebras over unions of two well orderings

Czech Academy of Sciences Publication Activity Database

Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw

2009-01-01

Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009

Boolean comparative analysis of qualitative data : a methodological note

NARCIS (Netherlands)

Romme, A.G.L.

1995-01-01

This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final

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.

Ordinary differential equations and Boolean networks in application to modelling of 6-mercaptopurine metabolism.

Science.gov (United States)

Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V

2017-04-01

We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.

Boolean models of biosurfactants production in Pseudomonas fluorescens.

Directory of Open Access Journals (Sweden)

Adrien Richard

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

Identification of control targets in Boolean molecular network models via computational algebra.

Science.gov (United States)

Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

2016-09-23

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

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.

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.

Confluence of an extension of combinatory logic by Boolean constants

DEFF Research Database (Denmark)

Czajka, Łukasz

2017-01-01

We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....

Realization of logical functions by vector programs

Energy Technology Data Exchange (ETDEWEB)

Lapkin, L Ya

1983-03-01

Recent computing and control applications often require program realization of finite automata in general and of an important particular class of memoryless automata specified by systems of Boolean functions. Logical control and computing machines which receive sequences of discrete signals on the input and convert them into sequences of discrete output signals using finite memory may be described by a finite automation model. However, in distinction from the circuit interpretation of finite automata, the automaton algorithm represents the structure of the automaton program and not the structure of the machine itself. Therefore, the complexity of the computer realization of an automaton is the complexity of the computer program, and not the complexity of the hardware. Two classes of programs currently used to evalute boolean functions are operator programs and binary programs. However, computing machines, including microcomputers, are equipped with additional possibilities for evaluation of Boolean functions, which are not utilized in programs of these two basic classes. In this article, we consider the design of vector programs for program realization of systems of Boolean functions. 3 references.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

Science.gov (United States)

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for

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

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

Science.gov (United States)

Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C

2016-11-01

Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

The Boolean algebra and central Galois algebras

Directory of Open Access Journals (Sweden)

George Szeto

2001-01-01

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

A GA-P algorithm to automatically formulate extended Boolean queries for a fuzzy information retrieval system

OpenAIRE

Cordón García, Oscar; Moya Anegón, Félix de; Zarco Fernández, Carmen

2000-01-01

[ES] Although the fuzzy retrieval model constitutes a powerful extension of the boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered t...

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

Science.gov (United States)

Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.

2015-10-01

The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.

Boolean Operations with Prism Algebraic Patches

Science.gov (United States)

Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

2009-01-01

In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

Bent functions results and applications to cryptography

CERN Document Server

Tokareva, Natalia

2015-01-01

Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced

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.

A new separation algorithm for the Boolean quadric and cut polytopes

DEFF Research Database (Denmark)

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

2014-01-01

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

Two Expectation-Maximization Algorithms for Boolean Factor Analysis

Czech Academy of Sciences Publication Activity Database

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

2014-01-01

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

Multipath Detection Using Boolean Satisfiability Techniques

Directory of Open Access Journals (Sweden)

Fadi A. Aloul

2011-01-01

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

The Boolean algebra of Galois algebras

Directory of Open Access Journals (Sweden)

Lianyong Xue

2003-02-01

Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B|bx=g(xb for all x∈B} for each g∈G, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|g∈G}, e a nonzero element in Ba, and He={g∈G|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.

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…

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

Stability of Boolean multilevel networks.

Science.gov (United States)

Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

2012-09-01

The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.

Message passing for quantified Boolean formulas

International Nuclear Information System (INIS)

Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka

2012-01-01

We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers

Optical reversible programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2012-07-20

Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.

Boolean Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

Science.gov (United States)

Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R

2017-01-01

Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.

Exact sampling from conditional Boolean models with applications to maximum likelihood inference

NARCIS (Netherlands)

Lieshout, van M.N.M.; Zwet, van E.W.

2001-01-01

We are interested in estimating the intensity parameter of a Boolean model of discs (the bombing model) from a single realization. To do so, we derive the conditional distribution of the points (germs) of the underlying Poisson process. We demonstrate how to apply coupling from the past to generate

Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics

NARCIS (Netherlands)

Jenner, Ronald A.

2002-01-01

A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic

Banach spaces of continuous functions as dual spaces

CERN Document Server

Dales, H G; Lau, A T -M; Strauss, D

2016-01-01

This book gives a coherent account of the theory of Banach spaces and Banach lattices, using the spaces C_0(K) of continuous functions on a locally compact space K as the main example. The study of C_0(K) has been an important area of functional analysis for many years. It gives several new constructions, some involving Boolean rings, of this space as well as many results on the Stonean space of Boolean rings. The book also discusses when Banach spaces of continuous functions are dual spaces and when they are bidual spaces.

A boolean optimization method for reloading a nuclear reactor

International Nuclear Information System (INIS)

Misse Nseke, Theophile.

1982-04-01

We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr

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

Science.gov (United States)

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

2013-03-01

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

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

Science.gov (United States)

Ensor, Pat

1992-01-01

Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…

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

Science.gov (United States)

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

2015-04-28

Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.

Complex network analysis of state spaces for random Boolean networks

Energy Technology Data Exchange (ETDEWEB)

Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)

2008-01-15

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.

Complex network analysis of state spaces for random Boolean networks

International Nuclear Information System (INIS)

Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya

2008-01-01

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two

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

Science.gov (United States)

Matoušek, Milan; Pták, Pavel

2015-12-01

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

Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

2005-01-01

Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

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

Energy Technology Data Exchange (ETDEWEB)

Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S., E-mail: miaoxs@mail.hust.edu.cn [Wuhan National Laboratory for Optoelectronics (WNLO), Huazhong University of Science and Technology (HUST), Wuhan 430074 (China); School of Optical and Electronic Information, Huazhong University of Science and Technology, Wuhan 430074 (China)

2013-12-21

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

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

International Nuclear Information System (INIS)

Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S.

2013-01-01

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

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

Science.gov (United States)

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

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

International Nuclear Information System (INIS)

Ramskill, Nicholas P; Wang, Mi

2011-01-01

In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime

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

Science.gov (United States)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

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

Science.gov (United States)

Fox, Edward A.; Winett, Sheila G.

1990-01-01

Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…

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

Science.gov (United States)

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2015-11-01

We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.

Bebop to the Boolean boogie an unconventional guide to electronics

CERN Document Server

Maxfield, Clive

2003-01-01

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

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…

Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral space

Science.gov (United States)

Szejka, Agnes; Drossel, Barbara

2010-02-01

We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.

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

Science.gov (United States)

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

1991-01-01

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

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.

Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.

Directory of Open Access Journals (Sweden)

Herman F Fumiã

Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.

Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask

OpenAIRE

Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti

2012-01-01

Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.

Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

2005-01-01

Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

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.

Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering

Czech Academy of Sciences Publication Activity Database

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

2009-01-01

Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009

Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

OpenAIRE

Andrade, Jefferson O.; Kameyama, Yukiyoshi

2012-01-01

Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...

Variances as order parameter and complexity measure for random Boolean networks

International Nuclear Information System (INIS)

Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel

2005-01-01

Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems

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.

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

Czech Academy of Sciences Publication Activity Database

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

2016-01-01

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

On bent and semi-bent quadratic Boolean functions

DEFF Research Database (Denmark)

Charpin, P.; Pasalic, Enes; Tavernier, C.

2005-01-01

correlation and high nonlinearity. We say that such a sequence is generated by a semi-bent function. Some new families of such function, represented by f(x) = Sigma(i=1)(n-1/2) c(i)Tr(x(2t+1)), n odd and c(i) is an element of F-2, have recently (2002) been introduced by Khoo et al. We first generalize......The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross...... their results to even n. We further investigate the conditions on the choice of ci for explicit definitions of new infinite families having three and four trace terms. Also, a class of nonpermutation polynomials whose composition with a quadratic function yields again a quadratic semi-bent function is specified...

Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.

Science.gov (United States)

Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad

2017-12-19

Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.

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

Science.gov (United States)

Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek

2015-08-07

The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.

Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method

International Nuclear Information System (INIS)

EI-Shanshoury, A.I.

2011-01-01

This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied

Construction of a fuzzy and all Boolean logic gates based on DNA

DEFF Research Database (Denmark)

M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse

2015-01-01

to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....

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.

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.

Satisfiability of logic programming based on radial basis function neural networks

International Nuclear Information System (INIS)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong

2014-01-01

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

Satisfiability of logic programming based on radial basis function neural networks

Energy Technology Data Exchange (ETDEWEB)

Hamadneh, Nawaf; Sathasivam, Saratha; Tilahun, Surafel Luleseged; Choon, Ong Hong [School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang (Malaysia)

2014-07-10

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

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.

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

Science.gov (United States)

Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail

2011-01-01

We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.

Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

Science.gov (United States)

Kupper, Z.; Hoffmann, H.

A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.

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

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

Science.gov (United States)

Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian

2018-04-01

Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.

THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM

Directory of Open Access Journals (Sweden)

A. A. Butov

2014-01-01

Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.

SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS

Directory of Open Access Journals (Sweden)

A. V. Sokolov

2016-01-01

Full Text Available The rapid development of methods of error-correcting coding, cryptography, and signal synthesis theory based on the principles of many-valued logic determines the need for a more detailed study of the forms of representation of functions of many-valued logic. In particular the algebraic normal form of Boolean functions, also known as Zhegalkin polynomial, that well describe many of the cryptographic properties of Boolean functions is widely used. In this article, we formalized the notion of algebraic normal form for many-valued logic functions. We developed a fast method of synthesis of algebraic normal form of 3-functions and 5-functions that work similarly to the Reed-Muller transform for Boolean functions: on the basis of recurrently synthesized transform matrices. We propose the hypothesis, which determines the rules of the synthesis of these matrices for the transformation from the truth table to the coefficients of the algebraic normal form and the inverse transform for any given number of variables of 3-functions or 5-functions. The article also introduces the definition of algebraic degree of nonlinearity of the functions of many-valued logic and the S-box, based on the principles of many-valued logic. Thus, the methods of synthesis of algebraic normal form of 3-functions applied to the known construction of recurrent synthesis of S-boxes of length N = 3k, whereby their algebraic degrees of nonlinearity are computed. The results could be the basis for further theoretical research and practical applications such as: the development of new cryptographic primitives, error-correcting codes, algorithms of data compression, signal structures, and algorithms of block and stream encryption, all based on the perspective principles of many-valued logic. In addition, the fast method of synthesis of algebraic normal form of many-valued logic functions is the basis for their software and hardware implementation.

Further Results on Constructions of Generalized Bent Boolean Functions

Science.gov (United States)

2016-03-01

China; 2Naval Postgraduate School, Applied Mathematics Department, Monterey, CA 93943, USA; 3Science and Technology on Communication Security...in 1976 as an interesting combinatorial object with the important property of having op- timal nonlinearity [1]. Since bent functions have many...77–94 10 Zhao Y, Li H L. On bent functions with some symmet- ric properties. Discret Appl Math, 2006, 154: 2537– 2543

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

Energy Technology Data Exchange (ETDEWEB)

D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)

2016-09-15

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

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

Generalized Boolean logic Driven Markov Processes: A powerful modeling framework for Model-Based Safety Analysis of dynamic repairable and reconfigurable systems

International Nuclear Information System (INIS)

Piriou, Pierre-Yves; Faure, Jean-Marc; Lesage, Jean-Jacques

2017-01-01

This paper presents a modeling framework that permits to describe in an integrated manner the structure of the critical system to analyze, by using an enriched fault tree, the dysfunctional behavior of its components, by means of Markov processes, and the reconfiguration strategies that have been planned to ensure safety and availability, with Moore machines. This framework has been developed from BDMP (Boolean logic Driven Markov Processes), a previous framework for dynamic repairable systems. First, the contribution is motivated by pinpointing the limitations of BDMP to model complex reconfiguration strategies and the failures of the control of these strategies. The syntax and semantics of GBDMP (Generalized Boolean logic Driven Markov Processes) are then formally defined; in particular, an algorithm to analyze the dynamic behavior of a GBDMP model is developed. The modeling capabilities of this framework are illustrated on three representative examples. Last, qualitative and quantitative analysis of GDBMP models highlight the benefits of the approach.

Cryptographic Properties of the Hidden Weighted Bit Function

Science.gov (United States)

2013-12-23

valid OMB control number. 1. REPORT DATE 23 DEC 2013 2. REPORT TYPE 3. DATES COVERED 00-00-2013 to 00-00-2013 4. TITLE AND SUBTITLE...K. Feng, An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity, in: IWCC 2009, In: LNCS

A novel mutual information-based Boolean network inference method from time-series gene expression data.

Directory of Open Access Journals (Sweden)

Shohag Barman

Full Text Available Inferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.In this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.Taken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.

Bent and bent(4) spectra of Boolean functions over finite fields

DEFF Research Database (Denmark)

Anbar Meidl, Nurdagül; Meidl, Wilfried

2017-01-01

For c is an element of F(2)n, a c-bent4 function f from the finite field F(2)n to F-2 is a function with a fiat spectrum with respect to the unitary transform V-f(c), which is designed to describe the component functions of modified planar functions. For c = 0 the transform V-f(c) reduces to the ...... a cubic monomial. We show that it is c-bent(4) only for c = 1, the function is then called negabent, which shows that non-quadratic functions exhibit a different behaviour. (C) 2017 Elsevier Inc. All rights reserved....

Dynamics of random Boolean networks under fully asynchronous stochastic update based on linear representation.

Directory of Open Access Journals (Sweden)

Chao Luo

Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.

Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.

Science.gov (United States)

Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu

2009-07-01

The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.

Neutral space analysis for a Boolean network model of the fission yeast cell cycle network

Directory of Open Access Journals (Sweden)

Gonzalo A Ruz

2014-01-01

Full Text Available BACKGROUND: Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle. RESULTS: Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G1 fixed point was found for deterministic updating schemes. CONCLUSIONS: In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the

On algorithmic equivalence of instruction sequences for computing bit string functions

NARCIS (Netherlands)

Bergstra, J.A.; Middelburg, C.A.

2015-01-01

Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

On algorithmic equivalence of instruction sequences for computing bit string functions

NARCIS (Netherlands)

Bergstra, J.A.; Middelburg, C.A.

2014-01-01

Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras

Science.gov (United States)

Andrade, Jefferson O.; Kameyama, Yukiyoshi

Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.

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

Science.gov (United States)

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

2016-12-21

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

When do evolutionary algorithms optimize separable functions in parallel?

DEFF Research Database (Denmark)

Doerr, Benjamin; Sudholt, Dirk; Witt, Carsten

2013-01-01

is that evolutionary algorithms make progress on all subfunctions in parallel, so that optimizing a separable function does not take not much longer than optimizing the hardest subfunction-subfunctions are optimized "in parallel." We show that this is only partially true, already for the simple (1+1) evolutionary...... algorithm ((1+1) EA). For separable functions composed of k Boolean functions indeed the optimization time is the maximum optimization time of these functions times a small O(log k) overhead. More generally, for sums of weighted subfunctions that each attain non-negative integer values less than r = o(log1...

Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.

Science.gov (United States)

Dallidis, Stylianos E; Karafyllidis, Ioannis G

2014-09-01

To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.

ON THE ESTIMATION OF DISTANCE DISTRIBUTION FUNCTIONS FOR POINT PROCESSES AND RANDOM SETS

Directory of Open Access Journals (Sweden)

Dietrich Stoyan

2011-05-01

Full Text Available This paper discusses various estimators for the nearest neighbour distance distribution function D of a stationary point process and for the quadratic contact distribution function Hq of a stationary random closed set. It recommends the use of Hanisch's estimator of D, which is of Horvitz-Thompson type, and the minussampling estimator of Hq. This recommendation is based on simulations for Poisson processes and Boolean models.

Generalized Boolean Functions as Combiners

Science.gov (United States)

2017-06-01

of large runs of ones [6]. The fifth test is the Binary Rank Matrix test. This test looks at the rank of disjoint sub- matrices of the entire sequence...matrices to be of size 32x32. The sub-matrices are filled in row by row from the original 17 sequence. The rank for each sub- matrix is then computed...amLeng t h : 57 #LFSRS 58 f o r i in range ( 0 , l en ( l f s r s ) ) : 59 x i = reduce ( lambda x , y : x^y , map ( lambda x : l f s r s [ i

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

KAUST Repository

Lima, Ricardo

2016-06-16

This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

KAUST Repository

Lima, Ricardo; Grossmann, Ignacio E.

2016-01-01

This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

Multi-Valued Logic Gates, Continuous Sensitivity, Reversibility, and Threshold Functions

OpenAIRE

İlhan, Aslı Güçlükan; Ünlü, Özgün

2016-01-01

We define an invariant of a multi-valued logic gate by considering the number of certain threshold functions associated with the gate. We call this invariant the continuous sensitivity of the gate. We discuss a method for analysing continuous sensitivity of a multi-valued logic gate by using experimental data about the gate. In particular, we will show that this invariant provides a lower bound for the sensitivity of a boolean function considered as a multi-valued logic gate. We also discuss ...

Spaces of continuous functions

CERN Document Server

Groenewegen, G L M

2016-01-01

The space C(X) of all continuous functions on a compact space X carries the structure of a normed vector space, an algebra and a lattice. On the one hand we study the relations between these structures and the topology of X, on the other hand we discuss a number of classical results according to which an algebra or a vector lattice can be represented as a C(X). Various applications of these theorems are given. Some attention is devoted to related theorems, e.g. the Stone Theorem for Boolean algebras and the Riesz Representation Theorem. The book is functional analytic in character. It does not presuppose much knowledge of functional analysis; it contains introductions into subjects such as the weak topology, vector lattices and (some) integration theory.

Modified planar functions and their components

DEFF Research Database (Denmark)

Anbar Meidl, Nurdagül; Meidl, Wilfried Meidl

2017-01-01

functions in odd characteristic as a vectorial bent function. We finally point out that though these components behave somewhat different than the multivariate bent4 functions, they are bent or semibent functions shifted by a certain quadratic term, a property which they share with their multivariate......Zhou ([20]) introduced modified planar functions in order to describe (2n; 2n; 2n; 1) relative difference sets R as a graph of a function on the finite field F2n, and pointed out that projections of R are difference sets that can be described by negabent or bent4 functions, which are Boolean...... functions given in multivariate form. One of the objectives of this paper is to contribute to the understanding of these component functions of modified planar functions. Moreover, we obtain a description of modified planar functions by their components which is similar to that of the classical planar...

featsel: A framework for benchmarking of feature selection algorithms and cost functions

OpenAIRE

Marcelo S. Reis; Gustavo Estrela; Carlos Eduardo Ferreira; Junior Barrera

2017-01-01

In this paper, we introduce featsel, a framework for benchmarking of feature selection algorithms and cost functions. This framework allows the user to deal with the search space as a Boolean lattice and has its core coded in C++ for computational efficiency purposes. Moreover, featsel includes Perl scripts to add new algorithms and/or cost functions, generate random instances, plot graphs and organize results into tables. Besides, this framework already comes with dozens of algorithms and co...

Using boolean and fuzzy logic combined with analytic hierarchy process for hazardous waste landfill site selection: A case study from Hormozgan province, Iran

Directory of Open Access Journals (Sweden)

Mahdieh Saadat Foomani

2017-01-01

Full Text Available Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where these special types of waste can be disposed of securely. Since landfills are permanent sites, special attention must be afforded in selecting the location. This paper investigated the use of the Boolean theory and Fuzzy logic in combination with Analytic Hierarchy Process (AHP methods by applying GIS and IDRISI software for the selection of a hazardous waste landfill site in the Iranian province of Hormozgan. The best location was determined via the Fuzzy and the Boolean methodologies. By collating the area selected for the hazardous waste landfill, this study found that Fuzzy logic with an AND operator had the best options for this purpose. In the end, the most suitable area for a hazardous waste landfill was about 1.6 km2 which was obtained by employing Fuzzy in combination with AHP and by using an AND operator. In addition, all the fundamental criteria affecting the landfill location were considered.

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.

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

Science.gov (United States)

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

2015-09-01

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

Theory and calculus of cubical complexes

Science.gov (United States)

Perlman, M.

1973-01-01

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

Importance analysis based on logical differential calculus and Binary Decision Diagram

International Nuclear Information System (INIS)

Zaitseva, Elena; Levashenko, Vitaly; Kostolny, Jozef

2015-01-01

System availability evaluation, sensitivity analysis, Importance Measures, and optimal design are important issues that have become research topics for reliability engineering. There are different mathematical approaches to the development of these topics. The structure function based approach is one of them. Structure function enables one to analyse a system of any complexity. But computational complexity of structure function based methods is time consuming for large-scale networks. We propose to use two mathematical approaches for decision to this problem for system importance analysis. The first of them is Direct Partial Boolean Derivative. New equations for calculating the Importance Measures are developed in terms of these derivatives. The second is Binary Decision Diagram (BDD), that supports efficient manipulation of Boolean algebra. Two algorithms for calculating Direct Partial Boolean Derivative based on BDD of structure function are proposed in this paper. The experimental results show the efficiency of new algorithms for calculating Direct Partial Boolean Derivative and Importance Measures. - Highlights: • New approach for calculation of Importance Measures is proposed. • Direct Partial Boolean Derivatives are used for calculation of Importance Measures. • New equations for Importance Measures are obtained. • New algorithm to calculate Direct Partial Boolean Derivatives by BDD is developed

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

Science.gov (United States)

Uezu, Tatsuya; Kiyokawa, Shuji

2016-06-01

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

Boolean Logic Tree of Label-Free Dual-Signal Electrochemical Aptasensor System for Biosensing, Three-State Logic Computation, and Keypad Lock Security Operation.

Science.gov (United States)

Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing

2017-09-19

The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.

An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.

Science.gov (United States)

Jiang, Han; Li, Xue; Xu, Qiuliang

2016-12-01

The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.

Multilayer Neural Networks with Extensively Many Hidden Units

International Nuclear Information System (INIS)

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

2001-01-01

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

Maiorana-McFarland class: Degree optimization and algebraic properties

DEFF Research Database (Denmark)

Pasalic, Enes

2006-01-01

degree of functions in the extended Maiorana-McFarland (MM) class (nonlinear resilient functions F : GF (2)(n) -> GF (2)(m) derived from linear codes). We also show that in the Boolean case, the same subclass seems not to have an optimized algebraic immunity, hence not providing a maximum resistance......In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree...... in the original class. Preserving a high-nonlinearity value immanent to the original construction method, together with the degree optimization gives in many cases functions with cryptographic properties superior to all previously known construction methods. This approach is then used to increase the algebraic...

Fault tree analysis with multistate components

International Nuclear Information System (INIS)

Caldarola, L.

1979-02-01

A general analytical theory has been developed which allows one to calculate the occurence probability of the top event of a fault tree with multistate (more than states) components. It is shown that, in order to correctly describe a system with multistate components, a special type of Boolean algebra is required. This is called 'Boolean algebra with restrictions on varibales' and its basic rules are the same as those of the traditional Boolean algebra with some additional restrictions on the variables. These restrictions are extensively discussed in the paper. Important features of the method are the identification of the complete base and of the smallest irredundant base of a Boolean function which does not necessarily need to be coherent. It is shown that the identification of the complete base of a Boolean function requires the application of some algorithms which are not used in today's computer programmes for fault tree analysis. The problem of statistical dependence among primary components is discussed. The paper includes a small demonstrative example to illustrate the method. The example includes also statistical dependent components. (orig.) [de

Attractor controllability of Boolean networks by flipping a subset of their nodes

Science.gov (United States)

Rafimanzelat, Mohammad Reza; Bahrami, Fariba

2018-04-01

The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.

Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.

Science.gov (United States)

Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S

2011-02-01

The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.

Neuromorphic function learning with carbon nanotube based synapses

International Nuclear Information System (INIS)

Gacem, Karim; Filoramo, Arianna; Derycke, Vincent; Retrouvey, Jean-Marie; Chabi, Djaafar; Zhao, Weisheng; Klein, Jacques-Olivier

2013-01-01

The principle of using nanoscale memory devices as artificial synapses in neuromorphic circuits is recognized as a promising way to build ground-breaking circuit architectures tolerant to defects and variability. Yet, actual experimental demonstrations of the neural network type of circuits based on non-conventional/non-CMOS memory devices and displaying function learning capabilities remain very scarce. We show here that carbon-nanotube-based memory elements can be used as artificial synapses, combined with conventional neurons and trained to perform functions through the application of a supervised learning algorithm. The same ensemble of eight devices can notably be trained multiple times to code successively any three-input linearly separable Boolean logic function despite device-to-device variability. This work thus represents one of the very few demonstrations of actual function learning with synapses based on nanoscale building blocks. The potential of such an approach for the parallel learning of multiple and more complex functions is also evaluated. (paper)

The boolean algebra with restricted variables as a tool for fault tree modularization

International Nuclear Information System (INIS)

Caldarola, L.; Wickenhaeuser, A.

1981-08-01

The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de

Generalization and capacity of extensively large two-layered perceptrons

International Nuclear Information System (INIS)

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

2002-01-01

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

Data structures theory and practice

CERN Document Server

Berztiss, A T

1971-01-01

Computer Science and Applied Mathematics: Data Structures: Theory and Practice focuses on the processes, methodologies, principles, and approaches involved in data structures, including algorithms, decision trees, Boolean functions, lattices, and matrices. The book first offers information on set theory, functions, and relations, and graph theory. Discussions focus on linear formulas of digraphs, isomorphism of digraphs, basic definitions in the theory of digraphs, Boolean functions and forms, lattices, indexed sets, algebra of sets, and order pair and related concepts. The text then examines

On automatic synthesis of analog/digital circuits

Energy Technology Data Exchange (ETDEWEB)

Beiu, V.

1998-12-31

The paper builds on a recent explicit numerical algorithm for Kolmogorov`s superpositions, and will show that in order to synthesize minimum size (i.e., size-optimal) circuits for implementing any Boolean function, the nonlinear activation function of the gates has to be the identity function. Because classical and--or implementations, as well as threshold gate implementations require exponential size, it follows that size-optimal solutions for implementing arbitrary Boolean functions can be obtained using analog (or mixed analog/digital) circuits. Conclusions and several comments are ending the paper.

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

Science.gov (United States)

Ye, Weiming; Li, Pengfei; Huang, Xuhui; Xia, Qinzhi; Mi, Yuanyuan; Chen, Runsheng; Hu, Gang

2010-10-01

Exploring the principle and relationship of gene transcriptional regulations (TR) has been becoming a generally researched issue. So far, two major mathematical methods, ordinary differential equation (ODE) method and Boolean map (BM) method have been widely used for these purposes. It is commonly believed that simplified BMs are reasonable approximations of more realistic ODEs, and both methods may reveal qualitatively the same essential features though the dynamical details of both systems may show some differences. In this Letter we exhaustively enumerated all the 3-gene networks and many autonomous randomly constructed TR networks with more genes by using both the ODE and BM methods. In comparison we found that both methods provide practically identical results in most of cases of steady solutions. However, to our great surprise, most of network structures showing periodic cycles with the BM method possess only stationary states in ODE descriptions. These observations strongly suggest that many periodic oscillations and other complicated oscillatory states revealed by the BM rule may be related to the computational errors of variable and time discretizations and rarely have correspondence in realistic biology transcriptional regulatory circuits.

Complex logic functions implemented with quantum dot bionanophotonic circuits.

Science.gov (United States)

Claussen, Jonathan C; Hildebrandt, Niko; Susumu, Kimihiro; Ancona, Mario G; Medintz, Igor L

2014-03-26

We combine quantum dots (QDs) with long-lifetime terbium complexes (Tb), a near-IR Alexa Fluor dye (A647), and self-assembling peptides to demonstrate combinatorial and sequential bionanophotonic logic devices that function by time-gated Förster resonance energy transfer (FRET). Upon excitation, the Tb-QD-A647 FRET-complex produces time-dependent photoluminescent signatures from multi-FRET pathways enabled by the capacitor-like behavior of the Tb. The unique photoluminescent signatures are manipulated by ratiometrically varying dye/Tb inputs and collection time. Fluorescent output is converted into Boolean logic states to create complex arithmetic circuits including the half-adder/half-subtractor, 2:1 multiplexer/1:2 demultiplexer, and a 3-digit, 16-combination keypad lock.

Orthogonal Algorithm of Logic Probability and Syndrome-Testable Analysis

Institute of Scientific and Technical Information of China (English)

无

1990-01-01

A new method,orthogonal algoritm,is presented to compute the logic probabilities(i.e.signal probabilities)accurately,The transfer properties of logic probabilities are studied first,which are useful for the calculation of logic probability of the circuit with random independent inputs.Then the orthogonal algoritm is described to compute the logic probability of Boolean function realized by a combinational circuit.This algorithm can make Boolean function “ORTHOGONAL”so that the logic probabilities can be easily calculated by summing up the logic probabilities of all orthogonal terms of the Booleam function.

Implementing size-optimal discrete neural networks require analog circuitry

Energy Technology Data Exchange (ETDEWEB)

Beiu, V.

1998-12-01

This paper starts by overviewing results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on a constructive solution for Kolmogorov`s superpositions the authors show that implementing Boolean functions can be done using neurons having an identity transfer function. Because in this case the size of the network is minimized, it follows that size-optimal solutions for implementing Boolean functions can be obtained using analog circuitry. Conclusions and several comments on the required precision are ending the paper.

Learning Read-constant Polynomials of Constant Degree modulo Composites

DEFF Research Database (Denmark)

Chattopadhyay, Arkadev; Gavaldá, Richard; Hansen, Kristoffer Arnsfelt

2011-01-01

Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...

Symmetric Logic Synthesis with Phase Assignment

OpenAIRE

Benschop, N. F.

2001-01-01

Decomposition of any Boolean Function BF_n of n binary inputs into an optimal inverter coupled network of Symmetric Boolean functions SF_k (k \\leq n) is described. Each SF component is implemented by Threshold Logic Cells, forming a complete and compact T-Cell Library. Optimal phase assignment of input polarities maximizes local symmetries. The "rank spectrum" is a new BF_n description independent of input ordering, obtained by mapping its minterms onto an othogonal n \\times n grid of (transi...

Generalized fault tree analysis combined with state analysis

International Nuclear Information System (INIS)

Caldarola, L.

1980-02-01

An analytical theory has been developed which allows one to calculate the occurrence probability of the top event of a fault tree with multistate (two or more than two states) components. It is shown that, in order to correctly describe a system with multistate components, a special type of boolean algebra is required. This is called 'boolean algebra with restrictions on variables' and its basic rules are the same as those of the traditional boolean algebra with some additional restrictions on the variables. These restrictions are extensively discussed in the paper. It is also shown that the boolean algebra with restrictions on variables facilitates the task of formally combining fault tree analysis with state analysis. The computer program MUSTAFA 1 based on the above theory has been developed. It can analyse fault trees of system containing statistically independent as well as dependent components with two or more than two states. MUSTAFA 1 can handle coherent as well as non coherent boolean functions. (orig.) 891 HP/orig. 892 MB [de

Plasticity of the cis-regulatory input function of a gene.

Directory of Open Access Journals (Sweden)

Avraham E Mayo

2006-04-01

Full Text Available The transcription rate of a gene is often controlled by several regulators that bind specific sites in the gene's cis-regulatory region. The combined effect of these regulators is described by a cis-regulatory input function. What determines the form of an input function, and how variable is it with respect to mutations? To address this, we employ the well-characterized lac operon of Escherichia coli, which has an elaborate input function, intermediate between Boolean AND-gate and OR-gate logic. We mapped in detail the input function of 12 variants of the lac promoter, each with different point mutations in the regulator binding sites, by means of accurate expression measurements from living cells. We find that even a few mutations can significantly change the input function, resulting in functions that resemble Pure AND gates, OR gates, or single-input switches. Other types of gates were not found. The variant input functions can be described in a unified manner by a mathematical model. The model also lets us predict which functions cannot be reached by point mutations. The input function that we studied thus appears to be plastic, in the sense that many of the mutations do not ruin the regulation completely but rather result in new ways to integrate the inputs.

On a hierarchy of Booleanfunctions hard to compute in constant depth

Directory of Open Access Journals (Sweden)

Anna Bernasconi

2001-12-01

Full Text Available 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. This work represents a step in this direction: we define a combinatorial property that makes Boolean functions `` hard '' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions.

On Computational Power of Quantum Read-Once Branching Programs

Directory of Open Access Journals (Sweden)

Farid Ablayev

2011-03-01

Full Text Available In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively small (usually logarithmic in the size of input number of qubits. Then we show that the described class of Boolean functions is closed under the polynomial projections.

Coherent systems with multistate components

International Nuclear Information System (INIS)

Caldarola, L.

1980-01-01

The basic rules of the Boolean algebra with restrictions on variables are briefly recalled. This special type of Boolean algebra allows one to handle fault trees of systems made of multistate (two or more than two states) components. Coherent systems are defined in the case of multistate components. This definition is consistent with that originally suggested by Barlow in the case of binary (two states) components. The basic properties of coherence are described and discussed. Coherent Boolean functions are also defined. It is shown that these functions are irredundant, that is they have only one base which is at the same time complete and irredundant. However, irredundant functions are not necessarily coherent. Finally a simplified algorithm for the calculation of the base of a coherent function is described. In the case that the function is not coherent, the algorithm can be used to reduce the size of the normal disjunctive form of the function. This in turn eases the application of the Nelson algorithm to calculate the complete base of the function. The simplified algorithm has been built in the computer program MUSTAFA-1. In a sample case the use of this algorithm caused a reduction of the CPU time by a factor of about 20. (orig.)

Logic circuits from zero forcing.

Science.gov (United States)

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

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

The Logical Properties of Lower and Upper Approximation Operations in Rough Sets%粗集中上下近似运算的逻辑性质

Institute of Scientific and Technical Information of China (English)

祝峰; 何华灿

2000-01-01

In this paper,we discuss the logical properties of rough sets through topological boolean algebras and closure topological boolean algebras.We get representation theorems of finite topological boolean algebras and closure topological boolean algebras under the upper-lower relation condition,which establish the relationship between topological boolean algebras or closure topological boolean algebras and rough sets in the general sets are similar to the Stone's representation theorem of boolean algebras.

Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation

Science.gov (United States)

Pinilla, Samuel; Poveda, Juan; Arguello, Henry

2018-03-01

Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.

Affine Equivalence and Constructions of Cryptographically Strong Boolean Functions

Science.gov (United States)

2013-09-01

Math. Dissertation Supervisor Jon T. Butler Distinguished Professor Department of Elec. and Comp. Eng. David R. Canright Associate Professor...Linear structures in blockciphers,” in Advances in Cryptology, EU- ROCRYPT’87, ser. Lecture Notes in Computer Science, D. Chaum and W. L. Price, Eds

Digital design basic concepts and principles

CERN Document Server

Karim, Mohammad A

2007-01-01

DATA TYPE AND REPRESENTATIONS Positional Number Systems Number System Conversion Negative Numbers Binary Arithmetic Unconventional Number System Binary Codes Error Detecting and Correcting Codes CAD System BOOLEAN ALGEBRA Logic Operations Logic Functions from Truth Tables Boolean Algebra MINIMIZATION OF LOGIC FUNCTIONS Karnaugh Map Incompletely Specified Functions in K-Map K-Maps for Product-of-sum Form of Functions Map-entered Variables Hazards Single-output Q-M Tabular Reduction Multiple-output Q-M Tabular reduction                               LOGIC FUNCTION IMPLEMENTATION Introduction Functionally Complete Operation Sets NAND-only and NOR-only Implementations Function Implementation Using XOR and XNOR Logic Circuit Implementation Using Gate Arrays Logic Function Implementation Using Multiplexers Logic Function Implementation Using Demultiplexers andecoders Logic Function Implementation Using ROM Logic Function Implementation Using PLD Logic Func...

Utilidade de regras booleanas aplicadas à liberação de resultados de exames hormonais e marcadores tumorais Usefulness of Boolean rules applied on the release of hormonal and tumor markers tests results

Directory of Open Access Journals (Sweden)

Murilo Rezende Melo

2006-08-01

review of results for adequate laboratory section test release. Analysis of these results using Boolean rules is an interesting alternative to reduce the number of results that require manual review. MATERIAL AND METHOD: We evaluated the utilization of Boolean rules using Instrument Manager software and Architect analyzer, mainly performing sex and thyroid hormones measurement. The intervention was evaluated on: a number of rules and its easiness of construction; b blind comparison of results evaluation by clinical pathologist (printed results and set of rules in 940 consecutive tests. RESULTS: Rule creation was a complex and arduous task, especially due to hormonal profiles with several different request patterns. It was necessary to use a set of 153 Boolean (if…then rules, in a specific order. This set of rules agreed with expert opinion in 97.9% (920 tests. Rules hold 25 tests (2.7% and the clinical pathologist only nine tests. There was discordance in 20 cases; rules did not hold only two cases: a beta-hCG in a male patient (that prompted the creation of a new rule and a complete thyroid profile lacking only TSH request (pathologist opted to review the original request. CONCLUSION: Creation of an efficient set of Boolean rules proved to be a complex task requiring both technical and logics knowledge, but allowing optimization of laboratory workload. We achieved excellent concordance between the set of rules and clinical pathologist manual review, in a safe, fast and low cost system.

Disjoint sum expansion method in FTA

International Nuclear Information System (INIS)

Ruan Keqiang

1987-01-01

An expansion formula for transforming boolean algebraic expressions into disjoint form was proved. Based on this expansion formula, a method for transforming system failure function into disjoint form was devised. The fact that the expansion can be done for several elements simulatneously makes the method flexible and fast. Some examples from fault tree analysis (FTA) and network analysis were examined by the new method to show its algorithm and its merit. Besides, by means of the proved expansion formula some boolean algebraic relations can proved very easily

High speed all optical logic gates based on quantum dot semiconductor optical amplifiers.

Science.gov (United States)

Ma, Shaozhen; Chen, Zhe; Sun, Hongzhi; Dutta, Niloy K

2010-03-29

A scheme to realize all-optical Boolean logic functions AND, XOR and NOT using semiconductor optical amplifiers with quantum-dot active layers is studied. nonlinear dynamics including carrier heating and spectral hole-burning are taken into account together with the rate equations scheme. Results show with QD excited state and wetting layer serving as dual-reservoir of carriers, as well as the ultra fast carrier relaxation of the QD device, this scheme is suitable for high speed Boolean logic operations. Logic operation can be carried out up to speed of 250 Gb/s.

Modeling digital switching circuits with linear algebra

CERN Document Server

Thornton, Mitchell A

2014-01-01

Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transf

Contribution to computer aided design of digital circuits - Minimization of alphanumeric expressions - Program CHOPIN

International Nuclear Information System (INIS)

Blanca, Ernest

1974-10-01

Alpha-numeric boolean expressions, written in the form of sums of products and/or products of sums with many brackets, may be minimized in two steps: syntaxic recognition analysis using precedence operator grammar, syntaxic reduction analysis. These two phases of execution and the different programs of the corresponding machine algorithm are described. Examples of minimization of alpha-numeric boolean expressions written with the help of brackets, utilisation note of the program CHOPIN and theoretical considerations related to language, grammar, precedence operator grammar, sequential systems, boolean sets, boolean representations and treatments of boolean expressions, boolean matrices and their use in grammar theory, are discussed and described. (author) [fr

Rational approximations and quantum algorithms with postselection

NARCIS (Netherlands)

Mahadev, U.; de Wolf, R.

2015-01-01

We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We

Probably Almost Bayes Decisions

DEFF Research Database (Denmark)

Anoulova, S.; Fischer, Paul; Poelt, S.

1996-01-01

discriminant functions for this purpose. We analyze this approach for different classes of distribution functions of Boolean features:kth order Bahadur-Lazarsfeld expansions andkth order Chow expansions. In both cases, we obtain upper bounds for the required sample size which are small polynomials...

Reliable computation from contextual correlations

Science.gov (United States)

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

2017-12-01

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

On Maximal Non-Disjoint Families of Subsets

Directory of Open Access Journals (Sweden)

Yu. A. Zuev

2017-01-01

Full Text Available The paper studies maximal non-disjoint families of subsets of a finite set. Non-disjointness means that any two subsets of a family have a nonempty intersection. The maximality is expressed by the fact that adding a new subset to the family cannot increase its power without violating a non-disjointness condition. Studying the properties of such families is an important section of the extreme theory of sets. Along with purely combinatorial interest, the problems considered here play an important role in informatics, anti-noise coding, and cryptography.In 1961 this problem saw the light of day in the Erdos, Ko and Rado paper, which established a maximum power of the non-disjoint family of subsets of equal power. In 1974 the Erdos and Claytman publication estimated the number of maximal non-disjoint families of subsets without involving the equality of their power. These authors failed to establish an asymptotics of the logarithm of the number of such families when the power of a basic finite set tends to infinity. However, they suggested such an asymptotics as a hypothesis. A.D. Korshunov in two publications in 2003 and 2005 established the asymptotics for the number of non-disjoint families of the subsets of arbitrary powers without maximality condition of these families.The basis for the approach used in the paper to study the families of subsets is their description in the language of Boolean functions. A one-to-one correspondence between a family of subsets and a Boolean function is established by the fact that the characteristic vectors of subsets of a family are considered to be the unit sets of a Boolean function. The main theoretical result of the paper is that the maximal non-disjoint families are in one-to-one correspondence with the monotonic self-dual Boolean functions. When estimating the number of maximal non-disjoint families, this allowed us to use the result of A.A. Sapozhenko, who established the asymptotics of the number of the

Using the Perceptron Algorithm to Find Consistent Hypotheses

OpenAIRE

Anthony, M.; Shawe-Taylor, J.

1993-01-01

The perceptron learning algorithm yields quite naturally an algorithm for finding a linearly separable boolean function consistent with a sample of such a function. Using the idea of a specifying sample, we give a simple proof that this algorithm is not efficient, in general.

Modeling stochasticity and robustness in gene regulatory networks.

Science.gov (United States)

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

2009-06-15

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

How to Circumvent Church Numerals

DEFF Research Database (Denmark)

Goldberg, Mayer; Torgersen, Mads

2002-01-01

In this work we consider a standard numeral system in the lambda-calculus, and the elementary arithmetic and Boolean functions and predicates defined on this numeral system, and show how to construct terms that "circumvent" or "defeat" these functions: The equality predicate is satisfied when com...

Linear algebra as an alternative approach to the synthesis of digital devices of automation and control systems

Directory of Open Access Journals (Sweden)

Nikolay Chernov

2018-01-01

Full Text Available The article considers linear algebra as an alternative mathematical tool of logic synthesis of digital structures to Boolean algebra and synthesis methods of digital electronic component base (ECB on its ground. The methods of solving the applied problems of logic synthesis are shown, including the expansion of an arbitrary logic function by means of monotonic functions. The proposed mathematical apparatus actually provides the creation of digital structures on the principles of analog circuitry. It can find application in the design of multivalued digital ECB, specialized system-on-chip and analog-digital sensors with current output. The examples of synthesis of the combinational and sequential two-valued and multivalued digital devices are given. In conclusion, the advantages of linear algebra in comparison with Boolean algebra are formulated.

on the use of ashenhurst decomposition chart as an alternative to ...

African Journals Online (AJOL)

Dr Obe

1997-09-01

Sep 1, 1997 ... ABSTRACT. The non-uniqueness of a multiplexer implementation of a Boolean function results from the partition of the function variables into data select and data input variables. This partition affects critically the cost and structure of the final multiplexer realisation. Hence the central problem in the ...

Conference on Commutative rings, integer-valued polynomials and polynomial functions

CERN Document Server

Frisch, Sophie; Glaz, Sarah; Commutative Algebra : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions

2014-01-01

This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: ·    Homological dimensions of Prüfer-like rings ·    Quasi complete rings ·    Total graphs of rings ·    Properties of prime ideals over various rings ·    Bases for integer-valued polynomials ·    Boolean subrings ·    The portable property of domains ·    Probabilistic topics in Intn(D) ·    Closure operations in Zariski-Riemann spaces of valuation domains ·    Stability of do...

Development of a computerized procedure system on the basis of formalized action and check

International Nuclear Information System (INIS)

Jung, Y. S.; Shin, Y. C.; Jung, K. H.; Sung, C. H.

1999-01-01

A computerized procedure system was developed on the basis of formalized action and check. The actions and checks are rendered into two dimensional flowchart with foldable, dynamic, and interactive functions. The action and check are evaluated by computer automatically, and can be overridden by operator if necessary. Detail of each action and check is described in the logic tree with several boolean instruction set and n out m of mathematical operator. Computer supports operators to execute the boolean instruction providing relevant process parameters and control devices. In spite of all these computer support, its inner logic is simple and transparent to operators to keep them in the control loop. The boolean instruction can have 3 states. And n out m operator is defined on the 3 states. The definition minimizes not only number of context switching in procedure execution, but also enables evaluation of the action and check. The process parameters are presented in both text label and graphical symbol to improve readability. Moreover, new mechanism to access any part of a procedure is devised while keeping the main stream of procedure execution

A new paradigm in the design of energy-efficient digital circuits using laterally-actuated double-gate NEMS

KAUST Repository

Dadgour, Hamed F.; Hussain, Muhammad Mustafa; Banerjee, Kaustav

2010-01-01

. While this in itself is a major improvement, its implications for minimizing Boolean functions using Karnaugh maps (K-maps) are even more significant. In the standard K-map technique, which is used in digital circuit design, adjacent "1s" (minterms

Algoritm bulevskogo faktornogo analiza, osnovannyj na kombinirovanii nejrosetevogo podchoda i metoda maksimizacii funkcii pravdopodobija

Czech Academy of Sciences Publication Activity Database

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

-, č. 3 (2014), s. 3-11 ISSN 1999-8554 Institutional support: RVO:67985807 Keywords : boolean factor analysis * attractor neural network * likelihood function maximization * KEGG database Subject RIV: IN - Informatics, Computer Science http://www.radiotec.ru/ cat alog.php? cat =jr7&art=14354

Larger bases and mixed analog/digital neural nets

Energy Technology Data Exchange (ETDEWEB)

Beiu, V.

1998-12-31

The paper overviews results dealing with the approximation capabilities of neural networks, and bounds on the size of threshold gate circuits. Based on an explicit numerical algorithm for Kolmogorov`s superpositions the authors show that minimum size neural networks--for implementing any Boolean function--have the identity function as the activation function. Conclusions and several comments on the required precision are ending the paper.

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

Science.gov (United States)

Chen, Fangyue; Chen, Guanrong Ron; He, Guolong; Xu, Xiubin; He, Qinbin

2009-10-01

Universal perceptron (UP), a generalization of Rosenblatt's perceptron, is considered in this paper, which is capable of implementing all Boolean functions (BFs). In the classification of BFs, there are: 1) linearly separable Boolean function (LSBF) class, 2) parity Boolean function (PBF) class, and 3) non-LSBF and non-PBF class. To implement these functions, UP takes different kinds of simple topological structures in which each contains at most one hidden layer along with the smallest possible number of hidden neurons. Inspired by the concept of DNA sequences in biological systems, a novel learning algorithm named DNA-like learning is developed, which is able to quickly train a network with any prescribed BF. The focus is on performing LSBF and PBF by a single-layer perceptron (SLP) with the new algorithm. Two criteria for LSBF and PBF are proposed, respectively, and a new measure for a BF, named nonlinearly separable degree (NLSD), is introduced. In the sense of this measure, the PBF is the most complex one. The new algorithm has many advantages including, in particular, fast running speed, good robustness, and no need of considering the convergence property. For example, the number of iterations and computations in implementing the basic 2-bit logic operations such as AND, OR, and XOR by using the new algorithm is far smaller than the ones needed by using other existing algorithms such as error-correction (EC) and backpropagation (BP) algorithms. Moreover, the synaptic weights and threshold values derived from UP can be directly used in designing of the template of cellular neural networks (CNNs), which has been considered as a new spatial-temporal sensory computing paradigm.

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.

r-Universal reversible logic gates

International Nuclear Information System (INIS)

Vos, A de; Storme, L

2004-01-01

Reversible logic plays a fundamental role both in ultra-low power electronics and in quantum computing. It is therefore important to know which reversible logic gates can be used as building block for the reversible implementation of an arbitrary boolean function and which cannot

A Top-down Approach to Genetic Circuit Synthesis and Optimized Technology Mapping

DEFF Research Database (Denmark)

Baig, Hasan; Madsen, Jan

2017-01-01

Genetic logic circuits are becoming popular as an emerging field of technology. They are composed of genetic parts of DNA and work inside a living cell to perform a dedicated boolean function triggered by the presence or absence of certain proteins or other species....

Object recognition and concept learning with Confucius

Energy Technology Data Exchange (ETDEWEB)

Cohen, B; Sammut, C

1982-01-01

A learning program produces, as its output, a Boolean function which describes a concept. The function returns true if and only if the argument is an object which satisfies the logical expression in the body of the function. The learning program's input is a set of objects which are instances of the concept to be learnt. The paper describes an algorithm devised to learn concept descriptions in this form. 15 references.

Long multiplication by instruction sequences with backward jump instructions

NARCIS (Netherlands)

Bergstra, J.A.; Middelburg, C.A.

2013-01-01

For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. Backward jump instructions

Diseño y simulación de un controlador difuso de temperatura empleando el concresor basado en relaciones booleanas

Directory of Open Access Journals (Sweden)

José Jairo Soriano Méndez

2012-06-01

Full Text Available This paper proposes the analysis and design of a Temperature Fuzzy controller using concresor based on Boolean relations (CBR. Firstly, presents the design of a Boolean controller. Later, fuzzy controller is designed based on Boolean controller raised previously. The control surfaces with and without simplification, show the features of proposes methodology. Additionally we analyze the effects of the simplifications made in the control rules.

Subject Retrieval from Full-Text Databases in the Humanities

Science.gov (United States)

East, John W.

2007-01-01

This paper examines the problems involved in subject retrieval from full-text databases of secondary materials in the humanities. Ten such databases were studied and their search functionality evaluated, focusing on factors such as Boolean operators, document surrogates, limiting by subject area, proximity operators, phrase searching, wildcards,…

On the complexity of computing two nonlinearity measures

DEFF Research Database (Denmark)

Find, Magnus Gausdal

2014-01-01

We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time 2O(n) given the truth table of length 2n, in fact under the same ...

Robust RBF Finite Automata

Czech Academy of Sciences Publication Activity Database

Šorel, Michal; Šíma, Jiří

2004-01-01

Roč. 62, - (2004), s. 93-110 ISSN 0925-2312 R&D Projects: GA AV ČR IAB2030007; GA MŠk LN00A056 Keywords : radial basis function * neural network * finite automaton * Boolean circuit * computational power Subject RIV: BA - General Mathematics Impact factor: 0.641, year: 2004

On the Equational Definition of the Least Prefixed Point

DEFF Research Database (Denmark)

Santocanale, Luigi

2003-01-01

We propose a method to axiomatize by equations the least prefixed point of an order preserving function. We discuss its domain of application and show that the Boolean modal μ-calculus has a complete equational axiomatization. The method relies on the existence of a “closed structure” and its rel...

Duration Calculus: Logical Foundations

DEFF Research Database (Denmark)

Hansen, Michael Reichhardt; Chaochen, Zhou

1997-01-01

The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...

Information Resources Usage in Project Management Digital Learning System

Science.gov (United States)

Davidovitch, Nitza; Belichenko, Margarita; Kravchenko, Yurii

2017-01-01

The article combines a theoretical approach to structuring knowledge that is based on the integrated use of fuzzy semantic network theory predicates, Boolean functions, theory of complexity of network structures and some practical aspects to be considered in the distance learning at the university. The paper proposes a methodological approach that…

Lattices with unique complements

CERN Document Server

Saliĭ, V N

1988-01-01

The class of uniquely complemented lattices properly contains all Boolean lattices. However, no explicit example of a non-Boolean lattice of this class has been found. In addition, the question of whether this class contains any complete non-Boolean lattices remains unanswered. This book focuses on these classical problems of lattice theory and the various attempts to solve them. Requiring no specialized knowledge, the book is directed at researchers and students interested in general algebra and mathematical logic.

Timing robustness in the budding and fission yeast cell cycles.

KAUST Repository

Mangla, Karan

2010-02-01

Robustness of biological models has emerged as an important principle in systems biology. Many past analyses of Boolean models update all pending changes in signals simultaneously (i.e., synchronously), making it impossible to consider robustness to variations in timing that result from noise and different environmental conditions. We checked previously published mathematical models of the cell cycles of budding and fission yeast for robustness to timing variations by constructing Boolean models and analyzing them using model-checking software for the property of speed independence. Surprisingly, the models are nearly, but not totally, speed-independent. In some cases, examination of timing problems discovered in the analysis exposes apparent inaccuracies in the model. Biologically justified revisions to the model eliminate the timing problems. Furthermore, in silico random mutations in the regulatory interactions of a speed-independent Boolean model are shown to be unlikely to preserve speed independence, even in models that are otherwise functional, providing evidence for selection pressure to maintain timing robustness. Multiple cell cycle models exhibit strong robustness to timing variation, apparently due to evolutionary pressure. Thus, timing robustness can be a basis for generating testable hypotheses and can focus attention on aspects of a model that may need refinement.

TEMAC, Top Event Sensitivity Analysis

International Nuclear Information System (INIS)

Iman, R.L.; Shortencarier, M.J.

1988-01-01

1 - Description of program or function: TEMAC is designed to permit the user to easily estimate risk and to perform sensitivity and uncertainty analyses with a Boolean expression such as produced by the SETS computer program. SETS produces a mathematical representation of a fault tree used to model system unavailability. In the terminology of the TEMAC program, such a mathematical representation is referred to as a top event. The analysis of risk involves the estimation of the magnitude of risk, the sensitivity of risk estimates to base event probabilities and initiating event frequencies, and the quantification of the uncertainty in the risk estimates. 2 - Method of solution: Sensitivity and uncertainty analyses associated with top events involve mathematical operations on the corresponding Boolean expression for the top event, as well as repeated evaluations of the top event in a Monte Carlo fashion. TEMAC employs a general matrix approach which provides a convenient general form for Boolean expressions, is computationally efficient, and allows large problems to be analyzed. 3 - Restrictions on the complexity of the problem - Maxima of: 4000 cut sets, 500 events, 500 values in a Monte Carlo sample, 16 characters in an event name. These restrictions are implemented through the FORTRAN 77 PARAMATER statement

Multi-valued and Fuzzy Logic Realization using TaOx Memristive Devices.

Science.gov (United States)

Bhattacharjee, Debjyoti; Kim, Wonjoo; Chattopadhyay, Anupam; Waser, Rainer; Rana, Vikas

2018-01-08

Among emerging non-volatile storage technologies, redox-based resistive switching Random Access Memory (ReRAM) is a prominent one. The realization of Boolean logic functionalities using ReRAM adds an extra edge to this technology. Recently, 7-state ReRAM devices were used to realize ternary arithmetic circuits, which opens up the computing space beyond traditional binary values. In this manuscript, we report realization of multi-valued and fuzzy logic operators with a representative application using ReRAM devices. Multi-valued logic (MVL), such as Łukasiewicz logic generalizes Boolean logic by allowing more than two truth values. MVL also permits operations on fuzzy sets, where, in contrast to standard crisp logic, an element is permitted to have a degree of membership to a given set. Fuzzy operations generally model human reasoning better than Boolean logic operations, which is predominant in current computing technologies. When the available information for the modelling of a system is imprecise and incomplete, fuzzy logic provides an excellent framework for the system design. Practical applications of fuzzy logic include, industrial control systems, robotics, and in general, design of expert systems through knowledge-based reasoning. Our experimental results show, for the first time, that it is possible to model fuzzy logic natively using multi-state memristive devices.

An expert system design to diagnose cancer by using a new method reduced rule base.

Science.gov (United States)

Başçiftçi, Fatih; Avuçlu, Emre

2018-04-01

A Medical Expert System (MES) was developed which uses Reduced Rule Base to diagnose cancer risk according to the symptoms in an individual. A total of 13 symptoms were used. With the new MES, the reduced rules are controlled instead of all possibilities (2 13 = 8192 different possibilities occur). By controlling reduced rules, results are found more quickly. The method of two-level simplification of Boolean functions was used to obtain Reduced Rule Base. Thanks to the developed application with the number of dynamic inputs and outputs on different platforms, anyone can easily test their own cancer easily. More accurate results were obtained considering all the possibilities related to cancer. Thirteen different risk factors were determined to determine the type of cancer. The truth table produced in our study has 13 inputs and 4 outputs. The Boolean Function Minimization method is used to obtain less situations by simplifying logical functions. Diagnosis of cancer quickly thanks to control of the simplified 4 output functions. Diagnosis made with the 4 output values obtained using Reduced Rule Base was found to be quicker than diagnosis made by screening all 2 13 = 8192 possibilities. With the improved MES, more probabilities were added to the process and more accurate diagnostic results were obtained. As a result of the simplification process in breast and renal cancer diagnosis 100% diagnosis speed gain, in cervical cancer and lung cancer diagnosis rate gain of 99% was obtained. With Boolean function minimization, less number of rules is evaluated instead of evaluating a large number of rules. Reducing the number of rules allows the designed system to work more efficiently and to save time, and facilitates to transfer the rules to the designed Expert systems. Interfaces were developed in different software platforms to enable users to test the accuracy of the application. Any one is able to diagnose the cancer itself using determinative risk factors. Thereby

Specifying the Behaviour of Python Programs: Language and Basic Examples

Directory of Open Access Journals (Sweden)

2010-04-01

Full Text Available This manuscript describe BeSSY, a function-centric language for formal behavioural specification that requires no more than high-school mathematics on arithmetic, functions, Boolean algebra and sets theory. An object can be modelled as a union of data sets and functions whereas inherited object can be modelled as a union of supersets and a set of object-specific functions. Python list and dictionary operations will be specified in BeSSY for illustration.

3D GIS spatial operation based on extended Euler operators

Science.gov (United States)

Xu, Hongbo; Lu, Guonian; Sheng, Yehua; Zhou, Liangchen; Guo, Fei; Shang, Zuoyan; Wang, Jing

2008-10-01

The implementation of 3 dimensions spatial operations, based on certain data structure, has a lack of universality and is not able to treat with non-manifold cases, at present. ISO/DIS 19107 standard just presents the definition of Boolean operators and set operators for topological relationship query, and OGC GeoXACML gives formal definitions for several set functions without implementation detail. Aiming at these problems, based mathematical foundation on cell complex theory, supported by non-manifold data structure and using relevant research in the field of non-manifold geometry modeling for reference, firstly, this paper according to non-manifold Euler-Poincaré formula constructs 6 extended Euler operators and inverse operators to carry out creating, updating and deleting 3D spatial elements, as well as several pairs of supplementary Euler operators to convenient for implementing advanced functions. Secondly, we change topological element operation sequence of Boolean operation and set operation as well as set functions defined in GeoXACML into combination of extended Euler operators, which separates the upper functions and lower data structure. Lastly, we develop underground 3D GIS prototype system, in which practicability and credibility of extended Euler operators faced to 3D GIS presented by this paper are validated.

Relationships between average depth and number of misclassifications for decision trees

KAUST Repository

Chikalov, Igor

2014-02-14

This paper presents a new tool for the study of relationships between the total path length or the average depth and the number of misclassifications for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [9] and datasets representing Boolean functions with 10 variables.

Relationships between average depth and number of misclassifications for decision trees

KAUST Repository

Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2014-01-01

This paper presents a new tool for the study of relationships between the total path length or the average depth and the number of misclassifications for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [9] and datasets representing Boolean functions with 10 variables.

A Deterministic Approach to the Synchronization of Cellular Automata

OpenAIRE

Garcia, J.; Garcia, P.

2011-01-01

In this work we introduce a deterministic scheme of synchronization of linear and nonlinear cellular automata (CA) with complex behavior, connected through a master-slave coupling. By using a definition of Boolean derivative, we use the linear approximation of the automata to determine a function of coupling that promotes synchronization without perturbing all the sites of the slave system.

Proceedings of the Annual Ada Software Engineering Education and Training Symposium (4th) Held in Houston, Texas on June 13-15, 1989

Science.gov (United States)

1989-06-01

Canfields, SevenUp, CocaCola , none); type Ounces is range 0 .. 20; type PriceType is digits 2 range 0.0 .. 0.75; type ContainerType is (bottle, can...brand of the soda (Shasta, CocaCola , etc.) function IsDiet(TheSoda : Soda) return boolean; -- return TRUE if the soda is a diet soda, FALSE otherwise

Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer

Science.gov (United States)

2012-03-01

INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE...BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR...additional amount of logic and delay is negligible for a four-input transeunt triangle, the increases become overwhelming for significantly larger

Classical databases and knowledge organization

DEFF Research Database (Denmark)

Hjørland, Birger

2015-01-01

This paper considers classical bibliographic databases based on the Boolean retrieval model (such as MEDLINE and PsycInfo). This model is challenged by modern search engines and information retrieval (IR) researchers, who often consider Boolean retrieval a less efficient approach. The paper...

Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking

DEFF Research Database (Denmark)

Williams, Poul Frederick; Biere, Armin; Clarke, Edmund M.

2000-01-01

In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Diagrams (BDDs), the traditionally used canonical representation. The method is based on standard fixed point algorithm...

A programmable artificial retina

International Nuclear Information System (INIS)

Bernard, T.M.; Zavidovique, B.Y.; Devos, F.J.

1993-01-01

An artificial retina is a device that intimately associates an imager with processing facilities on a monolithic circuit. Yet, except for simple environments and applications, analog hardware will not suffice to process and compact the raw image flow from the photosensitive array. To solve this output problem, an on-chip array of bare Boolean processors with halftoning facilities might be used, providing versatility from programmability. By setting the pixel memory size to 3 b, the authors have demonstrated both the technological practicality and the computational efficiency of this programmable Boolean retina concept. Using semi-static shifting structures together with some interaction circuitry, a minimal retina Boolean processor can be built with less than 30 transistors and controlled by as few as 6 global clock signals. The successful design, integration, and test of such a 65x76 Boolean retina on a 50-mm 2 CMOS 2-μm circuit are presented

PACC information management code for common cause failures analysis

International Nuclear Information System (INIS)

Ortega Prieto, P.; Garcia Gay, J.; Mira McWilliams, J.

1987-01-01

The purpose of this paper is to present the PACC code, which, through an adequate data management, makes the task of computerized common-mode failure analysis easier. PACC processes and generates information in order to carry out the corresponding qualitative analysis, by means of the boolean technique of transformation of variables, and the quantitative analysis either using one of several parametric methods or a direct data-base. As far as the qualitative analysis is concerned, the code creates several functional forms for the transformation equations according to the user's choice. These equations are subsequently processed by boolean manipulation codes, such as SETS. The quantitative calculations of the code can be carried out in two different ways: either starting from a common cause data-base, or through parametric methods, such as the Binomial Failure Rate Method, the Basic Parameters Method or the Multiple Greek Letter Method, among others. (orig.)

Diagnosis of constant faults in iteration-free circuits over monotone basis

KAUST Repository

Alrawaf, Saad Abdullah; Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2014-01-01

We show that for each iteration-free combinatorial circuit S over a basis B containing only monotone Boolean functions with at most five variables, there exists a decision tree for diagnosis of constant faults on inputs of gates with depth at most 7L(S) where L(S) is the number of gates in S. © 2013 Elsevier B.V. All rights reserved.

Diagnosis of constant faults in iteration-free circuits over monotone basis

KAUST Repository

Alrawaf, Saad Abdullah

2014-03-01

We show that for each iteration-free combinatorial circuit S over a basis B containing only monotone Boolean functions with at most five variables, there exists a decision tree for diagnosis of constant faults on inputs of gates with depth at most 7L(S) where L(S) is the number of gates in S. © 2013 Elsevier B.V. All rights reserved.

Exploring Shared SRAM Tables in FPGAs for Larger LUTs and Higher Degree of Sharing

Directory of Open Access Journals (Sweden)

Ali Asghar

2017-01-01

Full Text Available In modern SRAM based Field Programmable Gate Arrays, a Look-Up Table (LUT is the principal constituent logic element which can realize every possible Boolean function. However, this flexibility of LUTs comes with a heavy area penalty. A part of this area overhead comes from the increased amount of configuration memory which rises exponentially as the LUT size increases. In this paper, we first present a detailed analysis of a previously proposed FPGA architecture which allows sharing of LUTs memory (SRAM tables among NPN-equivalent functions, to reduce the area as well as the number of configuration bits. We then propose several methods to improve the existing architecture. A new clustering technique has been proposed which packs NPN-equivalent functions together inside a Configurable Logic Block (CLB. We also make use of a recently proposed high performance Boolean matching algorithm to perform NPN classification. To enhance area savings further, we evaluate the feasibility of more than two LUTs sharing the same SRAM table. Consequently, this work explores the SRAM table sharing approach for a range of LUT sizes (4–7, while varying the cluster sizes (4–16. Experimental results on MCNC benchmark circuits set show an overall area reduction of ~7% while maintaining the same critical path delay.

Minimal cut-set methodology for artificial intelligence applications

International Nuclear Information System (INIS)

Weisbin, C.R.; de Saussure, G.; Barhen, J.; Oblow, E.M.; White, J.C.

1984-01-01

This paper reviews minimal cut-set theory and illustrates its application with an example. The minimal cut-set approach uses disjunctive normal form in Boolean algebra and various Boolean operators to simplify very complicated tree structures composed of AND/OR gates. The simplification process is automated and performed off-line using existing computer codes to implement the Boolean reduction on the finite, but large tree structure. With this approach, on-line expert diagnostic systems whose response time is critical, could determine directly whether a goal is achievable by comparing the actual system state to a concisely stored set of preprocessed critical state elements

SETS reference manual

International Nuclear Information System (INIS)

Worrell, R.B.

1985-05-01

The Set Equation Transformation System (SETS) is used to achieve the symbolic manipulation of Boolean equations. Symbolic manipulation involves changing equations from their original forms into more useful forms - particularly by applying Boolean identities. The SETS program is an interpreter which reads, interprets, and executes SETS user programs. The user writes a SETS user program specifying the processing to be achieved and submits it, along with the required data, for execution by SETS. Because of the general nature of SETS, i.e., the capability to manipulate Boolean equations regardless of their origin, the program has been used for many different kinds of analysis

A method to identify important dynamical states in Boolean models of regulatory networks: application to regulation of stomata closure by ABA in A. thaliana.

Science.gov (United States)

Bugs, Cristhian A; Librelotto, Giovani R; Mombach, José C M

2011-12-22

We introduce a method to analyze the states of regulatory Boolean models that identifies important network states and their biological influence on the global network dynamics. It consists in (1) finding the states of the network that are most frequently visited and (2) the identification of variable and frozen nodes of the network. The method, along with a simulation that includes random features, is applied to the study of stomata closure by abscisic acid (ABA) in A. thaliana proposed by Albert and coworkers. We find that for the case of study, that the dynamics of wild and mutant networks have just two states that are highly visited in their space of states and about a third of all nodes of the wild network are variable while the rest remain frozen in True or False states. This high number of frozen elements explains the low cardinality of the space of states of the wild network. Similar results are observed in the mutant networks. The application of the method allowed us to explain how wild and mutants behave dynamically in the SS and determined an essential feature of the activation of the closure node (representing stomata closure), i.e. its synchronization with the AnionEm node (representing anion efflux at the plasma membrane). The dynamics of this synchronization explains the efficiency reached by the wild and each of the mutant networks. For the biological problem analyzed, our method allows determining how wild and mutant networks differ 'phenotypically'. It shows that the different efficiencies of stomata closure reached among the simulated wild and mutant networks follow from a dynamical behavior of two nodes that are always synchronized. Additionally, we predict that the involvement of the anion efflux at the plasma membrane is crucial for the plant response to ABA. The algorithm used in the simulations is available upon request.

Cryptography in constant parallel time

CERN Document Server

Applebaum, Benny

2013-01-01

Locally computable (NC0) functions are 'simple' functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth.This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as one-way func

Bypassing BDD Construction for Reliability Analysis

DEFF Research Database (Denmark)

Williams, Poul Frederick; Nikolskaia, Macha; Rauzy, Antoine

2000-01-01

In this note, we propose a Boolean Expression Diagram (BED)-based algorithm to compute the minimal p-cuts of boolean reliability models such as fault trees. BEDs make it possible to bypass the Binary Decision Diagram (BDD) construction, which is the main cost of fault tree assessment....

The Compositional Rule of Inference and Zadeh’s Extension Principle for Non-normal Fuzzy Sets

NARCIS (Netherlands)

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

2007-01-01

Defining the standard Boolean operations on fuzzy Booleans with the compositional rule of inference (CRI) or Zadeh's extension principle gives counter-intuitive results. We introduce and motivate a slight adaptation of the CRI, which only effects the results for non-normal fuzzy sets. It is shown

Upgrading Probability via Fractions of Events

Directory of Open Access Journals (Sweden)

Frič Roman

2016-08-01

Full Text Available The influence of “Grundbegriffe” by A. N. Kolmogorov (published in 1933 on education in the area of probability and its impact on research in stochastics cannot be overestimated. We would like to point out three aspects of the classical probability theory “calling for” an upgrade: (i classical random events are black-and-white (Boolean; (ii classical random variables do not model quantum phenomena; (iii basic maps (probability measures and observables { dual maps to random variables have very different “mathematical nature”. Accordingly, we propose an upgraded probability theory based on Łukasiewicz operations (multivalued logic on events, elementary category theory, and covering the classical probability theory as a special case. The upgrade can be compared to replacing calculations with integers by calculations with rational (and real numbers. Namely, to avoid the three objections, we embed the classical (Boolean random events (represented by the f0; 1g-valued indicator functions of sets into upgraded random events (represented by measurable {0; 1}-valued functions, the minimal domain of probability containing “fractions” of classical random events, and we upgrade the notions of probability measure and random variable.

A Note on 5-bit Quadratic Permutations’ Classification

OpenAIRE

Božilov, Dušan; Bilgin, Begül; Sahin, Hacı Ali

2017-01-01

Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees of their inverses, together with multiplicative complexity and existence of uniform threshold reali...

Failure diagnosis and fault tree analysis

International Nuclear Information System (INIS)

Weber, G.

1982-07-01

In this report a methodology of failure diagnosis for complex systems is presented. Systems which can be represented by fault trees are considered. This methodology is based on switching algebra, failure diagnosis of digital circuits and fault tree analysis. Relations between these disciplines are shown. These relations are due to Boolean algebra and Boolean functions used throughout. It will be shown on this basis that techniques of failure diagnosis and fault tree analysis are useful to solve the following problems: 1. describe an efficient search of all failed components if the system is failed. 2. Describe an efficient search of all states which are close to a system failure if the system is still operating. The first technique will improve the availability, the second the reliability and safety. For these problems, the relation to methods of failure diagnosis for combinational circuits is required. Moreover, the techniques are demonstrated for a number of systems which can be represented by fault trees. (orig./RW) [de

Proposal for an All-Spin Artificial Neural Network: Emulating Neural and Synaptic Functionalities Through Domain Wall Motion in Ferromagnets.

Science.gov (United States)

Sengupta, Abhronil; Shim, Yong; Roy, Kaushik

2016-12-01

Non-Boolean computing based on emerging post-CMOS technologies can potentially pave the way for low-power neural computing platforms. However, existing work on such emerging neuromorphic architectures have either focused on solely mimicking the neuron, or the synapse functionality. While memristive devices have been proposed to emulate biological synapses, spintronic devices have proved to be efficient at performing the thresholding operation of the neuron at ultra-low currents. In this work, we propose an All-Spin Artificial Neural Network where a single spintronic device acts as the basic building block of the system. The device offers a direct mapping to synapse and neuron functionalities in the brain while inter-layer network communication is accomplished via CMOS transistors. To the best of our knowledge, this is the first demonstration of a neural architecture where a single nanoelectronic device is able to mimic both neurons and synapses. The ultra-low voltage operation of low resistance magneto-metallic neurons enables the low-voltage operation of the array of spintronic synapses, thereby leading to ultra-low power neural architectures. Device-level simulations, calibrated to experimental results, was used to drive the circuit and system level simulations of the neural network for a standard pattern recognition problem. Simulation studies indicate energy savings by  ∼  100× in comparison to a corresponding digital/analog CMOS neuron implementation.

Solving a discrete model of the lac operon using Z3

Science.gov (United States)

Gutierrez, Natalia A.

2014-05-01

A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

Preliminary investigation of interconnected systems interactions for the safety injection system of Indian Point-3

International Nuclear Information System (INIS)

Alesso, H.P.; Lappa, D.A.; Smith, C.F.; Sacks, I.J.

1983-01-01

The rich diversity of ideas and techniques for analyzing interconnected systems interaction has presented the NRC with the problem of identifying methods appropriate for their own review and audit. This report presents the findings of a preliminary study using the Digraph Matrix Analysis method to evaluate interconnected systems interactions for the safety injection system of Indian Point-3. The analysis effort in this study was subjected to NRC constraints regarding the use of Boolean logic, the construction of simplified plant representations or maps, and the development of heuristic measures as specified by the NRC. The map and heuristic measures were found to be an unsuccessful approach. However, from the effort to model and analyze the Indian Point-3 safety injection system, including Boolean logic in the model, singleton and doubleton cut-sets were identified. It is recommended that efforts excluding Boolean logic and utilizing the NRC heuristic measures not be pursed further and that the Digraph Matrix approach (or other comparable risk assessment technique) with Boolean logic included to conduct the audit of the Indian Point-3 systems interaction study

An exact method for solving logical loops in reliability analysis

International Nuclear Information System (INIS)

Matsuoka, Takeshi

2009-01-01

This paper presents an exact method for solving logical loops in reliability analysis. The systems that include logical loops are usually described by simultaneous Boolean equations. First, present a basic rule of solving simultaneous Boolean equations. Next, show the analysis procedures for three-component system with external supports. Third, more detailed discussions are given for the establishment of logical loop relation. Finally, take up two typical structures which include more than one logical loop. Their analysis results and corresponding GO-FLOW charts are given. The proposed analytical method is applicable to loop structures that can be described by simultaneous Boolean equations, and it is very useful in evaluating the reliability of complex engineering systems.

Boolean Reasoning and Informed Search in the Minimization of Logic Circuits

Science.gov (United States)

1992-03-01

between a symbolic representation of a PLA using Os and is and the physical layout of the function. 2. Computer-aided design (CAD) tools have made it easy...Svoboda, Antonin and Donnamaie White. Advanced Logical Circuit Design Tech- niques. New York: Garland STPM Press, 1979. [Tison 67] Tison, Pierre

Rice DB: an Oryza Information Portal linking annotation, subcellular location, function, expression, regulation, and evolutionary information for rice and Arabidopsis.

Science.gov (United States)

Narsai, Reena; Devenish, James; Castleden, Ian; Narsai, Kabir; Xu, Lin; Shou, Huixia; Whelan, James

2013-12-01

Omics research in Oryza sativa (rice) relies on the use of multiple databases to obtain different types of information to define gene function. We present Rice DB, an Oryza information portal that is a functional genomics database, linking gene loci to comprehensive annotations, expression data and the subcellular location of encoded proteins. Rice DB has been designed to integrate the direct comparison of rice with Arabidopsis (Arabidopsis thaliana), based on orthology or 'expressology', thus using and combining available information from two pre-eminent plant models. To establish Rice DB, gene identifiers (more than 40 types) and annotations from a variety of sources were compiled, functional information based on large-scale and individual studies was manually collated, hundreds of microarrays were analysed to generate expression annotations, and the occurrences of potential functional regulatory motifs in promoter regions were calculated. A range of computational subcellular localization predictions were also run for all putative proteins encoded in the rice genome, and experimentally confirmed protein localizations have been collated, curated and linked to functional studies in rice. A single search box allows anything from gene identifiers (for rice and/or Arabidopsis), motif sequences, subcellular location, to keyword searches to be entered, with the capability of Boolean searches (such as AND/OR). To demonstrate the utility of Rice DB, several examples are presented including a rice mitochondrial proteome, which draws on a variety of sources for subcellular location data within Rice DB. Comparisons of subcellular location, functional annotations, as well as transcript expression in parallel with Arabidopsis reveals examples of conservation between rice and Arabidopsis, using Rice DB (http://ricedb.plantenergy.uwa.edu.au). © 2013 The Authors The Plant Journal © 2013 John Wiley & Sons Ltd.

Computer security simulation

International Nuclear Information System (INIS)

Schelonka, E.P.

1979-01-01

Development and application of a series of simulation codes used for computer security analysis and design are described. Boolean relationships for arrays of barriers within functional modules are used to generate composite effectiveness indices. The general case of multiple layers of protection with any specified barrier survival criteria is given. Generalized reduction algorithms provide numerical security indices in selected subcategories and for the system as a whole. 9 figures, 11 tables

Fast Bitwise Implementation of the Algebraic Normal Form Transform

OpenAIRE

Bakoev, Valentin

2017-01-01

The representation of Boolean functions by their algebraic normal forms (ANFs) is very important for cryptography, coding theory and other scientific areas. The ANFs are used in computing the algebraic degree of S-boxes, some other cryptographic criteria and parameters of errorcorrecting codes. Their applications require these criteria and parameters to be computed by fast algorithms. Hence the corresponding ANFs should also be obtained by fast algorithms. Here we continue o...

A short course in discrete mathematics

CERN Document Server

Bender, Edward A

2004-01-01

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, seq

Asynchronous Operators of Sequential Logic Venjunction & Sequention

CERN Document Server

Vasyukevich, Vadim

2011-01-01

This book is dedicated to new mathematical instruments assigned for logical modeling of the memory of digital devices. The case in point is logic-dynamical operation named venjunction and venjunctive function as well as sequention and sequentional function. Venjunction and sequention operate within the framework of sequential logic. In a form of the corresponding equations, they organically fit analytical expressions of Boolean algebra. Thus, a sort of symbiosis is formed using elements of asynchronous sequential logic on the one hand and combinational logic on the other hand. So, asynchronous

Stochastic Pseudo-Boolean Optimization

Science.gov (United States)

2011-07-31

16 polyominoes. Given this notation, we provide the following nonlinear mixed integer programming (MIP) formulation of the exact tiling problem: PNL ...ri, cj ≥ 0 ∀ i, j, p, q, k. 8.3.3 Linear Set Partitioning Formulation We use value disjunctions to reformulate PNL as a linear MIP that can be

Factors associated with sustained remission in patients with rheumatoid arthritis.

Science.gov (United States)

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

2015-01-01

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

Discrete computational structures

CERN Document Server

Korfhage, Robert R

1974-01-01

Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize

General method to find the attractors of discrete dynamic models of biological systems

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

General method to find the attractors of discrete dynamic models of biological systems.

Science.gov (United States)

Gan, Xiao; Albert, Réka

2018-04-01

Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.

Robustness and backbone motif of a cancer network regulated by miR-17-92 cluster during the G1/S transition.

Directory of Open Access Journals (Sweden)

Lijian Yang

Full Text Available Based on interactions among transcription factors, oncogenes, tumor suppressors and microRNAs, a Boolean model of cancer network regulated by miR-17-92 cluster is constructed, and the network is associated with the control of G1/S transition in the mammalian cell cycle. The robustness properties of this regulatory network are investigated by virtue of the Boolean network theory. It is found that, during G1/S transition in the cell cycle process, the regulatory networks are robustly constructed, and the robustness property is largely preserved with respect to small perturbations to the network. By using the unique process-based approach, the structure of this network is analyzed. It is shown that the network can be decomposed into a backbone motif which provides the main biological functions, and a remaining motif which makes the regulatory system more stable. The critical role of miR-17-92 in suppressing the G1/S cell cycle checkpoint and increasing the uncontrolled proliferation of the cancer cells by targeting a genetic network of interacting proteins is displayed with our model.

Counting and classifying attractors in high dimensional dynamical systems.

Science.gov (United States)

Bagley, R J; Glass, L

1996-12-07

Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.

Using of the Boolean Stochastic Generation method to target field investigations: the Mortisa landslide (eastern Italian Alps) case study

Science.gov (United States)

Bossi, Giulia; Marcato, Gianluca; Gottardi, Guido; Borgatti, Lisa

2016-04-01

When designing the geotechnical model of a landslide the information to define the soil profile within the slope is usually inferred from a small amount of data. This is particularly true for large landslides where the study area is vast and the variability of terrains is high. In this framework, a method allowing the best locations for further field investigation campaigns to be identified would be extremely useful. The Boolean Stochastic Generation method (BoSG), which randomly generates different soil distributions of two definite soil types in both 2D and 3D models, is a newly developed algorithm that can guide in this process. In this work the method has been applied to the Mortisa landslide case study, which is located in the Cortina d'Ampezzo valley (Veneto, Italy), part of the Dolomites UNESCO World Heritage list. The mudslide is 3.5 km long, stretching from 1750 to 1300 m a.s.l., and is located in a highly antrophized area where is damaging some buildings and a national road with its almost continuous movements. In fact, from year 2008, GNSS surveys recorded rates of displacements reaching 1.2 m/year in the most active parts of the landslide; the movements occur on a slip surfaces are located between 20 and 50 m below the surface. From the borecores some wooden samples were extracted allowing to reconstruct the sequence of events that led to the development of the present-day Mortisa slope. Interdigitated layers of gravel in a silty clay matrix originated from subsequent earth and debris flows events since the Lateglacial compose the landslide body, a condition that is particularly apt to be investigated with BoSG. A BoSG run for the Mortisa landslide was performed calculating 1200 soil configurations and using laboratory test parameters for the silty-clay matrix. The results were stacked in a tridimensional matrix in order to calculate the mean and the standard deviation (SD) of displacements for each element of the model mesh. In this way maps of the SD

A genetic programming approach for Burkholderia Pseudomallei diagnostic pattern discovery

Science.gov (United States)

Yang, Zheng Rong; Lertmemongkolchai, Ganjana; Tan, Gladys; Felgner, Philip L.; Titball, Richard

2009-01-01

Motivation: Finding diagnostic patterns for fighting diseases like Burkholderia pseudomallei using biomarkers involves two key issues. First, exhausting all subsets of testable biomarkers (antigens in this context) to find a best one is computationally infeasible. Therefore, a proper optimization approach like evolutionary computation should be investigated. Second, a properly selected function of the antigens as the diagnostic pattern which is commonly unknown is a key to the diagnostic accuracy and the diagnostic effectiveness in clinical use. Results: A conversion function is proposed to convert serum tests of antigens on patients to binary values based on which Boolean functions as the diagnostic patterns are developed. A genetic programming approach is designed for optimizing the diagnostic patterns in terms of their accuracy and effectiveness. During optimization, it is aimed to maximize the coverage (the rate of positive response to antigens) in the infected patients and minimize the coverage in the non-infected patients while maintaining the fewest number of testable antigens used in the Boolean functions as possible. The final coverage in the infected patients is 96.55% using 17 of 215 (7.4%) antigens with zero coverage in the non-infected patients. Among these 17 antigens, BPSL2697 is the most frequently selected one for the diagnosis of Burkholderia Pseudomallei. The approach has been evaluated using both the cross-validation and the Jack–knife simulation methods with the prediction accuracy as 93% and 92%, respectively. A novel approach is also proposed in this study to evaluate a model with binary data using ROC analysis. Contact: z.r.yang@ex.ac.uk PMID:19561021

A Comparative study of two methodologies for large binary datasets analysis.

Czech Academy of Sciences Publication Activity Database

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

2012-01-01

Roč. 22, č. 6 (2012), s. 565-582 ISSN 1210-0552 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070 Program:ED Institutional support: RVO:67985807 Keywords : dimension reduction * statistics * data mining * Boolean factor analysis * Boolean matrix factorization * information gain * likelihood-maximization * bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 0.362, year: 2012

Heuristics in Conflict Resolution

OpenAIRE

Drescher, Christian; Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten

2010-01-01

Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet receive...

Hadamard Transforms

CERN Document Server

Agaian, Sos; Egiazarian, Karen; Astola, Jaakko

2011-01-01

The Hadamard matrix and Hadamard transform are fundamental problem-solving tools in a wide spectrum of scientific disciplines and technologies, such as communication systems, signal and image processing (signal representation, coding, filtering, recognition, and watermarking), digital logic (Boolean function analysis and synthesis), and fault-tolerant system design. Hadamard Transforms intends to bring together different topics concerning current developments in Hadamard matrices, transforms, and their applications. Each chapter begins with the basics of the theory, progresses to more advanced

Effectiveness of Strengthening Exercises for the Elderly with Low Back Pain to Improve Symptoms and Functions: A Systematic Review

Directory of Open Access Journals (Sweden)

Nor Azizah Ishak

2016-01-01

Full Text Available Objective. To determine the effect of strengthening exercises for older people with low back pain (LBP. Methods. This study is a systematic review of experimental study which evaluated the evidence regarding exercises for older people with LBP by using EBSCO Academic Search Premier, EBSCO EconLit, Science Direct, PUBMED, and PEDro from 2006 to 2016. Search strategy for each database was conducted by using keywords such as “low back pain”, “older people”, and “strengthening exercise”. Boolean operators were used to combine keywords and manual exclusion was conducted to verify studies which met the inclusion criteria. The articles reviewed were evaluated and critically appraised by using PEDro scale and SPSS version 20 was used to analyze the data. Results. Three articles were found regarding strengthening exercise for older people with LBP whereas one study was conducted on multicomponent exercise. The mean, standard deviation, and variance of the PEDro score of all the studies were 5.67, 2.33, and 1.528, respectively. Overall, the qualities of all studies reviewed were fair. Two articles showed significant results when compared to control group (p<0.05. Conclusions. Strengthening exercise is a beneficial treatment for older people with LBP in reducing pain intensity, disability, and improved functional performances.

Computational capabilities of multilayer committee machines

Energy Technology Data Exchange (ETDEWEB)

Neirotti, J P [NCRG, Aston University, Birmingham (United Kingdom); Franco, L, E-mail: j.p.neirotti@aston.ac.u [Depto. de Lenguajes y Ciencias de la Computacion, Universidad de Malaga (Spain)

2010-11-05

We obtained an analytical expression for the computational complexity of many layered committee machines with a finite number of hidden layers (L < {infinity}) using the generalization complexity measure introduced by Franco et al (2006) IEEE Trans. Neural Netw. 17 578. Although our result is valid in the large-size limit and for an overlap synaptic matrix that is ultrametric, it provides a useful tool for inferring the appropriate architecture a network must have to reproduce an arbitrary realizable Boolean function.

Implicit Real Vector Automata

Directory of Open Access Journals (Sweden)

Jean-François Degbomont

2010-10-01

Full Text Available This paper addresses the symbolic representation of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop an original data structure for representing such sets, based on an implicit and concise encoding of a known structure, the Real Vector Automaton. The resulting formalism provides a canonical representation of polyhedra, is closed under Boolean operators, and admits an efficient decision procedure for testing the membership of a vector.

Logic-based aggregation methods for ranking student applicants

Directory of Open Access Journals (Sweden)

Milošević Pavle

2017-01-01

Full Text Available In this paper, we present logic-based aggregation models used for ranking student applicants and we compare them with a number of existing aggregation methods, each more complex than the previous one. The proposed models aim to include depen- dencies in the data using Logical aggregation (LA. LA is a aggregation method based on interpolative Boolean algebra (IBA, a consistent multi-valued realization of Boolean algebra. This technique is used for a Boolean consistent aggregation of attributes that are logically dependent. The comparison is performed in the case of student applicants for master programs at the University of Belgrade. We have shown that LA has some advantages over other presented aggregation methods. The software realization of all applied aggregation methods is also provided. This paper may be of interest not only for student ranking, but also for similar problems of ranking people e.g. employees, team members, etc.

Functional Circuitry on Commercial Fabric via Textile-Compatible Nanoscale Film Coating Process for Fibertronics.

Science.gov (United States)

Bae, Hagyoul; Jang, Byung Chul; Park, Hongkeun; Jung, Soo-Ho; Lee, Hye Moon; Park, Jun-Young; Jeon, Seung-Bae; Son, Gyeongho; Tcho, Il-Woong; Yu, Kyoungsik; Im, Sung Gap; Choi, Sung-Yool; Choi, Yang-Kyu

2017-10-11

Fabric-based electronic textiles (e-textiles) are the fundamental components of wearable electronic systems, which can provide convenient hand-free access to computer and electronics applications. However, e-textile technologies presently face significant technical challenges. These challenges include difficulties of fabrication due to the delicate nature of the materials, and limited operating time, a consequence of the conventional normally on computing architecture, with volatile power-hungry electronic components, and modest battery storage. Here, we report a novel poly(ethylene glycol dimethacrylate) (pEGDMA)-textile memristive nonvolatile logic-in-memory circuit, enabling normally off computing, that can overcome those challenges. To form the metal electrode and resistive switching layer, strands of cotton yarn were coated with aluminum (Al) using a solution dip coating method, and the pEGDMA was conformally applied using an initiated chemical vapor deposition process. The intersection of two Al/pEGDMA coated yarns becomes a unit memristor in the lattice structure. The pEGDMA-Textile Memristor (ETM), a form of crossbar array, was interwoven using a grid of Al/pEGDMA coated yarns and untreated yarns. The former were employed in the active memristor and the latter suppressed cell-to-cell disturbance. We experimentally demonstrated for the first time that the basic Boolean functions, including a half adder as well as NOT, NOR, OR, AND, and NAND logic gates, are successfully implemented with the ETM crossbar array on a fabric substrate. This research may represent a breakthrough development for practical wearable and smart fibertronics.

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

Directory of Open Access Journals (Sweden)

Shahaboddin Shamshirband

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

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

Science.gov (United States)

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

2016-01-01

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

A single nano cantilever as a reprogrammable universal logic gate

International Nuclear Information System (INIS)

Chappanda, K N; Ilyas, S; Kazmi, S N R; Younis, M I; Holguin-Lerma, J; Batra, N M; Costa, P M F J

2017-01-01

The current transistor-based computing circuits use multiple interconnected transistors to realize a single Boolean logic gate. This leads to higher power requirements and delayed computing. Transistors are not suitable for applications in harsh environments and require complicated thermal management systems due to excessive heat dissipation. Also, transistor circuits lack the ability to dynamically reconfigure their functionality in real time, which is desirable for enhanced computing capability. Further, the miniaturization of transistors to improve computational power is reaching its ultimate physical limits. As a step towards overcoming the limitations of transistor-based computing, here we demonstrate a reprogrammable universal Boolean logic gate based on a nanoelectromechanical cantilever (NC) oscillator. The fundamental XOR, AND, NOR, OR and NOT logic gates are condensed in a single NC, thereby reducing electrical interconnects between devices. The device is dynamically switchable between any logic gates at the same drive frequency without the need for any change in the circuit. It is demonstrated to operate at elevated temperatures minimizing the need for thermal management systems. It has a tunable bandwidth of 5 MHz enabling parallel and dynamically reconfigurable logic device for enhanced computing. (paper)

A single nano cantilever as a reprogrammable universal logic gate

KAUST Repository

Chappanda, K. N.

2017-02-24

The current transistor-based computing circuits use multiple interconnected transistors to realize a single Boolean logic gate. This leads to higher power requirements and delayed computing. Transistors are not suitable for applications in harsh environments and require complicated thermal management systems due to excessive heat dissipation. Also, transistor circuits lack the ability to dynamically reconfigure their functionality in real time, which is desirable for enhanced computing capability. Further, the miniaturization of transistors to improve computational power is reaching its ultimate physical limits. As a step towards overcoming the limitations of transistor-based computing, here we demonstrate a reprogrammable universal Boolean logic gate based on a nanoelectromechanical cantilever (NC) oscillator. The fundamental XOR, AND, NOR, OR and NOT logic gates are condensed in a single NC, thereby reducing electrical interconnects between devices. The device is dynamically switchable between any logic gates at the same drive frequency without the need for any change in the circuit. It is demonstrated to operate at elevated temperatures minimizing the need for thermal management systems. It has a tunable bandwidth of 5 MHz enabling parallel and dynamically reconfigurable logic device for enhanced computing.

Restructuring of an Event Tree for a Loss of Coolant Accident in a PSA model

International Nuclear Information System (INIS)

Lim, Ho-Gon; Han, Sang-Hoon; Park, Jin-Hee; Jang, Seong-Chul

2015-01-01

Conventional risk model using PSA (probabilistic Safety Assessment) for a NPP considers two types of accident initiators for internal events, LOCA (Loss of Coolant Accident) and transient event such as Loss of electric power, Loss of cooling, and so on. Traditionally, a LOCA is divided into three initiating event (IE) categories depending on the break size, small, medium, and large LOCA. In each IE group, safety functions or systems modeled in the accident sequences are considered to be applicable regardless of the break size. However, since the safety system or functions are not designed based on a break size, there exist lots of mismatch between safety system/function and an IE, which may make the risk model conservative or in some case optimistic. Present paper proposes new methodology for accident sequence analysis for LOCA. We suggest an integrated single ET construction for LOCA by incorporating a safety system/function and its applicable break spectrum into the ET. Integrated accident sequence analysis in terms of ET for LOCA was proposed in the present paper. Safety function/system can be properly assigned if its applicable range is given by break set point. Also, using simple Boolean algebra with the subset of the break spectrum, final accident sequences are expressed properly in terms of the Boolean multiplication, the occurrence frequency and the success/failure of safety system. The accident sequence results show that the accident sequence is described more detailed compared with the conventional results. Unfortunately, the quantitative results in terms of MCS (minimal Cut-Set) was not given because system fault tree was not constructed for this analysis and the break set points for all 7 point were not given as a specified numerical quantity. Further study may be needed to fix the break set point and to develop system fault tree

Restructuring of an Event Tree for a Loss of Coolant Accident in a PSA model

Energy Technology Data Exchange (ETDEWEB)

Lim, Ho-Gon; Han, Sang-Hoon; Park, Jin-Hee; Jang, Seong-Chul [KAERI, Daejeon (Korea, Republic of)

2015-05-15

Conventional risk model using PSA (probabilistic Safety Assessment) for a NPP considers two types of accident initiators for internal events, LOCA (Loss of Coolant Accident) and transient event such as Loss of electric power, Loss of cooling, and so on. Traditionally, a LOCA is divided into three initiating event (IE) categories depending on the break size, small, medium, and large LOCA. In each IE group, safety functions or systems modeled in the accident sequences are considered to be applicable regardless of the break size. However, since the safety system or functions are not designed based on a break size, there exist lots of mismatch between safety system/function and an IE, which may make the risk model conservative or in some case optimistic. Present paper proposes new methodology for accident sequence analysis for LOCA. We suggest an integrated single ET construction for LOCA by incorporating a safety system/function and its applicable break spectrum into the ET. Integrated accident sequence analysis in terms of ET for LOCA was proposed in the present paper. Safety function/system can be properly assigned if its applicable range is given by break set point. Also, using simple Boolean algebra with the subset of the break spectrum, final accident sequences are expressed properly in terms of the Boolean multiplication, the occurrence frequency and the success/failure of safety system. The accident sequence results show that the accident sequence is described more detailed compared with the conventional results. Unfortunately, the quantitative results in terms of MCS (minimal Cut-Set) was not given because system fault tree was not constructed for this analysis and the break set points for all 7 point were not given as a specified numerical quantity. Further study may be needed to fix the break set point and to develop system fault tree.

Idealized Compression Ratio for a Screw Briquetting Press

Directory of Open Access Journals (Sweden)

Peter Biath

2012-01-01

Full Text Available This paper deals with issues in determining the ideal compression ratio for a screw briquetting press. First, the principles of operation and a basic description of the main parts of a screw briquetting press are introduced. The next section describes the pressing space by means of 3D software. The pressing space was created using a Boolean subtract function. The final section of the paper measures the partial volumes of the pressing chamber in CATIA V5 by function of measuring. The measured values are substituted into the formula for the compression ratio, and the resulting evaluations are presented in the diagram in the conclusion of this paper.

Math for computer applications

CERN Document Server

REA, The Editors of

2013-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. Topics include logic, set theory, relations and functions, vectors and matrices, graph theory, counting and binomial theorem, probability, Boolean algebra, and linear programming and

Chemical switches and logic gates based on surface modified semiconductors

Energy Technology Data Exchange (ETDEWEB)

Konrad, Szacilowski; Wojciech, Macyk [Jagiellonian Univ., Dept. of Chemistry, Krakow (Poland)

2006-02-15

Photoelectrochemical properties of multicomponent photo-electrodes based on titanium dioxide and cadmium sulfide powders modified with hexacyanoferrate complexes have been examined. Photocurrent responses were recorded as functions of applied potential and photon energy. Surprisingly, the photocurrent can be switched between positive and negative values as a result of potential or photon energy changes. This new effect called Photo Electrochemical Photocurrent Switching (PEPS) opens a possibility of new chemical switches and logic gates construction. Boolean logic analysis and a tentative mechanism of the device are discussed. (authors)

Bayesian programming

CERN Document Server

Bessiere, Pierre; Ahuactzin, Juan Manuel; Mekhnacha, Kamel

2013-01-01

Probability as an Alternative to Boolean LogicWhile logic is the mathematical foundation of rational reasoning and the fundamental principle of computing, it is restricted to problems where information is both complete and certain. However, many real-world problems, from financial investments to email filtering, are incomplete or uncertain in nature. Probability theory and Bayesian computing together provide an alternative framework to deal with incomplete and uncertain data. Decision-Making Tools and Methods for Incomplete and Uncertain DataEmphasizing probability as an alternative to Boolean

Surface confined assemblies and polymers for sensing and molecular logic

Science.gov (United States)

de Ruiter, Graham; Altman, Marc; Motiei, Leila; Lahav, Michal; van der Boom, Milko E.

2013-05-01

Since the development of molecule-based sensors and the introduction of molecules mimicking the behavior of the AND gate in solution by de Silva in 1993, molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. The molecular approach toward Boolean logic resulted in intriguing proofs of concepts in solution including logic gates, half-adders, multiplexers, and flip-flop logic circuits. Molecular assemblies can perform diverse logic tasks by reconfiguring their inputs. Our recent research activities focus on MBLC with electrochromic polymers and immobilized polypyridyl complexes on solid support. We have designed a series of coordination-based thin films that are formed linearly by stepwise wet-chemical deposition or by self-propagating molecular assembly. The electrochromic properties of these films can be used for (i) detecting various analytes in solution and in the air, (ii) MBLC, (iii) electron-transfer studies, and (iv) interlayers for efficient inverted bulk-heterojunction solar cells. Our concept toward MBLC with functionalized surfaces is applicable to electrochemical and chemical inputs coupled with optical readout. Using this approach, we demonstrated various logic architectures with redox-active functionalized surfaces. Electrochemically operated sequential logic systems (e.g., flip-flops), multi-valued logic, and multi-state memory have been designed, which can improve computational power without increasing spatial requirements. Applying multi-valued digits in data storage and information processing could exponentially increase memory capacity. Our approach is applicable to highly diverse electrochromic thin films that operate at practical voltages (< 1.5 V).

Leakage Current Elimination of Four-Leg Inverter for Transformerless Three-Phase PV Systems

DEFF Research Database (Denmark)

Guo, Xiaoqiang; He, Ran; Jian, Jiamin

2016-01-01

Eliminating the leakage current is one of the most important issues for transformerless three phase photovoltaic (PV) systems. In this paper, the leakage current elimination of a three-phase four-leg PV inverter is investigated. With the common mode loop model established, the generation mechanism...... of the leakage current is clearly identified. Different typical carrier-based modulation methods and their corresponding common mode voltages are discussed. A new modulation strategy with Boolean logic function is proposed to achieve the constant common mode voltage for the leakage current reduction. Finally...

Implementing size-optimal discrete neural networks requires analog circuitry

Energy Technology Data Exchange (ETDEWEB)

Beiu, V.

1998-03-01

Neural networks (NNs) have been experimentally shown to be quite effective in many applications. This success has led researchers to undertake a rigorous analysis of the mathematical properties that enable them to perform so well. It has generated two directions of research: (i) to find existence/constructive proofs for what is now known as the universal approximation problem; (ii) to find tight bounds on the size needed by the approximation problem (or some particular cases). The paper will focus on both aspects, for the particular case when the functions to be implemented are Boolean.

Algebraic and stochastic coding theory

CERN Document Server

Kythe, Dave K

2012-01-01

Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.

Logical design for computers and control

CERN Document Server

Dodd, Kenneth N

1972-01-01

Logical Design for Computers and Control Logical Design for Computers and Control gives an introduction to the concepts and principles, applications, and advancements in the field of control logic. The text covers topics such as logic elements; high and low logic; kinds of flip-flops; binary counting and arithmetic; and Boolean algebra, Boolean laws, and De Morgan's theorem. Also covered are topics such as electrostatics and atomic theory; the integrated circuit and simple control systems; the conversion of analog to digital systems; and computer applications and control. The book is recommend

Network class superposition analyses.

Directory of Open Access Journals (Sweden)

Carl A B Pearson

Full Text Available Networks are often used to understand a whole system by modeling the interactions among its pieces. Examples include biomolecules in a cell interacting to provide some primary function, or species in an environment forming a stable community. However, these interactions are often unknown; instead, the pieces' dynamic states are known, and network structure must be inferred. Because observed function may be explained by many different networks (e.g., ≈ 10(30 for the yeast cell cycle process, considering dynamics beyond this primary function means picking a single network or suitable sample: measuring over all networks exhibiting the primary function is computationally infeasible. We circumvent that obstacle by calculating the network class ensemble. We represent the ensemble by a stochastic matrix T, which is a transition-by-transition superposition of the system dynamics for each member of the class. We present concrete results for T derived from boolean time series dynamics on networks obeying the Strong Inhibition rule, by applying T to several traditional questions about network dynamics. We show that the distribution of the number of point attractors can be accurately estimated with T. We show how to generate Derrida plots based on T. We show that T-based Shannon entropy outperforms other methods at selecting experiments to further narrow the network structure. We also outline an experimental test of predictions based on T. We motivate all of these results in terms of a popular molecular biology boolean network model for the yeast cell cycle, but the methods and analyses we introduce are general. We conclude with open questions for T, for example, application to other models, computational considerations when scaling up to larger systems, and other potential analyses.

Multi-valued fields

CERN Document Server

Ershov, Yuri L

2001-01-01

For more than 30 years, the author has studied the model-theoretic aspects of the theory of valued fields and multi-valued fields. Many of the key results included in this book were obtained by the author whilst preparing the manuscript. Thus the unique overview of the theory, as developed in the book, has been previously unavailable. The book deals with the theory of valued fields and mutli-valued fields. The theory of Prüfer rings is discussed from the `geometric' point of view. The author shows that by introducing the Zariski topology on families of valuation rings, it is possible to distinguish two important subfamilies of Prüfer rings that correspond to Boolean and near Boolean families of valuation rings. Also, algebraic and model-theoretic properties of multi-valued fields with near Boolean families of valuation rings satisfying the local-global principle are studied. It is important that this principle is elementary, i.e., it can be expressed in the language of predicate calculus. The most important...

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

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

Ramsey Results for Cycle Spectra

DEFF Research Database (Denmark)

Brandt, S.; Joos, F.; Muttel, J.

2013-01-01

Let C(G) denote the set of lengths of cycles of a graph G of order n and let (G) over bar denote the complement of G. We show that if n >= 6, then C(G) boolean OR C((G) over bar) contains all odd l with 3......Let C(G) denote the set of lengths of cycles of a graph G of order n and let (G) over bar denote the complement of G. We show that if n >= 6, then C(G) boolean OR C((G) over bar) contains all odd l with 3...

The zonal satellite problem. III Symmetries

Directory of Open Access Journals (Sweden)

Mioc V.

2002-01-01

Full Text Available The two-body problem associated with a force field described by a potential of the form U =Sum(k=1,n ak/rk (r = distance between particles, ak = real parameters is resumed from the only standpoint of symmetries. Such symmetries, expressed in Hamiltonian coordinates, or in standard polar coordinates, are recovered for McGehee-type coordinates of both collision-blow-up and infinity-blow-up kind. They form diffeomorphic commutative groups endowed with a Boolean structure. Expressed in Levi-Civita’s coordinates, the problem exhibits a larger group of symmetries, also commutative and presenting a Boolean structure.

Post optimization paradigm in maximum 3-satisfiability logic programming

Science.gov (United States)

Mansor, Mohd. Asyraf; Sathasivam, Saratha; Kasihmuddin, Mohd Shareduwan Mohd

2017-08-01

Maximum 3-Satisfiability (MAX-3SAT) is a counterpart of the Boolean satisfiability problem that can be treated as a constraint optimization problem. It deals with a conundrum of searching the maximum number of satisfied clauses in a particular 3-SAT formula. This paper presents the implementation of enhanced Hopfield network in hastening the Maximum 3-Satisfiability (MAX-3SAT) logic programming. Four post optimization techniques are investigated, including the Elliot symmetric activation function, Gaussian activation function, Wavelet activation function and Hyperbolic tangent activation function. The performances of these post optimization techniques in accelerating MAX-3SAT logic programming will be discussed in terms of the ratio of maximum satisfied clauses, Hamming distance and the computation time. Dev-C++ was used as the platform for training, testing and validating our proposed techniques. The results depict the Hyperbolic tangent activation function and Elliot symmetric activation function can be used in doing MAX-3SAT logic programming.

An operator calculus for surface and volume modeling

Science.gov (United States)

Gordon, W. J.

1984-01-01

The mathematical techniques which form the foundation for most of the surface and volume modeling techniques used in practice are briefly described. An outline of what may be termed an operator calculus for the approximation and interpolation of functions of more than one independent variable is presented. By considering the linear operators associated with bivariate and multivariate interpolation/approximation schemes, it is shown how they can be compounded by operator multiplication and Boolean addition to obtain a distributive lattice of approximation operators. It is then demonstrated via specific examples how this operator calculus leads to practical techniques for sculptured surface and volume modeling.

Finding small OBDDs for incompletely specified truth tables is hard

DEFF Research Database (Denmark)

Miltersen, Peter Bro; Kristensen, Jesper Torp

2006-01-01

We present an efficient reduction mapping undirected graphs G with n = 2^k vertices for integers k to tables of partially specified Boolean functions g: {0,1}^(4k+1) -> {0,1,*} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary dec...... decision diagram with at most (2m + 2)n^2 + 4n decision nodes. From this it follows that the problem of finding a minimum-sized consistent OBDD for an incompletely specified truth table is NP-hard and also hard to approximate....

Introduction to focus issue: quantitative approaches to genetic networks.

Science.gov (United States)

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

2013-06-01

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

The role of dendritic non-linearities in single neuron computation

Directory of Open Access Journals (Sweden)

Boris Gutkin

2014-05-01

Full Text Available Experiment has demonstrated that summation of excitatory post-synaptic protientials (EPSPs in dendrites is non-linear. The sum of multiple EPSPs can be larger than their arithmetic sum, a superlinear summation due to the opening of voltage-gated channels and similar to somatic spiking. The so-called dendritic spike. The sum of multiple of EPSPs can also be smaller than their arithmetic sum, because the synaptic current necessarily saturates at some point. While these observations are well-explained by biophysical models the impact of dendritic spikes on computation remains a matter of debate. One reason is that dendritic spikes may fail to make the neuron spike; similarly, dendritic saturations are sometime presented as a glitch which should be corrected by dendritic spikes. We will provide solid arguments against this claim and show that dendritic saturations as well as dendritic spikes enhance single neuron computation, even when they cannot directly make the neuron fire. To explore the computational impact of dendritic spikes and saturations, we are using a binary neuron model in conjunction with Boolean algebra. We demonstrate using these tools that a single dendritic non-linearity, either spiking or saturating, combined with somatic non-linearity, enables a neuron to compute linearly non-separable Boolean functions (lnBfs. These functions are impossible to compute when summation is linear and the exclusive OR is a famous example of lnBfs. Importantly, the implementation of these functions does not require the dendritic non-linearity to make the neuron spike. Next, We show that reduced and realistic biophysical models of the neuron are capable of computing lnBfs. Within these models and contrary to the binary model, the dendritic and somatic non-linearity are tightly coupled. Yet we show that these neuron models are capable of linearly non-separable computations.

A Modified Recession Vector Method Based on the Optimization-Simulation Approach to Design Problems of Information Security Systems

Directory of Open Access Journals (Sweden)

A. Yu. Bykov

2015-01-01

Full Text Available Modern practical task-solving techniques for designing information security systems in different purpose automated systems assume the solution of optimization tasks when choosing different elements of a security system. Formulations of mathematical programming tasks are rather often used, but in practical tasks it is not always analytically possible to set target function and (or restrictions in an explicit form. Sometimes, calculation of the target function value or checking of restrictions for the possible decision can be reduced to carrying out experiments on a simulation model of system. Similar tasks are considered within optimization-simulation approach and require the ad hoc methods of optimization considering the possible high computational effort of simulation.The article offers a modified recession vector method, which is used in tasks of discrete optimization to solve the similar problems. The method is applied when the task to be solved is to minimize the cost of selected information security tools in case of restriction on the maximum possible damage. The cost index is the linear function of the Boolean variables, which specify the selected security tools, with the restriction set as an "example simulator". Restrictions can be actually set implicitly. A validity of the possible solution is checked using a simulation model of the system.The offered algorithm of a method considers features of an objective. The main advantage of algorithm is that it requires a maximum of m+1 of steps where m is a dimensionality of the required vector of Boolean variables. The algorithm provides finding a local minimum by using the Hamming metrics in the discrete space; the radius of neighborhood is equal to 1. These statements are proved.The paper presents solution results of choosing security tools with the specified basic data.

Mathematical approaches for complexity/predictivity trade-offs in complex system models : LDRD final report.

Energy Technology Data Exchange (ETDEWEB)

Goldsby, Michael E.; Mayo, Jackson R.; Bhattacharyya, Arnab (Massachusetts Institute of Technology, Cambridge, MA); Armstrong, Robert C.; Vanderveen, Keith

2008-09-01

The goal of this research was to examine foundational methods, both computational and theoretical, that can improve the veracity of entity-based complex system models and increase confidence in their predictions for emergent behavior. The strategy was to seek insight and guidance from simplified yet realistic models, such as cellular automata and Boolean networks, whose properties can be generalized to production entity-based simulations. We have explored the usefulness of renormalization-group methods for finding reduced models of such idealized complex systems. We have prototyped representative models that are both tractable and relevant to Sandia mission applications, and quantified the effect of computational renormalization on the predictive accuracy of these models, finding good predictivity from renormalized versions of cellular automata and Boolean networks. Furthermore, we have theoretically analyzed the robustness properties of certain Boolean networks, relevant for characterizing organic behavior, and obtained precise mathematical constraints on systems that are robust to failures. In combination, our results provide important guidance for more rigorous construction of entity-based models, which currently are often devised in an ad-hoc manner. Our results can also help in designing complex systems with the goal of predictable behavior, e.g., for cybersecurity.

No-cloning theorem on quantum logics

International Nuclear Information System (INIS)

Miyadera, Takayuki; Imai, Hideki

2009-01-01

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

The Generalization Complexity Measure for Continuous Input Data

Directory of Open Access Journals (Sweden)

Iván Gómez

2014-01-01

defined in Boolean space, quantifies the complexity of data in relationship to the prediction accuracy that can be expected when using a supervised classifier like a neural network, SVM, and so forth. We first extend the original measure for its use with continuous functions to later on, using an approach based on the use of the set of Walsh functions, consider the case of having a finite number of data points (inputs/outputs pairs, that is, usually the practical case. Using a set of trigonometric functions a model that gives a relationship between the size of the hidden layer of a neural network and the complexity is constructed. Finally, we demonstrate the application of the introduced complexity measure, by using the generated model, to the problem of estimating an adequate neural network architecture for real-world data sets.

Reveal, A General Reverse Engineering Algorithm for Inference of Genetic Network Architectures

Science.gov (United States)

Liang, Shoudan; Fuhrman, Stefanie; Somogyi, Roland

1998-01-01

Given the immanent gene expression mapping covering whole genomes during development, health and disease, we seek computational methods to maximize functional inference from such large data sets. Is it possible, in principle, to completely infer a complex regulatory network architecture from input/output patterns of its variables? We investigated this possibility using binary models of genetic networks. Trajectories, or state transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing the mutual information between input states and output states, one is able to infer the sets of input elements controlling each element or gene in the network. This process is unequivocal and exact for complete state transition tables. We implemented this REVerse Engineering ALgorithm (REVEAL) in a C program, and found the problem to be tractable within the conditions tested so far. For n = 50 (elements) and k = 3 (inputs per element), the analysis of incomplete state transition tables (100 state transition pairs out of a possible 10(exp 15)) reliably produced the original rule and wiring sets. While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include multi-state models, essentially allowing direct application to realistic biological data sets. The ability to adequately solve the inverse problem may enable in-depth analysis of complex dynamic systems in biology and other fields.

Video rate morphological processor based on a redundant number representation

Science.gov (United States)

Kuczborski, Wojciech; Attikiouzel, Yianni; Crebbin, Gregory A.

1992-03-01

This paper presents a video rate morphological processor for automated visual inspection of printed circuit boards, integrated circuit masks, and other complex objects. Inspection algorithms are based on gray-scale mathematical morphology. Hardware complexity of the known methods of real-time implementation of gray-scale morphology--the umbra transform and the threshold decomposition--has prompted us to propose a novel technique which applied an arithmetic system without carrying propagation. After considering several arithmetic systems, a redundant number representation has been selected for implementation. Two options are analyzed here. The first is a pure signed digit number representation (SDNR) with the base of 4. The second option is a combination of the base-2 SDNR (to represent gray levels of images) and the conventional twos complement code (to represent gray levels of structuring elements). Operation principle of the morphological processor is based on the concept of the digit level systolic array. Individual processing units and small memory elements create a pipeline. The memory elements store current image windows (kernels). All operation primitives of processing units apply a unified direction of digit processing: most significant digit first (MSDF). The implementation technology is based on the field programmable gate arrays by Xilinx. This paper justified the rationality of a new approach to logic design, which is the decomposition of Boolean functions instead of Boolean minimization.

Computing with synthetic protocells.

Science.gov (United States)

Courbet, Alexis; Molina, Franck; Amar, Patrick

2015-09-01

In this article we present a new kind of computing device that uses biochemical reactions networks as building blocks to implement logic gates. The architecture of a computing machine relies on these generic and composable building blocks, computation units, that can be used in multiple instances to perform complex boolean functions. Standard logical operations are implemented by biochemical networks, encapsulated and insulated within synthetic vesicles called protocells. These protocells are capable of exchanging energy and information with each other through transmembrane electron transfer. In the paradigm of computation we propose, protoputing, a machine can solve only one problem and therefore has to be built specifically. Thus, the programming phase in the standard computing paradigm is represented in our approach by the set of assembly instructions (specific attachments) that directs the wiring of the protocells that constitute the machine itself. To demonstrate the computing power of protocellular machines, we apply it to solve a NP-complete problem, known to be very demanding in computing power, the 3-SAT problem. We show how to program the assembly of a machine that can verify the satisfiability of a given boolean formula. Then we show how to use the massive parallelism of these machines to verify in less than 20 min all the valuations of the input variables and output a fluorescent signal when the formula is satisfiable or no signal at all otherwise.

Strengthening Crypto-1 Cipher Against Algebraic Attacks

Directory of Open Access Journals (Sweden)

Farah Afianti

2015-08-01

Full Text Available In the last few years, several studies addressed the problem of data security in Mifare Classic. One of its weaknesses is the low random number quality. This causes SAT solver attacks to have lower complexity. In order to strengthen Crypto-1 against SAT solver attacks, a modification of the feedback function with better cryptographic properties is proposed. It applies a primitive polynomial companion matrix. SAT solvers cannot directly attack the feedback shift register that uses the modified Boolean feedback function, the register has to be split into smaller groups. Experimental testing showed that the amount of memory and CPU time needed were highest when attacking the modified Crypto-1 using the modified feedback function and the original filter function. In addition, another modified Crypto-1, using the modified feedback function and a modified filter function, had the lowest percentage of revealed variables. It can be concluded that the security strength and performance of the modified Crypto-1 using the modified feedback function and the modified filter function are better than those of the original Crypto-1.

Disparity between ultrasound and clinical findings in psoriatic arthritis.

Science.gov (United States)

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

2014-08-01

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

VirPLC: a Methodology to Developing Capacities, Skills and Self-esteem by the Logical Stimulus with a Simple, Functional and Dynamic Tool

Directory of Open Access Journals (Sweden)

Antoni FERRER ROJAS

2017-07-01

Full Text Available The proliferation of programming environments such as Logo, Minecraft, Code or Scratch is a consequence of the effectiveness of a graphic language for the introduction of students in programming but, some of the newer systems, such as App Inventor, are slow in the basic interaction: “make it” / “test it”. I propose an alternative for students from the age of 15. It is called VirPLC and it is oriented to something as functional as the systems control, through two screens: one with software to program and, another one with animated hardware to simulate it. VirPLC does not pretend to turn the user into an expert in automation, but to facilitate a first contact between the student and the logic world, by posing problems in practical, near and real control systems such as: crane control; TV competition; alarm; supermarket door; garage door; traffic light; lift... The student raises both the logical operativity, as well as the hardware requirements (inputs and outputs. The software works in an evolutionary and repeated way: “make it” / “test it” and consolidate to improve it. It allows the evolution in levels of greater complexity, where it is debugged until acquiring a solid “product”, functional, safe, versatile and installable. VirPLC step by step “hooks” students who pursue challenges and offers an alternative to apply after some Boolean Algebra notions, and before written programming, with objects, events and classes. VirPLC is freeware, it works under Windows (from XP to W10 and can be downloaded from the author’s WEB. At install time, it adds a folder with more than 30 examples often deliberately incomplete, along with a mini-course with several proposed practices.

A new paradigm in the design of energy-efficient digital circuits using laterally-actuated double-gate NEMS

KAUST Repository

Dadgour, Hamed F.

2010-01-01

Nano-Electro-Mechanical Switches (NEMS) offer the prospect of improved energy-efficiency in digital circuits due to their near-zero subthreshold leakage and extremely low subthreshold swing values. Among the different approaches of implementing NEMS, laterallyactuated double-gate NEMS devices have attracted much attention as they provide unique and exciting circuit design opportunities. For instance, this paper demonstrates that compact XOR/XNOR gates can be implemented using only two such NEMS transistors. While this in itself is a major improvement, its implications for minimizing Boolean functions using Karnaugh maps (K-maps) are even more significant. In the standard K-map technique, which is used in digital circuit design, adjacent "1s" (minterms) are grouped only in horizontal and/or vertical directions; the diagonal (or zig-zag) grouping of adjacent "1s" is not an option due to the absence of compact XOR/XNOR gates. However, this work demonstrates, for the first time ever, that in lateral double-gate NEMS-based circuits, grouping of minterms is possible in horizontal and vertical as well as diagonal fashions. This is because the diagonal groupings of minterms require XOR/XNOR operations, which are available in such NEMS-based circuits at minimal costs. This novel design paradigm facilitates more compact implementations of Boolean functions and thus, considerably improves their energy-efficiency. For example, a lateral NEMS-based full-adder is implemented using less than half the number of transistors, which is required by a CMOS-based full-adder. Furthermore, circuit simulations are performed to evaluate the energy-efficiencies of the NEMS-based 32-bit carry-save adders compared to their standard CMOS-based counterparts. Copyright 2010 ACM.

A unique structure for the multiplexer in quantum-dot cellular automata to create a revolution in design of nanostructures

Energy Technology Data Exchange (ETDEWEB)

Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed, E-mail: s.rasouli@iaut.ac.ir

2017-05-01

Quantum-dot cellular automata (QCA) is the advent of technology and suitable replacement for semiconductor transistor technology. In this paper, a unique structure for the 2:1 multiplexer is presented in QCA. The structure of this component is simple, ultra-efficient and very useful to implement the various logical functions. The proposed structure does not follow any Boolean function. It takes advantage of the inherent characteristics of quantum technology to produce the desired output. Based on these principles, we design the new and efficient structures for the 4:1 multiplexer and 8:1 multiplexer in the QCA technology. These structures are designed with QCADesigner simulator and simulation results are examined. Investigation results indicate the amazing performance of proposed structure compared to existing structures in terms of area, complexity, power consumption and latency.

A novel decision diagrams extension method

International Nuclear Information System (INIS)

Li, Shumin; Si, Shubin; Dui, Hongyan; Cai, Zhiqiang; Sun, Shudong

2014-01-01

Binary decision diagram (BDD) is a graph-based representation of Boolean functions. It is a directed acyclic graph (DAG) based on Shannon's decomposition. Multi-state multi-valued decision diagram (MMDD) is a natural extension of BDD for the symbolic representation and manipulation of the multi-valued logic functions. This paper proposes a decision diagram extension method based on original BDD/MMDD while the scale of a reliability system is extended. Following a discussion of decomposition and physical meaning of BDD and MMDD, the modeling method of BDD/MMDD based on original BDD/MMDD is introduced. Three case studies are implemented to demonstrate the presented methods. Compared with traditional BDD and MMDD generation methods, the decision diagrams extension method is more computationally efficient as shown through the running time

Nonlinear dynamics based digital logic and circuits.

Science.gov (United States)

Kia, Behnam; Lindner, John F; Ditto, William L

2015-01-01

We discuss the role and importance of dynamics in the brain and biological neural networks and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.

An ordering heuristic for building Binary Decision Diagrams for fault-trees

International Nuclear Information System (INIS)

Bouissou, M.

1997-01-01

Binary Decision Diagrams (BDD) have recently made a noticeable entry in the RAMS field. This kind of representation for boolean functions makes possible the assessment of complex fault-trees, both qualitatively (minimal cut-sets search) and quantitatively (exact calculation of top event probability). The object of the paper is to present a pre-processing of the fault-tree which ensures that the results given by different heuristics on the 'optimized' fault-tree are not too sensitive to the way the tree is written. This property is based on a theoretical proof. In contrast with some well known heuristics, the method proposed is not based only on intuition and practical experiments. (author)

Probability problems in seismic risk analysis and load combinations for nuclear power plants

International Nuclear Information System (INIS)

George, L.L.

1983-01-01

This workshop describes some probability problems in power plant reliability and maintenance analysis. The problems are seismic risk analysis, loss of load probability, load combinations, and load sharing. The seismic risk problem is to compute power plant reliability given an earthquake and the resulting risk. Component survival occurs if its peak random response to the earthquake does not exceed its strength. Power plant survival is a complicated Boolean function of component failures and survivals. The responses and strengths of components are dependent random processes, and the peak responses are maxima of random processes. The resulting risk is the expected cost of power plant failure

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

Science.gov (United States)

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

2016-12-01

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

Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels

Directory of Open Access Journals (Sweden)

Majid Nasiri Khormuji

2012-12-01

Full Text Available Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF, partial DF and compress-and-forward (CF relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented. The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF or superior to those achieved by DF relaying. In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links.

Design and finite element method analysis of laterally actuated multi-value nano electromechanical switches

KAUST Repository

Kloub, Hussam; Smith, Casey; Hussain, Muhammad Mustafa

2011-01-01

We report on the design and modeling of novel nano electromechanical switches suitable for implementing reset/set flip-flops, AND, NOR, and XNOR Boolean functions. Multiple logic operations can be implemented using only one switching action enabling parallel data processing; a feature that renders this design competitive with complementary metal oxide semiconductor and superior to conventional nano-electromechanical switches in terms of functionality per device footprint. The structural architecture of the newly designed switch consists of a pinned flexural beam structure which allows low strain lateral actuation for enhanced mechanical integrity. Reliable control of on-state electrical current density is achieved through the use of metal-metal contacts, true parallel beam deflection, and lithographically defined contact area to prevent possible device welding. Dynamic response as a function of device dimensions numerically investigated using ANSYS and MatLab Simulink. © 2011 The Japan Society of Applied Physics.

Design and finite element method analysis of laterally actuated multi-value nano electromechanical switches

KAUST Repository

Kloub, Hussam

2011-09-01

We report on the design and modeling of novel nano electromechanical switches suitable for implementing reset/set flip-flops, AND, NOR, and XNOR Boolean functions. Multiple logic operations can be implemented using only one switching action enabling parallel data processing; a feature that renders this design competitive with complementary metal oxide semiconductor and superior to conventional nano-electromechanical switches in terms of functionality per device footprint. The structural architecture of the newly designed switch consists of a pinned flexural beam structure which allows low strain lateral actuation for enhanced mechanical integrity. Reliable control of on-state electrical current density is achieved through the use of metal-metal contacts, true parallel beam deflection, and lithographically defined contact area to prevent possible device welding. Dynamic response as a function of device dimensions numerically investigated using ANSYS and MatLab Simulink. © 2011 The Japan Society of Applied Physics.

SAT-Based Software Certification

National Research Council Canada - National Science Library

Chaki, Sagar

2006-01-01

... predicate abstraction and validated by generating and proving verification conditions. In addition, the first part of the report proposes the use of theorem provers based on Boolean propositional satisfiability (SAT...

The foundations of statistics

CERN Document Server

Savage, Leonard J

1972-01-01

Classic analysis of the foundations of statistics and development of personal probability, one of the greatest controversies in modern statistical thought. Revised edition. Calculus, probability, statistics, and Boolean algebra are recommended.

CBP Customs Rulings Online Search System (CROSS)

Data.gov (United States)

Department of Homeland Security — CROSS is a searchable database of CBP rulings that can be retrieved based on simple or complex search characteristics using keywords and Boolean operators. CROSS has...

ZKBoo: Faster Zero-Knowledge for Boolean Circuits

DEFF Research Database (Denmark)

Giacomelli, Irene; Madsen, Jesper; Orlandi, Claudio

2016-01-01

variants of IKOS, which highlights their pros and cons for practically rele- vant soundness parameters; ◦ A generalization and simplification of their approach, which leads to faster Σ-protocols (that can be made non-interactive using the Fiat-Shamir heuristic) for state- ments of the form “I know x...

Image Filtering with Boolean and Statistical Operators.

Science.gov (United States)

1983-12-01

S3(2) COMPLEX AMAT(256, 4). BMAT (256. 4). CMAT(256. 4) CALL IOF(3. MAIN. AFLNM. DFLNI, CFLNM. MS., 82, S3) CALL OPEN(1.AFLNM* 1.IER) CALL CHECKC!ER...RDBLK(2. 6164. MAT. 16, IER) CALL CHECK(IER) DO I K-1. 4 DO I J-1.256 CMAT(J. K)-AMAT(J. K)’. BMAT (J. K) I CONTINUE S CALL WRBLK(3. 164!. CMAT. 16. IER

Boolean integration. [applied to switching network synthesis

Science.gov (United States)

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

1976-01-01

This paper presents the necessary and sufficient conditions for a given differential expression to be compatibly integrable and it presents the necessary and sufficient conditions for a given expression to be exactly integrable. Methods are given for integrating a differential expression when it is exactly integrable and when it is compatibly integrable. The physical interpretation is given of the integral of order k, of a differential expression, and it is shown that any differential expression of the proper form is integrable by parts.

On boolean combinations forming piecewise testable languages

Czech Academy of Sciences Publication Activity Database

Masopust, Tomáš; Thomazo, M.

2017-01-01

Roč. 682, June 19 (2017), s. 165-179 ISSN 0304-3975 Institutional support: RVO:67985840 Keywords : automata * language s * k-piecewise testability Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.698, year: 2016 http://www.sciencedirect.com/science/article/pii/S030439751730066X

Pseudo Boolean Programming for Partially Ordered Genomes

Science.gov (United States)

Angibaud, Sébastien; Fertin, Guillaume; Thévenin, Annelyse; Vialette, Stéphane

Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Starting from a partial order between genes of a genome, one method to find a total order consists in optimizing a given measure between a linear extension of this partial order and a given total order of a close and well-known genome. However, for most common measures, the problem turns out to be NP-hard. In this paper, we propose a (0,1)-linear programming approach to compute a linear extension of one genome that maximizes the number of common intervals (resp. the number of adjacencies) between this linear extension and a given total order. Next, we propose an algorithm to find linear extensions of two partial orders that maximize the number of adjacencies.

Boolean Approach to Dichotomic Quantum Measurement Theories

Energy Technology Data Exchange (ETDEWEB)

Nagata, K. [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of); Nakamura, T. [Keio University, Yokohama (Japan); Batle, J. [Universitat de les Illes Balears, Balearic Islands (Spain); Abdalla, S. [King Abdulaziz University Jeddah, Jeddah (Saudi Arabia); Farouk, A. [Al-Zahra College for Women, Muscat (Egypt)

2017-02-15

Recently, a new measurement theory based on truth values was proposed by Nagata and Nakamura [Int. J. Theor. Phys. 55, 3616 (2016)], that is, a theory where the results of measurements are either 0 or 1. The standard measurement theory accepts a hidden variable model for a single Pauli observable. Hence, we can introduce a classical probability space for the measurement theory in this particular case. Additionally, we discuss in the present contribution the fact that projective measurement theories (the results of which are either +1 or −1) imply the Bell, Kochen, and Specker (BKS) paradox for a single Pauli observable. To justify our assertion, we present the BKS theorem in almost all the two-dimensional states by using a projective measurement theory. As an example, we present the BKS theorem in two-dimensions with white noise. Our discussion provides new insight into the quantum measurement problem by using this measurement theory based on the truth values.

Analysis of several Boolean operation based trajectory generation strategies for automotive spray applications

Science.gov (United States)

Gao, Guoyou; Jiang, Chunsheng; Chen, Tao; Hui, Chun

2018-05-01

Industrial robots are widely used in various processes of surface manufacturing, such as thermal spraying. The established robot programming methods are highly time-consuming and not accurate enough to fulfil the demands of the actual market. There are many off-line programming methods developed to reduce the robot programming effort. This work introduces the principle of several based robot trajectory generation strategy on planar surface and curved surface. Since the off-line programming software is widely used and thus facilitates the robot programming efforts and improves the accuracy of robot trajectory, the analysis of this work is based on the second development of off-line programming software Robot studio™. To meet the requirements of automotive paint industry, this kind of software extension helps provide special functions according to the users defined operation parameters. The presented planning strategy generates the robot trajectory by moving an orthogonal surface according to the information of coating surface, a series of intersection curves are then employed to generate the trajectory points. The simulation results show that the path curve created with this method is successive and smooth, which corresponds to the requirements of automotive spray industrial applications.

Quantum Random Networks for Type 2 Quantum Computers

National Research Council Canada - National Science Library

Allara, David L; Hasslacher, Brosl

2006-01-01

Random boolean networks (RBNs) have been studied theoretically and computationally in order to be able to use their remarkable self-healing and large basins of altercation properties as quantum computing architectures, especially...

Microelectromechanical reprogrammable logic device

Science.gov (United States)

Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.

2016-01-01

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295

Microelectromechanical reprogrammable logic device

KAUST Repository

Hafiz, Md Abdullah Al

2016-03-29

In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.

Evolution of a search: the use of dynamic twitter searches during superstorm sandy.

Science.gov (United States)

Harris Smith, Sara; Bennett, Kelly J; Livinski, Alicia A

2014-09-26

Twitter has emerged as a critical source of free and openly available information during emergency response operations, providing an unmatched level of on-the-ground situational awareness in real-time. Responders and survivors turn to Twitter to share information and resources within communities, conduct rumor control, and provide a "boots on the ground" understanding of the disaster. However, the ability to tune out background "noise" is essential to effectively utilizing Twitter to identify important and useful information during an emergency response. This article highlights a two-prong strategy in which the use of a Twitter list paired with subject specific Boolean searches provided increased situational awareness and early event detection during the United States Department of Health and Human Services (HHS), Office of the Assistant Secretary for Preparedness and Response (ASPR) response to Superstorm Sandy in 2012. To maximize the amount of relevant information that was retrieved, the Twitter list and Boolean searches were dynamic and responsive to real-time developments, evolving health threats, and the informational needs of decision-makers. The use of a Twitter list combined with Boolean searches led to enhanced situational awareness throughout the HHS response. The incorporation of a dynamic search strategy over the course of the HHS Sandy response, allowed for the ability to account for over-tweeted information, changes in event related conversation, and decreases in the return of relevant information.

Toward using games to teach fundamental computer science concepts

Science.gov (United States)

Edgington, Jeffrey Michael

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

An ordering heuristic for building Binary Decision Diagrams for fault-trees

Energy Technology Data Exchange (ETDEWEB)

Bouissou, M. [Electricite de France (EDF), 75 - Paris (France)

1997-12-31

Binary Decision Diagrams (BDD) have recently made a noticeable entry in the RAMS field. This kind of representation for boolean functions makes possible the assessment of complex fault-trees, both qualitatively (minimal cut-sets search) and quantitatively (exact calculation of top event probability). The object of the paper is to present a pre-processing of the fault-tree which ensures that the results given by different heuristics on the `optimized` fault-tree are not too sensitive to the way the tree is written. This property is based on a theoretical proof. In contrast with some well known heuristics, the method proposed is not based only on intuition and practical experiments. (author) 12 refs.

The development of a natural language interface to a geographical information system

Science.gov (United States)

Toledo, Sue Walker; Davis, Bruce

1993-01-01

This paper will discuss a two and a half year long project undertaken to develop an English-language interface for the geographical information system GRASS. The work was carried out for NASA by a small business, Netrologic, based in San Diego, California, under Phase 1 and 2 Small Business Innovative Research contracts. We consider here the potential value of this system whose current functionality addresses numerical, categorical and boolean raster layers and includes the display of point sets defined by constraints on one or more layers, answers yes/no and numerical questions, and creates statistical reports. It also handles complex queries and lexical ambiguities, and allows temporarily switching to UNIX or GRASS.

Magnon-based logic in a multi-terminal YIG/Pt nanostructure

Energy Technology Data Exchange (ETDEWEB)

Ganzhorn, Kathrin, E-mail: kathrin.ganzhorn@wmi.badw.de; Klingler, Stefan; Wimmer, Tobias [Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften, 85748 Garching (Germany); Physik-Department, Technische Universität München, 85748 Garching (Germany); Geprägs, Stephan [Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften, 85748 Garching (Germany); Gross, Rudolf; Huebl, Hans, E-mail: huebl@wmi.badw.de; Goennenwein, Sebastian T. B., E-mail: goennenwein@wmi.badw.de [Walther-Meißner-Institut, Bayerische Akademie der Wissenschaften, 85748 Garching (Germany); Physik-Department, Technische Universität München, 85748 Garching (Germany); Nanosystems Initiative Munich, 80799 Munich (Germany)

2016-07-11

Boolean logic is the foundation of modern digital information processing. Recently, there has been a growing interest in phenomena based on pure spin currents, which allows to move from charge to spin based logic gates. We study a proof-of-principle logic device based on the ferrimagnetic insulator Yttrium Iron Garnet, with Pt strips acting as injectors and detectors for non-equilibrium magnons. We experimentally observe incoherent superposition of magnons generated by different injectors. This allows to implement a fully functional majority gate, enabling multiple logic operations (AND and OR) in one and the same device. Clocking frequencies of the order of several GHz and straightforward down-scaling make our device promising for applications.

Jauch-Piron logics with finiteness conditions

Science.gov (United States)

Rogalewicz, Vladimír

1991-04-01

We show that there are no non-Boolean block-finite orthomodular posets possessing a unital set of Jauch-Piron states. Thus, an orthomodular poset representing a quantum physical system must have infinitely many blocks.

Design and experimentation of BSFQ logic devices

International Nuclear Information System (INIS)

Hosoki, T.; Kodaka, H.; Kitagawa, M.; Okabe, Y.

1999-01-01

Rapid single flux quantum (RSFQ) logic needs synchronous pulses for each gate, so the clock-wiring problem is more serious when designing larger scale circuits with this logic. So we have proposed a new SFQ logic which follows Boolean algebra perfectly by using set and reset pulses. With this logic, the level information of current input is transmitted with these pulses generated by level-to-pulse converters, and each gate calculates logic using its phase level made by these pulses. Therefore, our logic needs no clock in each gate. We called this logic 'Boolean SFQ (BSFQ) logic'. In this paper, we report design and experimentation for an AND gate with inverting input based on BSFQ logic. The experimental results for OR and XOR gates are also reported. (author)

InfoRoute: the CISMeF Context-specific Search Algorithm.

Science.gov (United States)

Merabti, Tayeb; Lelong, Romain; Darmoni, Stefan

2015-01-01

The aim of this paper was to present a practical InfoRoute algorithm and applications developed by CISMeF to perform a contextual information retrieval across multiple medical websites in different health domains. The algorithm was developed to treat multiple types of queries: natural, Boolean and advanced. The algorithm also generates multiple types of queries: Boolean query, PubMed query or Advanced query. Each query can be extended via an inter alignments relationship from UMLS and HeTOP portal. A web service and two web applications have been developed based on the InfoRoute algorithm to generate links-query across multiple websites, i.e.: "PubMed" or "ClinicalTrials.org". The InfoRoute algorithm is a useful tool to perform contextual information retrieval across multiple medical websites in both English and French.

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

Science.gov (United States)

Wijesinghe, Parami; Liyanagedera, Chamika; Roy, Kaushik

2018-05-02

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

Topological Aspects of Information Retrieval.

Science.gov (United States)

Egghe, Leo; Rousseau, Ronald

1998-01-01

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

Timing robustness in the budding and fission yeast cell cycles.

KAUST Repository

Mangla, Karan; Dill, David L; Horowitz, Mark A

2010-01-01

Robustness of biological models has emerged as an important principle in systems biology. Many past analyses of Boolean models update all pending changes in signals simultaneously (i.e., synchronously), making it impossible to consider robustness

N-Acetylcysteine in depressive symptoms and functionality: a systematic review and meta-analysis.

Science.gov (United States)

Fernandes, Brisa S; Dean, Olivia M; Dodd, Seetal; Malhi, Gin S; Berk, Michael

2016-04-01

To assess the utility of N-acetylcysteine administration for depressive symptoms in subjects with psychiatric conditions using a systematic review and meta-analysis. A computerized literature search was conducted in MEDLINE, Embase, the Cochrane Library, SciELO, PsycINFO, Scopus, and Web of Knowledge. No year or country restrictions were used. The Boolean terms used for the electronic database search were (NAC OR N-acetylcysteine OR acetylcysteine) AND (depression OR depressive OR depressed) AND (trial). The last search was performed in November 2014. The literature was searched for double-blind, randomized, placebo-controlled trials using N-acetylcysteine for depressive symptoms regardless of the main psychiatric condition. Using keywords and cross-referenced bibliographies, 38 studies were identified and examined in depth. Of those, 33 articles were rejected because inclusion criteria were not met. Finally, 5 studies were included. Data were extracted independently by 2 investigators. The primary outcome measure was change in depressive symptoms. Functionality, quality of life, and manic and anxiety symptoms were also examined. A full review and meta-analysis were performed. Standardized mean differences (SMDs) and odds ratios (ORs) with 95% CIs were calculated. Five studies fulfilled our inclusion criteria for the meta-analysis, providing data on 574 participants, of whom 291 were randomized to receive N-acetylcysteine and 283 to placebo. The follow-up varied from 12 to 24 weeks. Two studies included subjects with bipolar disorder and current depressive symptoms, 1 included subjects with MDD in a current depressive episode, and 2 included subjects with depressive symptoms in the context of other psychiatric conditions (1 trichotillomania and 1 heavy smoking). Treatment with N-acetylcysteine improved depressive symptoms as assessed by Montgomery-Asberg Depression Rating Scale and Hamilton Depression Rating Scale when compared to placebo (SMD = 0.37; 95% CI = 0

Universal logic gates via liquid-electronic hybrid divider

KAUST Repository

Zhou, Bingpu

2012-01-01

We demonstrated two-input microdroplet-based universal logic gates using a liquid-electronic hybrid divider. All 16 Boolean logic functions have been realized by manipulating the applied voltages. The novel platform consists of a microfluidic chip with integrated microdroplet detectors and external electronic components. The microdroplet detectors act as the communication media for fluidic and electronic information exchange. The presence or absence of microdroplets at the detector translates into the binary signal 1 or 0. The embedded micro-mechanical pneumatically actuated valve (PAV), fabricated using the well-developed multilayer soft lithography technique, offers biocompatibility, flexibility and accuracy for the on-chip realization of different logic functions. The microfluidic chip can be scaled up to construct large-scale microfluidic logic computation. On the other hand, the microfluidic chip with a specific logic function can be applied to droplet-based chemical reactions for on-demand bio or chemical analysis. Our experimental results have presented an autonomously driven, precision-controlled microfluidic chip for chemical reactions based on the IF logic function. © 2012 The Royal Society of Chemistry.

Totally optimal decision rules

KAUST Repository

Amin, Talha

2017-11-22

Optimality of decision rules (patterns) can be measured in many ways. One of these is referred to as length. Length signifies the number of terms in a decision rule and is optimally minimized. Another, coverage represents the width of a rule’s applicability and generality. As such, it is desirable to maximize coverage. A totally optimal decision rule is a decision rule that has the minimum possible length and the maximum possible coverage. This paper presents a method for determining the presence of totally optimal decision rules for “complete” decision tables (representations of total functions in which different variables can have domains of differing values). Depending on the cardinalities of the domains, we can either guarantee for each tuple of values of the function that totally optimal rules exist for each row of the table (as in the case of total Boolean functions where the cardinalities are equal to 2) or, for each row, we can find a tuple of values of the function for which totally optimal rules do not exist for this row.

Totally optimal decision rules

KAUST Repository

Amin, Talha M.; Moshkov, Mikhail

2017-01-01

Optimality of decision rules (patterns) can be measured in many ways. One of these is referred to as length. Length signifies the number of terms in a decision rule and is optimally minimized. Another, coverage represents the width of a rule’s applicability and generality. As such, it is desirable to maximize coverage. A totally optimal decision rule is a decision rule that has the minimum possible length and the maximum possible coverage. This paper presents a method for determining the presence of totally optimal decision rules for “complete” decision tables (representations of total functions in which different variables can have domains of differing values). Depending on the cardinalities of the domains, we can either guarantee for each tuple of values of the function that totally optimal rules exist for each row of the table (as in the case of total Boolean functions where the cardinalities are equal to 2) or, for each row, we can find a tuple of values of the function for which totally optimal rules do not exist for this row.

Millennial Students’ Online Search Strategies are Associated With Their Mental Models of Search. A Review of: Holman, L. (2011. Millennial students’ mental models of search: Implications for academic librarians and database developers. Journal of Academic Librarianship, 37(1, 19-27. doi:10.1016/j.acalib.2010.10.003

Directory of Open Access Journals (Sweden)

Leslie Bussert

2011-09-01

. Students assumed that obtaining few results indicated a problem of keyword choices rather than search query structure. When faced with no results in the databases, they assumed there were no articles on their topics and did not re-evaluate their search queries. Those with unsuccessful Boolean searches did not recognize that their errors were due to logic, and instead changed their keywords or began a new search altogether.Several students understood keywords as concepts versus literal strings of letters, yet thought the search tools determined search results based solely on what was typed into the search box. Of those employing phrase searches, some believed that each word was queried, while others thought only the “primary terms” were queried. Most students (61% offered analogies to print resources to explain how search engines process queries, and all the students’ descriptions included their ideas about what a search tool contained, rather than how the search tools organized information.Attempts to expand or narrow searches were haphazard. While most students (57% employed the strategy of adding keywords to narrow searches, only a few (11% recognized the function of this technique and used it regularly, while others tended to return to their original broad searches in a different tool. Some had a limited understanding that adding terms narrows and reducing terms broadens the search, but their Boolean errors negated the use of synonyms or alternative terms for those purposes. Other strategies included using the search tool’s “advanced search” features or quotes, although all who used the latter did so incorrectly and some mistakenly thought parentheses served the same purpose.All subjects drew representations of their views of the relationship between keywords used and search results retrieved, though few were able to clearly visualize how a search engine processes a query, or address ideas such as expanding or narrowing searches or synonym use. Three

Von-Neumann and Beyond: Memristor Architectures

KAUST Repository

Naous, Rawan

2017-01-01

and probabilistic analysis for Boolean logic operators and correspondingly incorporate them into arithmetic blocks. Gate- and system-level accuracy of operation is presented to convey configurability and the different effects that the unreliability of the underlying

Combinatorial optimization in foundry practice

Science.gov (United States)

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

2016-04-01

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

General upper bounds on the runtime of parallel evolutionary algorithms.

Science.gov (United States)

Lässig, Jörg; Sudholt, Dirk

2014-01-01

We present a general method for analyzing the runtime of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel runtime. This allows for a rigorous estimate of the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is easy to apply and that it gives powerful results. In our examples the performance guarantees improve with the density of the topology. Surprisingly, even sparse topologies such as ring graphs lead to a significant speedup for many functions while not increasing the total number of function evaluations by more than a constant factor. We also identify which number of processors lead to the best guaranteed speedups, thus giving hints on how to parameterize parallel evolutionary algorithms.

A Method to Design Synthetic Cell-Cycle Networks

International Nuclear Information System (INIS)

Ke-Ke, Miao

2009-01-01

The interactions among proteins, DNA and RNA in an organism form elaborate cell-cycle networks which govern cell growth and proliferation. Understanding the common structure of cell-cycle networks will be of great benefit to science research. Here, inspired by the importance of the cell-cycle regulatory network of yeast which has been studied intensively, we focus on small networks with 11 nodes, equivalent to that of the cell-cycle regulatory network used by Li et al. [Proc. Natl. Acad. Sci. USA 101(2004)4781] Using a Boolean model, we study the correlation between structure and function, and a possible common structure. It is found that cascade-like networks with a great number of interactions between nodes are stable. Based on these findings, we are able to construct synthetic networks that have the same functions as the cell-cycle regulatory network. (condensed matter: structure, mechanical and thermal properties)

Fulltext PDF

Indian Academy of Sciences (India)

Shannon's special talents in mathematics and engineering were evident right from childhood. His best subjects in ... studied symbolic logic and Boolean algebra, and he now realized ... tributions to the area of artificial intelligence. He wrote a ...

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

Science.gov (United States)

Bandyopadhyay, Sanghamitra; Mallik, Saurav

2018-01-01

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

Proposition algebra

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2011-01-01

Sequential propositional logic deviates from conventional propositional logic by taking into account that during the sequential evaluation of a propositional statement, atomic propositions may yield different Boolean values at repeated occurrences. We introduce "free valuations" to capture this

Browsing and Querying in Online Documentation:A Study of User Interfaces and the Interaction Process

DEFF Research Database (Denmark)

Hertzum, Morten; Frøkjær, Erik

1996-01-01

A user interface study concerning the usage effectiveness of selected retrieval modes was conducted using an experimental text retrieval system, TeSS, giving access to online documentation of certain programming tools. Four modes of TeSS were compared: (1) browsing, (2) conventional boolean....... In the experiment the use of printed manuals is faster and provides answers of higher quality than any of the electronic modes. Therefore, claims about the effectiveness of computer-based text retrieval have to be wary in situations where printed manuals are manageable to the users. Among the modes of Te......SS, browsing is the fastest and the one causing fewest operational errors. On the same two variables, time and operational errors, the Venn diagram mode performs better than conventional boolean retrieval. The combined mode scores worst on the objective performance measures; nonetheless nearly all subjects...

Atomic effect algebras with compression bases

International Nuclear Information System (INIS)

Caragheorgheopol, Dan; Tkadlec, Josef

2011-01-01

Compression base effect algebras were recently introduced by Gudder [Demonstr. Math. 39, 43 (2006)]. They generalize sequential effect algebras [Rep. Math. Phys. 49, 87 (2002)] and compressible effect algebras [Rep. Math. Phys. 54, 93 (2004)]. The present paper focuses on atomic compression base effect algebras and the consequences of atoms being foci (so-called projections) of the compressions in the compression base. Part of our work generalizes results obtained in atomic sequential effect algebras by Tkadlec [Int. J. Theor. Phys. 47, 185 (2008)]. The notion of projection-atomicity is introduced and studied, and several conditions that force a compression base effect algebra or the set of its projections to be Boolean are found. Finally, we apply some of these results to sequential effect algebras and strengthen a previously established result concerning a sufficient condition for them to be Boolean.

Mode automata and their compilation into fault trees

International Nuclear Information System (INIS)

Rauzy, Antoine

2002-01-01

In this article, we advocate the use of mode automata as a high level representation language for reliability studies. Mode automata are states/transitions based representations with the additional notion of flow. They can be seen as a generalization of both finite capacity Petri nets and block diagrams. They can be assembled into hierarchies by means of composition operations. The contribution of this article is twofold. First, we introduce mode automata and we discuss their relationship with other formalisms. Second, we propose an algorithm to compile mode automata into Boolean equations (fault trees). Such a compilation is of interest for two reasons. First, assessment tools for Boolean models are much more efficient than those for states/transitions models. Second, the automated generation of fault trees from higher level representations makes easier their maintenance through the life cycle of systems under study

Pencarian Informasi Wisata Daerah Bali Menggunakan Teknologi Chatbot

Directory of Open Access Journals (Sweden)

I Nyoman Satria Paliwahet

2017-12-01

Full Text Available Bali is famous for its culture, tradition, natural beauty in it. Domestic and foreign tourists are interested to visit the island of Bali as a tourist destination. Information about tourism on the island of Bali is often found from various media such as websites, newspapers, advertisements and so on that takes time in the search. Chatbot is a system based on chat that is able to answer questions in accordance with the ability implanted in it. The implementation of chatbot provides more efficient information in getting information. Chatbot designed using a matching question scheme with an existing pattern on chatbot knowledge. Pattern matching in this chatbot using one feature of MySQL that is Fulltext Search Boolean Mode. The results achieved is the application of chatbot tourist information using Fulltext Search Boolean Mode successfully applied well.

Bibliographic Instruction in the 21st Century.

Science.gov (United States)

Poirier, Gayle

2000-01-01

Discusses bibliographic instruction in libraries. Topics include a history of bibliographic instruction; the Internet and electronic searching; librarians' use of technology; defining information needs; locating and accessing information, including classification systems and Boolean searching; evaluating information; using and communication…

Algorithms and programs for evaluating fault trees with multi-state components

International Nuclear Information System (INIS)

Wickenhaeuser, A.

1989-07-01

Part 1 and 2 of the report contain a summary overview of methods and algorithms for the solution of fault tree analysis problems. The following points are treated in detail: Treatment of fault tree components with more than two states. Acceleration of the solution algorithms. Decomposition and modularization of extensive systems. Calculation of the structural function and the exact occurrence probability. Treatment of statistical dependencies. A flexible tool to be employed in solving these problems is the method of forming Boolean variables with restrictions. In this way, components with more than two states can be treated, the possibilities of forming modules expanded, and statistical dependencies treated. Part 3 contains descriptions of the MUSTAFA, MUSTAMO, PASPI, and SIMUST computer programs based on these methods. (orig./HP) [de

Constraint programming for modelling and solving modal satisfiability

NARCIS (Netherlands)

Brand, S.; Gennari, R.; de Rijke, M.

2003-01-01

We explore to what extent and how efficiently constraint programmingcan be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfactionproblems with non-boolean domains, together with suitable constraints.Experiments show that the

Meta-Search Utilizing Evolitionary Recommendation: A Web Search Architecture Proposal

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Keyhanipour, A.; Krömer, P.; Moshiri, B.; Owais, S.; Snášel, V.

2008-01-01

Roč. 33, - (2008), s. 189-200 ISSN 1870-4069 Institutional research plan: CEZ:AV0Z10300504 Keywords : web search * meta-search engine * intelligent re-ranking * ordered weighted averaging * Boolean search queries optimizing Subject RIV: IN - Informatics, Computer Science

Proposition algebra with projective limits

NARCIS (Netherlands)

Bergstra, J.A.; Ponse, A.

2008-01-01

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a proposition, atomic propositions may yield different Boolean values at repeated occurrences. We introduce `free reactive valuations' to capture this dynamics of

Methods in Logic Based Control

DEFF Research Database (Denmark)

Christensen, Georg Kronborg

1999-01-01

Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...

Efficient Multi-Party Computation over Rings

DEFF Research Database (Denmark)

Cramer, Ronald; Fehr, Serge; Ishai, Yuval

2003-01-01

Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented by ...... the usefulness of the above results by presenting a novel application of MPC over (non-field) rings to the round-efficient secure computation of the maximum function. Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.......Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented...... by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these techniques: – Generality. Existing protocols do not apply to computation over more general algebraic structures (except via a brute-force simulation of computation in these structures). – Efficiency. The best...

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-01-01

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

KAUST Repository

Hussain, Shahid

2016-07-10

This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.

Number theoretic methods in cryptography complexity lower bounds

CERN Document Server

Shparlinski, Igor

1999-01-01

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de­ grees and orders of • polynomials; • algebraic functions; • Boolean functions; • linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf­ ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right­ most bit of the discrete logarithm and defines whether the argument is a quadratic...

Boolean Operations, Joins, and the Extended Low Hierarchy

OpenAIRE

Hemaspaandra, Lane A.; Jiang, Zhigen; Rothe, Joerg; Watanabe, Osamu

1999-01-01

We prove that the join of two sets may actually fall into a lower level of the extended low hierarchy than either of the sets. In particular, there exist sets that are not in the second level of the extended low hierarchy, EL_2, yet their join is in EL_2. That is, in terms of extended lowness, the join operator can lower complexity. Since in a strong intuitive sense the join does not lower complexity, our result suggests that the extended low hierarchy is unnatural as a complexity measure. We...

Reconfigurable Boolean logic using magnetic single-electron transistors

Czech Academy of Sciences Publication Activity Database

Gonzalez-Zalba, M.F.; Ciccarelli, C.; Zarbo, Liviu; Irvine, A.C.; Campion, R.C.; Gallagher, B. L.; Jungwirth, Tomáš; Ferguson, A.J.; Wunderlich, Joerg

2015-01-01

Roč. 10, č. 4 (2015), e0125142 E-ISSN 1932-6203 R&D Projects: GA MŠk(CZ) LM2011026; GA ČR GB14-37427G EU Projects: European Commission(XE) 268066 - 0MSPIN Institutional support: RVO:68378271 Keywords : single-electron transitor * reconfigurable logic * ferromagnetic semiconductor Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 3.057, year: 2015

Whose side are you on? : Finding solutions in a biased search-tree

NARCIS (Netherlands)

Heule, M.J.H.; Van Maaren, H.

2008-01-01

We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior on unsatisfiable instances. Direction heuristics select which Boolean value to assign to a decision variable. They are

Efficient SAT engines for concise logics: Accelerating proof search for zero-one linear constraint systems

DEFF Research Database (Denmark)

Fränzle, Martin; Herde, Christian

2003-01-01

We investigate the problem of generalizing acceleration techniques as found in recent satisfiability engines for conjunctive normal forms (CNFs) to linear constraint systems over the Booleans. The rationale behind this research is that rewriting the propositional formulae occurring in e.g. bounde...

Request language of the JINR information retrieval system

International Nuclear Information System (INIS)

Arnaudov, D.D.; Kozhenkova, Z.I.

1975-01-01

A classification of operating languages of information retreival systems (IRS) is given. A justification is made for the selection of the descriptor no-grammar language for coding documents and queries in the JINR IRS. A Boolean form query minimization algorithm is applied

Fuzzy and rough formal concept analysis: a survey

NARCIS (Netherlands)

Poelmans, J.; Ignatov, D.I.; Kuznetsov, S.O.; Dedene, G.

2014-01-01

Formal Concept Analysis (FCA) is a mathematical technique that has been extensively applied to Boolean data in knowledge discovery, information retrieval, web mining, etc. applications. During the past years, the research on extending FCA theory to cope with imprecise and incomplete information made

Strong, weak and branching bisimulation for transition systems and Markov reward chains: A unifying matrix approach

NARCIS (Netherlands)

Trcka, N.; Andova, S.; McIver, A.; D'Argenio, P.; Cuijpers, P.J.L.; Markovski, J.; Morgan, C.; Núñez, M.

2009-01-01

We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic apparatus. Next we consider Markov reward chains which are

Data Auditor: Analyzing Data Quality Using Pattern Tableaux

Science.gov (United States)

Srivastava, Divesh

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

Genetic Network Inference: From Co-Expression Clustering to Reverse Engineering

Science.gov (United States)

Dhaeseleer, Patrik; Liang, Shoudan; Somogyi, Roland

2000-01-01

Advances in molecular biological, analytical, and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using high-throughput gene expression assays, we are able to measure the output of the gene regulatory network. We aim here to review datamining and modeling approaches for conceptualizing and unraveling the functional relationships implicit in these datasets. Clustering of co-expression profiles allows us to infer shared regulatory inputs and functional pathways. We discuss various aspects of clustering, ranging from distance measures to clustering algorithms and multiple-duster memberships. More advanced analysis aims to infer causal connections between genes directly, i.e., who is regulating whom and how. We discuss several approaches to the problem of reverse engineering of genetic networks, from discrete Boolean networks, to continuous linear and non-linear models. We conclude that the combination of predictive modeling with systematic experimental verification will be required to gain a deeper insight into living organisms, therapeutic targeting, and bioengineering.

Discrete ternary particle swarm optimization for area optimization of MPRM circuits

International Nuclear Information System (INIS)

Yu Haizhen; Wang Pengjun; Wang Disheng; Zhang Huihong

2013-01-01

Having the advantage of simplicity, robustness and low computational costs, the particle swarm optimization (PSO) algorithm is a powerful evolutionary computation tool for synthesis and optimization of Reed-Muller logic based circuits. Exploring discrete PSO and probabilistic transition rules, the discrete ternary particle swarm optimization (DTPSO) is proposed for mixed polarity Reed-Muller (MPRM) circuits. According to the characteristics of mixed polarity OR/XNOR expression, a tabular technique is improved, and it is applied in the polarity conversion of MPRM functions. DTPSO is introduced to search the best polarity for an area of MPRM circuits by building parameter mapping relationships between particles and polarities. The computational results show that the proposed DTPSO outperforms the reported method using maxterm conversion starting from POS Boolean functions. The average saving in the number of terms is about 11.5%; the algorithm is quite efficient in terms of CPU time and achieves 12.2% improvement on average. (semiconductor integrated circuits)

Set operads in combinatorics and computer science

CERN Document Server

Méndez, Miguel A

2015-01-01

This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on species, product, sum, substitution and derivative, are simple and natural. They were designed as the set theoretical counterparts of the homonym operations on exponential generating functions, giving an immediate insight on the combinatorial meaning of them. The second objective is more ambitious. Before formulating it, authors present a brief historic account on the sources of decomposition theory. For more than forty years decompositions of discrete structures have been studied in different branches of discrete mathematics: combinatorial optimization, network and graph theory, switching design or boolean functions, simple multi-person games and clutters, etc.

News from the Library: Knovel trial period

CERN Multimedia

CERN Library

2014-01-01

Knovel is a Web-based database integrating technical information with analytical and search tools. It is specifically aimed at the engineering community, offering validated content derived from the most trusted sources.   Knovel combines the functionalities of an e-book platform and a search engine querying a plurality of online databases. These functionalities are complemented by analytical tools that permit the extraction and manipulation of data from e-book content. Knovelʼs tools - including its interactive tables and graphs - not only help users to find information hidden in complex graphs, equations and tables quickly, but also to analyse and manipulate data as easily as sorting a spreadsheet. Using either simple keywords or full Boolean queries, Knovel searches across different data sets to find the information engineers need, however deeply it may be buried. For more information please visit why.knovel.com and the corresponding Youtube channel. A trial period of Knovel for the whol...

Network-based identification of biomarkers coexpressed with multiple pathways.

Science.gov (United States)

Guo, Nancy Lan; Wan, Ying-Wooi

2014-01-01

Unraveling complex molecular interactions and networks and incorporating clinical information in modeling will present a paradigm shift in molecular medicine. Embedding biological relevance via modeling molecular networks and pathways has become increasingly important for biomarker identification in cancer susceptibility and metastasis studies. Here, we give a comprehensive overview of computational methods used for biomarker identification, and provide a performance comparison of several network models used in studies of cancer susceptibility, disease progression, and prognostication. Specifically, we evaluated implication networks, Boolean networks, Bayesian networks, and Pearson's correlation networks in constructing gene coexpression networks for identifying lung cancer diagnostic and prognostic biomarkers. The results show that implication networks, implemented in Genet package, identified sets of biomarkers that generated an accurate prediction of lung cancer risk and metastases; meanwhile, implication networks revealed more biologically relevant molecular interactions than Boolean networks, Bayesian networks, and Pearson's correlation networks when evaluated with MSigDB database.

Connections among quantum logics

International Nuclear Information System (INIS)

Lock, P.F.; Hardegree, G.M.

1985-01-01

In this paper, a theory of quantum logics is proposed which is general enough to enable us to reexamine a previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which are incorporated are divided into two groups which we call ''quantum propositional logics'' and ''quantum event logics''. The work of Kochen and Specker (partial Boolean algebras) is included and so is that of Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics, In this part of the paper, an axiom system for quantum propositional logics is developed and the above structures in the context of this system examined. (author)

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

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

2010-07-01

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

On hardness of multilinearization, and VNP-completeness in characteristics 2

Czech Academy of Sciences Publication Activity Database

Hrubeš, Pavel

2016-01-01

Roč. 9, č. 1 (2016), č. článku 1. ISSN 1942-3454 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : boolean formula * complexity measure Subject RIV: BA - General Mathematics http://dl.acm.org/ citation .cfm?doid=3007903.2940323

Binary Positive Semidefinite Matrices and Associated Integer Polytopes

DEFF Research Database (Denmark)

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

2012-01-01

We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...

New Approaches to Practical Secure Two-Party Computation

DEFF Research Database (Denmark)

Nordholt, Peter Sebastian

all practical protocols with malicious security were based on Yao’s garbled circuits. We report on an implementation of this protocol demonstrating its high efficiency. For larger circuits it evaluates 20000 Boolean gates per second. As an example, evaluating one oblivious AES encryption (around 34000...

Fuzzy Information Retrieval Using Genetic Algorithms and Relevance Feedback.

Science.gov (United States)

Petry, Frederick E.; And Others

1993-01-01

Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12…

Fuzzy: Much more than mere adjective

International Nuclear Information System (INIS)

Mezzalira, G.

1993-01-01

A new logic, radically different from the boolean one, is taking root above all in the sector of instrumentation and industrial controls. This paper discusses the impacts on the instrumentation sector of this approach which seems particularly ideal to face complex or undefined problems

Quantum mechanics over sets

Science.gov (United States)

Ellerman, David

2014-03-01

In models of QM over finite fields (e.g., Schumacher's ``modal quantum theory'' MQT), one finite field stands out, Z2, since Z2 vectors represent sets. QM (finite-dimensional) mathematics can be transported to sets resulting in quantum mechanics over sets or QM/sets. This gives a full probability calculus (unlike MQT with only zero-one modalities) that leads to a fulsome theory of QM/sets including ``logical'' models of the double-slit experiment, Bell's Theorem, QIT, and QC. In QC over Z2 (where gates are non-singular matrices as in MQT), a simple quantum algorithm (one gate plus one function evaluation) solves the Parity SAT problem (finding the parity of the sum of all values of an n-ary Boolean function). Classically, the Parity SAT problem requires 2n function evaluations in contrast to the one function evaluation required in the quantum algorithm. This is quantum speedup but with all the calculations over Z2 just like classical computing. This shows definitively that the source of quantum speedup is not in the greater power of computing over the complex numbers, and confirms the idea that the source is in superposition.

High-Density Liquid-State Machine Circuitry for Time-Series Forecasting.

Science.gov (United States)

Rosselló, Josep L; Alomar, Miquel L; Morro, Antoni; Oliver, Antoni; Canals, Vincent

2016-08-01

Spiking neural networks (SNN) are the last neural network generation that try to mimic the real behavior of biological neurons. Although most research in this area is done through software applications, it is in hardware implementations in which the intrinsic parallelism of these computing systems are more efficiently exploited. Liquid state machines (LSM) have arisen as a strategic technique to implement recurrent designs of SNN with a simple learning methodology. In this work, we show a new low-cost methodology to implement high-density LSM by using Boolean gates. The proposed method is based on the use of probabilistic computing concepts to reduce hardware requirements, thus considerably increasing the neuron count per chip. The result is a highly functional system that is applied to high-speed time series forecasting.

Fault tree analysis. Implementation of the WAM-codes

International Nuclear Information System (INIS)

Bento, J.P.; Poern, K.

1979-07-01

The report describes work going on at Studsvik at the implementation of the WAM code package for fault tree analysis. These codes originally developed under EPRI contract by Sciences Applications Inc, allow, in contrast with other fault tree codes, all Boolean operations, thus allowing modeling of ''NOT'' conditions and dependent components. To concretize the implementation of these codes, the auxiliary feed-water system of the Swedish BWR Oskarshamn 2 was chosen for the reliability analysis. For this system, both the mean unavailability and the probability density function of the top event - undesired event - of the system fault tree were calculated, the latter using a Monte-Carlo simulation technique. The present study is the first part of a work performed under contract with the Swedish Nuclear Power Inspectorate. (author)

Simulations of fluid flow through porous media based on cellular automata and non-linear dynamics

Energy Technology Data Exchange (ETDEWEB)

Paulson, K V

1992-05-15

A study is being carried out to apply cellular automata and non-linear dynamics in the construction of efficient and accurate computer simulations of multiphase fluid flow through porous media, with the objective of application to reservoir modelling for hydrocarbon recovery. An algorithm based on Boolean operations has been developed which transforms a PC clone into a highly efficient vector processor capable of cellular automata simulation of single fluid flow through two-dimensional rock matrix models of varying porosities. Macroscopic flow patterns have been established through spatial and temporal averaging with no floating point operations. Permeabilities of the different models have been calculated. Hardware allows the algorithm to function on dual processors on a PC platform using a video recording and editing facility. Very encouraging results have been obtained. 4 figs.

A High-Level Petri Net Framework for Genetic Regulatory Networks

Directory of Open Access Journals (Sweden)

Banks Richard

2007-12-01

Full Text Available To understand the function of genetic regulatory networks in the development of cellular systems, we must not only realise the individual network entities, but also the manner by which they interact. Multi-valued networks are a promising qualitative approach for modelling such genetic regulatory networks, however, at present they have limited formal analysis techniques and tools. We present a flexible formal framework for modelling and analysing multi-valued genetic regulatory networks using high-level Petri nets and logic minimization techniques. We demonstrate our approach with a detailed case study in which part of the genetic regulatory network responsible for the carbon starvation stress response in Escherichia coli is modelled and analysed. We then compare and contrast this multivalued model to a corresponding Boolean model and consider their formal relationship.

Survivability of systems under multiple factor impact

International Nuclear Information System (INIS)

Korczak, Edward; Levitin, Gregory

2007-01-01

The paper considers vulnerable multi-state series-parallel systems operating under influence of external impacts. Both the external impacts and internal failures affect system survivability, which is determined as the probability of meeting a given demand. The external impacts are characterized by several destructive factors affecting the system or its parts simultaneously. In order to increase the system's survivability a multilevel protection against the destructive factors can be applied to its subsystems. In such systems, the protected subsystems can be destroyed only if all of the levels of their protection are destroyed. The paper presents an algorithm for evaluating the survivability of series-parallel systems with arbitrary configuration of multilevel protection against multiple destructive factor impacts. The algorithm is based on a composition of Boolean and the Universal Generating Function techniques. Illustrative examples are presented

Noise-induced multistability in the regulation of cancer by genes and pseudogenes

Energy Technology Data Exchange (ETDEWEB)

Petrosyan, K. G., E-mail: pkaren@phys.sinica.edu.tw [Institute of Physics, Academia Sinica, Nankang, Taipei 11529, Taiwan (China); Hu, Chin-Kun, E-mail: huck@phys.sinica.edu.tw [Institute of Physics, Academia Sinica, Nankang, Taipei 11529, Taiwan (China); National Center for Theoretical Sciences, National Tsing Hua University, Hsinchu 30013, Taiwan (China); Business School, University of Shanghai for Science and Technology, Shanghai 200093 (China)

2016-07-28

We extend a previously introduced model of stochastic gene regulation of cancer to a nonlinear case having both gene and pseudogene messenger RNAs (mRNAs) self-regulated. The model consists of stochastic Boolean genetic elements and possesses noise-induced multistability (multimodality). We obtain analytical expressions for probabilities for the case of constant but finite number of microRNA molecules which act as a noise source for the competing gene and pseudogene mRNAs. The probability distribution functions display both the global bistability regime as well as even-odd number oscillations for a certain range of model parameters. Statistical characteristics of the mRNA’s level fluctuations are evaluated. The obtained results of the extended model advance our understanding of the process of stochastic gene and pseudogene expressions that is crucial in regulation of cancer.

Alternative probability theories for cognitive psychology.

Science.gov (United States)

Narens, Louis

2014-01-01

Various proposals for generalizing event spaces for probability functions have been put forth in the mathematical, scientific, and philosophic literatures. In cognitive psychology such generalizations are used for explaining puzzling results in decision theory and for modeling the influence of context effects. This commentary discusses proposals for generalizing probability theory to event spaces that are not necessarily boolean algebras. Two prominent examples are quantum probability theory, which is based on the set of closed subspaces of a Hilbert space, and topological probability theory, which is based on the set of open sets of a topology. Both have been applied to a variety of cognitive situations. This commentary focuses on how event space properties can influence probability concepts and impact cognitive modeling. Copyright © 2013 Cognitive Science Society, Inc.

Classes of feedforward neural networks and their circuit complexity

NARCIS (Netherlands)

Shawe-Taylor, John S.; Anthony, Martin H.G.; Kern, Walter

1992-01-01

This paper aims to place neural networks in the context of boolean circuit complexity. We define appropriate classes of feedforward neural networks with specified fan-in, accuracy of computation and depth and using techniques of communication complexity proceed to show that the classes fit into a

On the Combinatorics of SAT and the Complexity of Planar Problems

DEFF Research Database (Denmark)

Talebanfard, Navid

In this thesis we study several problems arising in Boolean satisfiability ranging from lower bounds for SAT algorithms and proof systems to extremal properties of formulas. The first problem is about construction of hard instances for k-SAT algorithms. For PPSZ algorithm [40] we give the first...

Learning context conditions for BDI plan selection

NARCIS (Netherlands)

Singh, D.; Sardina, S.; Padgham, L.; Airiau, S.; van der Hoek, W.; Kaminka, G.A.; Lespérance, Y.; Luck, M.; Sen, S.

2010-01-01

An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-called context conditions of plans, on which the whole model relies for plan selection, are restricted to be boolean formulas

Fail-safe logic elements for use with reactor safety systems

International Nuclear Information System (INIS)

Bobis, J.P.; McDowell, W.P.

1976-01-01

A complete fail-safe trip circuit is described which utilizes fail-safe logic elements. The logic elements used are analog multipliers and active bandpass filter networks. These elements perform Boolean operations on a set of AC signals from the output of a reactor safety-channel trip comparator

Handelman's hierarchy for the maximum stable set problem

NARCIS (Netherlands)

Laurent, M.; Sun, Z.

2014-01-01

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a

Visualisation of unbuilt buildings in their landscape

DEFF Research Database (Denmark)

Howard, Robert; Petersen, Ernst Steffen

1999-01-01

Computer modelling can provide better information on building projects presented in two dimensional drawings but never built. A cemetery project in Denmark was formed as a solid model in its sloping landscape using Softimage. Boolean operations were used to position walls at a given height above...

Library Dream Machines: Helping Students Master Super Online Catalogs.

Science.gov (United States)

Webb, T. D.

1992-01-01

Describes how automation has transformed the library and how super-catalogs have affected the process of doing research. Explains how faculty and librarians can work together to help students to use the available databases effectively, by teaching them Boolean logic, standard record formats, filing rules, etc. (DMM)

Generating and Solving Symbolic Parity Games

NARCIS (Netherlands)

Kant, Gijs; van de Pol, Jan Cornelis

We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System (PBES) and then instantiates the PBES to a parity game. We

Creating Büchi automata for multi-valued model checking

NARCIS (Netherlands)

Vijzelaar, Stefan J.J.; Fokkink, Wan J.

2017-01-01

In explicit state model checking of linear temporal logic properties, a Büchi automaton encodes a temporal property. It interleaves with a Kripke model to form a state space, which is searched for counterexamples. Multi-valued model checking considers additional truth values beyond the Boolean true

Analysis of signature wrapping attacks and countermeasures

DEFF Research Database (Denmark)

Gajek, Sebastian; Jensen, Meiko; Liao, Lijun

2009-01-01

In recent research it turned out that Boolean verification, of digital signatures in the context of WSSecurity, is likely to fail: If parts of a SOAP message, are signed and the signature verification applied to, the whole document returns true, then nevertheless the, document may have been...

On Attributes, Roles, and Dependencies in Description Logics and the Ackermann Case of the Decision Problem

DEFF Research Database (Denmark)

Toman, David; Weddel, Grant Edwin

2001-01-01

We present a decision procedure for the logical implication problem of a boolean complete DL dialect that includes attributes roles inverse roles and a new concept constructor that is capable of expressing a variety of equality and order generating dependencies The procedure underlies a mapping o...

Weak Distributivity. A Problem of von Neumann and the Mystery of Measurability

Czech Academy of Sciences Publication Activity Database

Balcar, Bohuslav; Jech, Thomas

2006-01-01

Roč. 12, č. 2 (2006), s. 241-266 ISSN 1079-8986 R&D Projects: GA AV ČR(CZ) IAA100190509 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * weak distributivity * submeasure Subject RIV: BA - General Mathematics Impact factor: 0.525, year: 2006

Rigid Bodies in Contact

DEFF Research Database (Denmark)

Niebe, Sarah Maria

. A contact point determination method, based on boolean surface maps, is developed to handle collisions between tetrahedral meshes. The novel nonsmooth nonlinear conjugate gradient (NNCG) method is presented. The NNCG method is comparable in terms of accuracy to the state-of-the-art method, projected Gauss...

Incorporating fuzzy data and logical relations in the design of expert systems for nuclear reactors

International Nuclear Information System (INIS)

Guth, M.A.S.

1987-01-01

This paper applies the method of assigning probability in Dempster-Shafer Theory (DST) to the components of rule-based expert systems used in the control of nuclear reactors. Probabilities are assigned to premises, consequences, and rules themselves. This paper considers how uncertainty can propagate through a system of Boolean equations, such as fault trees or expert systems. The probability masses assigned to primary initiating events in the expert system can be derived from observing a nuclear reactor in operation or based on engineering knowledge of the reactor parts. Use of DST mass assignments offers greater flexibility to the construction of expert systems in two important respects. First, DST mass assignments have the advantage over classical probability methods of accommodating when necessary uncommitted probability assignments. Thus the DST probability framework can incorporate expert system inputs from imprecise or fuzzy data. Second, DST applied to the Boolean rules themselves leads to a probabilistic logic, where a given rule may be valid with probability less than unity: fuzzy logical rules

Characteristics of a Circular Logic and Its Treatment

International Nuclear Information System (INIS)

Lim, Ho-Gon; Han, Sang-Hoon; Yang, Joon Eon

2007-01-01

A circular logic or a logical loop is defined as the infinite circulation of supporting relations due to their mutual dependencies among the systems in the Fault Tree Analysis (FTA). While many methods to break the circular logic have been developed and used in the fault tree quantification codes, the general solution for a circular logic and its breaking methods are not generally known as yet. This paper presents an analytic solution for circular logics in which the systems are linearly interrelated with each other. Then, a general treatment of circular logics is discussed. To formulate the analytic solution, the relations among systems in the fault tree structure are described by the Boolean equations. The solution is, then, obtained from the successive substitutions of the Boolean equations, which is equivalent to the attaching processes of interrelated system's fault tree to a given fault tree. The solution for three interrelated systems and their independent fault tree structures are given as an example

Simultaneous G-Quadruplex DNA Logic.

Science.gov (United States)

Bader, Antoine; Cockroft, Scott L

2018-04-03

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

Patterns of probabilistic evaluation of the maintenance

International Nuclear Information System (INIS)

Torres V, A.; Rivero O, J.J.

2004-01-01

The Boolean equation represented by the minimum sets of court at level of a system or of all one Probabilistic safety analysis (APS) it has been used for to evaluate the output configurations of service of teams during the exploitation. It has been carried out through applications of APS for the optimization of operational regimes. The obtaining of such boolean equations as demands of a process of high mathematical complexity for what exhaustive studies are required, even for the application of their results. The important advantages for the maintenance that they obtain of these applications they require the development of methodologies that bring near these optimization methods to the systems of management of the maintenance, and not facilitate their use for a personnel specialized in the probabilistic topics. The article presents a methodology for the preparation, solution and utilization of the results of the fault tree leaving of technological outlines. This algorithm has been automated through the MOSEG code Win to Ver 1.0 (Author)

Pre-quantum mechanics. Introduction to models with hidden variables

International Nuclear Information System (INIS)

Grea, J.

1976-01-01

Within the context of formalism of hidden variable type, the author considers the models used to describe mechanical systems before the introduction of the quantum model. An account is given of the characteristics of the theoretical models and their relationships with experimental methodology. The models of analytical, pre-ergodic, stochastic and thermodynamic mechanics are studied in succession. At each stage the physical hypothesis is enunciated by postulate corresponding to the type of description of the reality of the model. Starting from this postulate, the physical propositions which are meaningful for the model under consideration are defined and their logical structure is indicated. It is then found that on passing from one level of description to another, one can obtain successively Boolean lattices embedded in lattices of continuous geometric type, which are themselves embedded in Boolean lattices. It is therefore possible to envisage a more detailed description than that given by the quantum lattice and to construct it by analogy. (Auth.)

Patterns of probabilistic evaluation of the maintenance; Patrones de Evaluacion Probabilista del Mantenimiento

Energy Technology Data Exchange (ETDEWEB)

Torres V, A.; Rivero O, J.J. [Dpto. Ingenieria Nuclear, Instituto Superior de Tecnologias y Ciencias Aplicadas, Ave. Salvador Allende y Luaces, Quinta de los Molinos, Plaza, Ciudad Habana (Cuba)]. e-mail: atorres@fctn.isctn.edu.cu

2004-07-01

The Boolean equation represented by the minimum sets of court at level of a system or of all one Probabilistic safety analysis (APS) it has been used for to evaluate the output configurations of service of teams during the exploitation. It has been carried out through applications of APS for the optimization of operational regimes. The obtaining of such boolean equations as demands of a process of high mathematical complexity for what exhaustive studies are required, even for the application of their results. The important advantages for the maintenance that they obtain of these applications they require the development of methodologies that bring near these optimization methods to the systems of management of the maintenance, and not facilitate their use for a personnel specialized in the probabilistic topics. The article presents a methodology for the preparation, solution and utilization of the results of the fault tree leaving of technological outlines. This algorithm has been automated through the MOSEG code Win to Ver 1.0 (Author)

A Study of Search Intermediary Working Notes: Implications for IR System Design.

Science.gov (United States)

Spink, Amanda; Goodrum, Abby

1996-01-01

Reports findings from an exploratory study investigating working notes created during encoding and external storage (EES) processes by human search intermediaries (librarians at the University of North Texas) using a Boolean information retrieval (IR) system. Implications for the design of IR interfaces and further research is discussed.…

An MTIDD based firewall

DEFF Research Database (Denmark)

Christiansen, Mikkel; Fleury, Emmanuel

2004-01-01

benefits of the IDD structure are that it provides access to boolean algebra over filters, efficient classification time, and potentially a compact representation. Results from the empirical evaluation shows that IDDs are scalable in terms of memory usage: a 50,000 rule filter requires only 3MB of memory...

Bivium as a Mixed Integer Programming Problem

DEFF Research Database (Denmark)

Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias

2009-01-01

over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...

Probabilistic Relational Structures and Their Applications

Science.gov (United States)

Domotor, Zoltan

The principal objects of the investigation reported were, first, to study qualitative probability relations on Boolean algebras, and secondly, to describe applications in the theories of probability logic, information, automata, and probabilistic measurement. The main contribution of this work is stated in 10 definitions and 20 theorems. The basic…

Defining the Symmetry of the Universal Semi-Regular Autonomous Asynchronous Systems

Directory of Open Access Journals (Sweden)

Serban E. Vlad

2012-02-01

Full Text Available The regular autonomous asynchronous systems are the non-deterministic Boolean dynamical systems and universality means the greatest in the sense of the inclusion. The paper gives four definitions of symmetry of these systems in a slightly more general framework, called semi-regularity, and also many examples.

"Back-Stage" Dissent: Student Twitter Use Addressing Instructor Ideology

Science.gov (United States)

Linvill, Darren L.; Boatwright, Brandon C.; Grant, Will J.

2018-01-01

In this content analysis, we explored how students address instructor ideology in the university classroom through the social media platform Twitter. We employed Boolean search operators through Salesforce Marketing Cloud Radian6 software to gather tweets and identified English language tweets by how students referenced their instructor's…

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

Science.gov (United States)

Karl, Stefan; Dandekar, Thomas

2013-10-11

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

Discriminate the response of Acute Myeloid Leukemia patients to treatment by using proteomics data and Answer Set Programming.

Science.gov (United States)

Chebouba, Lokmane; Miannay, Bertrand; Boughaci, Dalila; Guziolowski, Carito

2018-03-08

During the last years, several approaches were applied on biomedical data to detect disease specific proteins and genes in order to better target drugs. It was shown that statistical and machine learning based methods use mainly clinical data and improve later their results by adding omics data. This work proposes a new method to discriminate the response of Acute Myeloid Leukemia (AML) patients to treatment. The proposed approach uses proteomics data and prior regulatory knowledge in the form of networks to predict cancer treatment outcomes by finding out the different Boolean networks specific to each type of response to drugs. To show its effectiveness we evaluate our method on a dataset from the DREAM 9 challenge. The results are encouraging and demonstrate the benefit of our approach to distinguish patient groups with different response to treatment. In particular each treatment response group is characterized by a predictive model in the form of a signaling Boolean network. This model describes regulatory mechanisms which are specific to each response group. The proteins in this model were selected from the complete dataset by imposing optimization constraints that maximize the difference in the logical response of the Boolean network associated to each group of patients given the omic dataset. This mechanistic and predictive model also allow us to classify new patients data into the two different patient response groups. We propose a new method to detect the most relevant proteins for understanding different patient responses upon treatments in order to better target drugs using a Prior Knowledge Network and proteomics data. The results are interesting and show the effectiveness of our method.

An algorithm for reliability analysis of phased-mission systems

International Nuclear Information System (INIS)

Ma, Y.; Trivedi, K.S.

1999-01-01

The purpose of this paper is to describe an efficient Boolean algebraic algorithm that provides exact solution to the unreliability of a multi-phase mission system where the configurations are described through fault trees. The algorithm extends and improves the Boolean method originally proposed by Somani and Trivedi. By using the Boolean algebraic method, we provide an efficient modeling approach which avoids the state space explosion and the mapping problems that are encountered by the Markov chain approach. To calculate the exact solution of the phased-mission system with deterministic phase durations, we introduce the sum of disjoint phase products (SDPP) formula, which is a phased-extension of the sum of disjoint products (SDP) formula. Computationally, the algorithm is quite efficient because it calls an SDP generation algorithm in the early stage of the SDPP computation. In this way, the phase products generated in the early stage of the SDPP formula are guaranteed to be disjoint. Consequently, the number of the intermediate phase products is greatly reduced. In this paper, we also consider the transient analysis of the phased-mission system. Special care is needed to account for the possible latent failures at the mission phase change times. If there are more stringent success criteria just after a mission phase change time, an unreliability jump would occur at that time. Finally, the algorithm has been implemented in the software package SHARPE. With SHARPE, the complexities of the phased-mission system is made transparent to the potential users. The user can conveniently specify a phased-mission model at a high level (through fault trees) and analyze the system quantitatively

A New One-Pass Transformation into Monadic Normal Form

DEFF Research Database (Denmark)

Danvy, Olivier

2003-01-01

We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pass, duplicates no code, generates no chains of thunks, and is properly tail recursive. It makes a crucial use of symbolic...

Introducing Online Bibliographic Service to its Users: The Online Presentation

Science.gov (United States)

Crane, Nancy B.; Pilachowski, David M.

1978-01-01

A description of techniques for introducing online services to new user groups includes discussion of terms and their definitions, evolution of online searching, advantages and disadvantages of online searching, production of the data bases, search strategies, Boolean logic, costs and charges, "do's and don'ts," and a user search questionnaire. (J…

Gaussian width bounds with applications to arithmetic progressions in random settings

NARCIS (Netherlands)

J. Briët (Jop); S. Gopi (Sivakanth)

2017-01-01

textabstractMotivated by two problems on arithmetic progressions (APs)—concerning large deviations for AP counts in random sets and random differences in Szemer´edi’s theorem— we prove upper bounds on the Gaussian width of the image of the n-dimensional Boolean hypercube under a mapping ψ : Rn →

Some open problems in noncommutative probability

International Nuclear Information System (INIS)

Kruszynski, P.

1981-01-01

A generalization of probability measures to non-Boolean structures is discussed. The starting point of the theory is the Gleason theorem about the form of measures on closed subspaces of a Hilbert space. The problems are formulated in terms of probability on lattices of projections in arbitrary von Neumann algebras. (Auth.)