Montanaro, Ashley; Osborne, Tobias J.
2008-01-01
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier coefficients of boolean functions; and two quantum versions of a theorem of Friedgut, Kalai and Naor on the Fourier spectra of boolean functions. In o...
International Nuclear Information System (INIS)
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years
Geometric Operators on Boolean Functions
Frisvad, Jeppe Revall; Falster, Peter
2007-01-01
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propo...
Computational complexity of Boolean functions
International Nuclear Information System (INIS)
Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.
Geometric Operators on Boolean Functions
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter
of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
Evolutionary Design of Boolean Functions
Institute of Scientific and Technical Information of China (English)
WANG Zhang-yi; ZHANG Huan-guo; QIN Zhong-ping; MENG Qing-shu
2005-01-01
We use evolutionary computing to synthesize Boolean functions randomly. By using specific crossover and mutation operator in evolving process and modifying search space and fitness function, we get some high non-linearity functions which have other good cryptography characteristics such as autocorrelation etc. Comparing to other heuristic search techniques, evolutionary computing approach is more effective because of global search strategy and implicit parallelism.
A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas
Morizumi, Hiroki
2008-01-01
In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function $f$ is called the inversion complexity of $f$. In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that $\\lceil \\log_2(n+1) \\rceil$ NOT gates are sufficient to compute any Boolean function on $n$ variables. As far as we...
Progress in Applications of Boolean Functions
Sasao, Tsutomu
2010-01-01
This book brings together five topics on the application of Boolean functions. They are 1. Equivalence classes of Boolean functions: The number of n-variable functions is large, even for values as small as n = 6, and there has been much research on classifying functions. There are many classifications, each with their own distinct merit. 2. Boolean functions for cryptography: The process of encrypting/decrypting plain text messages often depends on Boolean functions with specific properties. For example, highly nonlinear functions are valued because they are less susceptible to linear attacks.
Quantum algorithms for testing Boolean functions
Directory of Open Access Journals (Sweden)
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as speci
Local Correction of Boolean Functions
Alon, Noga
2011-01-01
A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using q queries to g. We observe that any k-junta, that is, any function which depends only on k of its input variables, is O(2^k)-locally correctable. Moreover, we show that there are examples where this is essentially best possible, and locally correcting some k-juntas requires a number of queries which is exponential in k. These examples, however, are far from being typical, and indeed we prove that for almost every k-junta, O(k log k) queries suffice.
Sensitivity versus block sensitivity of Boolean functions
Virza, Madars
2010-01-01
Determining relationship between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 (s(f))^2+ 1/2 s(f). The best known separation previously was bs(f) = 1/2 (s(f))^2 due to Rubinstein (1995). We also report results of computer search for functions with at most 12 variables.
Boolean-Valued Belief Functions
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2002-01-01
Roč. 31, č. 2 (2002), s. 153-181. ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002
Boolean nested canalizing functions: a comprehensive analysis
Li, Yuan; Murrugarra, David; Aguilar, Boris; Laubenbacher, Reinhard
2012-01-01
Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being nested canalizing, a property inspired by the concept of canalization in evolutionary biology. It has been shown that networks comprised of nested canalizing functions have dynamic properties that make them suitable for modeling molecular regulatory networks, namely a small number of (large) attractors, as well as relatively short limit cycles. This paper contains a detailed analysis of this class of functions, based on a novel normal form as polynomial functions over the Boolean field. The concept of layer is introduced that stratifies variables into different classes depending on their level of dominance. Using this layer concept a closed form formula is derived for the number of nested canalizing functions with a given number of variables. Additional metrics analyzed in...
Algorithms for Boolean Function Query Properties
Aaronson, Scott
2001-01-01
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,' and an O(N) algorithm for `quasisymmetry.' These algorithms are based on new insights into the structure of Boolean functions that may be of independent interest. We also give a subexponential-time algorithm for the space-bounded quantum query complexity of...
Learning Boolean functions with concentrated spectra
Mixon, Dustin G.; Peterson, Jesse
2015-08-01
This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample complexity of learning in this case. Next, we propose a computationally efficient method of empirical risk minimization, and we apply this method to the MNIST database of handwritten digits. These results demonstrate the effectiveness of our model for modern classification tasks. We conclude with a list of open problems for future investigation.
Representations of Boolean Functions by Perceptron Networks
Czech Academy of Sciences Publication Activity Database
Kůrková, Věra
Prague : Institute of Computer Science AS CR, 2014 - (Kůrková, V.; Bajer, L.; Peška, L.; Vojtáš, R.; Holeňa, M.; Nehéz, M.), s. 68-70 ISBN 978-80-87136-19-5. [ITAT 2014. European Conference on Information Technologies - Applications and Theory /14./. Demänovská dolina (SK), 25.09.2014-29.09.2014] R&D Projects: GA MŠk(CZ) LD13002 Institutional support: RVO:67985807 Keywords : perceptron networks * model complexity * Boolean functions Subject RIV: IN - Informatics, Computer Science
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
Stratification and enumeration of Boolean functions by canalizing depth
He, Qijun; Macauley, Matthew
2016-01-01
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively "picked off", until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.
Stratification and enumeration of Boolean functions by canalizing depth
He, Qijun
2015-01-01
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively picked off, until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.
Constructions of vector output Boolean functions with high generalized nonlinearity
Institute of Scientific and Technical Information of China (English)
KE Pin-hui; ZHANG Sheng-yuan
2008-01-01
Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean functions with high generalized nonlinearity using the sample space. The relation between the resilient order and generalized nonlinearity is also discussed.
Polynomial threshold functions and Boolean threshold circuits
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
2013-01-01
secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...... bound for PTFs that holds regardless of degree, thereby extending known lower bounds for THRMAJ circuits. We generalize two-party unbounded error communication complexity to the multi-party number-on-the-forehead setting, and show that communication lower bounds for 3-player protocols would yield size...... lower bounds for THRTHR circuits. We obtain several other results about PTFs. These include relationships between weight and degree of PTFs, and a degree lower bound for PTFs of constant length. We also consider a variant of PTFs over the max-plus algebra. We show that they are connected to PTFs over...
Inadmissible Class of Boolean Functions under Stuck-at Faults
Das, Debesh K.; Chowdhury, Debabani; Bhattacharya, Bhargab B; Sasao, Tsutomu
2013-01-01
Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root functions, which can never appear as faulty response in irredundant two-level circuits even when any arbitrary multiple stuck-at faults are injected. Conversely, we show that any other Boolean function can appear as a faulty response from an irredundant realization ...
Boolean functions with a vertex-transitive group of automorphisms
Czech Academy of Sciences Publication Activity Database
Savický, Petr
-, submitted 2015 (2016) R&D Projects: GA ČR GAP202/10/1333 Institutional support: RVO:67985807 Keywords : Boolean Functions * hypercube * isometric transformation * vertex-transitive group of automorphisms Subject RIV: BA - General Mathematics
Optimal Computation of Symmetric Boolean Functions in Collocated Networks
Kowshik, Hemant
2011-01-01
We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block computation strategies for computing symmetric Boolean functions. We study three classes of functions: threshold functions, delta functions and interval functions. We provide exactly optimal strategies for the first two classes, and a scaling law order-optimal strategy with optimal preconstant for interval functions. We also extend the results to the case of integer measurements and certain integer-valued functions. We use lower bounds from communication complexity theory, and provide an achievable scheme using information theoretic tools. Next, we consider the case where nodes measurements are random and drawn from independent Bernoulli distributions. We address the problem of optimal function computation so as to minimize the expected total number of bits that are transmitted. In ...
On Kolmogorov's superpositions and Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-31
The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.
New Considerations for Spectral Classification of Boolean Switching Functions
Directory of Open Access Journals (Sweden)
J. E. Rice
2011-01-01
Full Text Available This paper presents some new considerations for spectral techniques for classification of Boolean functions. These considerations incorporate discussions of the feasibility of extending this classification technique beyond n=5. A new implementation is presented along with a basic analysis of the complexity of the problem. We also note a correction to results in this area that were reported in previous work.
Constant communication complexity protocols for multiparty accumulative boolean functions
pal, S P; Kumar, S; Das, Sima; Kumar, Somesh; pal, Sudebkumar Prasant
2005-01-01
Generalizing a boolean function from Cleve and Buhrman \\cite{cb:sqec}, we consider the class of {\\it accumulative boolean functions} of the form $f_B(X_1,X_2,..., X_m)=\\bigoplus_{i=1}^n t_B(x_i^1x_i^2... x_i^m)$, where $X_j=(x^j_1,x^j_2,..., x^j_n), 1\\leq j\\leq m$ and $t_B(x_i^1x_i^2... x_i^m)=1$ for input $m$-tuples $x_i^1x_i^2...x_i^m\\in B\\subseteq A\\subseteq \\{0,1\\}^n$, and 0, otherwise. Here the set $A$ is the promise set for function $f_B$. The input vectors $X_j, 1\\leq j\\leq m$ are given to the $m\\geq 2$ parties respectively, who communicate classical bits in a distributed environment so that one of them (say Alice) comes up with the value of the function. We algebraically characterize entanglement assisted LOCC protocols requiring only $m-1$ cbits of communication, for certain classes of such multiparty boolean functions for $m\\geq 2$ parties under appropriate uniform parity promise restrictions on input $m$-tuples $x_i^1x_i^2...x_i^m, 1\\leq i\\leq n$. In contrast, for certain $m$-party accumulative boo...
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Creignou, Nadia; Thomas, Michael
2009-01-01
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional abduction, where the knowledge base and the manifestation are represented by propositional formulae. The problem of deciding whether there exists an explanation has been shown to be SigmaP2-complete in general. We consider variants obtained by restricting the allowed connectives in the formulae to certain sets of Boolean functions. We give a complete classification of the complexity for all considerable sets of Boolean functions. In this way, we identify easier cases, namely NP-complete and polynomial cases; and we highlight sources of intractability. Further, we address the problem of counting the explanations and draw a complete picture for the counting complexity.
Worst-Case Groundness Analysis Using Definite Boolean Functions
Genaim, Samir; Codish, Michael; Howe, Jacob M.
2004-01-01
This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the number of clauses but sub-exponential in the size of the program. For Pos, we strengthen a previous res...
Boolean Functions, Projection Operators and Quantum Error Correcting Codes
Aggarwal, Vaneet; Calderbank, A. Robert
2006-01-01
This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and non-additive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5,6,2)) code found by Rains [21]. It also extends to o...
Boolean Functions with a Simple Certificate for CNF Complexity
Czech Academy of Sciences Publication Activity Database
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382. ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant ostatní: GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Binary higher order neural networks for realizing Boolean functions.
Zhang, Chao; Yang, Jie; Wu, Wei
2011-05-01
In order to more efficiently realize Boolean functions by using neural networks, we propose a binary product-unit neural network (BPUNN) and a binary π-ς neural network (BPSNN). The network weights can be determined by one-step training. It is shown that the addition " σ," the multiplication " π," and two kinds of special weighting operations in BPUNN and BPSNN can implement the logical operators " ∨," " ∧," and " ¬" on Boolean algebra 〈Z(2),∨,∧,¬,0,1〉 (Z(2)={0,1}), respectively. The proposed two neural networks enjoy the following advantages over the existing networks: 1) for a complete truth table of N variables with both truth and false assignments, the corresponding Boolean function can be realized by accordingly choosing a BPUNN or a BPSNN such that at most 2(N-1) hidden nodes are needed, while O(2(N)), precisely 2(N) or at most 2(N), hidden nodes are needed by existing networks; 2) a new network BPUPS based on a collaboration of BPUNN and BPSNN can be defined to deal with incomplete truth tables, while the existing networks can only deal with complete truth tables; and 3) the values of the weights are all simply -1 or 1, while the weights of all the existing networks are real numbers. Supporting numerical experiments are provided as well. Finally, we present the risk bounds of BPUNN, BPSNN, and BPUPS, and then analyze their probably approximately correct learnability. PMID:21427020
Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean Functions
Maitra, S; Maitra, Subhamoy; Mukhopadhyay, Partha
2004-01-01
Boolean functions are important building blocks in cryptography for their wide application in both stream and block cipher systems. For cryptanalysis of such systems one tries to find out linear functions that are correlated to the Boolean functions used in the crypto system. Let $f$ be an $n$-variable Boolean function and its Walsh spectra is denoted by $W_f(\\omega)$ at the point $\\omega \\in \\{0, 1\\}^n$. The Boolean function is available in the form of an oracle. We like to find an $\\omega$ such that $W_f(\\omega) \
Boolean Functions, Quantum Gates, Hamilton Operators, Spin Systems and Computer Algebra
Hardy, Yorick; Steeb, Willi-Hans
2014-01-01
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a quantum gate is also described with the Hamilton operator expressed as spin system. Computer algebra implementations are provided.
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.
2016-07-01
We present a characterization of short-term stability of Kauffman's N K (random) Boolean networks under arbitrary distributions of transfer functions. Given such a Boolean network where each transfer function is drawn from the same distribution, we present a formula that determines whether short-term chaos (damage spreading) will happen. Our main technical tool which enables the formal proof of this formula is the Fourier analysis of Boolean functions, which describes such functions as multilinear polynomials over the inputs. Numerical simulations on mixtures of threshold functions and nested canalyzing functions demonstrate the formula's correctness.
Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions
DEFF Research Database (Denmark)
Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne
2005-01-01
We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic.......We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
Analysis of Boolean Functions based on Interaction Graphs and their influence in System Biology
Das, Jayanta Kumar; Rout, Ranjeet Kumar; Choudhury, Pabitra Pal
2014-01-01
Interaction graphs provide an important qualitative modeling approach for System Biology. This paper presents a novel approach for construction of interaction graph with the help of Boolean function decomposition. Each decomposition part (Consisting of 2-bits) of the Boolean functions has some important significance. In the dynamics of a biological system, each variable or node is nothing but gene or protein. Their regulation has been explored in terms of interaction graphs which are generate...
Automated Method for Building CNOT Based Quantum Circuits for Boolean Functions
Younes, A; Younes, Ahmed; Miller, Julian
2003-01-01
In this paper we discuss an efficient technique that can implement any given Boolean function as a quantum circuit. The method converts a truth table of a Boolean function to the corresponding quantum circuit using a minimal number of auxiliary qubits. We give examples of some circuits synthesized with this technique. A direct result that follows from the technique is a new way to convert any classical digital circuit to its classical reversible form.
Influence and interaction indexes for pseudo-Boolean functions: a unified least squares approach
Marichal, Jean-Luc
2012-01-01
The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified degree. We first observe that this property still holds if we consider approximations by pseudo-Boolean functions depending only on specified variables. We then show that the Banzhaf influence index can also be obtained from the latter approximation problem. Considering certain weighted versions of this approximation problem, we introduce a class of weighted Banzhaf influence indexes, analyze their most important properties, and point out similarities between the weighted Banzhaf influence index and the corresponding weighted Banzhaf interaction index.
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
2002-01-01
This paper presents a new data structure called boolean expression diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of binary decision diagrams (BDDs) which can represent any Boolean circuit in linear space. Two algorithms are described for transforming...
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt
2007-01-01
We consider constant depth circuits augmented with few exact threshold gates with arbitrary weights. We prove strong (up to exponential) size lower bounds for such circuits computing symmetric Boolean functions. Our lower bound is expressed in terms of a natural parameter, the balance, of symmetr...
From Boolean Network Model to Continuous Model Helps in Design of Functional Circuits
Bin Shao; Xiang Liu; Dongliang Zhang; Jiayi Wu; Qi Ouyang
2015-01-01
Computational circuit design with desired functions in a living cell is a challenging task in synthetic biology. To achieve this task, numerous methods that either focus on small scale networks or use evolutionary algorithms have been developed. Here, we propose a two-step approach to facilitate the design of functional circuits. In the first step, the search space of possible topologies for target functions is reduced by reverse engineering using a Boolean network model. In the second step, ...
Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
Kötzing, Timo; Sudholt, Dirk; Wagner, Markus
2010-01-01
With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on the class of linear pseudo-Boolean functions defined on binary strings of length 'n'. Our investigations point out how the progress according to function values is stored in pheromone. We provide a general upper bound of O((n^3 \\log n)/ \\rho) for two ACO variants on all linear functions, where (\\rho) determines the pheromone update strength. Furthermore, we show improved bounds for two well-known linear pseudo-Boolean functions called OneMax and BinVal and give additional insights using an experimental study.
Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne
1988-01-01
The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.
On a hierarchy of Boolean functions hard to compute in constant depth
Bernasconi, Anna
2001-01-01
Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation.\\par This work represents a step in this direction: we define a combinatorial property that makes Boolean functions ''\\emphhard'' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds ...
A quantum speedup in machine learning: Finding a N-bit Boolean function for a classification
Yoo, Seokwon; Bang, Jeongho; Lee, Changhyoup; Lee, Jinhyoung
2013-01-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate sol...
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable...... properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One closely mimics the BDD apply-operator while the other can exploit the structural information of the Boolean expression. The efficacy of the BED representation is demonstrated by verifying that the...
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 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....... The treatment of semi-bent functions is then presented in a much wider framework. We show how bent and semi-bent functions are interlinked, that is, the concatenation of two suitably chosen semi-bent functions will yield a bent function and vice versa. Finally, this approach is generalized so that the...
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2. PMID:26997659
bent-negabent 函数的构造%Constructions of bent-negabent Boolean functions
Institute of Scientific and Technical Information of China (English)
卓泽朋; 崇金凤; 魏仕民
2015-01-01
给出了一种新的 negabent 函数的构造，基于此构造和已有的 bent 函数的构造，得到了一种 bent-negabent 函数的构造；分析了一类由4个函数级联所得函数的性质，给出了这类函数为 negabent 函数的必要条件；给出了bent-negabent 函数的一种直和构造。%A new method to construct negabent function was provided.Based on it,a construction of bent-negabent function was obtained.And then,the special Boolean function by concatenation was investigated.A necessary condi-tions for this Boolean function to be a negabent function was presented.Finally,the direct sum construction of bent-negabent function is given.
Gavinsky, D; Kempe, J; Gavinsky, Dmitry; Kempe, Julia; Wolf, Ronald de
2006-01-01
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary has a certain amount of classical storage, but is completely insecure if he has a similar amount of quantum storage.
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
International Nuclear Information System (INIS)
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
Yoo, Seokwon; Bang, Jeongho; Lee, Changhyoup; Lee, Jinhyoung
2014-10-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution.
Quantum-state filtering applied to the discrimination of Boolean functions
International Nuclear Information System (INIS)
Quantum-state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs. The simplest case, when the N given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum-state filtering. We derived previously the optimal strategy for the case of N nonorthogonal states, { vertical bar ψ1>,..., vertical bar ψN>}, for distinguishing vertical bar ψ1> from the set { vertical bar ψ2>,..., vertical bar ψN>} and the corresponding optimal success and failure probabilities. In a previous paper [Phys. Rev. Lett. 90, 257901 (2003)], we sketched an application of the results to probabilistic quantum algorithms. Here we fill the gaps and give the complete derivation of the probabilistic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions
Quantum tests for the linearity and permutation invariance of Boolean functions
International Nuclear Information System (INIS)
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is ε-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order ε-2/3 calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.
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.
Stoyanov, B. P.; Kordov, K. M.
2013-10-01
We propose a modified encryption scheme based on 256 bit bent Boolean function and Feedback with Carry Shift Register. We estimated the output bits properties by the NIST, DIEHARD and ENT test packages. The results of the cryptanalysis show that the new cryptographic scheme provides an exclusive level of data security.
A solution to the surface intersection problem. [Boolean functions in geometric modeling
Timer, H. G.
1977-01-01
An application-independent geometric model within a data base framework should support the use of Boolean operators which allow the user to construct a complex model by appropriately combining a series of simple models. The use of these operators leads to the concept of implicitly and explicitly defined surfaces. With an explicitly defined model, the surface area may be computed by simply summing the surface areas of the bounding surfaces. For an implicitly defined model, the surface area computation must deal with active and inactive regions. Because the surface intersection problem involves four unknowns and its solution is a space curve, the parametric coordinates of each surface must be determined as a function of the arc length. Various subproblems involved in the general intersection problem are discussed, and the mathematical basis for their solution is presented along with a program written in FORTRAN IV for implementation on the IBM 370 TSO system.
On the Extension of Pseudo-Boolean Functions for the Aggregation of Interacting Criteria
Grabisch, Michel; Vansnick, Jean-Claude
2008-01-01
The paper presents an analysis on the use of integrals defined for non-additive measures (or capacities) as the Choquet and the \\Sipos{} integral, and the multilinear model, all seen as extensions of pseudo-Boolean functions, and used as a means to model interaction between criteria in a multicriteria decision making problem. The emphasis is put on the use, besides classical comparative information, of information about difference of attractiveness between acts, and on the existence, for each point of view, of a ``neutral level'', allowing to introduce the absolute notion of attractive or repulsive act. It is shown that in this case, the Sipos integral is a suitable solution, although not unique. Properties of the Sipos integral as a new way of aggregating criteria are shown, with emphasis on the interaction among criteria.
布尔函数的迹单项式逼近%Trace Function Monomials Approximation of Boolean Functions
Institute of Scientific and Technical Information of China (English)
祁传达; 袁小转; 邵辉
2014-01-01
A new spectrum of Boolean function was presented by monomial trace function instead of linear func -tion.The new spectrum was called as d-Walsh cyclic spectrum .Trace function monomials best approximation of Boole-an function was investigated and found by computing d-Walsh cyclic spectrum and the computational complexity was just 22n/n .By monomial trace function approximating the feedforward function of stream cipher , it is possible to com-mit a decimation attack on stream cipher , which may have important implications for cipher design and analysis .%提出了用单项迹函数代替线性函数来定义的布尔函数一种新的谱值，称之为布尔函数的d-Walsh循环谱，通过计算d-Walsh循环谱来研究布尔函数的最佳单项迹函数逼近，使用该方法的计算复杂性仅为22n/n 。利用单项迹函数逼近序列密码的前馈函数可实现对序列密码的采样攻击，对序列密码设计与分析具有重要意义。
A new class of hyper-bent Boolean functions in binomial forms
Wang, Baocheng; Qi, Yanfeng; Yang, Yixian; Xu, Maozhi
2011-01-01
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\\pm 2^{\\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as S-box, block cipher and stream cipher. Further, they have been applied to coding theory, spread spectrum and combinatorial design. Hyper-bent functions, as a special class of bent functions, were introduced by Youssef and Gong in 2001, which have stronger properties and rarer elements. Many research focus on the construction of bent and hyper-bent functions. In this paper, we consider functions defined over $\\mathbb{F}_{2^n}$ by $f_{a,b}:=\\mathrm{Tr}_{1}^{n}(ax^{(2^m-1)})+\\mathrm{Tr}_{1}^{4}(bx^{\\frac{2^n-1}{5}})$, where $n=2m$, $m\\equiv 2\\pmod 4$, $a\\in \\mathbb{F}_{2^m}$ and $b\\in\\mathbb{F}_{16}$. When $a\\in \\mathbb{F}_{2^m}$ and $(b+1)(b^4+b...
Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions.
Sezener, Can Eren; Oztop, Erhan
2015-08-01
Boolean functions (BFs) are central in many fields of engineering and mathematics, such as cryptography, circuit design, and combinatorics. Moreover, they provide a simple framework for studying neural computation mechanisms of the brain. Many representation schemes for BFs exist to satisfy the needs of the domain they are used in. In neural computation, it is of interest to know how many input lines a neuron would need to represent a given BF. A common BF representation to study this is the so-called polynomial sign representation where [Formula: see text] and 1 are associated with true and false, respectively. The polynomial is treated as a real-valued function and evaluated at its parameters, and the sign of the polynomial is then taken as the function value. The number of input lines for the modeled neuron is exactly the number of terms in the polynomial. This letter investigates the minimum number of terms, that is, the minimum threshold density, that is sufficient to represent a given BF and more generally aims to find the maximum over this quantity for all BFs in a given dimension. With this work, for the first time exact results for four- and five-variable BFs are obtained, and strong bounds for six-variable BFs are derived. In addition, some connections between the sign representation framework and bent functions are derived, which are generally studied for their desirable cryptographic properties. PMID:26079754
Realisation of all 16 Boolean logic functions in a single magnetoresistance memory cell
Gao, Shuang; Yang, Guang; Cui, Bin; Wang, Shouguo; Zeng, Fei; Song, Cheng; Pan, Feng
2016-06-01
Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis loop. These results may provide a helpful solution for the final commercialisation of MRAM-based stateful logic circuits in the near future.Stateful logic circuits based on next-generation nonvolatile memories, such as magnetoresistance random access memory (MRAM), promise to break the long-standing von Neumann bottleneck in state-of-the-art data processing devices. For the successful commercialisation of stateful logic circuits, a critical step is realizing the best use of a single memory cell to perform logic functions. In this work, we propose a method for implementing all 16 Boolean logic functions in a single MRAM cell, namely a magnetoresistance (MR) unit. Based on our experimental results, we conclude that this method is applicable to any MR unit with a double-hump-like hysteresis loop, especially pseudo-spin-valve magnetic tunnel junctions with a high MR ratio. Moreover, after simply reversing the correspondence between voltage signals and output logic values, this method could also be applicable to any MR unit with a double-pit-like hysteresis
Quantum-state filtering applied to the discrimination of Boolean functions
Bergou, J A; Bergou, Janos A.; Hillery, Mark
2005-01-01
Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum state filtering. We derived previously the optimal strategy for the case of N non-orthogonal states, {|\\psi_{1} >, ..., |\\psi_{N} >}, for distinguishing |\\psi_1 > from the set {|\\psi_2 >, ..., |\\psi_N >} and the corresponding optimal success and failure probabilities. In a previous paper [PRL 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill in the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algor...
Cardinal invariants on Boolean algebras
Monk, J Donald
2014-01-01
This book is concerned with cardinal number valued functions defined for any Boolean algebra. Examples of such functions are independence, which assigns to each Boolean algebra the supremum of the cardinalities of its free subalgebras, and cellularity, which gives the supremum of cardinalities of sets of pairwise disjoint elements. Twenty-one such functions are studied in detail, and many more in passing. The questions considered are the behaviour of these functions under algebraic operations such as products, free products, ultraproducts, and their relationships to one another. Assuming familiarity with only the basics of Boolean algebras and set theory, through simple infinite combinatorics and forcing, the book reviews current knowledge about these functions, giving complete proofs for most facts. A special feature of the book is the attention given to open problems, of which 185 are formulated. Based on Cardinal Functions on Boolean Algebras (1990) and Cardinal Invariants on Boolean Algebras (1996) by the...
Boolean Differential Operators
Catumba, Jorge; Diaz, Rafael
2012-01-01
We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Cottrell, Seth S.
In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are ''tuned'' so that their time step operators have degenerate eigenvalues, and only certain initial states are effective. More than that, the searches are never faster than order square root of N time. In this thesis the problem is defined rigorously, the causes for all of these patterns are identified, sufficient and necessary conditions for quadratic-speed searches for any connected subgraph are demonstrated, the tolerance of these conditions is investigated, and it is shown that (unfortunately) we can do no better than order square root of N time. Along the way, a useful formalism is established that may be useful in future work involving highly symmetric graphs. The tools and techniques so derived are then used to demonstrate that tree graphs can be used for the computation of Boolean functions. The philosophy of Farhi's work on the continuous-time NAND tree is applied to a discrete-time walk with any (AND, OR, NAND, or NOR) gate at each vertex. Tentative results show that the vast majority of possible Boolean functions on N bits can be calculated in order square root of N time.
Characterization Of any Non-linear Boolean function Using A Set of Linear Operators
Sahoo, Sudhakar; Choudhury, Pabitra Pal; Chakraborty, Mithun
2008-01-01
Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian Matrices. In this paper two different efforts have been made: first we try to systematize non-linear CA evolution in the light of deviant states and non-deviant states. For all the non-devian...
布尔函数与形态算子关系的研究%On the Relationship between Boolean Function and Morphology Operator
Institute of Scientific and Technical Information of China (English)
段汕; 罗敬; 徐文; 贺兴
2013-01-01
以布尔代数理论和欧式空间中二值形态变换理论为基础，通过布尔函数引入一个结构化映射，对二值形态变换的基本运算(腐蚀、膨胀)进行了描述，探讨了布尔函数与形态变换的关系，以期为二值形态变换的扩展提供新的途径。%This paper presents binary morphological transformation ( corrosion and expansion) on the basis of the Boolean algebra theory and the theory of binary morphological transformation in Euclidean space, and introduces a structural mapping resting on Boolean function, then researches the relationship between Boolean function and morphological transformation, which will provide a new way for extending morphological transformation.
Method of Transfer from Logical Schemes of Algorithms to Boolean Functions
Dyachenko, V. F.
1964-01-01
The author discusses a method for obtaining the Boolean functions describing the structure of a control circuit by means of AS operators whose sequence of operations is given in the form of a logical scheme or matrix scheme for an algorithm. An example of AS synthesis is given.
A finite alternation result for reversible boolean circuits
Selinger, Peter
2016-01-01
We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits. We show that every reversible boolean function of n >= 4 bits has alternation depth 9.
Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Semenov, Alexander; Zaikin, Oleg
2016-01-01
In this paper we propose an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning. With each partitioning we associate a point in the special finite search space. The estimation of effectiveness of the particular partitioning is the value of predictive function in the corresponding point of this space. The problem of search for an effective partitioning can be formulated as a problem of optimization of the predictive function. We use metaheuristic algorithms (simulated annealing and tabu search) to move from point to point in the search space. In our computational experiments we found partitionings for SAT instances encoding problems of inversion of some cryptographic functions. Several of these SAT instances with realistic predicted solving time were successfully solved on a computing cluster and in the volunteer computing project SAT@home. The solving time agrees well with estimations obtained by the proposed method. PMID:27190753
Boolean Orthogonalizing Combination Methods
Directory of Open Access Journals (Sweden)
Yavuz Can
2015-05-01
Full Text Available In this paper a new logical operation method called “ presented. It is used to calculate the difference, but also the complement of a function as well as the EXOR and EXNOR of two minterms respectively two ternary respectively two ternary-vector logical operation method called “orthogonal OR advantages of both methods are their results, which are already available form that has an essential advantage for continuing calculations. Since it applies, an orthogonal disjunctive normal form is equal to orthogonal antivalence normal form, subsequent Boolean differential calculus will be simplified.
Cardinal invariants on Boolean algebras
Monk, J Donald
2009-01-01
Deals with cardinal number valued functions defined for any Boolean algebra. This title considers the behavior of these functions under algebraic operations such as products, free products, ultraproducts, and their relationships to one another. It covers topics such as ultraproducts and Fedorchukis theorem
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
Research on non-line Boolean function realization technology%非线性布尔函数实现技术研究
Institute of Scientific and Technical Information of China (English)
常忠祥; 戴紫彬; 李伟; 刘楠; 戴强
2014-01-01
To improve the processing efficiency of nonline Boolean function in processor,a non-line Boolean function model was established based on extract shift and and-XOR.The model used the decimation shift operation for selecting the variables in-volved in operations,and-XOR operation was utilized to achieve different times and XOR between items.Finally,performances evaluation and adaptation functions were presented.The results showed that computational model of non-line Boolean function could significantly reduce the number of operations required by the non-line Boolean function.%为了提升处理器中非线性布尔函数处理效率，建立了以抽取移位和与-异或为基础的非线性布尔函数计算模型。利用抽取移位操作选择非线性布尔函数中参与运算的变量，利用与-异或操作实现不同次数与项之间的异或运算。对设计的单元进行了性能评估和函数适配，测试结果表明，设计的非线性布尔函数计算模型能够大幅降低实现非线性布尔函数所需的运算次数。
Construction of 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Good Nonlinearity
Institute of Scientific and Technical Information of China (English)
Sen-Shan Pan; Xiao-Tong Fu; Wei-Guo Zhangx
2011-01-01
This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of 1-resilient functions on any number n ＞ 2 of variables with at least sub-optimal algebraic immunity is provided.
Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions
Wegener, Ingo
2001-01-01
Many experiments ave shown that evolutionary algorithms are useful randomized search heuristics for optimization problems. In order to learn more about the reasons for their efficiency and in order to obtain proven results on evolutionary algorithms it is necessary to develop a theory of evolutionary algorithms. Such a theory is still in its infancy. A major part of a theory is the analysis of different variants of evolutionary algorithms on selected functions. Several results of this kind ha...
Effect of memory in non-Markovian Boolean networks
Ebadi, Haleh; Ausloos, Marcel; Jafari, GholamReza
2016-01-01
One successful model of interacting biological systems is the Boolean network. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function, - one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of a cell cycle network, we discover a power law memory with a more robust dynamics than the Markovian dynamics.
Boolean filters of distributive lattices
Directory of Open Access Journals (Sweden)
M. Sambasiva Rao
2013-07-01
Full Text Available In this paper we introduce the notion of Boolean filters in a pseudo-complemented distributive lattice and characterize the class of all Boolean filters. Further a set of equivalent conditions are derived for a proper filter to become a prime Boolean filter. Also a set of equivalent conditions is derived for a pseudo-complemented distributive lattice to become a Boolean algebra. Finally, a Boolean filter is characterized in terms of congruences.
Combinational Logic-Level Verification using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1997-01-01
Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties of...... BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level verification problem which is, given two combinational circuits, to determine whether they implement the same Boolean functions. Based on all combinational circuits in the ISCAS 85 and LGSynth 91...
Algebraic Degree of a Class Boolean Function Annihilators%一类布尔函数零化子的代数次数
Institute of Scientific and Technical Information of China (English)
祁传达; 俞迎达
2012-01-01
The effectiveness of algebraic attacks of stream ciphers depends on the algebraic degrees of annihilators of nonlinear Boolean functions.But it remains a difficult problem to construct annihilators with low degree for a given Boolean function. In this paper, we give a new proof of a result on the existence of the n-k degree annihilators formulated by Zhang Wenying,et al,and correct an error in their original proof.%序列密码代数攻击的成效取决于所使用的非线性布尔函数零化子的代数次数,但如何构造一个给定函数的低次数零化子仍是一个难题.本文对张文英等人提出的关于一类布尔函数存在n-k次零化子的结论给出了新的证明,弥补了原文证明不严密的缺陷.
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...
Drossel, Barbara
2007-01-01
This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and problems to solve, the basic concepts are introduced and important results concerning phase diagrams, numbers of relevant nodes and attractor properties are derived.
Boolean networks with reliable dynamics
Peixoto, Tiago P
2009-01-01
We investigated the properties of Boolean networks that follow a given reliable trajectory in state space. A reliable trajectory is defined as a sequence of states which is independent of the order in which the nodes are updated. We explored numerically the topology, the update functions, and the state space structure of these networks, which we constructed using a minimum number of links and the simplest update functions. We found that the clustering coefficient is larger than in random networks, and that the probability distribution of three-node motifs is similar to that found in gene regulation networks. Among the update functions, only a subset of all possible functions occur, and they can be classified according to their probability. More homogeneous functions occur more often, leading to a dominance of canalyzing functions. Finally, we studied the entire state space of the networks. We observed that with increasing systems size, fixed points become more dominant, moving the networks close to the frozen...
Fault Tolerant Boolean Satisfiability
Roy, A
2011-01-01
A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming unavailable). The concept of delta-models was introduced by Ginsberg, Parkes and Roy (AAAI 1998), where it was proved that finding delta-models for general Boolean formulas is NP-complete. In this paper, we extend that result by studying the complexity of finding delta-models for classes of Boolean formulas which are known to have polynomial time satisfiability solvers. In particular, we examine 2-SAT, Horn-SAT, Affine-SAT, dual-Horn-SAT, 0-valid and 1-valid SAT. We see a wide variation in the complexity of finding delta-models, e.g., while 2-SAT and Affine-SAT have polynomial time tests for delta-models, testing w...
Algorithms for Weighted Boolean Optimization
Manquinho, Vasco; Marques-Silva, Joao; Planes Cid, Jordi
2009-01-01
The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, different algorithms have been proposed for PBO and for MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT and viceversa. This papers proposes Weighted Boolean Optimization (WBO), a new uni- fied framework that aggregates and extends PBO and MaxSAT. In addition, the paper proposes...
IMS Algorithm for Learning Representations in Boolean Neural Networks
Biswas, Nripendra N; Murthy, TVMK; Chandrasekhar, M.
1991-01-01
A new algorithm for learning representations in Boolean neural networks, where the inputs and outputs are binary bits, is presented. The algorithm has become feasible because of a newly discovered theorem which states that any non-linearly separable Boolean function can be expressed as a convergent series of linearly separable functions connected by the logical OR (+) and the logical INHIBIT (-) operators. The formation of the series is carried out by many important properties exhibited by th...
Institute of Scientific and Technical Information of China (English)
陈银冬; 陆佩忠
2009-01-01
A second order recursive construction of even variables Boolean function with optimum algebraic immunity was proposed. It could be observed that the constructed Boolean functions have well cryptographic properties, such as good balance, high algebraic degree and high nonlinearity. Further more, it was generalized to a class of constructions for Boolean functions with optimum algebraic immunity.%提出了构造偶数变元代数免疫最优的布尔函数的方法,这是一个二阶的递归构造方法.分析表明,利用该方法构造而得到的布尔函数具有优良的密码学特性,比如具有较好的平衡性,较高的代数次数和非线性度等.最后,还对该构造方法进行了推广,进一步导出了递归构造偶数变元代数免疫最优布尔函数的一类方法.
Symmetry in Boolean Satisfiability
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2010-06-01
Full Text Available This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use symmetries to avoid traversing all assignments by constraining the search to visit a few representative assignments in each equivalence class. This can lead to a significant reduction in search runtime without affecting the completeness of the search.
Investigating Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Neruda, Roman; Frolov, A. A.
- : ACM, 2008 - (Ding, C.; Li, T.; Zhu, S.), s. 18-25 ISBN 978-1-60558-307-5. [DMMT'08. Workshop in Conjunction with SIGKDD 2008 /14./. Las Vegas (US), 24.08.2008-24.08.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * nonnegative matrix factorization * neural networks * information retrieval * data mining * binary data Subject RIV: BB - Applied Statistics, Operational Research http://users.cs.fiu.edu/~taoli/kdd08-workshop/DMMT08-Proceedings.pdf
Fault Tolerant Boolean Satisfiability
Roy, A
2011-01-01
A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming unavailable). The concept of delta-models was introduced by Ginsberg, Parkes and Roy (AAAI 1998...
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante
Cho Kwang-Hyun; Choi Sun; Kwon Yung-Keun
2007-01-01
Abstract Background A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes. For instance, connectivity, clustering coefficient, and shortest path length were previously proposed for this purpose. However, there is still a pressing need to investigate another topological measure that can better describe the functional importance of network nodes. In this respect, we considered a fee...
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.
Techniques for solving Boolean equation systems
Keinänen, Misa
2006-01-01
Boolean equation systems are ordered sequences of Boolean equations decorated with least and greatest fixpoint operators. Boolean equation systems provide a useful framework for formal verification because various specification and verification problems, for instance, μ-calculus model checking can be represented as the problem of solving Boolean equation systems. The general problem of solving a Boolean equation system is a computationally hard task, and no polynomial time solution technique ...
The Influence of Canalization on the Robustness of Boolean Networks
Kadelka, Claus; Laubenbacher, Reinhard
2016-01-01
Time- and state-discrete dynamical systems are frequently used to model molecular networks. This paper provides a collection of mathematical and computational tools for the study of robustness in Boolean network models. The focus is on networks governed by $k$-canalizing functions, a recently introduced class of Boolean functions that contains the well-studied class of nested canalizing functions. The activities and sensitivity of a function quantify the impact of input changes on the function output. This paper generalizes the latter concept to $c$-sensitivity and provides formulas for the activities and $c$-sensitivity of general $k$-canalizing functions as well as canalizing functions with more precisely defined structure. A popular measure for the robustness of a network, the Derrida value, can be expressed as a weighted sum of the $c$-sensitivities of the governing canalizing functions, and can also be calculated for a stochastic extension of Boolean networks. These findings provide a computationally eff...
Institute of Scientific and Technical Information of China (English)
厉晓华; 赵建华
2016-01-01
To simplify the process for calculating c‐derivative of Boolean function with don't‐care‐terms in the Boole‐an logic algebra system based on AND‐OR‐NOT operation ,the K‐map method for calculating the first and second‐order c‐derivative of Boolean function with don't‐care‐terms is proposed according to the definition of c‐derivative . The c‐derivative is calculated by folding the square corresponds of the K‐map ,and then conducts OR operation .The application results show that the presented method is simple and convenient for operation .The simplest AND/OR expansion of c‐derivative of Boolean function with don't‐care‐terms can also be obtained from K‐map .%为简化与‐或‐非代数系统中含无关项逻辑函数布尔c‐导数的计算过程，从逻辑函数布尔c‐导数的定义出发，提出了计算含无关项一阶布尔c‐导数和二阶布尔c‐导数的K图方法。该方法通过折叠映射K图中的填入格值，并对相应格值进行“或”运算以计算含无关项布尔c‐导数。应用实例表明，该方法直观有效，且能直接得到布尔c‐导数的最简与／或式。
Generalized join-hemimorphisms on Boolean algebras
Sergio Celani
2003-01-01
We introduce the notions of generalized join-hemimorphism and generalized Boolean relation as an extension of the notions of join-hemimorphism and Boolean relation, respectively. We prove a duality between these two notions. We will also define a generalization of the notion of Boolean algebra with operators by considering a finite family of Boolean algebras endowed with a generalized join-hemimorphism. Finally, we define suitable notions of subalgebra, congruences, Boole...
Boolean Operations on Conic Polygons
Institute of Scientific and Technical Information of China (English)
Yong-Xi Gong; Yu Liu; Lun Wu; Yu-Bo Xie
2009-01-01
An algorithm for Boolean operations on conic polygons is proposed. Conic polygons are polygons consisting of conic segments or bounded conics with directions. Preliminaries of Boolean operations on general polygons are presented. In our algorithm, the intersection points and the topological relationships between two conic polygons are computed. Boundaries are obtained by tracking path and selecting uncrossed boundaries following rule tables to build resulting conic polygons.We define a set of rules for the intersection, union, and subtraction operations on conic polygons. The algorithm considers degeneration cases such as homology, complement, interior, and exterior. The algorithm is also evaluated and implemented.
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Zakarias, Sarah Nouhad Haddad
We present a protocol for securely computing a Boolean circuit $C$ in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming access to a preprocessing functionality that is not given the inputs to compute on. For a large number of players the work done by...... each player is the same as the work needed to compute the circuit in the clear, up to a constant factor. Our protocol is the first to obtain these properties for Boolean circuits. On the technical side, we develop new homomorphic authentication schemes based on asymptotically good codes with an...
Constant-overhead secure computation of Boolean circuits using preprocessing
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Zakarias, S.
2013-01-01
We present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same as...
Construction of Generalized Bent Function Based on Boolean Function Normality%基于布尔函数正规性的广义Bent函数构造
Institute of Scientific and Technical Information of China (English)
许广魁; 李远华; 马凤丽
2012-01-01
基于广义Bent函数的正规性,结合子空间上的特征函数,分析广义正规Bent函数的Chrestenson谱特征.利用间接构造Bent函数的方法,在整数模m的剩余类环Zm以及p元域Zp上,给出2类新的n元广义Bent函数.理论分析结果表明,与传统构造方法相比,该方法可构造出更多的n元广义Bent函数.%This paper is based on the normality of generalized Bent functions, combines the characteristic functions of linear subspace. The Chrestenson spectral characteristics of generalized nonnal Bent functions are studied. According to the indirect construction method, two new classes of generalized Bent functions of n variables over integers module m residue class Zm and p meta-field Zp are presented. Theory analysis result shows that more generalized Bent functions can be constructed by using the proposed construction method compared with the traditional construction method.
Terse Integer Linear Programs for Boolean Optimization
Directory of Open Access Journals (Sweden)
Christoph Buchheim
2009-05-01
Full Text Available We present a new polyhedral approach to nonlinear Boolean optimization. Compared to other methods, it produces much smaller integer programming models, making it more efficient from a practical point of view. We mainly obtain this by two different ideas: first, we do not require the objective function to be in any normal form. The transformation into a normal form usually leads to the introduction of many additional variables or constraints. Second, we reduce the problem to the degree-two case in a very efficient way, by slightly extending the dimension of the original variable space. The resulting model turns out to be closely related to the maximum cut problem; we show that the corresponding polytope is a face of a suitable cut polytope in most cases. In particular, our separation problem reduces to the one for the maximum cut problem. In practice, the approach appears to be very competitive for unconstrained Boolean optimization problems. First experimental results, which have been obtained for some particularly hard instances of the Max-SAT Evaluation 2007, show that our very general implementation can outperform even special-purpose Max-SAT solvers. The software is accessible online under “we.logoptimize.it”.
Improving the User Query for the Boolean Model Using Genetic Algorithms
Nassar, Mohammad Othman; Mashagba, Eman Al
2011-01-01
The Use of genetic algorithms in the Information retrieval (IR) area, especially in optimizing a user query in Arabic data collections is presented in this paper. Very little research has been carried out on Arabic text collections. Boolean model have been used in this research. To optimize the query using GA we used different fitness functions, different mutation strategies to find which is the best strategy and fitness function that can be used with Boolean model when the data collection is the Arabic language. Our results show that the best GA strategy for the Boolean model is the GA (M2, Precision) method.
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
Drucker, Andrew
2012-01-01
We study the circuit complexity of Boolean operators, i.e., collections of Boolean functions defined over a common input. Our focus is the well-studied model in which arbitrary Boolean functions are allowed as gates, and in which a circuit's complexity is measured by its depth and number of wires. We show sharp limitations of several existing lower-bound methods for this model. First, we study an information-theoretic lower-bound method due to Cherukhin, that yields bounds of form $\\Omega_d(n...
Improving the User Query for the Boolean Model UsingGenetic Algorithms
Directory of Open Access Journals (Sweden)
Mohammad Othman Nassar
2011-09-01
Full Text Available The Use of genetic algorithms in the Information retrieval (IR area, especially in optimizing a user query in Arabic data collections is presented in this paper. Very little research has been carried out on Arabic text collections. Boolean model have been used in this research. To optimize the query using GA we used different fitness functions, different mutation strategies to find which is the best strategy and fitness function that can be used with Boolean model when the data collection is the Arabic language. Our results show that the best GA strategy for the Boolean model is the GA (M2, Precision method.
Boolean Reasoning with Graphs of Partitions
Goossens, Daniel
2010-01-01
version longue du papier court "A Dynamic Boolean Knowledge Base" accepté à ICTAI 2010. This paper presents an implemented architecture for easy learning, reorganizing and navigation into a Boolean knowledge base. As the base grows with new definitions and constraints, it is normalized by the closure of a completion operator. This normalization allows arbitrary formats for Boolean expressions. It ensures basic reasoning abilities and spontaneously organizes intermingled taxonomies of conce...
Model Checking of Boolean Process Models
Schneider, Christoph; Wehler, Joachim
2011-01-01
In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to mode...
Boolean networks as modelling framework
Directory of Open Access Journals (Sweden)
Florian eGreil
2012-08-01
Full Text Available In a network, the components of a given system are represented as nodes, the interactions are abstracted as links between the nodes. Boolean networks refer to a class of dynamics on networks, in fact it is the simplest possible dynamics where each node has a value 0 or 1. This allows to investigate extensively the dynamics both analytically and by numerical experiments. The present article focuses on the theoretical concept of relevant components and the immediate application in plant biology, references for more in-depths treatment of the mathematical details are also given.
Boolean Search: Current State and Perspectives.
Frants, Valery I.; Shapiro, Jacob; Taksa, Isak; Voiskunskii, Vladimir G.
1999-01-01
Discusses the use of Boolean logic in information-retrieval systems and analyzes existing criticisms of operational systems. Considers users' ability to use and understand Boolean operators, ranking, the quality of query formulations, and negative effects of criticism; and concludes that criticism is directed at the methodology employed in…
Boolean gates on actin filaments
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.
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/.
Generalizing Boolean Satisfiability II: Theory
Dixon, H E; Luks, E M; Parkes, A J; 10.1613/jair.1555
2011-01-01
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-...
Densities of mixed volumes for Boolean models
Weil, Wolfgang
2001-01-01
In generalization of the well-known formulae for quermass densities of stationary and isotropic Boolean models, we prove corresponding results for densities of mixed volumes in the stationary situation and show how they can be used to determine the intensity of non-isotropic Boolean models Z in d-dimensional space for d = 2, 3, 4. We then consider non-stationary Boolean models and extend results of Fallert on quermass densities to densities of mixed volumes. In particular, we present explicit...
Translating Pseudo-Boolean Constraints into CNF
Aavani, Amir
2011-01-01
A Pseudo-Boolean constraint is a linear constraint over Boolean variables. This kind of constraints has been widely used in expressing NP-complete problems. This paper introduces a new algorithm for translating Pseudo-Boolean constraints into CNF clauses. The CNF produced by the proposed encoding has small size, and we also characterize the constraints for which one can expect the SAT solvers to perform well on the produced CNF. We show that there are many constraints for which the proposed encoding has a good performance.
Institute of Scientific and Technical Information of China (English)
杜蛟; 温巧燕; 张劼; 庞善起
2013-01-01
通过对素数元旋转对称弹性布尔函数特征矩阵的研究，给出了其特征矩阵的若干性质，得到了素数元旋转对称布尔函数为弹性函数的一个充要条件，由此完全决定了旋转对称弹性函数的构造以及这类函数的精确计数公式，最后还给出了所有的三元、五元、七元旋转对称弹性布尔函数的构造方案与精确计数。%The characteristic matrix of the resilient rotation symmetric Boolean functions (RSBF) with prime number variables were explored. Some properties about characteristic matrix of them were given. A necessary and sufficient con-dition on the construction of resilient RSBF with prime number variables was derived. So construction and count formula of all the resilient RSBF with prime number variables were determined by this way. At last, all the resilient RSBF with 3, 5 or 7 variables were given.
Combinatorics of Boolean automata circuits dynamics
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2012-01-01
International audience In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work fo...
Boolean Logic with Fault Tolerant Coding
Alagoz, B. Baykant
2009-01-01
Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have provided the digital system skill of auto-recovery without need for designing additional-fault tolerance mechanisms.
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-01
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes. PMID:26821940
Forced synchronization of autonomous dynamical Boolean networks
International Nuclear Information System (INIS)
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics
Forced synchronization of autonomous dynamical Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx [División de Matemáticas Aplicadas, Instituto Potosino de Investigación Científica y Tecnológica A. C., Camino a la Presa San José 2055, Col. Lomas 4 Sección, C.P. 78216, San Luis Potosí, S.L.P. (Mexico); Campos-Cantón, I. [Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Álvaro Obregón 64, C.P. 78000, San Luis Potosí, S.L.P. (Mexico); Gauthier, Daniel J. [Department of Physics and Center for Nonlinear and Complex Systems, Duke University, Box 90305, Durham, North Carolina 27708 (United States)
2015-08-15
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.
Duality theories for Boolean algebras with operators
Givant, Steven
2014-01-01
In this new text, Steven Givant—the author of several acclaimed books, including works co-authored with Paul Halmos and Alfred Tarski—develops three theories of duality for Boolean algebras with operators. Givant addresses the two most recognized dualities (one algebraic and the other topological) and introduces a third duality, best understood as a hybrid of the first two. This text will be of interest to graduate students and researchers in the fields of mathematics, computer science, logic, and philosophy who are interested in exploring special or general classes of Boolean algebras with operators. Readers should be familiar with the basic arithmetic and theory of Boolean algebras, as well as the fundamentals of point-set topology.
New Measure of Boolean Factor Analysis Quality
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
Vol. 1. Heidelberg: Springer, 2011 - (Dobnikar, A.; Lotrič, U.; Šter, B.), s. 100-109. (Lecture Notes in Computer Science. 6593). ISBN 978-3-642-20281-0. ISSN 0302-9743. [ICANNGA'2011. International Conference /10./. Ljubljana (SI), 14.04.2011-16.04.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * information gain * expectation-maximization * associative memory * neural network application * Boolean matrix factorization * bars problem * Hopfield neural network Subject RIV: IN - Informatics, Computer Science
Fast Gr\\"obner Basis Computation for Boolean Polynomials
Hinkelmann, Franziska
2010-01-01
We introduce the Macaulay2 package BooleanGB, which computes a Gr\\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
International Nuclear Information System (INIS)
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
Energy Technology Data Exchange (ETDEWEB)
Zhang, Ting; Xu, Jian-yi [Key Laboratory of Modern Acoustics, Department of Physics and Collaborative Innovation Center of Advanced Microstructures, Nanjing University, Nanjing 210093 (China); Cheng, Ying, E-mail: chengying@nju.edu.cn; Liu, Xiao-jun, E-mail: liuxiaojun@nju.edu.cn [Key Laboratory of Modern Acoustics, Department of Physics and Collaborative Innovation Center of Advanced Microstructures, Nanjing University, Nanjing 210093 (China); State Key Laboratory of Acoustics, Chinese Academy of Sciences, Beijing 100190 (China); Guo, Jian-zhong [School of Physics and Information Technology, Shaanxi Normal University, Xian 710119 (China)
2015-03-16
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations.
Symmetric Groups and Quotient Complexity of Boolean Operations
Bell, Jason; Brzozowski, Janusz; Moreira, Nelma; Reis, Rogério
2013-01-01
The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the transition semigroups of the minimal deterministic automata accepting L and L' are the symmetric groups S_m and S_n of degrees m and n, respectively. Denote by o any binary boolean operation that is not a constant and not a function of one argument only. For m,n ...
Graphical interpretation of Boolean operators for protein NMR assignments.
Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy
2008-09-01
We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-dimensional spectra to obtain its functionality. The method's strength lies in the continuous graphical presentation of the spectra, allowing both a semi-automatic peaklist construction and sequential assignment. We demonstrate here its general use for the case of a folded protein with a well-dispersed spectrum, but equally for a natively unfolded protein where spectral resolution is minimal. PMID:18762868
Some Aspects of Boolean Valued Analysis
Kusraev, A. G.; Kutateladze, S. S.
2015-01-01
This is a survey of some recent applications of Boolean valued analysis to operator theory and harmonic analysis. Under consideration are pseudoembedding operators, the noncommutative Wickstead problem, the Radon-Nikodym Theorem for JB-algebras, and the Bochner Theorem for lattice-valued positive definite mappings on locally compact groups.
Demonstrating Boolean Logic Using Simple Electrical Circuits
McElhaney, Kevin W.
2004-01-01
While exploring the subject of geometric proofs, boolean logic operators AND and OR can be used to allow students to visualize their true-or-false patterns. An activity in the form of constructing electrical circuits is illustrated to explain the concept.
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
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
A Boolean Map Theory of Visual Attention
Huang, Liqiang; Pashler, Harold
2007-01-01
A theory is presented that attempts to answer two questions. What visual contents can an observer consciously access at one moment? Answer: only one feature value (e.g., green) per dimension, but those feature values can be associated (as a group) with multiple spatially precise locations (comprising a single labeled Boolean map). How can an…
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
Bose, S. K.; Lawrence, C. P.; Liu, Z.; Makarenko, K. S.; van Damme, R. M. J.; Broersma, H. J.; van der Wiel, W. G.
2015-12-01
Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures.
Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
Heckel, Reinhard; Bossert, Martin
2011-01-01
Consider a large Boolean network with a feed forward structure. Given a probability distribution for the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network? To identify these nodes, a notion that quantifies the determinative power of an input over states in the network is needed. We argue that the mutual information (MI) between a subset of the inputs X = {X_1, ..., X_n} of node i and the function f_i(X)$ associated with node i quantifies the determinative power of this subset of inputs over node i. To study the relation of determinative power to sensitivity to perturbations, we relate the MI to measures of perturbations, such as the influence of a variable, in terms of inequalities. The result shows that, maybe surprisingly, an input that has large influence does not necessarily have large determinative power. The main tool for the analysis is Fourier analysis of Boolean functions. Whether a function is sensitive to perturbations or not...
Evolution of a designless nanoparticle network into reconfigurable Boolean logic.
Bose, S K; Lawrence, C P; Liu, Z; Makarenko, K S; van Damme, R M J; Broersma, H J; van der Wiel, W G
2015-12-01
Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures. PMID:26389658
Evolution and Controllability of Cancer Networks: A Boolean Perspective.
Srihari, Sriganesh; Raman, Venkatesh; Leong, Hon Wai; Ragan, Mark A
2014-01-01
Cancer forms a robust system capable of maintaining stable functioning (cell sustenance and proliferation) despite perturbations. Cancer progresses as stages over time typically with increasing aggressiveness and worsening prognosis. Characterizing these stages and identifying the genes driving transitions between them is critical to understand cancer progression and to develop effective anti-cancer therapies. In this work, we propose a novel model for the `cancer system' as a Boolean state space in which a Boolean network, built from protein-interaction and gene-expression data from different stages of cancer, transits between Boolean satisfiability states by "editing" interactions and "flipping" genes. Edits reflect rewiring of the PPI network while flipping of genes reflect activation or silencing of genes between stages. We formulate a minimization problem min flip to identify these genes driving the transitions. The application of our model (called BoolSpace) on three case studies-pancreatic and breast tumours in human and post spinal-cord injury (SCI) in rats-reveals valuable insights into the phenomenon of cancer progression: (i) interactions involved in core cell-cycle and DNA-damage repair pathways are significantly rewired in tumours, indicating significant impact to key genome-stabilizing mechanisms; (ii) several of the genes flipped are serine/threonine kinases which act as biological switches, reflecting cellular switching mechanisms between stages; and (iii) different sets of genes are flipped during the initial and final stages indicating a pattern to tumour progression. Based on these results, we hypothesize that robustness of cancer partly stems from "passing of the baton" between genes at different stages-genes from different biological processes and/or cellular components are involved in different stages of tumour progression thereby allowing tumour cells to evade targeted therapy, and therefore an effective therapy should target a "cover set" of
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Fast Vertical Mining Using Boolean Algebra
Directory of Open Access Journals (Sweden)
Hosny M. Ibrahim
2015-01-01
Full Text Available The vertical association rules mining algorithm is an efficient mining method, which makes use of support sets of frequent itemsets to calculate the support of candidate itemsets. It overcomes the disadvantage of scanning database many times like Apriori algorithm. In vertical mining, frequent itemsets can be represented as a set of bit vectors in memory, which enables for fast computation. The sizes of bit vectors for itemsets are the main space expense of the algorithm that restricts its expansibility. Therefore, in this paper, a proposed algorithm that compresses the bit vectors of frequent itemsets will be presented. The new bit vector schema presented here depends on Boolean algebra rules to compute the intersection of two compressed bit vectors without making any costly decompression operation. The experimental results show that the proposed algorithm, Vertical Boolean Mining (VBM algorithm is better than both Apriori algorithm and the classical vertical association rule mining algorithm in the mining time and the memory usage.
Boolean network robotics: a proof of concept
Roli, Andrea; Pinciroli, Carlo; Birattari, Mauro
2011-01-01
Dynamical systems theory and complexity science provide powerful tools for analysing artificial agents and robots. Furthermore, they have been recently proposed also as a source of design principles and guidelines. Boolean networks are a prominent example of complex dynamical systems and they have been shown to effectively capture important phenomena in gene regulation. From an engineering perspective, these models are very compelling, because they can exhibit rich and complex behaviours, in spite of the compactness of their description. In this paper, we propose the use of Boolean networks for controlling robots' behaviour. The network is designed by means of an automatic procedure based on stochastic local search techniques. We show that this approach makes it possible to design a network which enables the robot to accomplish a task that requires the capability of navigating the space using a light stimulus, as well as the formation and use of an internal memory.
Efficient Analog Circuits for Boolean Satisfiability
Yin, Xunzhao; Sedighi, Behnam; Varga, Melinda; Ercsey-Ravasz, Maria; Toroczkai, Zoltan; Hu, Xiaobo Sharon
2016-01-01
Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative solutions to tackle such problems. Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed (Nature Physics, 7(12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT). This solver shows polynomial ana...
Using Genetic Algorithms for Boolean Queries Optimization
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Snášel, Václav; Owais, S.S.J.; Krömer, P.
Calgary: ACTA Press, 2005 - (Hamza, M.), s. 178-184 ISBN 0-88986-510-8. [IASTED International Conference on Internet and Multimedia Systems and Applications /9./. Honolulu (US), 15.08.2005-17.08.2005] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : genetic algorithms * information retrieval * Boolean query * genetic programming Subject RIV: BA - General Mathematics
On the Implementation of Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Krömer, P.; Platoš, J.; Húsek, Dušan
Los Alamitos: IEEE, 2008, s. 554-558. ISBN 978-0-7695-3299-8. [ETID '08. International Workshop on Evolutionary Techniques /2./, in collocation with DEXA 2008 International Conference /19./. Turin (IT), 01.09.2008-05.09.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science
Direct relations between morphology and transport in Boolean models.
Scholz, Christian; Wirner, Frank; Klatt, Michael A; Hirneise, Daniel; Schröder-Turk, Gerd E; Mecke, Klaus; Bechinger, Clemens
2015-10-01
We study the relation of permeability and morphology for porous structures composed of randomly placed overlapping circular or elliptical grains, so-called Boolean models. Microfluidic experiments and lattice Boltzmann simulations allow us to evaluate a power-law relation between the Euler characteristic of the conducting phase and its permeability. Moreover, this relation is so far only directly applicable to structures composed of overlapping grains where the grain density is known a priori. We develop a generalization to arbitrary structures modeled by Boolean models and characterized by Minkowski functionals. This generalization works well for the permeability of the void phase in systems with overlapping grains, but systematic deviations are found if the grain phase is transporting the fluid. In the latter case our analysis reveals a significant dependence on the spatial discretization of the porous structure, in particular the occurrence of single isolated pixels. To link the results to percolation theory we performed Monte Carlo simulations of the Euler characteristic of the open cluster, which reveals different regimes of applicability for our permeability-morphology relations close to and far away from the percolation threshold. PMID:26565348
Direct relations between morphology and transport in Boolean models
Scholz, Christian; Wirner, Frank; Klatt, Michael A.; Hirneise, Daniel; Schröder-Turk, Gerd E.; Mecke, Klaus; Bechinger, Clemens
2015-10-01
We study the relation of permeability and morphology for porous structures composed of randomly placed overlapping circular or elliptical grains, so-called Boolean models. Microfluidic experiments and lattice Boltzmann simulations allow us to evaluate a power-law relation between the Euler characteristic of the conducting phase and its permeability. Moreover, this relation is so far only directly applicable to structures composed of overlapping grains where the grain density is known a priori. We develop a generalization to arbitrary structures modeled by Boolean models and characterized by Minkowski functionals. This generalization works well for the permeability of the void phase in systems with overlapping grains, but systematic deviations are found if the grain phase is transporting the fluid. In the latter case our analysis reveals a significant dependence on the spatial discretization of the porous structure, in particular the occurrence of single isolated pixels. To link the results to percolation theory we performed Monte Carlo simulations of the Euler characteristic of the open cluster, which reveals different regimes of applicability for our permeability-morphology relations close to and far away from the percolation threshold.
Boolean Logic Optimization in Majority-Inverter Graphs
Amarù, Luca; Gaillardon, Pierre-Emmanuel; De Micheli, Giovanni
2015-01-01
We present a Boolean logic optimization framework based on Majority-Inverter Graph (MIG). An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. Current MIG optimization is supported by a consistent algebraic framework. However, when algebraic methods cannot improve a result quality, stronger Boolean methods are needed to attain further optimization. For this purpose, we propose MIG Boolean methods exploiting the error masking property of m...
ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS
Ali Muhammad Ali Rushdi; Adnan Ahmad Alsogati
2013-01-01
A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s). Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable a...
Using Boolean Constraint Propagation for Sub-clause Deduction
Darras, Sylvain; Dequen, Gilles; Devendeville, Laure; Mazure, Bertrand; Ostrowski, Richard; Sais, Lahkdar
2005-01-01
Boolean Constraint Propagation (BCP) is recognized as one of the most use- ful technique for efficient satisfiability checking. In this paper a new extension of the scope of boolean constraint propagation is proposed. It makes an original use of BCP to achieve further reduction of boolean formulas. Considering the impli- cation graph generated by the constraint propagation process as a resolution tree, sub-clauses from the original formula can be deduced. Then, we show how such extension can ...
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
Neural Network Boolean Factor Analysis and Applications
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Frolov, A.; Polyakov, P.Y.; Snášel, V.
-: WSEAS Press, 2007 - (Katehakis, M.; And ina, D.; Mastorakis, M.), s. 30-35. (Electrical and Computer Engineering Series). ISBN 978-960-6766-21-3. [CIMMACS'07. WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics. Tenerife (ES), 14.12.2007-16.12.2007] R&D Projects: GA MŠk 1M0567; GA AV ČR 1ET100300414; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : Hopfield neural network * boolean factor analysis * unsupervised learning * dimension reduction * data mining Subject RIV: BB - Applied Statistics, Operational Research
Towards boolean operations with thermal photons
Ben-Abdallah, Philippe
2016-01-01
The Boolean algebra is the natural theoretical framework for a classical information treatment. The basic logical operations are usually performed using logic gates. In this Letter we demonstrate that NOT, OR and AND gates can be realized exploiting the near-field radiative interaction in N-body systems with phase change materials. With the recent development of a photon thermal transistor and thermal memory, this result paves the way for a full information treatment and smart solutions for active thermal management at nanoscale with photons.
Solving the Satisfiability Problem Through Boolean Networks
Roli, Andrea; Milano, Michela
2011-01-01
In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework f...
Solving the Satisfiability Problem Through Boolean Networks
Roli, Andrea
2011-01-01
In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions. The mapping presented allows to develop a new class of algorithms to solve SAT. Moreover, this new approach suggests new ways to combine symbolic and connectionist computation and provides a general framework for local search algorithms.
E-Referencer: Transforming Boolean OPACs to Web Search Engines.
Khoo, Christopher S. G.; Poo, Danny C. C.; Toh, Teck-Kang; Hong, Glenn
E-Referencer is an expert intermediary system for searching library online public access catalogs (OPACs) on the World Wide Web. It is implemented as a proxy server that mediates the interaction between the user and Boolean OPACs. It transforms a Boolean OPAC into a retrieval system with many of the search capabilities of Web search engines.…
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
Ordered Boolean List (OBL): reducing the footprint for evaluating Boolean expressions.
Rossignac, Jaroslaw Jarek
2011-09-01
An Expanded Boolean Expression (EBE) does not contain any XOR or EQUAL operators. The occurrence of each variable is a different literal. We provide a linear time algorithm that converts an EBE of n literals into a logically equivalent Ordered Boolean List (OBL) and show how to use the OBL to evaluate the EBE in n steps and O(log log n) space, if the values of the literals are each read once in the order prescribed by the OBL. (An evaluation workspace of 5 bits suffices for all EBEs of up to six billion literals.) The primary application is the SIMD architecture, where the same EBE is evaluated in parallel for different input vectors when rendering solid models on the GPU directly from their Constructive Solid Geometry (CSG) representation. We compare OBL to the Reduced Ordered Binary Decision Diagram (ROBDD) and suggest possible applications of OBL to logic verification and to circuit design. PMID:21737862
A short Boolean derivation of mean failure frequency for any (also non-coherent) system
International Nuclear Information System (INIS)
For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.
Schmalz, Mark S.
1993-09-01
The processing of Boolean imagery compressed by runlength encoding (RLE) frequently exhibits greater computational efficiency than the processing of uncompressed imagery, due to the data reduction inherent in RLE. In a previous publication, we outlined general methods for developing operators that compute over RLE Boolean imagery. In this paper, we present sequential and parallel algorithms for a variety of operations over RLE imagery, including the customary arithmetic and logical Hadamard operations, as well as the global reduce functions of image sum and maximum. RLE neighborhood-based operations, as well as the more advanced RLE operations of linear transforms, connected component labelling, and pattern recognition are presented in the companion paper.
Robust Boolean Operation for Sculptured Models
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
To enhance the ability of current modeling system, an uniformed representation is designed to represent wire-frame, solid, surface models. We present an algorithm for Boolean operation between the models under this representation. Accuracy, efficiency and robustness are the main consideration. The geometric information is represented with trimmed parametric patches and trimmed parametric splines. The topological information is represented with an extended half-edge data structure. In the process of intersection calculation, hierarchy intersection method is applied for unified classification. Tracing the intersection curve to overcome degenerate cases that occur frequently in practice. The algorithm has been implemented as the modeling kernel of a feature based modeling system named GS-CAD98, which was developed on Windows/NT platform.
Consistent stabilizability of switched Boolean networks.
Li, Haitao; Wang, Yuzhen
2013-10-01
This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs. PMID:23787170
Relative stability of network states in Boolean network models of gene regulation in development.
Zhou, Joseph Xu; Samal, Areejit; d'Hérouël, Aymeric Fouquier; Price, Nathan D; Huang, Sui
2016-01-01
Progress in cell type reprogramming has revived the interest in Waddington's concept of the epigenetic landscape. Recently researchers developed the quasi-potential theory to represent the Waddington's landscape. The Quasi-potential U(x), derived from interactions in the gene regulatory network (GRN) of a cell, quantifies the relative stability of network states, which determine the effort required for state transitions in a multi-stable dynamical system. However, quasi-potential landscapes, originally developed for continuous systems, are not suitable for discrete-valued networks which are important tools to study complex systems. In this paper, we provide a framework to quantify the landscape for discrete Boolean networks (BNs). We apply our framework to study pancreas cell differentiation where an ensemble of BN models is considered based on the structure of a minimal GRN for pancreas development. We impose biologically motivated structural constraints (corresponding to specific type of Boolean functions) and dynamical constraints (corresponding to stable attractor states) to limit the space of BN models for pancreas development. In addition, we enforce a novel functional constraint corresponding to the relative ordering of attractor states in BN models to restrict the space of BN models to the biological relevant class. We find that BNs with canalyzing/sign-compatible Boolean functions best capture the dynamics of pancreas cell differentiation. This framework can also determine the genes' influence on cell state transitions, and thus can facilitate the rational design of cell reprogramming protocols. PMID:26965665
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Yamakami, Tomoyuki
2010-01-01
Constraint satisfaction problems (or CSPs) have been extensively studied in AI, database theory, graph theory, etc. From an approximation viewpoint, it has been important to approximate the total number of assignments that satisfy all given Boolean constraints. There is a trichotomy theorem for such approximate counting for (non-weighted) Boolean CSPs; namely, all such counting problems are neatly classified into three categories under polynomial-time approximation-preserving reductions [Dyer, Goldberg, and Jerrum, 2010]. We extend this result to approximate counting for complex-weighted Boolean CSPs, provided that all arity-1 constraints are freely available to use. This makes a significant progress in the quest for the approximation classification of all counting Boolean CSPs in the most general form. To deal with complex weights, we employ proof techniques along the line of solving Holant problems [Valiant, 2002, 2008]. Our result also gives an approximation version of the dichotomy theorem of the complexi...
Automatic Ranked Output from Boolean Searches in SIRE
Noreault, Terry; And Others
1977-01-01
This study examined the effectiveness using an automatic algorithm to rank the results of Boolean searches of an inverted file design document retrieval system. Relevant documents were ranked significantly higher than nonrelevant documents on output lists. (Author/KP)
Boolean Burritos: How the Faculty Ate Up Keyword Searching.
York, Sherry
1999-01-01
Describes an activity that librarians can use to acquaint teachers with keyword searching and Boolean operators to more successfully use the library's online catalog. Uses food ingredients to represent various possible combinations. (LRW)
Linear Programming Formulation of the Boolean Satisfiability Problem
Diaby, Moustapha
2008-01-01
In this paper, we present a new, graph-based modeling approach and a polynomial-sized linear programming (LP) formulation of the Boolean satisfiability problem (SAT). The approach is illustrated with a numerical example.
Directory of Open Access Journals (Sweden)
Claudia Stötzel
Full Text Available In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.
On the number of attractors of Boolean automata circuits
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2009-01-01
In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work focuses on th...
Boolean Equi-propagation for Optimized SAT Encoding
Metodi, Amit; Lagoon, Vitaly; Stuckey, Peter J
2011-01-01
We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings. We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.
Enhancing Boolean networks with fuzzy operators and edge tuning
Poret, Arnaud; Monteiro Sousa, Claudio; Boissel, Jean-Pierre
2014-01-01
Quantitative modeling in systems biology can be difficult due to the scarcity of quantitative details about biological phenomenons, especially at the subcellular scale. An alternative to escape this difficulty is qualitative modeling since it requires few to no quantitative information. Among the qualitative modeling approaches, the Boolean network formalism is one of the most popular. However, Boolean models allow variables to be valued at only true or false, which can appear too simplistic ...
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms and Requirements
Audemard, Gilles; Bertoli, Piergiorgio; Cimatti, Alessandro; Kornilowicz, Artur; Sebastiani, Roberto
2002-01-01
In the last years we have witnessed an impressive advance in the efficiency of boolean solving techniques, which has brought large previously intractable problems at the reach of state-of-the-art solvers. Unfortunately, simple boolean expressions are not expressive enough for representing many real-world problems, which require handling also integer or real values and operators. On the other hand, mathematical solvers, like computer-algebra systems or constraint solvers, cannot handle efficie...
Boolean network model predicts knockout mutant phenotypes of fission yeast.
Directory of Open Access Journals (Sweden)
Maria I Davidich
Full Text Available BOOLEAN NETWORKS (OR: networks of switches are extremely simple mathematical models of biochemical signaling networks. Under certain circumstances, Boolean networks, despite their simplicity, are capable of predicting dynamical activation patterns of gene regulatory networks in living cells. For example, the temporal sequence of cell cycle activation patterns in yeasts S. pombe and S. cerevisiae are faithfully reproduced by Boolean network models. An interesting question is whether this simple model class could also predict a more complex cellular phenomenology as, for example, the cell cycle dynamics under various knockout mutants instead of the wild type dynamics, only. Here we show that a Boolean network model for the cell cycle control network of yeast S. pombe correctly predicts viability of a large number of known mutants. So far this had been left to the more detailed differential equation models of the biochemical kinetics of the yeast cell cycle network and was commonly thought to be out of reach for models as simplistic as Boolean networks. The new results support our vision that Boolean networks may complement other mathematical models in systems biology to a larger extent than expected so far, and may fill a gap where simplicity of the model and a preference for an overall dynamical blueprint of cellular regulation, instead of biochemical details, are in the focus.
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.
Efficient Analog Circuits for Boolean Satisfiability
Yin, Xunzhao; Varga, Melinda; Ercsey-Ravasz, Maria; Toroczkai, Zoltan; Hu, Xiaobo Sharon
2016-01-01
Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative solutions to tackle such problems. Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed (Nature Physics, 7(12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT). This solver shows polynomial analog time-complexity on even the hardest benchmark $k$-SAT ($k \\geq 3$) formulas, but at an energy cost through exponentially driven auxiliary variables. With some modifications to the CTDS equations, here we present a novel analog hardware SAT solver, AC-SAT, implementing the CTDS. AC-SAT is intended to be used as a co-processor, and with its modular design can be readily extended to different problem sizes. The circuit is designed and simulated based on a 32nm CMOS technology. SPICE simulation results show speedup factor...
Measuring Mutual Information in Random Boolean Networks
Luque, B; Luque, Bartolo; Ferrera, Antonio
1999-01-01
During the last few years an area of active research in the field of complex systems is that of their information storing and processing abilities. Common opinion has it that the most interesting beaviour of these systems is found ``at the edge of chaos'', which would seem to suggest that complex systems may have inherently non-trivial information proccesing abilities in the vicinity of sharp phase transitions. A comprenhensive, quantitative understanding of why this is the case is however still lacking. Indeed, even ``experimental'' (i.e., often numerical) evidence that this is so has been questioned for a number of systems. In this paper we will investigate, both numerically and analitically, the behavior of Random Boolean Networks (RBN's) as they undergo their order-disorder phase transition. We will use a simple mean field approximation to treat the problem, and without lack of generality we will concentrate on a particular value for the connectivity of the system. In spite of the simplicity of our argume...
Second moment method for a family of boolean CSP
Boufkhad, Yacine
2011-01-01
The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first moment method on the number of solutions permits to compute upper bounds on any boolean CSP, the second moment method used for computing lower bounds proves to be more tricky and in most cases gives only the trivial lower bound 0. In this paper, we define a subclass of boolean CSP covering the monotone versions of many known NP-Complete boolean CSPs. We give a method for computing non trivial lower bounds for any member of this subclass. This is achieved thanks to an application of the second moment method to some selected solutions called characteristic solutions that depend on the boolean CSP considered. We apply, as an example, this method to establish that the threshold r_{k} of monotone 1-in-k-SAT is \\log k/k\\leq r_{k}\\leq\\log^{2}k/k
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Glasser, Christian; Selivanov, Victor
2008-01-01
The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the single levels of these hierarchies and obtain the following results: - The classes of the Boolean hierarchy over level $\\Sigma_1$ of the dot-depth hierarchy are decidable in $NL$ (previously only the decidability was known). The same remains true if predicates mod $d$ for fixed $d$ are allowed. - If modular predicates for arbitrary $d$ are allowed, then the classes of the Boolean hierarchy over level $\\Sigma_1$ are decidable. - For the restricted case of a two-letter alphabet, the classes of the Boolean hierarchy over level $\\Sigma_2$ of the Straubing-Th\\'erien hierarchy are decidable in $NL$. This is the first decidability result for this hierarchy. - The membership problems for all mentioned Boolean-hierarchy classes are logspace many-one hard for $NL$. - T...
A more robust Boolean model describing inhibitor binding
Institute of Scientific and Technical Information of China (English)
Zhaoqian Steven XIE; Chao TANG
2008-01-01
From the first application of the Boolean model to the cell cycle regulation network of budding yeast, new regulative pathways have been discovered, par-ticularly in the G1/S transition circuit. This discovery called for finer modeling to study the essential biology, and the resulting outcomes are first introduced in the ar-ticle. A traditional Boolean network model set up for the new G1/S transition circuit shows that it cannot correctly simulate real biology unless the model parameters are fine tuned. The deficiency is caused by an overly coarse-grained description of the inhibitor binding process, which shall be overcome by a two-vector model proposed whose robustness is surveyed using random perturba-tions. Simulations show that the proposed two-vector model is much more robust in describing inhibitor binding processes within the Boolean framework.
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets. PMID:26336114
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....
Experimental Comparison of Schemes for Interpreting Boolean Queries
Lee, Whay C.; Edward A Fox
1988-01-01
The standard interpretation of the logical operators in a Boolean retrieval system is in general too strict. A standard Boolean query rarely comes close to retrieving all and only those documents which are relevant to the user. An AND query is often too narrow and an OR query is often too broad. The choice of the AND results in retrieving on the left end of a typical average recall-precision graph, while the choice of the OR results in retrieving on the right end, implying a tradeoff between ...
ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS
Directory of Open Access Journals (Sweden)
Ali Muhammad Ali Rushdi
2013-01-01
Full Text Available A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s. Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable at a latter instance t2 to its value at an earlier instance t1. This equation remains valid when the times t1 and t2 are both augmented by any integral multiple of the underlying time period. In other words, there are infinitely many versions of a reduced scalar equation, any of which is useful for deducing information about the cyclic behavior of the network. However, to obtain correct information about the transient behavior of the network, one must find the true reduced scalar equation for which instances t1 and t2 are minimal. This study investigates the nature, derivation and utilization of reduced scalar equations. It relies on Boolean-algebraic manipulations for the derivation of such equations and suggests that this derivation can be facilitated by seeking certain orthogonality relations among certain successive (albeit not necessarily consecutive instances of the same scalar variable. We demonstrate, contrary to previously published assumptions or assertions, that there is typically no common reduced scalar equation for all the scalar variables. Each variable usually satisfies its own distinct reduced scalar equation. We also demonstrate that the derivation of a reduced scalar equation is achieved not only by proving it but also by disproving an immediately preceding version of it when such a version might exist. We also demonstrate that, despite the useful insight supplied by the reduced scalar equations, they do not provide a total solution like the
Some Properties of Inclusions of Multisets and Contractive Boolean Operators
Hyvernat, Pierre
2011-01-01
10 pages, including appendix Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and characterize the preorder in terms of the simpler pointwise inclusion and the existence of a special increasing boolean operator f:B^n -> B^n. We also show that contrary to increasing boolean operators, the relevant operators are no...
Boolean Logic: An Aid for Searching Computer Databases in Special Education and Rehabilitation.
Summers, Edward G.
1989-01-01
The article discusses using Boolean logic as a tool for searching computerized information retrieval systems in special education and rehabilitation technology. It includes discussion of the Boolean search operators AND, OR, and NOT; Venn diagrams; and disambiguating parentheses. Six suggestions are offered for development of good Boolean logic…
Generalizations of Boolean imaging operations to the continuous-tone domain
Harrington, Steven J.
1992-07-01
In black-and-white printing the page image can be represented within a computer as an array of binary values indicating whether or not pixels should be inked. The Boolean operators of AND, OR, and EXCLUSIVE-OR are often used when adding new objects to the image array. For color printing the page may be represented as an array of `continuous-tone' color values, and the generalization of these logic functions to gray-scale or full-color images is, in general, not defined or understood. When incrementally composing a page image, new colors can replace old in an image buffer, or new colors and old can be combined according to some mixing function to form a composite color, which is stored. This paper examines the properties of the Boolean operations and suggests full-color functions that preserve the desired properties. These functions can be used to combine colored images in ways that preserve information about object shapes when the shapes overlap. The relationships between the proposed functions and physical models of color mixing are also discussed.
Coevolution of Information Processing and Topology in Hierarchical Adaptive Random Boolean Networks
Gorski, Piotr J; Holyst, Janusz A
2015-01-01
Random Boolean networks (RBNs) are frequently employed for modelling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive RBN (HARBN) as a system consisting of distinct adaptive RBNs - subnetworks - connected by a set of permanent interlinks. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. We investigate mean node information, mean edge information as well as a mean node degree as functions of model parameters and demonstrate HARBN's ability to describe complex hierarchical systems.
The one-way communication complexity of the Boolean Hidden Matching Problem
Kerenidis, I; Kerenidis, Iordanis; Raz, Ran
2006-01-01
We give a tight lower bound of Omega(\\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communication complexity protocol of O(\\log n) qubits for this problem, we obtain an exponential separation of quantum and classical one-way communication complexity for partial functions. A similar result was independently obtained by Gavinsky, Kempe, de Wolf [GKdW06]. Our lower bound is obtained by Fourier analysis, using the Fourier coefficients inequality of Kahn Kalai and Linial [KKL88].
The receptor mosaic hypothesis of the engram: possible relevance of Boolean network modeling.
Zoli, M; Guidolin, D; Fuxe, K; Agnati, L F
1996-09-01
In the past 15 years, several lines of evidence have shown that receptors for chemical signals can interact in domains of the plasma membrane and possibly form molecular circuits encoding logical operators. In this frame, the receptor mosaic hypothesis of the engram was advanced. According to this proposal, aggregates of different receptor species (mosaics) may form in neuronal membranes (typically synapses) and constitute a memory trace (engram) of its activity. In the present paper, we present an attempt to model the functioning of aggregates of interacting receptors in membrane domains by means of random Boolean networks. PMID:8968825
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
International Nuclear Information System (INIS)
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software
Boolean approaches to graph embeddings related to VLSI
Institute of Scientific and Technical Information of China (English)
刘彦佩
2001-01-01
This paper discusses the development of Boolean methods in some topics on graph em-beddings which are related to VLSI. They are mainly the general theory of graph embeddability, the orientabilities of a graph and the rectilinear layout of an electronic circuit.
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
On the Road to Genetic Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.
2007-01-01
Roč. 17, č. 6 (2007), s. 675-688. ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithm s * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007
Boolean linear differential operators on elementary cellular automata
Martín Del Rey, Ángel
2014-12-01
In this paper, the notion of boolean linear differential operator (BLDO) on elementary cellular automata (ECA) is introduced and some of their more important properties are studied. Special attention is paid to those differential operators whose coefficients are the ECA with rule numbers 90 and 150.
Pointwise Approximation for the Iterated Boolean Sums of Bernstein Operators
Institute of Scientific and Technical Information of China (English)
HUO Xiao-yan; LI Cui-xiang; YAO Qiu-mei
2013-01-01
In this paper,with the help of modulus of smoothness ω2r(4)(f,t),we discuss the pointwise approximation properties for the iterated Boolean sums of Bernstein operator Bnn and obtain direct and inverse theorems when 1-1/r ≤ λ ≤ 1,r ∈ N.
Graphical interpretation of Boolean operators for protein NMR assignments
Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy
2008-01-01
We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical three-
On the Prime Whales of a Boolean Algebra
Holland, Jason
2013-01-01
In this note, we introduce objects called prime whales and use them to represent a Boolean algebra as an algebra of sets in a way that is analogous to Stone's Representation Theorem. We also characterize the existence of prime whales in terms of the existence of prime ideals.
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
borealis - A generalized global update algorithm for Boolean optimization problems
Zhu, Zheng; Katzgraber, Helmut G
2016-01-01
Optimization problems with Boolean variables that fall into the nondeterministic polynomial (NP) class are of fundamental importance in computer science, mathematics, physics and industrial applications. Most notably, solving constraint-satisfaction problems, which are related to spin-glass-like Hamiltonians in physics, remains a difficult numerical task. As such, there has been great interest in designing efficient heuristics to solve these computationally difficult problems. Inspired by parallel tempering Monte Carlo in conjunction with the rejection-free isoenergetic cluster algorithm developed for Ising spin glasses, we present a generalized global update optimization heuristic that can be applied to different NP-complete problems with Boolean variables. The global cluster updates allow for a wide-spread sampling of phase space, thus considerably speeding up optimization. By carefully tuning the pseudo-temperature (needed to randomize the configurations) of the problem, we show that the method can efficie...
High Quality Test Pattern Generation and Boolean Satisfiability
Eggersglüß, Stephan
2012-01-01
This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT). A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects. The aim of the techniques and methodologies presented in this book is to improve SAT-based ATPG, in order to make it applicable in industrial practice. Readers will learn to improve the performance and robustness of the overall test generation process, so that the ATPG algorithm reliably will generate test patterns for most targeted faults in acceptable run time to meet the high fault coverage demands of industry. The techniques and improvements presented in this book provide the following advantages: Provides a comprehensive introduction to test generation and Boolean Satisfiability (SAT); Describes a...
Algorithms for Finding Small Attractors in Boolean Networks
Directory of Open Access Journals (Sweden)
Hayashida Morihiro
2007-01-01
Full Text Available A Boolean network is a model used to study the interactions between different genes in genetic regulatory networks. In this paper, we present several algorithms using gene ordering and feedback vertex sets to identify singleton attractors and small attractors in Boolean networks. We analyze the average case time complexities of some of the proposed algorithms. For instance, it is shown that the outdegree-based ordering algorithm for finding singleton attractors works in time for , which is much faster than the naive time algorithm, where is the number of genes and is the maximum indegree. We performed extensive computational experiments on these algorithms, which resulted in good agreement with theoretical results. In contrast, we give a simple and complete proof for showing that finding an attractor with the shortest period is NP-hard.
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
Estimation of Boolean Factor Analysis Performance by Informational Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
Berlin : Springer, 2010 - (Snášel, V.; Szczepaniak, P.; Abraham, A.; Kacprzyk, J.), s. 83-94 ISBN 978-3-642-10686-6. - (Advances in Intelligent and Soft Computing. 67). [AWIC 2009. Atlantic Web Intelligence Conference /6./. Prague (CZ), 09.09.2009-11.09.2009] Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * informational gain * Hopfield-like network Subject RIV: IN - Informatics, Computer Science
Reduction of Database Independence to Dividing in Atomless Boolean Algebras
Hyttinen, Tapani; Paolini, Gianluca
2014-01-01
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov [4], the former case of independence can be seen as the discrete version of the latter.
Yes/No/Maybe: A Boolean attempt at feedback
12130478 - Louw, Henk; 10095519 - Van Rooy, Albertus Jacobus
2010-01-01
This paper describes an experiment in which Boolean feedback (a kind of checklist) was used to provide feedback on the paragraph structures of first year students in an Academic Literacy course. We begin by introducing the major problems with feedback on L2 writing and establishing why a focus on paragraph structures in particular is of importance. The experiment conducted was a two-draft assignment in which three different kinds of feedback (technique A: handwritten comments, B: consciousnes...
A Boolean Approach to Airline Business Model Innovation
Hvass, Kristian
2012-01-01
Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities le...
A Boolean algebra approach to the construction of snarks
Fiol Mora, Miquel Àngel
1991-01-01
This work deals with the construction of snarks, that is, cubic graphs that cannot be 3-edge-colored. A natural generalization of the concept of "color", that describes in a simple way the coloring ("0" or "1") of any set of (semi)edges, is introduced. This approach allows us to apply the Boolean logic theory to find an ample family of snarks, which includes many of the previous known constructions and also some interesting ones. Peer Reviewed
Boolean logic device done with DFB laser diode
Hurtado Villavieja, Antonio; González Marcos, Ana; Martín Pereda, José Antonio
2004-01-01
We present simulation results on how power output-input characteristic Instability in Distributed FeedBack -DFB semiconductor laser diode SLA can be employed to implemented Boolean logic device. Two configurations of DFB Laser diode under external optical injection, either in the transmission or in the reflective mode of operation, is used to implement different Optical Logic Cells (OLCs), called the Q- and the P-Device OLCs. The external optical injection correspond to two inputs data plus a...
Mapping Complex Networks: Exploring Boolean Modeling of Signal Transduction Pathways
Bhardwaj, Gaurav; Wells, Christine P.; Albert, Reka; van Rossum, Damian B.; Patterson, Randen L
2009-01-01
In this study, we explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signaling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP3R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomization of ...
Matroids, hereditary collections and simplicial complexes having boolean representations
Rhodes, John; Silva, Pedro V.
2012-01-01
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\\vee$-generated lattices. The lattice of flats, defined for hereditary collections, lattices and matrices, plays a central role in the theory. The representations constitute a lattice and the minimal and strictly join irreducible elements are studied, as well as various closure operators.
Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice
Heba I. Mustafa
2013-01-01
The concept of soft sets based on complete atomic Boolean lattice, which can be seen as a generalization of soft sets, is introduced. Some operations on these soft sets are discussed, and new types of soft sets such as full, keeping infimum, and keeping supremum are defined and supported by some illustrative examples. Two pairs of new soft rough approximation operators are proposed and the relationship among soft set is investigated, and their related properties are given. We show that Järvin...
MILES FORMULAE FOR BOOLEAN MODELS OBSERVED ON LATTICES
Directory of Open Access Journals (Sweden)
Joachim Ohser
2011-05-01
Full Text Available The densities of the intrinsic volumes – in 3D the volume density, surface density, the density of the integral of the mean curvature and the density of the Euler number – are a very useful collection of geometric characteristics of random sets. Combining integral and digital geometry we develop a method for efficient and simultaneous calculation of the intrinsic volumes of random sets observed in binary images in arbitrary dimensions. We consider isotropic and reflection invariant Boolean models sampled on homogeneous lattices and compute the expectations of the estimators of the intrinsic volumes. It turns out that the estimator for the surface density is proved to be asymptotically unbiased and thusmultigrid convergent for Boolean models with convex grains. The asymptotic bias of the estimators for the densities of the integral of the mean curvature and of the Euler number is assessed for Boolean models of balls of random diameters. Miles formulae with corresponding correction terms are derived for the 3D case.
Image Restoration Research Based on Boolean Cloud Model Algorithm%基于布尔云模型算法的图像修复研究
Institute of Scientific and Technical Information of China (English)
王宝红; 郭水旺; 季钢
2013-01-01
Aiming at the deficiencies of the existing image restoration algorithm,Boolean cloud model algorithm is used.First the cloud model is constructed,cloud entropy to determine cloud Boolean relations,clouds appear,Boolean logic to calculate each cloud droplet collection of mutual information entropy,entropy of different results to determine value.Followed by the input and Boolean cloud state function determines the cloud model decision by input Boolean function can produce new clouds again,optimize cloud states choose different cloud entropy dynamic changes.Finally,the algorithm processes.simulation results show operator to connect natural repair image,smoothness,to maintain the overall continuous,and PSNR value.%针对现有图像修复算法的不足,采用布尔云模型算法.首先构造云模型,利用云熵确定云布尔关系.不同的云团值出现时,布尔逻辑计算每个云滴集合的互信息熵.通过比较熵的不同来确定结果值；接着在受输入和布尔函数决定后产生云态,云模型在受输入和布尔函数决定后,可以再次产生新的云团.对云态进行选择优化,其不同的云熵动态变化,最后给出了算法流程.仿真结果显示算法对修复图像连接自然,有光滑性,保持了整体连续,并且PSNR值较大.
Expectation-Maximization Approach to Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
Piscataway: IEEE, 2011, s. 559-566. ISBN 978-1-4244-9636-5. [IJCNN 2011. International Joint Conference on Neural Networks. San Jose (US), 31.07.2011-05.08.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * bars problem * dendritic inhibition * expectation-maximization * neural network application * statistics Subject RIV: IN - Informatics, Computer Science
Neural Network Based Boolean Factor Analysis of Parliament Voting
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Polyakov, P.Y.; Húsek, Dušan; Řezanková, H.
Heidelberg : Springer, 2006 - (Rizzi, A.; Vichi, M.), s. 861-868 ISBN 3-7908-1708-2. [COMPSTAT 2006. Symposium /17./. Rome (IN), 28.08.2006-01.09.2006] R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Grant ostatní: RFBR(RU) 05-07-90049 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural networks * social networks Subject RIV: BB - Applied Statistics, Operational Research
Self-organized networks of competing boolean agents
Paczuski; Bassler; Corral
2000-04-01
A model of Boolean agents competing in a market is presented where each agent bases his action on information obtained from a small group of other agents. The agents play a competitive game that rewards those in the minority. After a long time interval, the poorest player's strategy is changed randomly, and the process is repeated. Eventually the network evolves to a stationary but intermittent state where random mutation of the worst strategy can change the behavior of the entire network, often causing a switch in the dynamics between attractors of vastly different lengths. PMID:11019043
Dimensionality Reduction in Boolean Data: Comparison of Four BMF Methods
Czech Academy of Sciences Publication Activity Database
Bartl, E.; Bělohlávek, R.; Osicka, P.; Řezanková, Hana
Berlin: Springer, 2015 - (Masulli, F.; Petrosino, A.; Rovetta, S.), s. 118-133. (Lecture Notes in Computer Science. 7627). ISBN 978-3-662-48576-7. ISSN 0302-9743. [CHDD 2012. Clustering High-Dimensional Data. International Workshop /1./. Naples (IT), 15.05.2012-15.05.2012] R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk CZ.1.07/2.3.00/20.0059 Keywords : binary data * dimensionality reduction * Boolean factor analysis * matrix decomposition Subject RIV: BB - Applied Statistics, Operational Research
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97. ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
C*-algebras associated to Boolean dynamical systems
Pardo Espino, Enrique
2016-01-01
The goal of this talk is to present the C*-algebra $C^*(\\mathcal{B}, \\mathcal{L}, \\theta)$ of a Boolean dynamical system $(\\mathcal{B}, \\mathcal{L}, \\theta)$, that generalizes the $C^*$-algebra associated to a labelled graph introduced by Bates and Pask, and to determine its simplicity, its gauge invariant ideals, as well as compute its K-Theory. This is a joint work with Toke Meier Carlsen (Department of Science and Technology, University of the Faroe Islands) and Eduard Ortega (Departme...
Comparison of Two Neural Networks Approaches to Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Polyakov, P.Y.; Frolov, A. A.; Húsek, Dušan
Los Alamitos: IEEE Computer Society, 2009 - (Snášel, V.; Pokorný, J.; Pichappan, P.; El-Qawasmeh, E.), s. 316-321 ISBN 978-1-4244-4614-8. [NDT 2009. International Conference on Networked Digital Technologies /1./. Ostrava (CZ), 29.07.2009-31.07.2009] R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * artificial inteligence * neural networks * multivariate statistics * Boolean factor analysis * Hopfield-like neural networks * feed forward neural network Subject RIV: BB - Applied Statistics, Operational Research
Boolean approaches to graph embeddings related to VLSI
Institute of Scientific and Technical Information of China (English)
LIU; Yanpei(
2001-01-01
［1］Hu, T. C., Kuh, S. E., Theory and concepts of circuit layout, in VLSI Circuit Layout: Theory and Design, New York:IEEE Press, 1985, 3-18.［2］Liu Yanpei, Embeddability in Graphs, Boston-Beijing: Kluwer Science, 1995.［3］Liu Yanpei, Some combinatorial optimization problems arising from VLSI circuit design, Applied Math. -JCU, 1993, 38:218-235.［4］Liu Yanpei, Marchioro, P. , Petreschi, R., At most single bend embeddings of cubic graphs, Applied Math. -CJU, 1994,39: 127-142.［5］Liu Yanpei, Marchioro, P. , Petreschi, R. et al. , Theoretical results on at most 1-bend embeddability of graphs, Acta Math.Appl. Sinica, 1992, 8: 188-192.［6］Liu Yanpei, Morgana, A., Simeone, B., General theoretical results on rectilinear embeddability of graphs, Acta Math. Ap- pl. Simca, 1991, 7: 187-192.［7］Calamoneri, T., Petreschi, R., Liu Yanpei, Optimally Extending Bistandard Graphs on the Orthogonal Grid, ASCM2000 Symposium, Tailand, Dec.17-21, 2000.［8］Liu Yanpei, Morgana, A., Simeone, B., A graph partition problem, Acta Math. Appl. Sinica, 1996, 12: 393-400.［9］Liu Yanpei, Morgana, A. , Simeone, B. , A linear algorithm for 2-bend embeddings of planar graphs in the two dimensional grid, Discrete Appl. Math., 1998, 81: 69-91.［10］Liu Yanpei, Boolean approach to planar embeddings of a graph, Acta Math. Sinica, New Series, 1989, 5: 64-79.［11］Hammer, P. L., Liu Yanpei, Simeone, B., Boolean approaches to combinatorial optimization, J. Math. Res. Expos.,1990, 10: 300-312, 455-468, 619-628.［12］Liu Yanpei, Boolean planarity characterization of graphs, Acta Math. Sinica, New Series, 1988, 4: 316-329.［13］Liu Yanpei, Boolean characterizations of planarity and planar embeddings of graphs, Ann. O. R., 1990, 24: 165-174.
Soft Rough Approximation Operators on a Complete Atomic Boolean Lattice
Directory of Open Access Journals (Sweden)
Heba I. Mustafa
2013-01-01
Full Text Available The concept of soft sets based on complete atomic Boolean lattice, which can be seen as a generalization of soft sets, is introduced. Some operations on these soft sets are discussed, and new types of soft sets such as full, keeping infimum, and keeping supremum are defined and supported by some illustrative examples. Two pairs of new soft rough approximation operators are proposed and the relationship among soft set is investigated, and their related properties are given. We show that Järvinen's approximations can be viewed as a special case of our approximation. If , then our soft approximations coincide with crisp soft rough approximations (Feng et al. 2011.
The number system hidden inside the Boolean satisfiability problem
Cho, Keum-Bae
2014-01-01
The Boolean satisfiability (SAT) problem is the first known example of an NP-complete problem, and thousands of NP-compete problems have been identified by reducing the SAT to the problems. Researchers have tried to find a definite mathematical expression that distinguishes among NL-complete, P-complete, and NP-complete problems such as 2-SAT, Horn-SAT, and 3-SAT. In this paper, we introduce the natural number system hidden inside the SAT structure. We reduce a SAT instance to an integer-prog...
The behavior of noise-resilient Boolean networks with diverse topologies
International Nuclear Information System (INIS)
The dynamics of noise-resilient Boolean networks with majority functions and diverse topologies is investigated. A wide class of possible topological configurations is parametrized as a stochastic blockmodel. For this class of networks, the dynamics always undergoes a phase transition from a non-ergodic regime, where a memory of its past states is preserved, to an ergodic regime, where no such memory exists and every microstate is equally probable. Both the average error on the network and the critical value of noise where the transition occurs are investigated analytically, and compared to numerical simulations. The results for 'partially dense' networks, comprising relatively few, but dynamically important nodes, which have a number of inputs that greatly exceeds the average for the entire network, give very general upper bounds on the maximum resilience against noise attainable on globally sparse systems
Directory of Open Access Journals (Sweden)
Jean-Marc Roussel
2014-01-01
Full Text Available Formal methods can strongly contribute to improve dependability of controllers during design, by providing means to avoid flaws due to designers' omissions or specifications misinterpretations. This paper presents a synthesis method dedicated to logic controllers. Its goal is to obtain the control laws from specifications given in natural language by symbolic computation. The formal framework that underlies this method is the Boolean algebra of n-variable switching functions. In this algebra, thanks to relations and theorems presented in this paper, it is possible to formally express logical controllers specifications, to automatically detect inconsistencies in specifications, and to obtain automatically the set of solutions or to choose an optimal solution according to given optimization criteria. The application of this synthesis method to an example allows illustrating its main advantages.
16 Boolean logics in three steps with two anti-serially connected memristors
Zhou, Yaxiong; Li, Yi; Xu, Lei; Zhong, Shujing; Sun, Huajun; Miao, Xiangshui
2015-06-01
Memristor based logic gates that can execute memory and logic operations are regarded as building blocks for non Von Neumann computation architecture. In this letter, Ta/GeTe/Ag memristors were fabricated and showed reproducible binary switches between high-resistance and low-resistance states. Utilizing a structure with two anti-serially connected memristors, we propose a logic operation methodology, based on which arbitrary Boolean logic can be realized in three steps, and the logic result can be nonvolatilely stored. A functionally complete logic operation: NAND is further verified by HSPICE simulation and experiments. The implementation of logic-in-memory unit may stimulate the development of future massive parallel computing.
Boolean Operators and the Naive End-User: Moving to AND.
Proctor, Edward
2002-01-01
Discusses the confusion among end users in using Boolean operators when searching electronic resources. Highlights include search engines; site-specific search engines; the counterintuitive nature of Boolean logic; hidden defaults; the problem of conceptualization; reprogramming defaults; and a lack of user education. (LRW)
Young, Degi; Shneiderman, Ben
1993-01-01
Literature showing the disadvantages of Boolean logic in online searching is reviewed, and research comparing the Filter/Flow visual interface (i.e., a graphical representation of Boolean operators) with a text-only interface is described. A significant difference in the total number of correct queries is reported that favored Filter/Flow. (16…
Disjunctive normal forms for any class of Boolean algebras with operators
Khaled, Mohamed
2015-01-01
Disjunctive normal forms can provide elegant and constructive proofs of many standard results such as completeness, decidability and so on. They were also used to show non atomicity of some free algebras of specific Boolean algebras with operators. Here, we generalize the normal forms for any class of Boolean algebras with operators.
Radecki, Tadeusz
1985-01-01
Reports research results into a methodology for determining similarity between queries characterized by Boolean search request formulations and discusses similarity measures for Boolean combinations of index terms. Rationale behind these measures is outlined, and conditions ensuring their equivalence are identified. Results of an experiment…
Boolean Models of Biosurfactants Production in Pseudomonas fluorescens
Richard, Adrien; Rossignol, Gaelle; Comet, Jean-Paul; Bernot, Gilles; Guespin-Michel, Jannine; Merieau, Annabelle
2012-01-01
Cyclolipopeptides (CLPs) are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene () and not restored by complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained. PMID:22303435
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.
Boolean modeling in systems biology: an overview of methodology and applications
International Nuclear Information System (INIS)
Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)
Chaos synchronization of two stochastically coupled random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Hung, Y.-C. [Department of Physics, National Sun Yat-sen University, Kaohsiung, Taiwan (China) and Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)]. E-mail: d9123801@student.nsysu.edu.tw; Ho, M.-C. [Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)]. E-mail: t1603@nknucc.nknu.edu.tw; Lih, J.-S. [Department of Physics and Geoscience, National Pingtung University of Education, Pingtung, Taiwan (China); Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China); Jiang, I-M. [Department of Physics, National Sun Yat-sen University, Kaohsiung, Taiwan (China); Nonlinear Science Group, Department of Physics, National Kaohsiung Normal University, Kaohsiung, Taiwan (China)
2006-07-24
In this Letter, we study the chaos synchronization of two stochastically coupled random Boolean networks (RBNs). Instead of using the 'site-by-site and all-to-all' coupling, the coupling mechanism we consider here is that: the nth cell in a network is linked by an arbitrarily chosen cell in the other network with probability {rho}, and it possesses no links with probability 1-{rho}. The mechanism is useful to investigate the coevolution of biological species via horizontal genetic exchange. We show that the density evolution of networks can be described by two deterministic coupled polynomial maps. The complete synchronization occurs when the coupling parameter exceeds a critical value. Moreover, the reverse bifurcations in inhomogeneous condition are observed and under our discussion.
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.
Complete Boolean Satisfiability Solving Algorithms Based on Local Search
Institute of Scientific and Technical Information of China (English)
Wen-Sheng Guo; Guo-Wu Yang; William N.N.Hung; Xiaoyu Song
2013-01-01
Boolean satisfiability (SAT) is a well-known problem in computer science,artificial intelligence,and operations research.This paper focuses on the satisfiability problem of Model RB structure that is similar to graph coloring problems and others.We propose a translation method and three effective complete SAT solving algorithms based on the characterization of Model RB structure.We translate clauses into a graph with exclusive sets and relative sets.In order to reduce search depth,we determine search order using vertex weights and clique in the graph.The results show that our algorithms are much more effective than the best SAT solvers in numerous Model RB benchmarks,especially in those large benchmark instances.
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Yamakami, Tomoyuki
2011-01-01
We give a unified treatment to optimization problems that can be expressed in the form of nonnegative-real-weighted Boolean constraint satisfaction problems. Creignou, Khanna, Sudan, Trevisan, and Williamson studied the complexity of approximating their optimal solutions whose optimality is measured by the sums of outcomes of constraints. To explore a wider range of optimization constraint satisfaction problems, following an early work of Marchetti-Spaccamela and Romano, we study the case where the optimality is measured by products of constraints' outcomes. We completely classify those problems into three categories: PO problems, NPO-hard problems, and intermediate problems that lie between the former two categories. To prove this trichotomy theorem, we analyze characteristics of nonnegative-real-weighted constraints using a variant of the notion of T-constructibility developed earlier for complex-weighted counting constraint satisfaction problems.
Boolean Factor Analysis by Expectation-Maximization Method
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
Heidelberg : Springer, 2013 - (Kudělka, M.; Pokorný, J.; Snášel, V.; Abraham, A.), s. 243-254 ISBN 978-3-642-31602-9. ISSN 2194-5357. - (Advances in Intelligent Systems and Computing. 179). [IHCI 2011. International Conference on Intelligent Human Computer Interaction /3./. Prague (CZ), 29.08.2011-31.08.2011] R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070 Institutional research plan: CEZ:AV0Z10300504 Keywords : neural networks * hidden pattern search * Boolean factor analysis * generative model * information redundancy * exceptation-maximization Subject RIV: IN - Informatics, Computer Science
A Boolean delay equation model of ENSO variability
Saunders, Amira; Ghil, Michael
2001-12-01
Boolean delay equations (BDEs) provide a mathematical framework to formulate and analyze conceptual models of complex multi-component systems. This framework is used here to construct a simple conceptual model for the El-Niño/Southern Oscillation (ENSO) phenomenon. ENSO involves the coupling of atmospheric and oceanic processes that are far from being completely understood. Our BDE model uses Boolean variables to represent key atmospheric and oceanic quantities and equations that involve logical operators to describe their evolution. Two distinct time-delay parameters, one for the local atmosphere-ocean coupling effects and the other for oceanic wave propagation, are introduced. Over a range of physically relevant delay values, this truly minimal model captures two essential features of ENSO’s interannual variability - its regularity and its tendency to phase-lock to the annual cycle. Oscillations with average cycle length that is an integer multiple of the seasonal cycle are prevalent and range from 2 to 7 years. Transition zones - where the average period lengths are noninteger rational multiples of the forcing period - exhibit Devil’s staircases, a signature of the quasi-periodic (QP) route to chaos. Our BDE model thus validates results from previous studies of the interaction of the seasonal cycle with ENSO’s “delayed oscillator”. It gives therewith support to the view that the observed irregularity results predominantly from low-order chaotic processes rather than from stochastic weather noise. Moreover, in the transition zone between the two integer periodicities of 2 and 3 years, a heretofore unsuspected, self-similar “fractal sunburst” pattern emerges in phase-parameter space. This pattern provides a distinct and more complex scenario than the QP route to chaos found in earlier, more detailed ENSO models. Period selection in this 2-3-year transitional region seems to play a key role in ENSO’s irregularity, as well as in the appearance of
Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach
International Nuclear Information System (INIS)
Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering. (paper)
Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach
Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru
2014-12-01
Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.
Parameter Learning of Boolean Bayesian Networks%布尔型贝叶斯网络参数学习
Institute of Scientific and Technical Information of China (English)
吴永广; 周兴旺
2015-01-01
布尔型贝叶斯网络是一类由布尔型变量组成的网络，它能够以线性多变量函数描述，使计算和处理上灵活高效。通过运用连接树算法对络进行分块化处理的方法，可以提高算法的效率，然后以传统的最大似然估计方法对布尔型网络的参数进行学习。服从同一分布律的贝叶斯网络参数学习算法发展比较成熟，这类以狄利克雷或者高斯分布为基础的算法在应用领域中难以发挥其应有的价值。相比之下，基于布尔型贝叶斯网络下的参数学习更贴近于应用，在人工智能和数据挖掘等领域有很好的发展前景。%Boolean Bayesian network is a class of Bayesian networks which are made up of Boolean varia-bles. The method to describe the network with a multi-linear function is flexible and efficient to compute and process variables. By introducing Junction Tree algorithm,the network can be divided into blocks which can make it easy to calculate. Then the traditional maximum likelihood estimation method was used for learning Boolean networks. Parameter learning algorithm following the same distribution is more ma-ture,but this kind of algorithm based on Dirichlet or Gaussian distribution is difficult to play its proper val-ue in practice. In contrast,parameter learning based on Boolean networks gets close to applications. It has good prospects for development in areas such as artificial intelligence and data mining.
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
Dubrova, Elena; Teslenko, Maxim
2011-01-01
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible. PMID:21778527
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.
A novel generalized design methodology and realization of Boolean operations using DNA.
Zoraida, B S E; Arock, Michael; Ronald, B S M; Ponalagusamy, R
2009-09-01
The biological deoxyribonucleic acid (DNA) strand has been increasingly seen as a promising computing unit. A new algorithm is formulated in this paper to design any DNA Boolean operator with molecular beacons (MBs) as its input. Boolean operators realized using the proposed design methodology is presented. The developed operators adopt a uniform representation for logical 0 and 1 for any Boolean operator. The Boolean operators designed in this work employ only a hybridization operation at each stage. Further, this paper for the first time brings out the realization of a binary adder and subtractor using molecular beacons. Simulation results of the DNA-based binary adder and subtractor are given to validate the design. PMID:19505531
Boolean and advanced searching for EDGAR data on www.sec.gov
Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.
Boolean Delay Equations: A simple way of looking at complex systems
Ghil, Michael; Zaliapin, Ilya; Coluzzi, Barbara
2006-01-01
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time. They represent therewith metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit ...
SAT-based Distributed Reactive Control Protocol Synthesis for Boolean Networks
Sahin, Yunus Emre; Ozay, Necmiye
2016-01-01
This paper considers the synthesis of distributed reactive control protocols for a Boolean network in a distributed manner. We start with a directed acyclic graph representing a network of Boolean subsystems and a global contract, given as an assumption-guarantee pair. Assumption captures the environment behavior, and guarantee is the requirements to be satisfied by the system. Local assumption-guarantee contracts, together with local control protocols ensuring these local contracts, are comp...
On the Number of Attractors of Positive and Negative Boolean Automata Circuits.
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2010-01-01
International audience In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain t...
Propagation of external regulation and asynchronous dynamics in random Boolean networks
Mahmoudi, Hamed; Pagnani, Andrea; Weigt, Martin; Zecchina, Riccardo
2007-01-01
Boolean Networks and their dynamics are of great interest as abstract modeling schemes in various disciplines, ranging from biology to computer science. Whereas parallel update schemes have been studied extensively in past years, the level of understanding of asynchronous updates schemes is still very poor. In this paper we study the propagation of external information given by regulatory input variables into a random Boolean network. We compute both analytically and numerically the time evol...
Reconstructing an atomic orthomodular lattice from the poset of its Boolean sublattices
Constantin, Carmen; Doering, Andreas
2013-01-01
We show that an atomic orthomodular lattice L can be reconstructed up to isomorphism from the poset B(L) of Boolean subalgebras of L. A motivation comes from quantum theory and the so-called topos approach, where one considers the poset of Boolean sublattices of L=P(H), the projection lattice of the algebra B(H) of bounded operators on Hilbert space.
Wang, Shiping; Zhu, Qingxin; Zhu, William; Min, Fan
2012-01-01
Covering is an important type of data structure while covering-based rough sets provide an efficient and systematic theory to deal with covering data. In this paper, we use boolean matrices to represent and axiomatize three types of covering approximation operators. First, we define two types of characteristic matrices of a covering which are essentially square boolean ones, and their properties are studied. Through the characteristic matrices, three important types of covering approximation ...
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
Meier, Arne; Schneider, Thomas
2010-01-01
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite family, have an easier satisfiability problem; sometimes it is even tractable. All these fragments restrict the use of Boolean operators in one way or another. We look at systematic and more general restrictions of the Boolean operators and establish ...
Cost-Optimal Execution of Trees of Boolean Operators with Shared Streams
Casanova, Henri; Lim, Lipyeow; Robert, Yves; Vivien, Frédéric; Zaidouni, Dounia
2013-01-01
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors to a query processing device, such as a smartphone, over one or more network interfaces. Retrieving a data item incurs a cost, e.g., an energy expense that depletes the smartphone's battery. Since the query tree contains boolean operators, part of the tree can be shortcircuited depending on t...
Bent functions results and applications to cryptography
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
Dynamical modeling of the cholesterol regulatory pathway with Boolean networks
Directory of Open Access Journals (Sweden)
Corcos Laurent
2008-11-01
Full Text Available Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivotal role in dislypidemia and, ultimately, in cancer through intermediates such as mevalonate, farnesyl pyrophosphate and geranyl geranyl pyrophosphate, but no dynamic model of this pathway has been proposed until now. Results We set up a computational framework to dynamically analyze large biological networks. This framework associates a classical and computationally efficient synchronous Boolean analysis with a newly introduced method based on Markov chains, which identifies spurious cycles among the results of the synchronous simulation. Based on this method, we present here the results of the analysis of the cholesterol biosynthesis pathway and its physiological regulation by the Sterol Response Element Binding Proteins (SREBPs, as well as the modeling of the action of statins, inhibitor drugs, on this pathway. The in silico experiments show the blockade of the cholesterol endogenous synthesis by statins and its regulation by SREPBs, in full agreement with the known biochemical features of the pathway. Conclusion We believe that the method described here to identify spurious cycles opens new routes to compute large and biologically relevant models, thanks to the computational efficiency of synchronous simulation. Furthermore, to the best of our knowledge, we present here the first dynamic systems biology model of the human cholesterol pathway and several of its key regulatory control elements, hoping it would provide a good basis to perform in silico
Learning Techniques for Automatic Test Pattern Generation using Boolean Satisfiability
Directory of Open Access Journals (Sweden)
Liu Xin
2013-07-01
Full Text Available Automatic Test Pattern Generation (ATPG is one of the core problems in testing of digital circuits. ATPG algorithms based on Boolean Satisfiability (SAT turned out to be very powerful, due to great advances in the performance of satisfiability solvers for propositional logic in the last two decades. SAT-based ATPG clearly outperforms classical approaches especially for hard-to-detect faults. But its inaccessibility of structural information and don’t care, there exists the over-specification problem of input patterns. In this paper we present techniques to delve into an additional layer to make use of structural properties of the circuit and value justification relations to a generic SAT algorithm. It joins binary decision graphs (BDD and SAT techniques to improve the efficiency of ATPG. It makes a study of inexpensive reconvergent fanout analysis of circuit to gather information on the local signal correlation by using BDD learning, then uses the above learned information to restrict and focus the overall search space of SAT-based ATPG. The learning technique is effective and lightweight. Experimental results show the effectiveness of the approach.
On Using Cutting Planes in Pseudo-Boolean Optimization
Directory of Open Access Journals (Sweden)
Vasco M. Manquinho
2006-03-01
Full Text Available Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP. However, cutting plane techniques are seldom used in Pseudo-Boolean Optimization (PBO algorithms. This paper addresses the utilization of Gomory mixed-integer and clique cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds and for learning new constraints. A side result of learning new constraints is that the utilization of cutting planes enables non-chronological backtracking. Besides cutting planes, the paper also shows that the utilization of search restarts in PBO can be effective in practice, allowing the computation of tighter lower bounds each time the search restarts. The more aggressive lower bounds result from the constraints learned due to the utilization of cutting planes. Experimental results show that the integration of cutting planes and search restarts in a SAT-based algorithm for PBO yields a competitive new solution for PBO.
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
Directory of Open Access Journals (Sweden)
Hossein M. Sheini
2006-03-01
Full Text Available This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflict-induced learning. Novel features of our approach include a light-weight and efficient hybrid learning and backjumping strategy for analyzing PB constraints and CNF clauses in order to simultaneously learn both a CNF clause and a PB constraint with minimum overhead and use both to determine the backtrack level. Several techniques for handling the original and learned PB constraints are introduced. Overall, our method benefits significantly from the pruning power of the learned PB constraints, while keeping the overhead of adding them into the problem low. In this paper, we also address two other methods for solving PB problems, namely Integer Linear Programming (ILP and pre-processing to CNF SAT, and present a thorough comparison between them and our hybrid method. Experimental comparison of our method against other hybrid approaches is also demonstrated. Additionally, we provide details of the MiniSAT-based implementation of our solver Pueblo to enable the reader to construct a similar one.
Boolean and brain-inspired computing using spin-transfer torque devices
Fan, Deliang
Several completely new approaches (such as spintronic, carbon nanotube, graphene, TFETs, etc.) to information processing and data storage technologies are emerging to address the time frame beyond current Complementary Metal-Oxide-Semiconductor (CMOS) roadmap. The high speed magnetization switching of a nano-magnet due to current induced spin-transfer torque (STT) have been demonstrated in recent experiments. Such STT devices can be explored in compact, low power memory and logic design. In order to truly leverage STT devices based computing, researchers require a re-think of circuit, architecture, and computing model, since the STT devices are unlikely to be drop-in replacements for CMOS. The potential of STT devices based computing will be best realized by considering new computing models that are inherently suited to the characteristics of STT devices, and new applications that are enabled by their unique capabilities, thereby attaining performance that CMOS cannot achieve. The goal of this research is to conduct synergistic exploration in architecture, circuit and device levels for Boolean and brain-inspired computing using nanoscale STT devices. Specifically, we first show that the non-volatile STT devices can be used in designing configurable Boolean logic blocks. We propose a spin-memristor threshold logic (SMTL) gate design, where memristive cross-bar array is used to perform current mode summation of binary inputs and the low power current mode spintronic threshold device carries out the energy efficient threshold operation. Next, for brain-inspired computing, we have exploited different spin-transfer torque device structures that can implement the hard-limiting and soft-limiting artificial neuron transfer functions respectively. We apply such STT based neuron (or 'spin-neuron') in various neural network architectures, such as hierarchical temporal memory and feed-forward neural network, for performing "human-like" cognitive computing, which show more than
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.
Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks
Gong, Xinwei
This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing
Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2010-01-01
Full Text Available In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
Belov, Anton
2011-01-01
This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from real-world industrial SAT application domains. The recently introduced SLS method CRSat has been shown to noticeably improve on previously suggested SLS techniques in solving such real-world instances by combining justification-based local search with limited Boolean constraint propagation on the non-clausal formula representation form of Boolean circuits. In this work, we study possibilities of further improving the performance of CRSat by exploiting circuit-level structural knowledge for developing new search heuristics for CRSat. To this end, we introduce and experimentally evaluate a variety of search heuristics, many of which are motivated by circuit-level heuristics originally developed in completely different contexts, e.g., for electronic design automation applications. To the best of our knowledge, most of the heuristics are novel in the context of SLS for S...
Local digital estimators of intrinsic volumes for Boolean models and in the design based setting
DEFF Research Database (Denmark)
Svane, Anne Marie
In order to estimate the specific intrinsic volumes of a planar Boolean model from a binary image, we consider local digital algorithms based on weigted sums of 2×2 configuration counts. For Boolean models with balls as grains, explicit formulas for the bias of such algorithms are derived......, resulting in a set of linear equations that the weights must satisfy in order to minimize the bias in high resolution. These results generalize to larger classes of random sets, as well as to the design based situation, where a fixed set is observed on a stationary isotropic lattice. Finally, the formulas...... for the bias obtained for Boolean models are applied to existing algorithms in order to compare their accuracy....
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
A. Meier and T. Schneider
2010-01-01
The standard reasoning problem, concept satisfiability, in the basic description logic ALCis PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families,have an easier satisfiability problem; sometimes it is even tractable.All these fragments restrict the use of Boolean operators in one way or another.We look at systematic and more general restrictionsof the Boolean operators and establish the ...
Dinet, Jrme; Favart, Monik; Passerault, Jean-Michel
2004-01-01
Boolean systems still constitute most of the installed base of online public access catalogues (OPACs) in the French universities even if many studies have shown that Boolean operators are not frequently used by non-librarian users (by contrast with professional librarians). The first study examined the use of Boolean operators by French…
The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students
Tomaszewski, Robert
2016-01-01
Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…
Describing the What and Why of Students' Difficulties in Boolean Logic
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
Hersh, William; Turpin, Andrew; Price, Susan; Kraemer, Dale; Olson, Daniel; Chan, Benjamin; Sacherek, Lynetta
2001-01-01
Describes research conducted at the TREC (Text Retrieval Conference) interactive track that compared Boolean and natural language searching, showing they achieved comparable results; and assessed the validity of batch-oriented retrieval evaluations, showing that the results from batch evaluations were not comparable to those obtained in…
Practical Enhanced Boolean Retrieval: Experiences with the SMART and SIRE Systems.
Fox, Edward A.; Koll, Matthew B.
1988-01-01
Provides an overview of methods for improving the effectiveness of Boolean retrieval systems, including document clustering, relevance feedback, weighted term searching, ranked output, and fuzzy set theory. The discussion of experimental studies with the SMART and SIRE systems focuses on the implementation and results of these methods. (69…
Learning and Unlearning in Hopfield-Like Neural Network Performing Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
Berlin : Springer, 2010 - (Koronacki, J.; Ras, Z.; Wierzchon, S.; Kacprzyk, J.), s. 501-518 ISBN 978-3-642-05176-0. - (Studies in Computational Intelligence. 262) Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield-like neural network * spurious attractors * statistics * bingy data Subject RIV: IN - Informatics, Computer Science
Exploring phospholipase C-coupled Ca(2+) signalling networks using Boolean modelling.
Bhardwaj, G; Wells, C P; Albert, R; van Rossum, D B; Patterson, R L
2011-05-01
In this study, the authors explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signalling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP(3)R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomisation of the Boolean operators ablates oscillatory pattern formation. Furthermore, knock-out simulations of the IP(3)R, TRPC3 and multiple other proteins recapitulate experimentally derived results. The potential of this approach can be observed by its ability to predict previously undescribed cellular phenotypes using in vitro experimental data. Indeed, our cellular analysis of the developmental and calcium-regulatory protein, DANGER1a, confirms the counter-intuitive predictions from our Boolean models in two highly relevant cellular models. Based on these results, the authors theorise that with sufficient legacy knowledge and/or computational biology predictions, Boolean networks can provide a robust method for predictive modelling of any biological system. [Includes supplementary material]. PMID:21639591
Composing Boolean Search Statements: Self-Confidence, Concept Analysis, Search Logic, and Errors.
Nahl, Diane; Harada, Violet H.
1996-01-01
A study of 191 juniors and seniors from 6 Oahu high schools tested their ability to interpret and construct search statements after reading brief instructions on concept analysis, Boolean operators, and search statement format. On average, students made two errors per statement; scores and types of errors are examined for influences of gender and…
Systolic arrays for binary image processing by using Boolean differential operators
Shmerko, V. P.; Yanushkevich, S. N.; Kochergov, E. G.
1993-11-01
A matrix form of the Boolean differential temporal (parametric) operators is proposed. The procedures of preliminary binary image processing (logic filtering, finding of contours) are constructed on this base. This presentation of the operators allows to synthesize the algorithms having a mapping into an architecture of systolic arrays.
Application of fuzzy logic to Boolean models for digital soil assessment
Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.
2011-01-01
Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between t
Applying Boolean discrete methods in the production of a real-valued probabilistic programming model
Nix, Jonathan Darren
2016-01-01
In this paper we explore the application of some notable Boolean methods, namely the Disjunctive Normal Form representation of logic table expansions, and apply them to a real-valued logic model which utilizes quantities on the range [0,1] to produce a probabilistic programming of a game character's logic in mathematical form.
Radecki, Tadeusz
1982-01-01
Presents and discusses the results of research into similarity measures for search request formulations which employ Boolean combinations of index terms. The use of a weighting mechanism to indicate the importance of attributes in a search formulation is described. A 16-item reference list is included. (JL)
On a Boolean-valued Model of the Strict Implication System(Continuous)
Institute of Scientific and Technical Information of China (English)
LI Na; LIU Hua-ke
2004-01-01
The reference [4] proved the consistency of S 1 and S 2 among Lewis'five strict implicationsystems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S 3 , S 4 and S 5 in Lewis'five strictimplication systems is not decided. This paper makes use of the properties : (1) the equivalence of the modal systems S 3 andP 3 , S 4 and P 4 ; (2) the modal systems P 3 and P 4 all contained the modal axiom T(□p) ; (3) the modal axiom T is correspondence to the reflexiveproperty in VB . Hence, the paper proves: (a) |A S 31|=1 ; (b) |A S 41|=1 ;(c) |A S 51|=1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB ). Therefore, the paper finallyproves that the Boolean-valued model VB of the ZFC axiomsystem in set theory is also a Boolean-valued model of Lewis'the strict implication system S 3 , S 4 and S 5 .
"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis
Directory of Open Access Journals (Sweden)
Arellano Gustavo
2011-12-01
Full Text Available Abstract Background In Thomas' formalism for modeling gene regulatory networks (GRNs, branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a asynchrony, (b incompletely specified behavior, and (c interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/, a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary
Fuzzy Boolean Algebras Based on Implication Operator%基于蕴涵算子上的模糊布尔代数
Institute of Scientific and Technical Information of China (English)
陈华新
2011-01-01
文中给出R-模糊布尔代数的定义,讨论了其与模糊布尔代数的关系,证明在一定的条件下,有限个R-模糊布尔代数的交(并)还是R-模糊布尔代数,R-模糊布尔代数的同态像(原像)仍是R-模糊布尔代数.%In this paper ,we introduce the definition of fuzzy Boolean algebra. Based on that, the differences and connection between R-fuzzy Boolean algebra and fuzzy Boolean algebra are discussed. Furhtermore, it is proved that the finite intersection (union) of R-fuzzy Boolean algebra is still R-fuzzy Boolean algebra , and the homomorphic image (preimage) of R-fuzzy Boolean algebra is still R-fuzzy Boolean algebra.
计算布尔e-导数的最小项编码分组方法%The Method of Minterm Code Packet for Computing Boolean e-derivative
Institute of Scientific and Technical Information of China (English)
李建伟
2015-01-01
The method of minterm code packet for Boolean e-derivative is put forward considering the characteri-stic of logistic function minterm and two logistic functions and operation. This method devides the binary coding corresponding to minterm of logistic function into two groups which is based on the values of variables in minte-rm coding, When solving the Boolean E-derivative, we can achieve the result by making one of the two groups bitwise inverted and comparing with the other. The method applies to computing Boolean E-derivative that containslogistic functions with don’t cares. The examples show that this method simplifies the computational procedure of Boolean e-derivative.%布尔e-导数的最小项编码分组法是在综合考虑逻辑函数最小项和两逻辑函数进行与运算的特征的基础上提出来的。该方法依据变量在最小项编码中的取值，把求导函数的最小项对应二进制编码分成两组。在求解布尔e-导数时只需将其中一组最小项编码某(些)位取反，而后与另一组比较就可得出结果。该方法也可以用来求解含任意项逻辑函数布尔e-导数。实例表明，该方法使布尔e-导数的计算过程得到简化。
布尔表达式的化简与并行排序网络验证%Boolean expression simplification and parallel sort network validation
Institute of Scientific and Technical Information of China (English)
王德才; 徐建国; 吴哲辉; 罗永亮; 王传民
2009-01-01
To design an effective tool that can be used to verify the correctness of a parallel sorting network, a Boolean expression sim-plification algorithm based on the [0,1] theory and Boolean function of the characteristics and the nature is put forward, based on this algorithm a validation tool is designed. The characteristics and the nature of [0,1] theory and Boolean function are discussed and the natures that are helpful to simplify of the operation are pointed out. The tool can be used for the design of parallel sorting networks based on the parameters of the network graphics, and it can automatically generate the Boolean expressions and simplify it. The tool's output will be helpful to analyze the network, and it can also be used to design and optimize the sort network. Finally, the validity of the tool is demonstrated by the application.%为设计出能够验证并行排序网络正确性的有效工具,根据[0,1]原理和布尔函数的特点和性质,提出一种布尔表达式的化简算法,并根据此算法设计出验证工具.对[0,1]原理和布尔函数的特点和性质进行了讨论,指出有利于化简操作的性质.设计出的工具能够根据并行排序网络的参数显示网络图形、自动生成布尔表达式并实现化简验证,工具的输出有利于对排序网络的分析,也可以用于辅助排序网络的设计和优化.实验结果表明了该工具的有效性.
Ω-fuzzy subalgebra of Boolean algebra%布尔代数的Ω-模糊子代数
Institute of Scientific and Technical Information of China (English)
刘卫锋
2013-01-01
Ω-fuzzy subalgebra of Boolean algebra and its properties were discussed in this paper .Ω-fuzzy subalgebra of Boolean algebra was defined and two judging theorems of Ω-fuzzy subalgebra of Boolean algebra were given , and it was stated that intersection-images and inverse-images under Boolean algebra homomorphism of Ω-fuzzy subalgebra of Boolean algebra were respectively Ω-fuzzy subalgebra of Boolean algebra . Then , by defining three operations ⊕ ,ⓧ , over RΩ where RΩexpressed all mappings from set Ωto Boolean algebra R ,a Boolean algebra was obtained ,and fuzzy subalgebra and Ω-fuzzy subalgebra about RΩwere researched .% 研究布尔代数的Ω-模糊子代数及其性质。定义布尔代数的Ω-模糊子代数，给出布尔代数的Ω-模糊子代数的两个简化判定定理，并证明布尔代数的Ω-模糊子代数的交、同态像和同态逆像等也是布尔代数的Ω-模糊子代数。然后，令RΩ表示集合Ω到布尔代数R的所有映射的集合，通过在 RΩ上定义3种运算磑，磗，，得到布尔代数枙RΩ，磑，磗，， I0，I1枛，并研究与其相关的模糊子代数和Ω-模糊子代数。
Multiple Sequence Alignment using Boolean Algebra and Fuzzy Logic:A Comparative Study
Directory of Open Access Journals (Sweden)
Nivit Gill
2011-09-01
Full Text Available Multiple sequence alignment is the most fundamental and essential task of computational biology, and forms the base for other tasks of bioinformatics. In this paper, two different approaches to sequence alignment have been discussed and compared. The first method employs Boolean algebra which is a two-valued logic whereas the second is based on Fuzzy logic which is a multi-valued logic. Both the methods perform sequence matching by direct comparison method using the operations of Boolean algebra and fuzzy logic respectively. To ensure the optimal alignment, dynamic programming is employed to align multiple sequences progressively. Both the methods are implemented and then tested on various sets of real genome sequences taken from NCBI bank. The processing time for both the methods on these data sets have been computed and compared.
Modeling boolean decision rules applied to multiple-observer decision strategies.
Maguire, W
1996-01-01
A model that derives multiple-observer decision strategy ROC curves for boolean decision rules applied to binary decisions of two or three observers is presented. It is assumed that covert decision variables consistent with ROC models of observer performance underlie decisions and that readers' decision criteria are in a fixed relationship. The specific parameters of individual ROC curves and the correlational structure that describes interobserver agreement have dramatic effects upon the relative benefits to be derived from different boolean strategies. A common strategy employed in clinical practice, in which the overall decision is positive if any observer makes a positive decision, is most effective when the readers are of similar ability, when they adopt similar decision criteria, when interreader agreement is greater for negative than for positive cases, and when the individual ROC slope is observer decision strategies can be evaluated using the model equations. A bootstrap method for testing model-associated hypotheses is described. PMID:8717599
The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices
Institute of Scientific and Technical Information of China (English)
LIU Jian-ping; CHEN Jin-song
2013-01-01
Let Gn(C) be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and GC (Jn) the set of all primitive matrices in Gn(C). In this paper, some necessary and suﬃ cient conditions for A in the semigroup Gn(C) to be primitive are given. We also show that GC (Jn) is a subsemigroup of Gn(C).
A language for real time simulation of processes with boolean inputs and outputs
Fernández Camacho, Eduardo; García Franquelo, Leopoldo; Lozano, J.
1983-01-01
This paper deals with the problem of real time simulation of processes with boolean inputs and outputs. A language for this purpose and the programs that processes it is presented. The language allows the description of processes with simultaneous evolutions as a timed petri net type of description is used. Random failures can also be Introduced in the behaviour of the model. The language allows the control of a semlgraphic CRT in order to facilitate the task of following the model behaviour.
Boolean implication networks derived from large scale, whole genome microarray datasets
Sahoo, Debashis; Dill, David L.; Gentles, Andrew J.; Tibshirani, Robert; Plevritis, Sylvia K.
2008-01-01
We describe a method for extracting Boolean implications (if-then relationships) in very large amounts of gene expression microarray data. A meta-analysis of data from thousands of microarrays for humans, mice, and fruit flies finds millions of implication relationships between genes that would be missed by other methods. These relationships capture gender differences, tissue differences, development, and differentiation. New relationships are discovered that are preserved across all three sp...
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550. ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 4.291, year: 2014
Closure Properties of Classes of Spatio-Temporal Objects for Boolean Set Operations
Haesevoets, Sofie; Kuijpers, Bart
2000-01-01
We study a model for spatio-temporal objects, introduced by Chomicki and Revesz, in which spatio-temporal data is specified by a spatial reference object together with a geometric transformation that determines the movement of the reference object in time. We give complete results concerning closure under Boolean set operators for the different classes of spatio-temporal objects introduced by these authors (In particular, we also answer a conjecture by Chomicki and Revesz negatively). Since o...
Cost-Optimal Execution of Boolean Query Trees with Shared Streams
Casanova, Henri; Lim, Lipyeow; Robert, Yves; Vivien, Frédéric; Zaidouni, Dounia
2014-01-01
International audience The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors, which incurs a cost, e.g., an energy expense that depletes the battery of a mobile query processing device. The objective is to determine the order in which predicates should be evaluated so as to shortcut part of the query evaluation and minimize the expected cost....
Boolean delay equations: A simple way of looking at complex systems
Ghil, Michael; Zaliapin, Ilya; Coluzzi, Barbara
2008-12-01
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time; such BDEs can be seen therefore as metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil’s staircases and “fractal sunbursts.” All known solutions of dissipative BDEs have stationary variance. BDE systems of this type, both free and forced, have been used as highly idealized models of climate change on interannual, interdecadal and paleoclimatic time scales. BDEs are also being used as flexible, highly efficient models of colliding cascades of loading and failure in earthquake modeling and prediction, as well as in genetics. In this paper we review the theory of systems of BDEs and illustrate their applications to climatic and solid-earth problems. The former have used small systems of BDEs, while the latter have used large hierarchical networks of BDEs. We moreover introduce BDEs with an infinite number of variables distributed in space (“partial BDEs”) and discuss connections with other types of discrete dynamical systems, including cellular automata and Boolean networks. This research-and-review paper concludes with a set of open questions.
Boolean Delay Equations: A Simple Way of Looking at Interactions and Extreme Events
Ghil, Michael
2013-04-01
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time; such BDEs can be seen therefore as metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts.'' BDE systems have been used as highly idealized models of climate change on several time scales, as well as in earthquake modeling and prediction, and in genetics. BDEs with an infinite number of variables on a regular spatial grid have been called "partial BDEs" and we discuss connections with other types of discrete dynamical systems, including cellular automata and Boolean networks. We present recent BDE work on damage propagation in networks, with an emphasis on production-chain models. This formalism turns out to be well adapted to investigating propagation of an initial damage due to a climatic or other natural disaster. It thus serves to study economic impacts of extreme events, as well as extreme disruption of a network of interactions.
Boolean model of Yeast Apoptosis as a tool to study yeast and human apoptotic regulations
Directory of Open Access Journals (Sweden)
MarijaCvijovic
2012-12-01
Full Text Available Programmed cell death (PCD is an essential cellular mechanism that is evolutionary conserved, mediated through various pathways and acts by integrating different stimuli. Many diseases such as neurodegenerative diseases and cancers are found to be caused by, or associated with, regulations in the cell death pathways. Yeast Saccharomyces cerevisiae, is a unicellular eukaryotic organism that shares with human cells components and pathways of the PCD and is therefore used as a model organism. Boolean modelling is becoming promising approach to capture qualitative behaviour and describe essential properties of such complex networks. Here we present large literature-based and to our knowledge first Boolean model that combines pathways leading to apoptosis (a type of PCD in yeast. Analysis of the yeast model confirmed experimental findings of anti-apoptotic role of Bir1p and pro-apoptotic role of Stm1p and revealed activation of the stress protein kinase Hog proposing the maximal level of activation upon heat stress. In addition we extended the yeast model and created an in silico humanized yeast in which human pro- and anti-apoptotic regulators Bcl-2 family and Valosin-contain protein (VCP are included in the model. We showed that accumulation of Bax in in silico humanized yeast shows apoptotic markers and that VCP is essential target of Akt Signaling. The presented Boolean model provides comprehensive description of yeast apoptosis network behaviour. Extended model of humanized yeast gives new insights of how complex human disease like neurodegenration can initially be tested.
Boolean modeling of neural systems with point-process inputs and outputs.
Marmarelis, Vasilis Z; Zanos, Theodoros P; Courellis, Spiros H; Berger, Theodore W
2006-01-01
This paper presents a novel modeling approach for neural systems with point-process inputs and outputs (binary time-series of 0's and 1's) that utilizes Boolean operators of modulo-2 multiplication and addition, corresponding to the logical AND and OR operations respectively. The form of the employed mathematical model is akin to a "Boolean-Volterra" model that contains the product terms of all relevant input lags in a hierarchical order, where terms of order higher than first represent nonlinear interactions among the various lagged values of each input point-process or among lagged values of various inputs (if multiple inputs exist) as they reflect on the output. The coefficients of this Boolean model are also binary variables that indicate the presence or absence of the respective term in each specific model/system. Simulations are used to explore the properties of such models and the feasibility of accurate estimation of such models from short data-records in the presence of noise (i.e. spurious spikes). The results demonstrate the feasibility of obtaining reliable estimates of such models, even in the presence of considerable noise in the input and/or output, thus making the proposed approach an attractive candidate for modeling neural systems in a practical context. PMID:17946091
Reverse engineering Boolean networks: from Bernoulli mixture models to rule based systems.
Directory of Open Access Journals (Sweden)
Mehreen Saeed
Full Text Available A Boolean network is a graphical model for representing and analyzing the behavior of gene regulatory networks (GRN. In this context, the accurate and efficient reconstruction of a Boolean network is essential for understanding the gene regulation mechanism and the complex relations that exist therein. In this paper we introduce an elegant and efficient algorithm for the reverse engineering of Boolean networks from a time series of multivariate binary data corresponding to gene expression data. We call our method ReBMM, i.e., reverse engineering based on Bernoulli mixture models. The time complexity of most of the existing reverse engineering techniques is quite high and depends upon the indegree of a node in the network. Due to the high complexity of these methods, they can only be applied to sparsely connected networks of small sizes. ReBMM has a time complexity factor, which is independent of the indegree of a node and is quadratic in the number of nodes in the network, a big improvement over other techniques and yet there is little or no compromise in accuracy. We have tested ReBMM on a number of artificial datasets along with simulated data derived from a plant signaling network. We also used this method to reconstruct a network from real experimental observations of microarray data of the yeast cell cycle. Our method provides a natural framework for generating rules from a probabilistic model. It is simple, intuitive and illustrates excellent empirical results.
Weights of Exact Threshold Functions
DEFF Research Database (Denmark)
Babai, László; Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.;
2010-01-01
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute value) of the coefficients required to represent such functions. These bounds are very close and in the linear case in ...
Random Boolean Networks and Attractors of their Intersecting Circuits
Demongeot, Jacques; Elena, Adrien; Noual, Mathilde; Sené, Sylvain
2011-01-01
International audience The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the "immunetworks" involved in the control of the immune system. As a result, we show that the small number of attract...
Boolean modeling and fault diagnosis in oxidative stress response
Sridharan Sriram; Layek Ritwik; Datta Aniruddha; Venkatraj Jijayanagaram
2012-01-01
Abstract Background Oxidative stress is a consequence of normal and abnormal cellular metabolism and is linked to the development of human diseases. The effective functioning of the pathway responding to oxidative stress protects the cellular DNA against oxidative damage; conversely the failure of the oxidative stress response mechanism can induce aberrant cellular behavior leading to diseases such as neurodegenerative disorders and cancer. Thus, understanding the normal signaling present in ...
HSP70 mediates survival in apoptotic cells – Boolean network prediction and experimental validation
Directory of Open Access Journals (Sweden)
Suhas Vasaikar
2015-08-01
Full Text Available Neuronal stress or injury results in the activation of proteins, which regulate the balance between survival and apoptosis. However, the complex mechanism of cell signalling involving cell death and survival, activated in response to cellular stress is not yet completely understood. To bring more clarity about these mechanisms, a Boolean network was constructed that represented the apoptotic pathway in neuronal cells. FasL and neurotrophic growth factor (NGF were considered as inputs in the absence and presence of heat shock proteins known to shift the balance towards survival by rescuing pro-apoptotic cells. The probabilities of survival, DNA repair and apoptosis as cellular fates, in the presence of either the growth factor or FasL, revealed a survival bias encoded in the network. Boolean predictions tested by measuring the mRNA expression level of caspase-3, caspase-8 and BAX in neuronal Neuro2a (N2a cell line with NGF and FasL as external input, showed positive correlation with the observed experimental results for survival and apoptotic states. It was observed that HSP70 contributed more towards rescuing cells from apoptosis in comparison to HSP27, HSP40 and HSP90. Overexpression of HSP70 in N2a transfected cells showed reversal of cellular fate from FasL-induced apoptosis to survival. Further, the pro-survival role of the proteins BCL2, IAP, cFLIP and NFκB determined by vertex perturbation analysis was experimentally validated through protein inhibition experiments using EM20-25, Embelin and Wedelolactone, which resulted in 1.27-fold, 1.26-fold and 1.46-fold increase in apoptosis of N2a cells. The existence of a one-to-one correspondence between cellular fates and attractor states shows that Boolean networks may be employed with confidence in qualitative analytical studies of biological networks.
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.
Boolean Logic Gates From A Single Memristor Via Low-Level Sequential Logic
Gale, Ella; Costello, Ben de Lacy; Adamatzky, Andrew
2014-01-01
By using the memristor's memory to both store a bit and perform an operation with a second input bit, simple Boolean logic gates have been built with a single memristor. The operation makes use of the interaction of current spikes (occasionally called current transients) found in both memristors and other devices. The sequential time-based logic methodology allows two logical input bits to be used on a one-port by sending the bits separated in time. The resulting logic gate is faster than one...
Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
Directory of Open Access Journals (Sweden)
Wai-Ki Ching
2008-09-01
Full Text Available A Boolean network (BN is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the importance of gene ordering. Especially, setting internal nodes ahead yields shorter computational time than setting external nodes ahead in various types of algorithms. We also present a heuristic algorithm which does not look for the optimal solution but for the solution whose computational time is shorter than that of the exact algorithms.
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Frolov, A. A.; Polyakov, P.Y.; Řezanková, H.; Snášel, V.
Lisabon : Instituto Nacional de Estatística, 2008 - (Gomes, M.; Pinto Martins, J.; Silva, J.), s. 3739-3742 ISBN 978-972-673-992-0. [ISI 2007. Session of the International Statistical Institute /56./. Lisboa (PT), 22.08.2007-29.08.2007] R&D Projects: GA AV ČR 1ET100300414 Grant ostatní: RFBR(RU) 05-07-90049 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * document classification * automatic concepts search * unsupervised learning * neural network Subject RIV: BB - Applied Statistics, Operational Research
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.
Simulation Performance of MMSE Iterative Equalization with Soft Boolean Value Propagation
Krishnamoorthy, Aravindh; Jandial, Ravi
2011-01-01
The performance of MMSE Iterative Equalization based on MAP-SBVP and COD-MAP algorithms (for generating extrinsic information) are compared for fading and non-fading communication channels employing serial concatenated convolution codes. MAP-SBVP is a convolution decoder using a conventional soft-MAP decoder followed by a soft-convolution encoder using the soft-boolean value propagation (SBVP). From the simulations it is observed that for MMSE Iterative Equalization, MAP-SBVP performance is comparable to COD-MAP for fading and non-fading channels.
Neural Network Based Boolean Factor Analysis: Efficient Tool for Automated Topics Search.
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Frolov, A. A.; Polyakov, P.Y.; Řezanková, H.
Amman: Applied Science Private University, 2006 - (Issa, G.; El-Qawasmeh, E.; Raho, G.), s. 321-327 ISBN 9957-8592-0-X. [CSIT 2006. International Multiconference on Computer Science and Information Technology /4./. Amman (JO), 05.04.2006-07.04.2006] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural networks * associative memory * clustering * web searching * semantic web * information retrieval * document indexing * document classification * document processing * data mining * machine learning Subject RIV: BB - Applied Statistics, Operational Research
Directory of Open Access Journals (Sweden)
Reverter Antonio
2011-02-01
Full Text Available Abstract Background Cancer has remarkable complexity at the molecular level, with multiple genes, proteins, pathways and regulatory interconnections being affected. We introduce a systems biology approach to study cancer that formally integrates the available genetic, transcriptomic, epigenetic and molecular knowledge on cancer biology and, as a proof of concept, we apply it to colorectal cancer. Results We first classified all the genes in the human genome into cancer-associated and non-cancer-associated genes based on extensive literature mining. We then selected a set of functional attributes proven to be highly relevant to cancer biology that includes protein kinases, secreted proteins, transcription factors, post-translational modifications of proteins, DNA methylation and tissue specificity. These cancer-associated genes were used to extract 'common cancer fingerprints' through these molecular attributes, and a Boolean logic was implemented in such a way that both the expression data and functional attributes could be rationally integrated, allowing for the generation of a guilt-by-association algorithm to identify novel cancer-associated genes. Finally, these candidate genes are interlaced with the known cancer-related genes in a network analysis aimed at identifying highly conserved gene interactions that impact cancer outcome. We demonstrate the effectiveness of this approach using colorectal cancer as a test case and identify several novel candidate genes that are classified according to their functional attributes. These genes include the following: 1 secreted proteins as potential biomarkers for the early detection of colorectal cancer (FXYD1, GUCA2B, REG3A; 2 kinases as potential drug candidates to prevent tumor growth (CDC42BPB, EPHB3, TRPM6; and 3 potential oncogenic transcription factors (CDK8, MEF2C, ZIC2. Conclusion We argue that this is a holistic approach that faithfully mimics cancer characteristics, efficiently predicts
单Buck逆变器布尔型滑模控制研究%Single Buck inverters based on Boolean sliding mode control
Institute of Scientific and Technical Information of China (English)
陈江辉; 邓红雷; 王健敏; 谢运祥
2011-01-01
为了提高逆变器滑模控制器的稳态精确度,针对一种由一个双向Buck变换器和桥式换向电路组成的单Buck型逆变器进行类似Lyapunov函数的布尔量滑模控制策略的研究.在其等效电路的状态空间平均法动态模型基础上,建立单Buck型逆变器等效电路的三阶系统数学模型,构建具有电流环节和积分环节的全状态变量滑模切换函数,在此切换函数基础上给出布尔滑模控制器的分析和设计过程.仿真和实验结果表明:系统稳态终值误差小,输出电压和电流具有强鲁棒性和良好动态性能；布尔滑模控制的实际控制律简单,易于实现；验证了所采用布尔滑模控制策略的正确性.%In order to further increase the inverter sliding-mode controller's precision, a Boolean sliding-mode control strategy based on Lyapunov-like function was researched on the single Buck inverter composed of a bi-directional Buck converter and bridge-type diverter. Based on the state space average method dynamic modeling of the system equivalent circuit, third-order system mathematical model of single Buck inverter equivalent circuit and full status sliding manifold with current element and integral element were established. There were operation principles of circuit, circuit dynamic mode and the steps of Boolean sliding-mode controller design. The emulation and experiment show that the system steady-state precision is small. Output voltage and current have strong robustness and a good dynamic performance and Boolean sliding-mode actual control was simple and was to be realized. These results verify the correction of control strategy.
A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
Yamakami, Tomoyuki
2010-01-01
We determine the complexity of approximate counting of the total weight of assignments for complex-weighted Boolean constraint satisfaction problems (or CSPs), particularly, when degrees of instances are bounded from above by a given constant, provided that all arity-1 constraints are freely available. All degree-1 counting CSPs are solvable in polynomial time. When the degree is more than 2, we present a trichotomy theorem that classifies all bounded-degree counting CSPs into only three categories with a help of free arity-1 constraints. This classification extends to complex-weighted problems an earlier result of Dyer, Goldberg, Jalsenius, and Richerby (2010) on the complexity of the approximate counting of bounded-degree unweighted Boolean CSPs. The framework of the proof of our trichotomy theorem is based on a theory of signatures (Cai and Lu, 2007, 2008) used in Valiant's holographic algorithms. Despite the use of arbitrary complex-weight, our proof is rather elementary and intuitive by an extensive use ...
Experimental Clocking of Nanomagnets with Strain for Ultralow Power Boolean Logic.
D'Souza, Noel; Salehi Fashami, Mohammad; Bandyopadhyay, Supriyo; Atulasimha, Jayasimha
2016-02-10
Nanomagnetic implementations of Boolean logic have attracted attention because of their nonvolatility and the potential for unprecedented overall energy-efficiency. Unfortunately, the large dissipative losses that occur when nanomagnets are switched with a magnetic field or spin-transfer-torque severely compromise the energy-efficiency. Recently, there have been experimental reports of utilizing the Spin Hall effect for switching magnets, and theoretical proposals for strain induced switching of single-domain magnetostrictive nanomagnets, that might reduce the dissipative losses significantly. Here, we experimentally demonstrate, for the first time that strain-induced switching of single-domain magnetostrictive nanomagnets of lateral dimensions ∼200 nm fabricated on a piezoelectric substrate can implement a nanomagnetic Boolean NOT gate and steer bit information unidirectionally in dipole-coupled nanomagnet chains. On the basis of the experimental results with bulk PMN-PT substrates, we estimate that the energy dissipation for logic operations in a reasonably scaled system using thin films will be a mere ∼1 aJ/bit. PMID:26744913
Boolean Modeling of Cellular and Molecular Pathways Involved in Influenza Infection
Directory of Open Access Journals (Sweden)
Christopher S. Anderson
2016-01-01
Full Text Available Systems virology integrates host-directed approaches with molecular profiling to understand viral pathogenesis. Self-contained statistical approaches that combine expression profiles of genes with the available databases defining the genes involved in the pathways (gene-sets have allowed characterization of predictive gene-signatures associated with outcome of the influenza virus (IV infection. However, such enrichment techniques do not take into account interactions among pathways that are responsible for the IV infection pathogenesis. We investigate dendritic cell response to seasonal H1N1 influenza A/New Caledonia/20/1999 (NC infection and infer the Boolean logic rules underlying the interaction network of ligand induced signaling pathways and transcription factors. The model reveals several novel regulatory modes and provides insights into mechanism of cross talk between NFκB and IRF mediated signaling. Additionally, the logic rule underlying the regulation of IL2 pathway that was predicted by the Boolean model was experimentally validated. Thus, the model developed in this paper integrates pathway analysis tools with the dynamic modeling approaches to reveal the regulation between signaling pathways and transcription factors using genome-wide transcriptional profiles measured upon influenza infection.
(2,n) secret sharing scheme for gray and color images based on Boolean operation
Institute of Scientific and Technical Information of China (English)
DONG Lin; WANG DaoShun; LI ShunDong; DAI YiQi
2012-01-01
Traditional secret sharing (SS) schemes can reconstruct the secret precisely,but have high computation complexity.Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of contrast. Wang et al.proposed a (2,n)-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/2.In this paper,we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.'s binary (2,n)-SS scheme.Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image.The two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level processing.These proposed schemes have low computation complexity and almost ideal contrast.
高阶布尔网络的结构%Structure of higher order Boolean networks*
Institute of Scientific and Technical Information of China (English)
李志强; 赵寅; 程代展
2011-01-01
The higher order Boolean (control) network is introduced and its topological structure is studied.Using semi-tensor product of matrices,its dynamics is converted into two algebraic forms,which are standard discrete-time dynamic systems.The one-to-one correspondence of the network dynamics and its first algebraic form is proved,and certain topological structures,including fixed points,cycles,and transient time,of higher order Boolean (control) networks are revealed.The relationship between the original system and its second algebraic form is also studied.%介绍高阶布尔（控制）网络,并研究了其拓扑结构.以矩阵的半张量积作为工具,把高阶布尔网络的动态过程转化为2种标准离散事件动态系统的代数形式.证明了高阶布尔网络和第1代数形式的一一对应关系,并由此得到其拓扑结构（不动点、极限圈以及暂态期等）.还研究了高阶布尔网络系统与它第2代数形式的关系.
应用布尔遗传算子求解N皇后问题%Solving N-queens algorithm based on boolean genetic operator.
Institute of Scientific and Technical Information of China (English)
帅训波; 马书南
2011-01-01
The backtracking algorithm suffers from massive computational time when solving large scale N-Queens problem.Boolean genetic operator is proposed to improve local searching ability of genetic algorithm. By the boolean genetic operator combined with matrix genetic operator which has better global searching ability, an optimization combination genetic algorithm is constructed to solve N-Queens problem.The transform coding between integer and binary,fitness function based on constraint of N-Queens problem are designed to ensure the global convergence of algorithm.The better efficiency of solving N-Queens problem is verified by comparing with backtracking and current genetic algorithm.%应用回溯法求解规模较大的N皇后问题时,时间开销巨大.从提出布尔遗传算子角度,增强遗传算法局部搜索性能,与具有良好全局搜索性能的矩阵遗传算子组合应用,对N皇后问题求解.采用自然数和二进制互换的编码方式,应用N皇后的约束条件构造适应度函数,保证了算法的全局收敛性.通过与回溯法和相关遗传算法比较,实验证实了该方法应用于求解N皇后问题,具有良好的搜索效率和求解质量.
Ahmed, Tarek Sayed
2013-01-01
We give some general theorems on free algebras of varieties of Boolean algebras with operators; a hitherto new result is obtained for Pinter's substitution algebras. For n\\geq 3, and m>1, there is a generating set of the free algebra freely generated by m elements, which is not a free set of generators.
Lahoz-Beltra, R; Hameroff, S R; Dayhoff, J E
1993-01-01
Adaptive behaviors and dynamic activities within living cells are organized by the cytoskeleton: intracellular networks of interconnected protein polymers which include microtubules (MTs), actin, intermediate filaments, microtubule associated proteins (MAPs) and other protein structures. Cooperative interactions among cytoskeletal protein subunit conformational states have been used to model signal transmission and information processing. In the present work we present a theoretical model for molecular computing in which Boolean logic is implemented in parallel networks of individual MTs interconnected by MAPs. Conformational signals propagate on MTs as in data buses and in the model MAPs are considered as Boolean operators, either as bit-lines (like MTs) where a signal can be transported unchanged between MTs ('BUS-MAP'), or as bit-lines where a Boolean operation is performed in one of the two MAP-MT attachments ('LOGIC-MAP'). Three logic MAPs have been defined ('NOT-MAP, 'AND-MAP', 'XOR-MAP') and used to demonstrate addition, subtraction and other arithmetic operations. Although our choice of Boolean logic is arbitrary, the simulations demonstrate symbolic manipulation in a connectionist system and suggest that MT-MAP networks can perform computation in living cells and are candidates for future molecular computing devices. PMID:8318677
Zaidi, Faisal K.; Nazzal, Yousef; Ahmed, Izrar; Naeem, Muhammad; Jafri, Muhammad Kamran
2015-11-01
Identifying potential groundwater recharge zones is a pre-requisite for any artificial recharge project. The present study focuses on identifying the potential zones of Artificial Groundwater Recharge (AGR) in Northwestern Saudi Arabia. Parameters including slope, soil texture, vadose zone thickness, groundwater quality (TDS) and type of water bearing formation were integrated in a GIS environment using Boolean logic. The results showed that 17.90% of the total studied area is suitable for AGR. The identified zones were integrated with the land use/land cover map to avoid agricultural and inhabited lands which reduced the total potential area to 14.24%. Geomorphologically the wadi beds are the most suitable sites for recharge. On the basis of the potential AGR zones closeness to the available recharge water supply (rain water, desalinated sea water and treated waste water) the potential zones were classified as Category A (high priority) and Category B (low priority).
Attractor Neural Network Combined with Likelihood Maximization Algorithm for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
Vol. 1. Berlin: Springer, 2012 - (Wang, J.; Yen, G.; Polycarpou, M.), s. 1-10. (Lecture Notes in Computer Science. 7367). ISBN 978-3-642-31345-5. ISSN 0302-9743. [ISNN 2012. International Symposium on Neural Networks /9./. Shenyang (CN), 11.07.2012-14.07.2012] R&D Projects: GA ČR GAP202/10/0262 Grant ostatní: GA MŠk(CZ) ED1.1.00/02.0070 Institutional research plan: CEZ:AV0Z10300504 Keywords : Associative Neural Network * Likelihood Maximization * Boolean Factor Analysis * Binary Matrix factorization * Noise XOR Mixing * Plato Problem * Information Gain * Bars problem * Data Mining * Dimension Reduction * Hebbian Learning * Anti-Hebbian Learning Subject RIV: IN - Informatics, Computer Science
Statistical and algebraic analysis of a family of random Boolean equations
International Nuclear Information System (INIS)
The statistical and algebraic properties of a family of random Boolean equations are studied in this paper. Based on studying the mechanism of influence propagation from some variable fixed to 1, the giant strongly connected component and magnetization of solutions are investigated, which exhibit the splitting phenomenon of solution space and a ferromagnetic transition. Furthermore, by analyzing the semi-group property of the solution space and the influence of propagation from some variable fixed to 0, the scale of generating elements is calculated, which undergoes linear, polynomial and exponential phases. Compared with the analysis by statistical mechanics, it is suggested that these different phases of algebraic complexity correspond to the structural complexity of the solution space as replica symmetry, one-step replica symmetry breaking and further-step replica symmetry breaking phases. It is supposed that the structural complexity of solution space can be interpreted from the viewpoint of algebra
Critical line in undirected Kauffman Boolean networks - the role of percolation
International Nuclear Information System (INIS)
We show that to describe correctly the position of the critical line in Kauffman random Boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of percolation transition is much simpler in random undirected networks than in the directed ones, we study the Kauffman model in undirected networks. We derive the mean field formula for the critical line in the giant components of these networks, and show that the critical line characterizing the whole network results from the fact that the ordered behavior of small clusters shields the chaotic behavior of the giant component. We also show a possible attitude towards the analytical description of the shielding effect. The theoretical derivations given in this paper very much tally with the numerical simulations done for classical random graphs
Decisional Processes with Boolean Neural Network: the Emergence of Mental Schemes
Barnabei, Graziano; Conversano, Ciro; Lensi, Elena
2010-01-01
Human decisional processes result from the employment of selected quantities of relevant information, generally synthesized from environmental incoming data and stored memories. Their main goal is the production of an appropriate and adaptive response to a cognitive or behavioral task. Different strategies of response production can be adopted, among which haphazard trials, formation of mental schemes and heuristics. In this paper, we propose a model of Boolean neural network that incorporates these strategies by recurring to global optimization strategies during the learning session. The model characterizes as well the passage from an unstructured/chaotic attractor neural network typical of data-driven processes to a faster one, forward-only and representative of schema-driven processes. Moreover, a simplified version of the Iowa Gambling Task (IGT) is introduced in order to test the model. Our results match with experimental data and point out some relevant knowledge coming from psychological domain.
An Efficient Higher Order And High Speed Kogge-Stone Based CSLA Using Common Boolean Logic
Directory of Open Access Journals (Sweden)
Kuppampati Prasad,
2014-06-01
Full Text Available Adders are the basic building blocks of any processor or data path application. In adder design carry generation is the critical path. In this paper, we propose An Efficient and high speed carry select adder by replacing Ripple Carry Adders with parallel prefix adders (Kogge-Stone for Cin=0 stage and common Boolean logic for Cin=1 stage. In this proposed method we can reduce delay and area by 3%, 26% and 5% for 16-bit , 5%, 34% and 14% for 32-bit, 8%, 41% and 19% for 64-bit and 9%,46% and 21% for 128-bit compare to the modified adders (Regular CSLA, Regular with BEC and Regular with CBL.
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Morgado, Antonio
2008-01-01
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quartet Consistency (MQC) problem consists of computing a global phylogeny that satisfies the maximum number of quartets. A number of solutions have been proposed for the MQC problem, including Dynamic Programming, Constraint Programming, and more recently Answer Set Programming (ASP). ASP is currently the most efficient approach for optimally solving the MQC problem. This paper proposes encoding the MQC problem with pseudo-Boolean (PB) constraints. The use of PB allows solving the MQC problem with efficient PB solvers, and also allows considering different modeling approaches for the MQC problem. Initial results are promising, and suggest that PB can be an effective alternative for solving the MQC problem.
Ones and zeros understanding Boolean algebra digital circuits and the logic of sets
Gregg, John
1998-01-01
"Ones and Zeros explains, in lay terms, Boolean algebra, the suprisingly simple system of mathematical logic used in digital computer circuitry. Ones and Zeros follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. Readers will learn about the interesting history of the development of symbolic logic in particular, and the often misunderstood process of mathematical invention and scientific discovery, in general. Ones and Zeros also features practical exercises with answers, real-world examples of digital circuit design, and a reading list." "Ones and Zeros will be of particular interest to software engineers who want to gain a comprehensive understanding of computer hardware." "Outstanding features include: a history of mathematical logic, an explanation of the logic of digital circuits, and hands-on exercises and examples."--Jacket.
Combined spatial filtering and Boolean operators applied to the processing of real images
Feltmate, B. E.
1982-06-01
Several new and seemingly successful scene analysis techniques for application to real image processing are presented. These techniques consist of particular combinations of spatial low pass filtering, global thresholding and Boolean operators, specifically the AND, OR and NOT operators. These combinatorial operators, hereafter referred to as the Boolpass operators, perform the task of picture energy/information reduction, while retaining the fundamental picture primitives such as edges which characterize the images. Over 150 figures are included which illustrate the results obtained from application of the Boolpass techniques to eight different natural scenes. These results indicate that the Boolpass operators do display great potential as important components of a larger more comprehensive pattern recognition machine. Such a machine would encompass further processing (for target classification/recognition) of the resulting Boolpass operator information.
Decisional Processes with Boolean Neural Network: The Emergence of Mental Schemes
International Nuclear Information System (INIS)
Human decisional processes result from the employment of selected quantities of relevant information, generally synthesized from environmental incoming data and stored memories. Their main goal is the production of an appropriate and adaptive response to a cognitive or behavioral task. Different strategies of response production can be adopted, among which haphazard trials, formation of mental schemes and heuristics. In this paper, we propose a model of Boolean neural network that incorporates these strategies by recurring to global optimization strategies during the learning session. The model characterizes as well the passage from an unstructured/chaotic attractor neural network typical of data-driven processes to a faster one, forward-only and representative of schema-driven processes. Moreover, a simplified version of the Iowa Gambling Task (IGT) is introduced in order to test the model. Our results match with experimental data and point out some relevant knowledge coming from psychological domain. (authors)
Order-to-chaos transition in the hardness of random Boolean satisfiability problems
Varga, Melinda; Sumi, Róbert; Toroczkai, Zoltán; Ercsey-Ravasz, Mária
2016-05-01
Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical systems as diverse as fluids, chemical reactions, and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of constraint satisfaction problems that include scheduling, circuit design, routing, database problems, and even Sudoku. In particular, we present a study of the emergence of hardness in Boolean satisfiability (k -SAT), a canonical class of constraint satisfaction problems, by using an analog deterministic algorithm based on a system of ordinary differential equations. Problem hardness is defined through the escape rate κ , an invariant measure of transient chaos of the dynamical system corresponding to the analog algorithm, and it expresses the rate at which the trajectory approaches a solution. We show that for a given density of constraints and fixed number of Boolean variables N , the hardness of formulas in random k -SAT ensembles has a wide variation, approximable by a lognormal distribution. We also show that when increasing the density of constraints α , hardness appears through a second-order phase transition at αχ in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic. A similar behavior is found in 4-SAT as well, however, such a transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter κ ˜NB |α - αχ|1-γ with 0 <γ <1 . We demonstrate that the transition is generated by the appearance of metastable basins in the solution space as the density of constraints α is increased.
I/O correlation properties of bent functions
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Let f(x1, x2,…,xn) be a Boolean bent function with n variables. The mutual information between the output variable and m linearly independent affine functions with respect to x1, x2,…,xn is studied. The results show that the mutual information depends mainly on m and n, but little on the structure of function f.
I/O correlation properties of bent functions
Institute of Scientific and Technical Information of China (English)
张宝东; 吕述望
2000-01-01
Let f( x1, x2, …, xn) be a Boolean bent function with n variables. The mutual information between the output variable and m linearly independent affine functions with respect to x1, x2, …, xn is studied. The results show that the mutual information depends mainly on m and n, but little on the structure of function f.
Counting all bent functions in dimension eight 99270589265934370305785861242880
DEFF Research Database (Denmark)
Langevin, Philippe; Leander, Gregor
2011-01-01
Based on the classification of the homogeneous Boolean functions of degree 4 in 8 variables we present the strategy that we used to count the number of all bent functions in dimension 8. There are $$99270589265934370305785861242880 \\approx 2^{106}$$such functions in total. Furthermore, we show th...
Smart Detector Cell: A Scalable All-Spin Circuit for Low Power Non-Boolean Pattern Recognition
Aghasi, Hamidreza; Iraei, Rouhollah Mousavi; Naeemi, Azad; Afshari, Ehsan
2016-05-01
We present a new circuit for non-Boolean recognition of binary images. Employing all-spin logic (ASL) devices, we design logic comparators and non-Boolean decision blocks for compact and efficient computation. By manipulation of fan-in number in different stages of the circuit, the structure can be extended for larger training sets or larger images. Operating based on the mainly similarity idea, the system is capable of constructing a mean image and compare it with a separate input image within a short decision time. Taking advantage of the non-volatility of ASL devices, the proposed circuit is capable of hybrid memory/logic operation. Compared with existing CMOS pattern recognition circuits, this work achieves a smaller footprint, lower power consumption, faster decision time and a lower operational voltage. To the best of our knowledge, this is the first fully spin-based complete pattern recognition circuit demonstrated using spintronic devices.
Directory of Open Access Journals (Sweden)
Max Billib
2011-12-01
Full Text Available With population increase, lack of conventional fresh water resources and uncertainties due to climate change, there is growing interest in the arid and semi-arid areas to increase groundwater recharge with recycled water. Finding the best locations for artificial recharge of groundwater in such areas is one of the most crucial design steps to guarantee the long life and the sustainability of these projects. This study presents two ways to go about performing analysis; creating a suitability map to find out the suitability of every location on the map and another way is querying the created data sets to obtain a Boolean result of true or false map. These techniques have been applied on Sadat Industrial City which is located in a semi arid area in the western desert fringes of The Nile delta in the north west of Egypt. Thematic layers for number of parameters were prepared from some maps and satellite images and they have been classified, weighted and integrated in ArcGIS environment. By the means of the overlay weighted model in ArcGIS a suitability map which is classified into number of priority zones was obtained and it could be compared with the obtained true-false map of Boolean logic. Both methods suggested mostly the northern parts of the city for groundwater recharge; however the weighted model could give more accurate suitability map while Boolean logic suggested wider ranges of areas. This study recommends Boolean logic as a first estimator for locating the best locations as it is easier and not time consuming, while the overlay weighted model for more accurate results.
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
伪布尔链上的α、β算子%α,β Operators on Quasi－Boolean Chain
Institute of Scientific and Technical Information of China (English)
刘树人; 成央金
2001-01-01
At first,we propose the α operator and βoperator on quasi－boolean chain.Next investigate their properties and apply them to solve inqualities in one unknown.%提出了伪布尔链上的α和β算子,研究了它们的性质并应用这两种算子求解含一个变量的不等式．
Kauffman networks with threshold functions
Greil, Florian; Drossel, Barbara
2007-01-01
We investigate Threshold Random Boolean Networks with $K = 2$ inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks should be critical but it turns out that they show a rich variety of behaviors, including periodic and chaotic oscillations. The results are supported by analytical calculations and computer simulations.
Zhu, Zheng; Andresen, Juan Carlos; Moore, M A; Katzgraber, Helmut G
2014-02-01
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium. PMID:25353433
Marmarelis, Vasilis Z; Zanos, Theodoros P; Berger, Theodore W
2009-08-01
This paper presents a new modeling approach for neural systems with point-process (spike) inputs and outputs that utilizes Boolean operators (i.e. modulo 2 multiplication and addition that correspond to the logical AND and OR operations respectively, as well as the AND_NOT logical operation representing inhibitory effects). The form of the employed mathematical models is akin to a "Boolean-Volterra" model that contains the product terms of all relevant input lags in a hierarchical order, where terms of order higher than first represent nonlinear interactions among the various lagged values of each input point-process or among lagged values of various inputs (if multiple inputs exist) as they reflect on the output. The coefficients of this Boolean-Volterra model are also binary variables that indicate the presence or absence of the respective term in each specific model/system. Simulations are used to explore the properties of such models and the feasibility of their accurate estimation from short data-records in the presence of noise (i.e. spurious spikes). The results demonstrate the feasibility of obtaining reliable estimates of such models, with excitatory and inhibitory terms, in the presence of considerable noise (spurious spikes) in the outputs and/or the inputs in a computationally efficient manner. A pilot application of this approach to an actual neural system is presented in the companion paper (Part II). PMID:19517238
The number and probability of canalizing functions
Just, Winfried; Shmulevich, Ilya; Konvalina, John
2003-01-01
Canalizing functions have important applications in physics and biology. For example, they represent a mechanism capable of stabilizing chaotic behavior in Boolean network models of discrete dynamical systems. When comparing the class of canalizing functions to other classes of functions with respect to their evolutionary plausibility as emergent control rules in genetic regulatory systems, it is informative to know the number of canalizing functions with a given number of input variables. Th...
Order-to-chaos transition in the hardness of random Boolean satisfiability problems
Varga, Melinda; Sumi, Robert; Ercsey-Ravasz, Maria; Toroczkai, Zoltan
Transient chaos is a phenomenon characterizing the dynamics of phase space trajectories evolving towards an attractor in physical systems. We show that transient chaos also appears in the dynamics of certain algorithms searching for solutions of constraint satisfaction problems (e.g., Sudoku). We present a study of the emergence of hardness in Boolean satisfiability (k-SAT) using an analog deterministic algorithm. Problem hardness is defined through the escape rate κ, an invariant measure of transient chaos, and it expresses the rate at which the trajectory approaches a solution. We show that the hardness in random k-SAT ensembles has a wide variation approximable by a lognormal distribution. We also show that when increasing the density of constraints α, hardness appears through a second-order phase transition at αc in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic, however, such transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter. We demonstrate that the transition is generated by the appearance of non-solution basins in the solution space as the density of constraints is increased.
Damage spreading in spatial and small-world random Boolean networks
Lu, Qiming; Teuscher, Christof
2014-02-01
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance of spatially local networks scales with a power law as the system size N increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Giunchiglia, E; Tacchella, A; 10.1613/jair.1959
2011-01-01
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable formula in conjunctive normal form (CNF) and then represented as a set of clauses. Deduction starts by inferring new clauses by resolution, and goes on until the empty clause is generated or satisfiability of the set of clauses is proven, e.g., because no new clauses can be generated. In this paper, we restrict our attention to the problem of evaluating Quantified Boolean Formulas (QBFs). In this setting, the above outlined deduction process is known to be sound and complete if given a formula in CNF and if a form of resolution, called Q-resolution, is used. We introduce Q-resolution on terms, to be used for formulas in disjunctive normal form. We show that the computation performed by most of the available procedures for QBFs --based on the Davis-Logemann-Loveland procedure (DLL) for propositional satisfiability-- corresponds to a tree...
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms
Tamura, Takeyuki; Akutsu, Tatsuya
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor, which is also called a fixed point, is NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where singleton attractors correspond to steady states. Though a naive algorithm can detect a singleton attractor for an AND/OR BN in O(n 2n) time, no O((2-ε)n) (ε > 0) time algorithm was known even for an AND/OR BN with non-restricted indegree, where n is the number of nodes in a BN. In this paper, we present an O(1.787n) time algorithm for detecting a singleton attractor of a given AND/OR BN, along with related results. We also show that detection of a singleton attractor in a BN with maximum indegree two is NP-hard and can be polynomially reduced to a satisfiability problem.
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.
Damage spreading in spatial and small-world random boolean networks
Energy Technology Data Exchange (ETDEWEB)
Lu, Qiming [Los Alamos National Laboratory; Teuscher, Christof [Los Alamos National Laboratory
2008-01-01
Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.
Memory-Based Boolean Game and Self-Organized Phenomena on Networks
Institute of Scientific and Technical Information of China (English)
HUANG Zi-Gang; WU Zhi-Xi; GUAN Jian-Yue; WANG Ying-Hai
2006-01-01
@@ We study a memory-based Boolean game (MBBG) taking place on a regular ring, wherein each agent acts according to its local optimal states of the last M time steps recorded in memory, and the agents in the minority are rewarded. One free parameter p between 0 and 1 is introduced to denote the strength of the agent willing to make a decision according to its memory. It is found that giving proper willing strength p, the MBBG system can spontaneously evolve to a state of performance better than the random game; while for larger p, the herd behaviour emerges to reduce the system profit. By analysing the dependence of dynamics of the system on the memory capacity M, we find that a higher memory capacity favours the emergence of the better performance state, and effectively restrains the herd behaviour, thus increases the system profit. Considering the high cost of long-time memory, the enhancement of memory capacity for restraining the herd behaviour is also discussed,and M = 5 is suggested to be a good choice.
Boolean operations of STL models based on edge-facet intersection
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
For the data processing of the Rapid Prototyping Manufacturing, Boolean operation can offer a versatile tool for editing or modifying the STL model, adding the artificial construction, and creating the complex assistant support structure to meet the special technical requests. The topological structure of STL models was built firstly in order to obtain the neighborhood relationship among the triangular facets. The intersection test between every edge of one solid and every facet of another solid Was taken to get the intersection points. According to the matching relationship of the triangle index recorded in the data structure of the intersection points, the intersection segments array and the intersection loop were traced out. Each intersected triangle was subdivided by the Constrained Delaunay Triangulations. The intersected surfaces were divided into several surface patches along the intersection loops. The inclusion prediction between the surface patch and the other solid was taken by testing whether the candidate point Was inside or outside the solid region of the slice. Detecting the loops for determination of the valid intersection lines greatly increases the efficiency and the reliability of the process.
Boolean Process Based Waveform Simulation for Combinational Circuit%基于布尔过程的组合电路波形模拟
Institute of Scientific and Technical Information of China (English)
李立健; 闵应骅
2001-01-01
High operation frequency and strict timing behavior arecharacteristics of modern high performance integrated circuit, which require that a digital system simulator can precisely simulate not only the logic function but also the timing behavior of a circuit. This paper presents an approach of waveform simulation for combinational circuit based on Boolean process, and introduces its theoretical bases, used techniques, major algorithms, verifications by SPICE and results of experiments.%工作频率高和定时严格是现代集成电路的特点，它们要求数字系统模拟器不但可以模拟电路的逻辑行为，而且可以精确地模拟电路的定时特性.文中提出了一个基于布尔过程的波形模拟途径，并介绍了它的理论基础、主要算法思想、所采用的技术、SPICE验证以及实验结果.
Klauser, Benedikt; Saragliadis, Athanasios; Ausländer, Simon; Wieland, Markus; Berthold, Michael R; Hartig, Jörg S
2012-09-01
In cellular systems environmental and metabolic signals are integrated for the conditional control of gene expression. On the other hand, artificial manipulation of gene expression is of high interest for metabolic and genetic engineering. Especially the reprogramming of gene expression patterns to orchestrate cellular responses in a predictable fashion is considered to be of great importance. Here we introduce a highly modular RNA-based system for performing Boolean logic computation at a post-transcriptional level in Escherichia coli. We have previously shown that artificial riboswitches can be constructed by utilizing ligand-dependent Hammerhead ribozymes (aptazymes). Employing RNA self-cleavage as the expression platform-mechanism of an artificial riboswitch has the advantage that it can be applied to control several classes of RNAs such as mRNAs, tRNAs, and rRNAs. Due to the highly modular and orthogonal nature of these switches it is possible to combine aptazyme regulation of activating a suppressor tRNA with the regulation of mRNA translation initiation. The different RNA classes can be controlled individually by using distinct aptamers for individual RNA switches. Boolean logic devices are assembled by combining such switches in order to act on the expression of a single mRNA. In order to demonstrate the high modularity, a series of two-input Boolean logic operators were constructed. For this purpose, we expanded our aptazyme toolbox with switches comprising novel behaviours with respect to the small molecule triggers thiamine pyrophosphate (TPP) and theophylline. Then, individual switches were combined to yield AND, NOR, and ANDNOT gates. This study demonstrates that post-transcriptional aptazyme-based switches represent versatile tools for engineering advanced genetic devices and circuits without the need for regulatory protein cofactors. PMID:22777205
Scott, N Ann; Moga, Carmen; Harstall, Christa
2009-12-01
Rationale, aims and objectives The Appraisal of Guidelines Research and Evaluation (AGREE) instrument is a generic tool for assessing guideline quality. This feasibility study aimed to reduce the ambiguity and subjectivity associated with AGREE item scoring, and to augment the tool's capacity to differentiate between good- and poor-quality guidelines. Methods A literature review was conducted to ascertain what AGREE instrument adjustments had been reported to date. The AGREE User Guide was then modified by: 1 constructing a detailed set of instructions, or dictionary, using Boolean operators, and 2 overlaying seven criteria to categorize guideline quality. The feasibility of the Boolean-based dictionary was tested by three appraisers using three randomly selected guidelines on low back pain management. The dictionary was then revised and re-tested. Results Of the 52 published studies identified, 14% had modified the instrument by adding or deleting items and 35% had adopted strategies, such as using a consensus approach, to overcome inconsistencies and ensure identical item scoring among appraisers. For the feasibility test, Pearson correlation coefficients ranged from 0.27 to 0.81. Revision and re-testing of the dictionary increased the level of agreement (range 0.41 to 0.94). Application of the revised dictionary not only decreased the variability of the domain scores, but also reduced the tool's reliability among inexperienced appraisers. Conclusion Appraisers found the Boolean-based AGREE User Guide easier to use than the original, which improved their confidence in the tool. Good reliability was achieved in the feasibility test, but the reliability and validity of some of the changes will require further evaluation. PMID:20367706
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Moravec, P.; Snášel, V.; Frolov, A.; Řezanková, H.; Polyakov, P.Y.
Berlin : Springer, 2007 - (Ghosh, A.; De, R.), s. 235-243 ISBN 978-3-540-77045-9. - (Lecture Notes in Computer Science. 4815). [PReMI 2007. International Conference /2./. Kolkata (IN), 18.12.2007-22.12.2007] R&D Projects: GA MŠk(CZ) 1M0567; GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * neural network * dimension reduction * cluster analysis Subject RIV: BB - Applied Statistics, Operational Research
Hegedüs, Gábor
2010-01-01
Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number of the cliques $K_{i+1}$, contained in the graph $G(P)$. Our main results are some linear equations connecting the numbers $f_i(P)$ and $b_i(L)$. We reprove the Dehn--Sommerville equations for simplicial polytopes. In our proof we use free resolutions and the theory of Stanley--Reisner rings.
Notes on coarse grainings and functions of observables
Dvurecenskij, A; Pulmannova, S; Ylinen, K
2004-01-01
Using the Naimark dilation theory we investigate the question under what conditions an observable which is a coarse graining of another observable is a function of it. To this end, conditions for the separability and for the Boolean structure of an observable are given.
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.
Energy Technology Data Exchange (ETDEWEB)
Santos, L.O.E.; Philippi, P.C.; Fernandes, C.P. [Porous Media and Thermophysical Properties Laboratory LMPT, Mechanical Engineering Department, Federal University of Santa Catarina, 88040-900 , SC Florianopolis (Brazil); Damiani, M.C. [Engineering Simulation and Scientific Software ESSS, Parque Tecnologico de Florianopolis, Rodovia SC 401 km 001, 88030-000 , SC Florianopolis (Brazil)
2002-07-01
This paper presents a method for predicting the intrinsic permeability of porous media based on the integration of the local velocity field. Three-dimensional representations of the porous structure are reconstructed from two-dimensional binary images, after segmentation of digital images acquired from thin plates, commonly used in microscopy. Velocity field is calculated on these three-dimensional representations using a Boolean lattice gas method (LGA). Reconstruction is based on a Gaussian stochastic simulation. Mercury-intrusion results furnish auxiliary data that are used for the estimation of a critical percolation diameter and to establish a necessary condition for the binary source images to give accurate predictions of permeability, considering the intrinsic limitations of the reconstruction process. Reconstruction method and connection loss, resolution factor, adherence conditions and the effects of Boolean noise in the calculation of permeability are fully discussed. The method is used to simulate flows through several petroleum reservoir rocks, leading to intrinsic permeability prediction. Simulation is compared with experimental results. Considered as an intrinsic permeability prediction method based on the geometrical information that is possible to recovery from microscopy thin plates, three-dimensional reconstruction appears to be the most critical step in present simulation scheme.
基于布尔语义的Gentzen推导模型%Gentzen Deduction Model Based on Boolean Logic Semantics
Institute of Scientific and Technical Information of China (English)
陈博; 眭跃飞
2015-01-01
Deduction systems are important arts of searching technology. This paper gives a new correspondence between the propositional logic and Boolean algebra, where an inequation is corresponding to a Gentzen sequent, so that the inequation is true in every Boolean algebra if and only if the Gentzen sequent is provable. In information retrieval, the information inference can effectively turn into the operation on poset. Precisely, the logical language for the propositional logic contains operators Ø'Ù'Ú;the terms instead of formulas are defined (a|Øt|t1 Ù t2|t1 Ú t2 , where a is an element) and used to represent elements in Boolean algebra. This paper defines an assignment v using Boolean algebra as its domain, and assigns the terms to be the element in Boolean algebra. The sequence ΓÞΔ is satisfied if tv £tv. Finally, this paper gives a Gentzen system to prove the soundness and completeness theorem.%布尔模型是信息检索系统的一种基础模型。给出了命题逻辑和布尔代数间的一种新的对应关系，其中布尔代数中的不等式对应Gentzen系统中的矢列式，使得当一个不等式在任意布尔代数中为真，当且仅当它所对应的矢列式是可证的。并且使得在信息检索中，针对信息的推理可以有效地转为偏序集上的运算。讨论的命题逻辑语言的运算符为Ø、Ù、Ú；并且定义了项（a|Øt|t1Ù t2|t1Ú t2'其中a是一个元素）来替代原先的公式和表示布尔代数中的元素。此外，定义了以布尔代数为论域的赋值v，将命题逻辑中的项赋值为布尔代数中的元素，并且如果tv £t v ，则矢列式ΓÞ D为真。最后给出了Gentzen系统下的可靠性和完备性定理的证明。tÎΓtÎΔ
Fresch, B.; Verduijn, J.; Mol, J. A.; Rogge, S.; Remacle, F.
2012-07-01
We show that a single atom transistor (SAT) addressed by a pulsed gate voltage is a physical realization of an Oracle that can calculate the four one-bit Boolean functions, the logical output being encoded in a measurable current. The algorithm relies on the quasi-classical parallelism that arises from the linearity of the kinetic scheme used to describe incoherent electron transport through two levels of the SAT. We demonstrate that one of the four one-bit Boolean functions can be identified by a single current measurement. The generalization of the algorithm to n bit functions is also discussed.
Multistate nested canalizing functions
Adeyeye, J O; Laubenbacher, R; Li, Y
2013-01-01
The concept of a nested canalizing Boolean function has been studied over the course of the last decade in the context of understanding the regulatory logic of molecular interaction networks, such as gene regulatory networks. Such functions appear preferentially in published models of such networks. Recently, this concept has been generalized to include multi-state functions, and a recursive formula has been derived for their number, as a function of the number of variables. This paper carries out a detailed analysis of the class of nested canalizing functions over an arbitrary finite field. Furthermore, the paper generalizes the concept further, and derives a closed formula for the number of such generalized functions. The paper also derives a closed formula for the number of equivalence classes under permutation of variables. This is motivated by the fact that two nested canalizing functions that differ by a permutation of the variables share many important properties with each other. The paper contributes ...
Boole代数上的几个新度量结构%Several New Metric Structures on Boolean Algebra
Institute of Scientific and Technical Information of China (English)
左卫兵; 娄妍
2011-01-01
设B是Boole代数,Ω是B到Boole代数{0,1}的全体格同态,μ是Ω上的概率测度,基于B中元素的尺寸的概念提出了元素之间的几个伪度量,建立了B上的度量结构,研究了其上运算的连续性及相互关系.%Let B be a Boolean algebra and ft the set of all homomorphisms from B into {0,1}, and μ be a probability measure on Ω. Based on the concept of sizes of elements of B several new metrics on the pairs of elements are introduced, and the metric structures on B are established, finally, the propositions of continuity of the operations on B are studied.
Ilinca, Liviu
2010-01-01
With $G_k(n)$ the number of functions of $n$ boolean variables definable by $k$-SAT formulae, we prove that $G_3(n)$ is asymptotic to $2^{n+\\binom{n}{3}}$. This is a strong form of the case $k=3$ of a conjecture of Bollob\\'as, Brightwell and Leader stating that for fixed $k$, $\\log_2 G_k(n)\\sim \\binom{n}{k}$.
On the Number of 2-SAT Functions
Ilinca, Liviu; 10.1017/S096354830900995X
2010-01-01
We give an alternative proof of a conjecture of Bollob\\'as, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formulae is $(1+o(1))2^{\\binom{n+1}{2}}$. One step in the proof determines the asymptotics of the number of "odd-blue-triangle-free" graphs on $n$ vertices.
On Extension of Measurable Functions and Local Operators
Shragin, Isaak V.; Nepomnyashchikh, Yurii V.
2003-04-01
In this work we generalize a number of results from1 on extension of measurable functions and local operators. In comparasion with 1 we assume neither measure to be defined on considered σ- algebras, nor the metric space on functions values is complete. As well in contrast to 1 here we do not make use Boolean algebras. This circumstance made possible essentially to simplify the presentation.
布尔运算在压缩机主机设计中应用%Application of Boolean Calculation in the Frame Design of Compressor
Institute of Scientific and Technical Information of China (English)
张勇; 冯丞科; 赵文雄; 李振波
2012-01-01
Boolean calculation is the basic algorithm of computer graphic. During the process of modelling by CAD design software and computer geometric modeling techniques, Boolean operation displays an important action as an useful tool. From the two aspects of the calculation of frame oil basin and clearance volume, the application of Boolean colculation in compressor design is specified. By using Boolean operation, the volume mentioned above,which is the significant parameter of frame,can be obtained efficiently and rapidly. Meanwhile,the problems of heavy workload and low efficiency existing in traditional calculation method are effectively solved, and the results are more accurate.%布尔运算是计算机图形学中的基本算法.在计算机几何造型技术与CAD设计软件建模过程中,布尔操作作为一个常用工具发挥着重要的作用.从压缩机主机机身油池容量及压缩缸端余隙容积的计算2个方面,阐述了布尔运算在压缩机主机设计中的运用.通过使用该方法,可以高效快捷的得到上述空间容积,获得主机的主要性能参数,同时有效地解决了传统计算方法工作量大、效率低等问题,并提高了计算结果的准确性.
基于布尔差别矩阵逻辑运算的属性约简%Attribute Reduction Based on Logical Operation of Boolean Discernibility Matrix
Institute of Scientific and Technical Information of China (English)
杨传健; 葛浩; 李龙澍
2012-01-01
In order to overcome the shortcomings of computing attribute reduction based on discernibility matrix,the decision tables was simplified,and the definition of Boolean discernibility matrix and the method of logical operation based on Boolean discernibility matrix were provided.The corresponding definitions of core attributes and attribute reduction based on Boolean discernibility matrix were put forward.It was proved that core attributes and attribute reduction acquired from the definitions are equivalent to the core attributes and attribute reduction based on positive region.Then,the algorithm for computing attribute reduction based on logical operation of Boolean discernibility matrix was designed,and its time and space complexity were all O（｜C｜｜U/C｜2）.Finally,the example and experiments were used to explain the feasibility and effectiveness of the method.%针对差别矩阵属性约简存在的不足,首先将决策表简化,并引入布尔差别矩阵定义及其逻辑运算方法;然后给出基于布尔差别矩阵核属性和属性约简的定义,同时证明了该核属性和属性约简与正区域的核属性和属性约简是等价的;接着,设计基于属性布尔差别矩阵逻辑运算的属性约简算法,算法的时间和空间复杂度均为O（｜C｜｜U/C｜2）。最后,通过实例和实验验证本文算法的正确性和高效性。
The Minimal and Maximal Sensitivity of the Simplified Weighted Sum Function
Li, Jiyou; Luo, Chu; Xu, Zeying
2015-01-01
Sensitivity is an important complexity measure of Boolean functions. In this paper we present properties of the minimal and maximal sensitivity of the simplified weighted sum function. A simple close formula of the minimal sensitivity of the simplified weighted sum function is obtained. A phenomenon is exhibited that the minimal sensitivity of the weighted sum function is indeed an indicator of large primes, that is, for large prime number p, the minimal sensitivity of the weighted sum functi...
Directory of Open Access Journals (Sweden)
Tholen Stefan
2011-01-01
Full Text Available Abstract Background Several computational methods exist to suggest rational genetic interventions that improve the productivity of industrial strains. Nonetheless, these methods are less effective to predict possible genetic responses of the strain after the intervention. This problem requires a better understanding of potential alternative metabolic and regulatory pathways able to counteract the targeted intervention. Results Here we present SPABBATS, an algorithm based on Boolean satisfiability (SAT that computes alternative metabolic pathways between input and output species in a reconstructed network. The pathways can be constructed iteratively in order of increasing complexity. SPABBATS allows the accumulation of intermediates in the pathways, which permits discovering pathways missed by most traditional pathway analysis methods. In addition, we provide a proof of concept experiment for the validity of the algorithm. We deleted the genes for the glutamate dehydrogenases of the Gram-positive bacterium Bacillus subtilis and isolated suppressor mutant strains able to grow on glutamate as single carbon source. Our SAT approach proposed candidate alternative pathways which were decisive to pinpoint the exact mutation of the suppressor strain. Conclusions SPABBATS is the first application of SAT techniques to metabolic problems. It is particularly useful for the characterization of metabolic suppressor mutants and can be used in a synthetic biology setting to design new pathways with specific input-output requirements.
Spaces of continuous functions
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.
Modal Functional (`Dialectica') Interpretation
Hernest, Dan; Trifonov, Trifon
2012-01-01
We adapt our light Dialectica interpretation to usual and light modal formulas (with universal quantification on boolean and natural variables) and prove it sound for a non-standard modal arithmetic based on Goedel's T and classical S_4. The range of this light modal Dialectica is the usual (non-modal) classical Arithmetic in all finite types (with booleans); the propositional kernel of its domain is Boolean and not S_4. The `heavy' modal Dialectica interpretation is a new technique; it canno...
Logic Functions and Quantum Error Correcting Codes
Xu, Yajie; Ma, Zhi; Zhang, Chunyuan; Lü, Xin
2007-01-01
In this paper, based on the relationship between logic functions and quantum error correcting codes(QECCs), we unify the construction of QECCs via graphs, projectors and logic functions. A construction of QECCs over a prime field GF(p) is given, and one of the results given by Ref[8] can be viewed as a corollary of one theorem in this paper. With the help of Boolean functions, we give a clear proof of the existence of a graphical QECC in mathematical view, and find that the existence of an [[...
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
Logic gates are devices that can perform logical operations by transforming a set of inputs into a predictable single detectable output. The hybridization properties, structure, and function of nucleic acids can be used to make DNA-based logic gates. These devices are important modules in molecular...... computing and biosensing. The ideal logic gate system should provide a wide selection of logical operations, and be integrable in multiple copies into more complex structures. Here we show the successful construction of a small DNA-based logic gate complex that produces fluorescent outputs corresponding to...
Boolean expression of object(property)-oriented concept lattice%面向对象（属性）概念格的布尔表达
Institute of Scientific and Technical Information of China (English)
石慧; 魏玲
2015-01-01
Formal concept analysis is an important method of knowledge representation and discovery.It is a method for data analysis used in finding,ordering and displaying of concepts.As a valid and potential tools in knowledge dis-covery,concept lattice theory has attracted much attention of artificial intelligence researchers around the world. Now,it have been applied in various research areas,such as machine learning,expert system,computer network, decision analysis,data mining,and so on.This paper introduced Boolean logic operation in FCA and used it to define the up and down approximate operation,and Boolean object(property)-oriented concept lattice in Boolean formal context.This method greatly simplified the process of constructing object(property)-oriented concept lattice.%形式概念分析是用于知识表示和知识发现的一个重要方法。将逻辑运算方法引入形式概念分析之中，利用布尔向量的逻辑运算定义了布尔形式背景中的上、下近似运算，给出了其性质。并定义了布尔面向对象(属性)概念格，证明了其与面向对象(属性)概念格的等价性。简化了构造面向对象(属性)概念格的过程。
Controllability and observability of Boolean control networks%布尔控制网络的能控性与能观性
Institute of Scientific and Technical Information of China (English)
李志强; 宋金利
2013-01-01
Using the semi-tensor product,we convert the Boolean control network to its algebraic form.From the structure matrix of Boolean control network,the controllability and observability of the Boolean control network are discussed.A novel necessary and sufficient condition for controllability,which improves the recent results,is given.The new controllability condition eliminates the redundant computation of controllability matrix.The highest power of matrix is reduced from 2m+n to 2 n.Also,a sufficient condition for observability is obtained,which can be computed easily.A numerical example is presented to show the applicability of our controllability and observability condition.%利用矩阵的半张量积,布尔控制网络被转化为离散时间系统.本文从离散时间系统的结构矩阵出发,讨论了逻辑控制系统的能控能观性条件,得到了一个新的能控性条件.新的条件简化了原有能控性矩阵的计算复杂性,矩阵的最高阶数由原来的2m+n降到了2n.另外,还得到了检验布尔控制网络能观性的条件.与原有条件相比,新的条件更容易计算检验.最后,给出一个实例,检验给出的能控能观性判断条件的正确性.
基于故障的布尔表达式测试技术综述%Survey on Fault-based Testing Techniques for Boolean Expressions
Institute of Scientific and Technical Information of China (English)
孙昌爱; 程庆顺
2013-01-01
Boolean expressions play a key role in specifications and programs, and thus significantly affect the correctness of software. How to efficiently test Boolean expressions is an important issue. We first introduced the basic concepts and principle of fault-based testing. We then summarized several fault classes of Boolean expressions and discussed their detection hierarchies. Next, we reviewed several representative fault-based testing strategies for Boolean expressions, and proposed a comparison framework to compare them with respect to the applicability,fault detection capability and reduction of test suites. Finally,we pointed out several future issues based on our observations of limitations on the existing works,and briefly introduced our relevant work in this area%布尔表达式是软件规格说明与程序实现中的关键成份,严重影响软件的正确性.如何有效地测试布尔表达式是软件测试领域的一个重要研究方向.介绍了基于故障的软件测试的基本概念与原理,归纳了布尔表达式的各种故障类型,讨论了不同故障类型之间的检测包含关系；评述了几类代表性的面向布尔表达式的测试策略,提出了一种比较框架并比较了各种策略的适用情形、故障检测能力与测试用例精简程度.针对现有研究工作的不足,探讨了几个值得研究的问题,简要介绍了近年来此领域的研究工作.
Meghabghab, George
2001-01-01
Discusses the evaluation of search engines and uses neural networks in stochastic simulation of the number of rejected Web pages per search query. Topics include the iterative radial basis functions (RBF) neural network; precision; response time; coverage; Boolean logic; regression models; crawling algorithms; and implications for search engine…
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.
基于布尔矩阵的DeePWeb复杂模式匹配%Deeo Web Complex Schema Matching Based on Boolean Matrix
Institute of Scientific and Technical Information of China (English)
龚桂芬; 伏玉璨; 程远虎
2011-01-01
在正负关联规则中引入布尔矩阵的概念,在双重相关性挖掘算法的基础上提出一种Deep Web复杂模式匹配算法.将查询接口模式中的属性项转化成布尔矩阵,通过对矩阵进行正关联规则运算挖掘组属性,对矩阵进行负关联规则运算挖掘同义属性.实验结果表明该算法的执行效率较高.%This paper introduces the Boolean matrix into the both positive and negative association roles, based on the Duel Correlated Mining (DCM) algorithm, it presents a Deep Web complex schema matching algorithm.It transforms the attributes in the query interface schemas into a Boolean matrix, mines group attributes by positively calculating for matrix and mines synonymous attributes by negatively calculating for matrix.Experimental results show that the algorithm has higher efficiency.
求S盒布尔表达式的若干算法探讨%Different algorithms on computation of Boolean expression of S box
Institute of Scientific and Technical Information of China (English)
李晓东; 陶涛
2012-01-01
S盒是许多加密算法唯一的非线性部件,其安全性对这些算法的密码分析至关重要.S盒输出的布尔表达式(即模2域上的代数多项式)被用于衡量S盒的非线性度等用途.在已知S盒真值表情况下,对求S盒各输出布尔表达式的各种算法进行了探讨和总结.其中,折半异或法在普通PC计算机上只需要m2m-1次操作,其中m为S盒的输入位数,且不需要占用额外的内存.%S box is the only nonlinear component of many encryption algorithms, its security is important to the cryptanalysis of these algorithms. Output Boolean expression of the S box is used to measure the degree of the nonlinearity of S box. Known truth table, various algorithms on computing output Boolean expression of the S box are discussed and summarized. Among them, the fold XOR method only requires m2m-1 operations in PC computers where m is the input bit number of S box, and does not require additional memory.
Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin
2016-01-01
Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behavior of systems. In this paper, we investigate the less-studied one-bit perturbation, which falls under the category of structural intervention. Previous works focused on finding the optimal one-bit perturbation to maximally alter the steady-state distribution (SSD) of undesirable states through matrix perturbation theory. However, the application of the SSD is limited to Boolean networks with about ten genes. In 2007, Xiao et al. proposed to search the optimal one-bit perturbation by altering the sizes of the basin of attractions (BOAs). However, their algorithm requires close observation of the state-transition diagram. In this paper, we propose an algorithm that efficiently determines the BOA size after a perturbation. Our idea is that, if we construct the basin of states for all states, then the size of the BOA of perturbed networks can be obtained just by updating the paths of the states whose transitions have been affected. Results from both synthetic and real biological networks show that the proposed algorithm performs better than the exhaustive SSD-based algorithm and can be applied to networks with about 25 genes. PMID:27196530
When do evolutionary algorithms optimize separable functions in parallel?
DEFF Research Database (Denmark)
Doerr, Benjamin; Sudholt, Dirk; Witt, Carsten
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...
Implementing Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Neruda, Roman; Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A. A.
Vol. Part I. Berlin : Springer, 2008 - (Kůrková, V.; Neruda, R.; Koutník, J.), s. 543-552 ISBN 978-3-540-87535-2. - (Lecture Notes in Computer Science. 5163). [ICANN 2008. International Conference on Artificial Neural Network s /18./. Prague (CZ), 03.09.2008-06.09.2008] Institutional research plan: CEZ:AV0Z10300504 Keywords : factor analysis * genetic algorithm * neural network s Subject RIV: IN - Informatics, Computer Science
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
硬件加速的渐进式多边形模型布尔运算%GPU-Accelerated Progressive Boolean Operations on Polygonal Models
Institute of Scientific and Technical Information of China (English)
赵汉理; 孟庆如; 金小刚; 黄辉; 王明
2015-01-01
多边形模型的布尔运算中包含复杂的求交计算以及多边形重建过程，精度控制和处理效率是其中的关键。为了降低布尔运算复杂度，提出一种适合硬件加速的基于渐进式布尔运算的多层次细节网格模型生成方法。该方法采用分层深度图像来近似表示多边形实体的封闭边界，将多边形的求交计算简化为坐标轴平行的采样点的实体内外部判断；为了免去各层次细节模型的重复采样过程，渐进式地将边界采样点归并到低分辨率下的立方体中；运用特征保持的多边形重建算法将相同立方体内的边界采样点转换成多边形顶点，根据邻接关系生成网格模型。上述算法使用支持图形硬件加速的CUDA编程并行实现。实验结果表明了算法的可行性。%Boolean operations on polygonal models involve the complex intersection calculations and po-lygonal reconstruction, where the precision control and processing efficiency are two key problems. To re-duce the Boolean operation complexity, this paper proposes a progressive and GPU accelerated Boolean op-eration approach to generate levels-of-detail polygonal models. Layered depth images are employed to ap-proximate the enclosed boundaries of polygons and the intersection calculations are performed as the in/out classification of axis-aligned sampling points. To avoid the additional sampling process for levels-of-detail models, the boundary points are progressively merged into low-resolution cubes. The feature-preserving dual contouring algorithm is adopted to convert boundary points into a mesh model. The proposed algorithm can be implementation in parallel on GPU with the hardware-supported CUDA. Finally, experimental results show the feasibility of the proposed approach.
Analysis and Control of Boolean Networks:A Semi-tensor Product Approach%布尔网络的分析与控制-矩阵半张量积方法
Institute of Scientific and Technical Information of China (English)
程代展; 齐洪胜; 赵寅
2011-01-01
布尔网络是描述基因调控网络的一个有力工具.由于系统生物学的发展,布尔网络的分析与控制成为生物学与系统控制学科的交叉热点.本文综述作者用其原创的矩阵半张量积方法在布尔网络的分析与控制中得到的一系列结果.内容包括:布尔网络的拓扑结构,布尔控制网络的能控、能观性与实现,布尔网络的稳定性和布尔控制网络的镇定,布尔控制网络的干扰解耦,布尔(控制)网络的辨识,以及布尔网络的最优控制等.%Boolean network is a powerful tool for describing gene regulatory network. With the development of the systems biology, the analysis and control of Boolean networks become a hot topic for multidisciplinary research. This paper surveys some recent results obtained in the analysis and control of Boolean networks using semi-tensor product of matrices. The contents of this paper include the topological structure of Boolean networks, the controllability and observability, realization, stability and stabilization, disturbance decoupling, identification, and optimal control of Boolean (control) networks.
Parameters-based voxelization of NURBS volumes and its Boolean operation%基于参数的NURBS体体素化与布尔运算
Institute of Scientific and Technical Information of China (English)
高新瑞; 张树生; 周文山; 侯增选
2006-01-01
Parameters-based voxelization of NURBS volumes and their Boolean operation such as union, intersection and difference are discussed mainly. This is a new kind ofvoxelization algorithm which can more exactly express the volume. The methods for construction of NURBS volumes include skinning, sweeping and swinging etc.%主要讨论基于参数的NURBS体体素化与并、交、差布尔运算.这是一种能比较精确表示NURBS体的体素化算法.NURBS体造型技术主要有蒙皮法、拉伸法与旋转法等.影响NURBS体形状的因素有控制顶点、结点与结点的重度、权因子与基函数次数.
语义特征建模系统中布尔算法的研究%Research on Boolean Operation in Semantic Feature Modeling System
Institute of Scientific and Technical Information of China (English)
金瑛浩; 孙立镌
2012-01-01
To improve the efficiency of boolean operations in semantic feature modeling system,a semantic representation based method was proposed. It represents feature models with semantic representation, manages feature elements by cellular model,improves detect efficiency of features interaction and builds new the feature entity by splitting inter-sectant cells and semantic faces. This method can not only build the boolean entity rapidly and exactly, but also avoid errors such as holes and losing geometry faces. Experiments on computer show that this new method is more adaptable and practicable.%为了提高语义特征建模系统中布尔操作的运行效率,提出了一种基于语义表示法的布尔操作算法.该算法用语义表示法表示特征模型,用细胞元模型组织和管理特征元素,用语义面替代几何面来提高特征的交互检测效率,通过细胞分裂和语义面分解来生成新实体.该算法不仅可以快速准确地生成布尔实体,还可以避免几何面的丢失及“孔洞”等错误的发生.实验证明,该算法具有广泛的使用前景和实用价值.
Design and simulation of efficient chaos based generators, crypto-systems and hash functions
Noura, Hassan
2012-01-01
In this thesis, we study the problem of chaos based information security and its services namely: the confidentiality, the data integrity and the sourceauthentication. Firstly, the generation of efficient chaotic sequences problem is treated. Thus, we propose three efficient generators, each one including a perturbation technique to overcome the inconveniences of the finite precision. The first generator uses a coupling of non linear Boolean functions. The second generator is based on a flexi...
Optimizing Monotone Functions Can Be Difficult
Doerr, Benjamin; Sudholt, Dirk; Winzen, Carola; Zarges, Christine
2010-01-01
Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant $c$ in the mutation probability $p(n) = c/n$ can make a decisive difference. We show that if $c 33$, we present a strictly monotone function such that the (1+1) evolutionary algorithm with overwhelming probability does not find the optimum within $2^{\\Omega(n)}$ iterations. This is the first time that we observe that a constant factor change of the mutation probability changes the run-time by more than constant factors.
Sizonenko A. B.
2012-01-01
The analysis of information security tools and systems is carried out in this article. This analysis revealed that the functioning of many of them associated with the implementation of intensive logical calculations. Ways of representing Boolean functions are analyzed, the criteria of efficiency and ways to increase productivity tools and security systems are presented
SYNTHESIS METHODS OF ALGEBRAIC NORMAL FORM OF MANY-VALUED LOGIC FUNCTIONS
Directory of Open Access Journals (Sweden)
A. V. Sokolov
2016-03-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.
基于8种常用蕴涵算子上的模糊布尔代数%Fuzzy Boolean Algebras Based on Eight Familiar Kinds of Implication Operator
Institute of Scientific and Technical Information of China (English)
陈华新
2012-01-01
Based on the work of "Fuzzy Boolean Algebras Based on Implication Operator", present work gives eight kinds of equivalent forms of fuzzy Boolean algebras based on familiar eight kinds of implication operator by using inequalities characterizatian method. This paper promotes the results of the corresponding fuzzy algebra, and enriches riches theoretical results of fuzzy algebra.%在文献[1]的基础上,利用不等式的刻画方法,给出8种常用的R-蕴涵算子下的R-模糊布尔代数的8种等价形式,推广了现有相应模糊代数的结果,丰富了模糊代数的理论成果.
Sengupta, Abhronil; Shim, Yong; Roy, Kaushik
2015-01-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,...
Inferring Biologically Relevant Models: Nested Canalyzing Functions
Hinkelmann, Franziska
2010-01-01
Inferring dynamic biochemical networks is one of the main challenges in systems biology. Given experimental data, the objective is to identify the rules of interaction among the different entities of the network. However, the number of possible models fitting the available data is huge and identifying a biologically relevant model is of great interest. Nested canalyzing functions, where variables in a given order dominate the function, have recently been proposed as a framework for modeling gene regulatory networks. Previously we described this class of functions as an algebraic toric variety. In this paper, we present an algorithm that identifies all nested canalyzing models that fit the given data. We demonstrate our methods using a well-known Boolean model of the cell cycle in budding yeast.
基于高效布尔运算的三维矢量缓冲区算法%An algorithm for 3D vector buffer based on efficient Boolean operation
Institute of Scientific and Technical Information of China (English)
卢新明; 王红娟
2012-01-01
An algorithm which is based on the Boolean operation is proposed to generate 3D vector buffer.Firstly,with an intensive study of Boolean operation,the algorithm of Boolean operation is described,the complexity of the algorithm is analyzed,and a new method is introduced to improve the stability of the Boolean operation,which uses the whole topological relationships,uniform logical relationships and uniform operation tolerance to avoid the contradictions of the intersecting calculations.Secondly,the basic spheres,cylinders and stretched solids are generated in accordance with a buffer radius and the topological relationships of points,edges and faces.Finally,a 3D buffer is generated by the Boolean operation of all the basic solids.The results show that the algorithm is feasible and can calculate the 3D vector buffer of the spatial objects effectively.%提出了一种求解三维矢量缓冲区的算法,该算法以布尔运算为基础.算法通过对布尔运算进行深入研究的基础上,描述了布尔运算算法,分析了算法复杂度,提出了一种提高布尔运算稳定性的新方法.该稳定性方法采用了拓扑关系完整性、逻辑判断统一性和运算容差统一性这3个规则来避免运算中出现不一致的情况;根据缓冲区半径及几何元素点、边、面的拓扑关系,把基本几何元素生成基本体：空间点生成球体、空间边生成圆柱体、空间面生成拉伸体;把所有基本体进行布尔运算生成三维缓冲区.结果表明：提出的算法是可行的,能有效的求解空间对象的三维矢量缓冲区.
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.
Representations of highly-varying functions by perceptron networks
Czech Academy of Sciences Publication Activity Database
Kůrková, Věra
North Charleston: CreateSpace Independent Publishing Platform, 2013 - (Vinař, T.; Holeňa, M.; Lexa, M.; Peška, L.; Vojtáš, P.), s. 73-76 ISBN 978-1-4909-5208-6. [ITAT 2013. Conference on Theory and Practice of Information Technologies. Donovaly (SK), 11.09.2013-15.09.2013] R&D Projects: GA ČR GAP202/11/1368 Institutional support: RVO:67985807 Keywords : one-hidden-layer networks * perceptrons * Boolean functions * network complexity Subject RIV: IN - Informatics, Computer Science
The Analysis of Linear Equivalence of Boolean Functions and Its Applications%布尔函数线性等价的分析与应用
Institute of Scientific and Technical Information of China (English)
孟庆树; 张焕国
2004-01-01
对于g(x)=f(xA+b)+l*x+c,给定f(x),g(x),如何求取等价关系A,b,l,c是一个有用的问题.该文利用Walsh谱和自相关函数谱作为工具,给出的算法1可以求取g(x)=f(xA)型的等价关系.针对g(x)=f(xA+b)+l*x+c类型的等价关系,当b已知时,基于Fuller-Millan算法给出的算法2比Fuller-Millan算法至少要快k-1倍,其中k为函数绝对自相关函数谱含有的谱类个数.应用于AES的S -盒的8个布尔函数间等价关系的求取,算法2比Fuller-Millan算法提高速度近20倍.应用于IP (Isomorphism of Polynomials) 问题的分析,指出Patarin所给参数的IP问题是可解的,因此基于IP问题的密码体制是不安全的.
Enumeration and Characterization of Semi-Bent Quadratic Boolean Functions%二次半Bent函数的计数和刻画
Institute of Scientific and Technical Information of China (English)
唐春明; 亓延峰; 徐茂智; 郭宝安
2014-01-01
具有好的性质的布尔函数在密码学和通信中都有重要的应用,例如平衡性,非线性,抗代数攻击等的布尔函数,Bent函数和半Bent函数.这些布尔函数性质基本都是从布尔函数的Walsh变换来描述和定义.Bent函数和半Bent函数的定义可由布尔函数Walsh变换的值所给出,布尔函数的Bent性和半Bent性都有了许多重要的研究成果.然而布尔函数的Bent性和半Bent性的完全刻画和分类是非常困难的工作,许多工作围绕一些特殊形式的布尔函数展开.新的Bent函数和半Bent函数的构造和详细刻画是具有研究意义的.本文研究了一类n=2vpr变元的二次半Bent函数.此类布尔函数的半Bent性可以用函数系数所对应的多项式来刻画.利用自反多项式的性质,结合容斥原理便可以给出满足刻画条件的多项式个数,从而也就给出了与多项式对应的二次半Bent函数的计数.此外进一步考虑此类函数的半Bent性的多项式刻画,使用函数系数ci的一些线性组合性质给出了此类半Bent函数更为简单的刻画.
Minimum Distance Between Bent and Resilient Boolean Functions%Bent 函数和弹性函数的最小距离
Institute of Scientific and Technical Information of China (English)
李超; 屈龙江
2008-01-01
研究了Bent函数和弹性函数的最小距离,给出了求Bent函数和弹性函数的最小距离的一个新算法,得到了Bent函数和弹性函数最小距离新的下限,新的下限在一阶情形优于 S.Maity 等人在2004年给出的结果,同时证实了他们所提出的猜想,并且得到了12元、14元Bent函数和一阶弹性函数的最小距离.
Method of Boolean operation based on 3D grid model%三维网格模型的布尔运算方法
Institute of Scientific and Technical Information of China (English)
陈学工; 杨兰; 黄伟; 季兴
2011-01-01
提出了一种基于三维网格模型的布尔运算方法.首先通过基于方向包围盒(OBB)层次包围盒树的碰撞检测算法,得到实体的相交三角形对;接下来求出两相交三角形之间的交线,建立与三角形的交线拓扑关系;通过分类处理三种交线类型来对相交三角形进行区域划分,得到一系列多边形,并对多边形进行三角剖分形成结果区域;最后根据体的包含关系构建关系邻接表,判断多边形区域的相对于其他实体的内外关系并通过网格模型的拓扑关系,定位表面三角网格区域;同时根据交、并、差等布尔操作,对结果区域进行取舍,得到最终结果.实验结果表明相交部分的岩性与实体的岩性相吻合,验证了该算法的正确性以及可行性.%A kind of Boolean operational method based on a three-dimensional grid model was proposed. Firstly, through collision detection algorithm based on hierarchical bounding box tree of Oriented Bounding Box (ORB), the intersecting triangles could be got. Through the intersection test of the triangles, the intersecting lines could be obtained and the intersecting lines topology relations with the triangles could be established. Secondly, a regional division for the intersecting triangles was made through processing the three types of intersecting lines, so as to get a series of polygons, and carry out Delaunay triangulations for polygon to get the result area. Lastly, relation adjacency list was constructed based on solid containing relations, the polygon's internal relation and external relation with other entities were judged, and the triangles were located according to the mesh model topology relations. Simultaneously, according to such Boolean operations as the intersection, union, and differences, according to the grid model topology relations were judged, the position of the triangles were judged and then the final results could be obtained. Experimental results show that this
Study and Improvement of Apriori Algorithm based on Boolean Matrix%基于布尔矩阵Apriori算法的改进研究
Institute of Scientific and Technical Information of China (English)
汪浩; 吴静
2013-01-01
Based on the research of Apriori algorithm of boolean matrix, an improved PMApriori(Prune Matrix Apriori) algorithm is proposed, and this algorithm could efficiently and speedily find frequent itemsets from the transaction database. For storage and computing characteristics of the matrixes are fully used, only once scanning of the database is required, and it is unnecessary to generate the candidate itemstts, thus the operation efficiency of the algorithm is improved greatly. The uninterrupted trimming and compressing of storage matrixes in the algorithm implementation could save the memory space and the matrix-scanning time. Demonstration and comparison of various algorithms indicate that the proposed algorithm has fairly good time and space characteristics.% 为了高效且快速地从事务数据库中生成频繁项集，在研究基于布尔矩阵 Apriori 算法的基础上，提出一种改进算法 PM Apriori(Prune Matrix Apriori)算法。此算法充分利用矩阵的存储与运算特性，仅扫描数据库一次，不需要生成候选集，有效地提高算法的运算效率，在算法执行过程不断对存储矩阵进行修剪压缩，节省了内存空间和扫描矩阵的时间，并通过算法示例与算法性能对比分析证明所提出的改进算法具有良好的时间特性和空间特性。
Testing Read-Once Functions over Arbitrary Bases
Chistikov, Dmitry V
2012-01-01
A Boolean function is called read-once over a basis B if it can be expressed by a formula over B where no variable appears more than once. A checking test for a read-once function f over B depending essentially on all its variables is a set of input vectors distinguishing f from all other read-once functions of the same variables. We show that all read-once functions f over B have checking tests containing O(n^l) vectors, where n is the number of essential variables of f and l is the largest arity of functions in B. The employed technique involves reconstructing f from its l-variable projections and provides a stronger form of Kuznetsov's classic theorem on read-once representations.
Institute of Scientific and Technical Information of China (English)
陈锦松; 谭宜家
2011-01-01
设n是一个正整数,Gn(r)是B={0,1}上所有n阶r-循环矩阵组成之集,Gn=n-1∪r=0(r).对于半群Gn中任一个固定的r循环矩阵C,在Gn中定义一个新的运算“*”:(V)A,B∈Gn,A* B=ACB.则(Gn,*)构成一个半群,称(Gn,*)为(带有三明治矩阵C的)广义循环布尔矩阵三明治半群,并记为Gn(C).刻画了半群Gn(C)中的完全正则元,并给出了求Gn(C)中所有完全正则元的算法.%Let n be a positive integer,and Cn (r) be the set of all n × n r-circulant matrices over the Boolean algebra B ={0,1},Gn=n-1∪r=0 Cn(r).For any fixed r-circulant matrix C(C≠0) in Gn.Define an operation “ * ” in Gn:A * B=ACB for any A,B in Gn,where ACB is the usual product of Boolean matrices.Then (Gn,* ) is a semigroup.We denote this semigroup by Gn (C) and call it the sandwich semigroup of generalized circulant Boolean matrices with sandwich matrix C.In this paper,the fully regular elements in Gn (C) are characterized.The algorithm to find all the fully regular elements of A in Gn (C) is given.
提高多边形布尔运算健壮性的顶点融合技术%Methods to enhance polygon Boolean operations robustness by merging vertices
Institute of Scientific and Technical Information of China (English)
白萌; 孟新; 李大林
2012-01-01
多边形在计算机中是以浮点数表示其顶点的，但这样的多边形在进行布尔运算时由于浮点数误差的问题会引起算法失效。鉴于此，分析了计算几何领域中影响多边形布尔运算健壮性的因素；制定了提高简单多边形布尔算法健壮性的策略，提出了多边形顶点融合技术来规避浮点数误差而造成的计算错误，确保了算法的收敛性。经程序测试，这些方法不仅增加了算法的健壮性，而且更有效的满足高性能计算的精度要求和性能要求。%Polygon represents its vertices by floating point, but doing the polygon Boolean operations as a result of floating point error will lead to the problem to a floating point error. In view of this, analysis the impact of the polygon Boolean operations robustness factor in the field of computational geometry, develop strategies to enhance the robustness of the polygon Boolean operations, propose polygon vertices merging technology to circumvent the floating-point error caused by calculation errors, to ensure the convergence of the algorithm. Testing the program, these methods not only increase the algorithm robustness, but more effectively meet the precision high-performance computing requirements and performance requirements.
Logical composition of Lyapunov functions
Balestrino, A.; Caiti, A.; Crisostomi, E.
2011-03-01
This article introduces the use of R-functions to compose single Lyapunov functions (LFs) via classic Boolean operators, with the aim to obtain a rich family of non-conventional, generally non-convex functions. The main benefit of the proposed composition is the nice geometric interpretation, since it corresponds to intersection and union operations in the phase space region. The composition of LFs is parameterised through a variable γ and classic compositions of LFs through min and max operations are recovered as a special case for a particular value of γ. The proposed logical composition is applied to region of asymptotic stability (RAS) estimation problems, where the union of several LFs corresponds to the union of the RAS estimates obtained from the separate use of each LF. Likewise, the intersection of several LFs defined on independent subsets of the state space variables provides a single LF for the overall dynamical system. Sufficient conditions for the composition function to be an LF are provided and results are described through several examples of classic nonlinear dynamical systems.
A New Algorithm of Polygons' Boolean Operations Using Interior Angle%一种利用图形内角的多边形布尔运算新算法
Institute of Scientific and Technical Information of China (English)
朱二喜; 何援军
2011-01-01
现有的平面多边形布尔运算在一般情况下可以快速地获得正确结果,但如遇到奇异情况,则会产生错误.因此,采用图形内角概念分析奇异情况,并在原有交点遍历算法框架基础上给出一种全局化的奇异处理算法.与其他的多边形布尔运算算法相比,该算法对奇异的分析更为简洁有效,且具有高效性和鲁棒性.%The current algorithms of the polygons' boolean operations can give correct results rapidly enough in general cases. But there are errors when it comes to queer conditions.This paper proposes a method to analyze queer conditions using concept of graphic interior angle,and gives a new overall algorithm of queer's treatment on the basis of the original intersection-traversal algorithms' framework. Compared with other algorithms of polygons'boolean operations, the algorithm in this paper is more simple and effective for analysis of queer conditions.
Extensional Uniformity for Boolean Circuits
McKenzie, Pierre; Vollmer, Heribert
2008-01-01
Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be able to exhibit the circuits in the circuit family defining C. We say that (C,L) has the "Uniformity Duality Property" if the extensionally uniform class C \\cap L can be captured intensionally by means of adding so-called "L-numerical predicates" to the first-order descriptive complexity apparatus describing the connection language of the circuit family defining C. This paper exhibits positive instances and negative instances of the Uniformity Duality Property.
Basti, Gianfranco; Castiglione, Patrizia; Casolino, Marco; Perrone, Antonio L.; Picozza, Piergiorgio
1993-08-01
Usually, to discriminate among particle tracks in high energy physics a set of discriminating parameters is used. To cope with the different particle behaviors these parameters are connected by the human observer with boolean operators. We tested successfully an automatic method for particle recognition using a stochastic method to pre-process the input to a back propagation algorithm. The test was made using raw experimental data of electrons and negative pions taken at CERN laboratories (Geneva). From the theoretical standpoint, the stochastic pre-processing of a back propagation algorithm can be interpreted as finding the optimal fuzzy membership function notwithstanding high fluctuating (noisy) input data.
Two-terminal Distributed Source Coding with Alternating Messages for Function Computation
Ma, Nan
2008-01-01
A two-terminal interactive distributed source coding problem with alternating messages is studied. The focus is on function computation at both locations with a probability which tends to one as the blocklength tends to infinity. A single-letter characterization of the rate region is provided. It is observed that interaction is useless (in terms of the minimum sum-rate) if the goal is pure source reproduction at one or both locations but the gains can be arbitrarily large for (general) function computation. For doubly symmetric binary sources and any Boolean function, interaction is useless with even infinite messages, when computation is desired at only one location, but is useful, when desired at both locations. For independent Bernoulli sources and the Boolean AND function computation at both locations, an interesting achievable infinite-message sum-rate is derived. This sum-rate is expressed, in analytic closed-form, in terms of a two-dimensional definite integral with an infinitesimal rate for each messa...
Institute of Scientific and Technical Information of China (English)
王红娟; 张杏莉; 卢新明
2011-01-01
提出一种稳定快速的三维复杂地质体的布尔运算算法.该算法不需要跟踪交线,利用带拓扑信息的交边对实体区域进行分类,避免面在体内的判断,提高运算速度.算法在进行布尔运算前解决了数值计算误差引起的相关分类间的冲突,保证运算的稳定性.将该方法应用于蓝光矿山数字化平台系统,实践结果证明其适合数据分散、数据密集及带孔洞的实体,特别是大规模、奇异的三维复杂地质体.%A fast and stable algorithm of Boolean operation of complex geological body is proposed. The algorithm does not require tracking intersecting lines, uses the intersecting edges with the topology information to classify the regions of bodies, avoids the judgment of the triangles inside the bodies, and improves the speed of operation. At the same time, before Boolean operations the algorithm resolves the conflict caused by the numerical calculation errors between the relevant categories, and ensures the stability of operation. This method is applied to LionKingSoft digital mining platforms system and the bodies of data-dispersive, data-intensive and with holes, especially the massive, exotic three-dimensional complex geological bodies.
A Fast Attack Algorithm on the MD5 Hash Function
Institute of Scientific and Technical Information of China (English)
WANG Zhang-yi; ZHANG Huan-guo; QIN Zhong-ping; MENG Qing-shu
2006-01-01
The sufficient conditions for keeping desired differential path of MD5 was discussed. By analyzing the expanding of subtraction difference, differential characters of Boolean functions, and the differential characters of shift rotation, the sufficient conditions for keeping desired differential path could be obtained. From the differential characters of shift rotation, the lacked sufficient conditions were found. Then an algorithm that reduces the number of trials for finding collisions were presented. By restricting search space, search operation can be reduced tc 234 for the first block and 230 for the second block. The whole attack on the MD5 can be accomplished within 2C hours using a PC with 1.6 G CPU.
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.
Institute of Scientific and Technical Information of China (English)
曾萍萍; 杨凌; 张烨; 吴建华
2013-01-01
A pixel contractible secret sharing scheme (2n,2n)based on Boolean operation and Arnold trons-form is proposed to decrease the burdens of participants.This scheme divides an image into 2n pieces (shares)in such a way that each piece has the size of 1/2n of the original image and only all shares are a-vailable can we restore the original image without any quality loss.Comparative study shows the effective-ness and performance of the proposed algorithm.%为了减小参与者的负担，本文基于布尔运算提出了一种像素缩小的（2 n，2 n）秘密共享方案，该方案通过 Ar-nold变换和加密算法将一幅图像共享成2n幅大小为原图像1/2n的分存图像，只有所有分存图像共同存在时才能够无质量损失地恢复出原图像信息。对比研究表明了该方案的有效性和优点。
Network Reliability Algorithm Based on Pathset Matrix and Boolean Operation%基于路集矩阵与布尔运算的网络可靠度算法
Institute of Scientific and Technical Information of China (English)
高会生; 展敬宇; 王博颖; 李潇睿
2012-01-01
This paper analyzes the network reliability algorithm based on pathset matrix, and there exists a serious combination explosion problem in this algorithm. Aiming at this problem, it proposes a network reliability algorithm based on pathset matrix and boolean operation. The concept of bit vector is introduced. In addition, the pre-process of special pathsets and count of all-one bit vectors are also implied. Experimental results show that it not only increases the memory utilization, reduce the redundancy but also relieve the combination explosion problem in some degree.%分析基于路集矩阵与布尔运算的网络可靠度算法,指出其存在组合爆炸问题.为此,提出一种改进算法,引入位矢量以减少内存需求,对特殊路集进行预处理并统计全1位矢量.实验结果表明,改进算法可提高内存利用率、减少冗余运算,能在一定程度上缓解组合爆炸问题.
A Family of Generalized Bent Functions%一类广义Bent函数的构造
Institute of Scientific and Technical Information of China (English)
陈新姣; 张焕国
2012-01-01
作为非线性度达到最优的布尔函数——Bent函数可应用于差集、组合论、序列设计密码学等诸多领域.Kumar等人从码分多址技术（CDMA）中相关性最优的序列设计角度将Bent函数的概念推广到奇特征有限域,提出了广义Bent函数.本文基于循环矩阵秩的计算,研究了基于二次型构造的p-元函数是广义Bent函数的充分必要条件,并给出了一类新的广义Bent函数.%Bent functions, a class of Boolean functions with the maximal possible nonlinearity, have applications in the fields of different sets, combinatorial theory, sequence design and cryptography. Motivated by the design of optimally correlated sequences used in code division multiple access (CDMA) communication system,Kumar et al. Generalized the notion of Boolean bent functions to the case of functions over an arbitrary finite field in 1985. The present pa- per firstly studied the ranks of circulant matrices over finite field with odd characteristic, based on which we gave a sufficient and necessary condition for bentness of a class of p-ary functions derived from quadratic forms, among which some new p-ary Bent functions were generated.
Roetteler, Martin
2009-01-01
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular exponentiation function. In a generalization of this idea, quantum Fourier sampling can be used to discover hidden subgroup structures of some functions much more efficiently than it is possible classically. Another problem for which the Fourier transform has been recruited successfully on a quantum computer is the hidden shift problem. Quantum algorithms for hidden shift problems usually have a slightly different flavor from hidden subgroup algorithms, as they use the Fourier transform to perform a correlation with a given reference function, instead of sampling from the Fourier spectrum directly. In this paper we show that hidden shifts can be extracted efficiently from Boolean functions that are quadratic forms. We also show how to identify an unknown quadratic form on n va...
Directory of Open Access Journals (Sweden)
Shefali Mamataj
2016-07-01
Full Text Available In today‟s world everyday a new technology which is faster, smaller and more complex than its predecessor is being developed. Reversible computation is a research area characterized by having only computational models that is both forward and backward deterministic. Reversible Logic is gaining significant consideration as the potential logic design style for implementation in modern nanotechnology and quantum computing with minimal impact on physical entropy. It has become very popular over the last few years since reversible logic circuits dramatically reduce energy loss. It consumes less power by recovering bit loss from its unique input-output mapping. This paper represents the implementation of conventional Boolean functions for basic digital gate by using COG reversible gate. This paper also represents a multi logic function generator circuit for generating multiple logical function simultaneously using COG gates. And also represents a controlled multi logic function generator circuit for generating any specified output in a controlled way.
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.
Pseudo Boolean Programming for Partially Ordered Genomes
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.
Image filtering with Boolean and statistical operators
Wells, R. D.
1983-12-01
Edge extraction is an image processing technique for defining the edge information in an image. This effort researches different edging processes as applied to preprocessing for two pattern recognition processes. The first one is a cross-correlation method to find a target given that the target has a known size, orientation, and aspect. Correlation is performed in the spatial frequency domain with two-dimensional fast Fourier transforms of the searched edge image and a hand drawn edge template to correct for translation only. The second pattern recognition process researched also uses edging as one step of a purely spatial domain algorithm. The approach locates targets in infrared images that can be described as hot clusters. A cluster recognition algorithm by Hamadani is implemented and altered for testing of local thresholding and thresholding rules. The algorithm is shown to be effective on real infrared images.
Probabilistic frames for non-Boolean phenomena.
Narens, Louis
2016-01-13
Classical probability theory, as axiomatized in 1933 by Andrey Kolmogorov, has provided a useful and almost universally accepted theory for describing and quantifying uncertainty in scientific applications outside quantum mechanics. Recently, cognitive psychologists and mathematical economists have provided examples where classical probability theory appears inadequate but the probability theory underlying quantum mechanics appears effective. Formally, quantum probability theory is a generalization of classical probability. This article explores relationships between generalized probability theories, in particular quantum-like probability theories and those that do not have full complementation operators (e.g. event spaces based on intuitionistic logic), and discusses how these generalizations bear on important issues in the foundations of probability and the development of non-classical probability theories for the behavioural sciences. PMID:26621992
Fast Vertical Mining Using Boolean Algebra
Hosny M. Ibrahim; Marghny, M. H.; Noha M. A. Abdelaziz
2015-01-01
The vertical association rules mining algorithm is an efficient mining method, which makes use of support sets of frequent itemsets to calculate the support of candidate itemsets. It overcomes the disadvantage of scanning database many times like Apriori algorithm. In vertical mining, frequent itemsets can be represented as a set of bit vectors in memory, which enables for fast computation. The sizes of bit vectors for itemsets are the main space expense of the algorithm that restricts its ex...
Similarity Measures for Boolean Search Request Formulations.
Radecki, Tadeusz
1982-01-01
Proposes a means for determining the similarity between search request formulations in online information retrieval systems, and discusses the use of similarity measures for clustering search formulations and document files in such systems. Experimental results using the proposed methods are presented in three tables. A reference list is provided.…
Theory and calculus of cubical complexes
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.
Sun, Ying
2011-01-01
This article proposes an informative exploratory tool, the functional boxplot, for visualizing functional data, as well as its generalization, the enhanced functional boxplot. Based on the center outward ordering induced by band depth for functional data, the descriptive statistics of a functional boxplot are: the envelope of the 50% central region, the median curve, and the maximum non-outlying envelope. In addition, outliers can be detected in a functional boxplot by the 1.5 times the 50% central region empirical rule, analogous to the rule for classical boxplots. The construction of a functional boxplot is illustrated on a series of sea surface temperatures related to the El Niño phenomenon and its outlier detection performance is explored by simulations. As applications, the functional boxplot and enhanced functional boxplot are demonstrated on children growth data and spatio-temporal U.S. precipitation data for nine climatic regions, respectively. This article has supplementary material online. © 2011 American Statistical Association.
Directory of Open Access Journals (Sweden)
Sivakumar.R
2015-04-01
Full Text Available Introduction: The knowledge on effect of location of infarct and volume of infarct on motor and functional outcomes is ambiguous due to variations in methodology and outcome measures used. This narrative review is aimed to summaries the studies on infarct location and volume related to motor and functional outcome, for a better understanding of the conclusions and limitation of the studies. Methodology: Literature search was done with key words of location of infarcts, size of infarct, motor recovery and functional recovery with Boolean term AND. Studies using outcome measures of multiple domain was not considered for inclusion. Results: 13 studies were identified in an extensive search without a time limit. Studies were categorized under location and volume with motor and functional recovery as variables. Majority of studies were done in isolation to any two variables, location outnumbered volume. The relationship with location and motor outcome was inconclusive, though two studies concluded that cortical infarcts had better scores than sub cortical. Volume was moderately associated with motor and functional recovery. Majority of the studies concluded a relationship between location and functional outcome, however the results are variable. Conclusion: Only few studies have analyzed the impact of infarct in different location and results were inconclusive. Outcome measures were summative in nature, not reflecting recovery in upper and lower extremities in isolation. The amount of recovery is analysed with initial deficits. We suggest more studies are required in this area to provide clarity.
DEFF Research Database (Denmark)
Campi, Stefano; Gardner, Richard; Gronchi, Paolo;
2012-01-01
Variants of the brightness function of a convex body K in n-dimensional Euclidean are investigated. The Lambertian lightness function L(K; v , w ) gives the total reflected light resulting from illumination by a light source at infinity in the direction w that is visible when looking in the...... direction v . The partial brightness function R( K ; v , w ) gives the area of the projection orthogonal to v of the portion of the surface of K that is both illuminated by a light source from the direction w and visible when looking in the direction v . A class of functions called lightness functions is...... lightness functions....
DEFF Research Database (Denmark)
Della Pia, Eduardo Antonio; Hansen, Randi Westh; Zoonens, Manuela; Martinez, Karen L.
Amphipols are amphipathic polymers that stabilize membrane proteins isolated from their native membrane. They have been functionalized with various chemical groups in the past years for protein labeling and protein immobilization. This large toolbox of functionalized amphipols combined with their...... surfaces for various applications in synthetic biology. This review summarizes the properties of functionalized amphipols suitable for synthetic biology approaches....
Institute of Scientific and Technical Information of China (English)
赵亚群; 李世取
2001-01-01
Bent functions,a special class of Boolean functions,are of greatuse in the fields of cryptography and communication due to their nonlinear and stable properties.But their number is rare and they are neither balanced and nor correlation-immune.Partially Bent functions containing Bent functions are a larger class of Boolean functions presented by Claud Carlet to remedy the defects of Bent functions.Now concepts of Bent and partially Bent functions have been extended onto Ring znm(m is a positive integer) called generalized Bent and generalized partially Bent functions on znm.In this paper, the relation between generalized partially Bent and generalized Bent functions on znp(p is prime)is studied according to the Chrestenson cyclic spectral characteristic of generalized partially Bent functions on znp. The function and the spectral relation formulas between them are presented%Bent函数是一类特殊的布尔函数，因其非线性性和稳定性在密码学和通信等领域有很重要的应用.但它们数量少、不平衡且无相关免疫性.为了弥补Bent函数的不足，ClaudCarlet提出了部分Bent函数的概念，部分Bent函数是包含Bent函数的更大的函数类.后来，人们又将这两种函数概念先后都拓广到了环znm(m为正整数)上，分别被称为znm上的广义Bent函数和广义部分Bent函数.本文利用znp(p为素数)上广义部分Bent函数的Chrestenson循环谱特征讨论了znp上的广义部分Bent函数和广义Bent函数之间的关系，给出了这两种函数之间的函数关系式和谱值关系式.
Markushevich, A I
2014-01-01
Entire Functions focuses on complex numbers and the algebraic operations on them and the basic principles of mathematical analysis.The book first elaborates on the concept of an entire function, including the natural generalization of the concept of a polynomial and power series. The text then takes a look at the maximum absolute value and the order of an entire function, as well as calculations for the coefficients of power series representing a given function, use of integrals, and complex numbers. The publication elaborates on the zeros of an entire function and the fundamen
Kantorovich, L V
1982-01-01
Functional Analysis examines trends in functional analysis as a mathematical discipline and the ever-increasing role played by its techniques in applications. The theory of topological vector spaces is emphasized, along with the applications of functional analysis to applied analysis. Some topics of functional analysis connected with applications to mathematical economics and control theory are also discussed. Comprised of 18 chapters, this book begins with an introduction to the elements of the theory of topological spaces, the theory of metric spaces, and the theory of abstract measure space
Czech Academy of Sciences Publication Activity Database
Millová, Katarína
London: Palgrave Macmillan, 2015, s. 60-80. ISBN 978-1-137-43995-6 R&D Projects: GA ČR GAP407/10/2410 Institutional support: RVO:68081740 Keywords : social dimension of successful development * structure of social functioning * resources of social functioning Subject RIV: AN - Psychology
International Nuclear Information System (INIS)
It is a compilation of chapters written by active researchers and offer information and critical insights about semiconducting materials and devices, dielectric and ferroelectric materials, magnetic materials, composites and other functional materials. In the book, the functional materials are discussed from the mixed valences and stoichiometry points of view, to understand the structural evolution and transformation of different material systems - in particular, the role played by crystal structures in property control of functional materials using advanced characterization techniques. The book examines the properties, soft-chemistry preparations, electronic structures and crystal structures of transition and rare earth metals and their oxides. The book presents a strong argument that functional materials system is the future direction of the multidisciplinary research involving physics, chemistry, materials science and electrical engineering, with emphasis on device applications. Papers relevant to INIS are indexed separately
Czech Academy of Sciences Publication Activity Database
Bustince, H.; Fernández, J.; Mesiar, Radko; Montero, J.; Orduna, R.
2010-01-01
Roč. 72, 3-4 (2010), s. 1488-1499. ISSN 0362-546X R&D Projects: GA ČR GA402/08/0618 Institutional research plan: CEZ:AV0Z10750506 Keywords : t-norm * Migrative property * Homogeneity property * Overlap function Subject RIV: BA - General Mathematics Impact factor: 1.279, year: 2010 http://library.utia.cas.cz/separaty/2009/E/mesiar-overlap functions.pdf
Hahn, M
1996-01-01
Based on empirical evidence from a free word order language (German) we propose a fundamental revision of the principles guiding the ordering of discourse entities in the forward-looking centers within the centering model. We claim that grammatical role criteria should be replaced by indicators of the functional information structure of the utterances, i.e., the distinction between context-bound and unbound discourse elements. This claim is backed up by an empirical evaluation of functional centering.
Research on Molding Bionic Artificial Bone Scaffold Based on Shape Function%基于形函数的人工骨支架仿生建模技术研究
Institute of Scientific and Technical Information of China (English)
杨立军; 齐艳梅; 王丽丽
2013-01-01
人工骨支架在骨仿生研究中起重要作用,它不仅能代替缺损骨支撑人体,而且能够引导组织再生、增殖和功能发挥.以有限元形函数映射理论与布尔运算为基础,利用UG二次开发工具UG/Open GRIP,提出了一种仿形精度较高,通用性较强的支架建模方法:首先利用映射法将骨实体模型进行六面体网格划分,然后通过每个六面体的八个节点把规则的单元微结构负型映射得到相应的子单元负型,每个完整的子单元负型进行布尔并运算得到微孔结构负型,即内部微结构模型,最后通过骨实体外形与微结构负型进行布尔差运算获得仿形支架.以人体承力骨为研究对象,研究表明:通过有限元单元的剖分和约束方法,能高效随机地获得更自然的支架模型.%The artificial bone scaffold plays an important part in bionic artificial bone, and it not only provides support for human body, but also guides the regeneration and proliferation of tissues and displays the function. Based on the mapping theory and Boolean operation, a modeling method was put forward with higher profiling accuracy and stronger versatility through the secondary development tools of UG/Open GRIP: firstly, based on the mapping method, the solid model was meshed with the hexahedral mesh; secondly. On the basis of the acquired information of nodes, the unit microstructure was mapped into the irregular and negative microstructure, and then the internal microstructure model was established based on the boolean operation union; at last the scaffold model was gained through boolean subtraction of the internal microstructure model and the solid model. This thesis regards load bearing bone of human body as an object, and the results show that a more natural scaffold model can be achieved efficiently and randomly by using the method.
Nambudiripad, K B M
2014-01-01
After presenting the theory in engineers' language without the unfriendly abstraction of pure mathematics, several illustrative examples are discussed in great detail to see how the various functions of the Bessel family enter into the solution of technically important problems. Axisymmetric vibrations of a circular membrane, oscillations of a uniform chain, heat transfer in circular fins, buckling of columns of varying cross-section, vibrations of a circular plate and current density in a conductor of circular cross-section are considered. The problems are formulated purely from physical considerations (using, for example, Newton's law of motion, Fourier's law of heat conduction electromagnetic field equations, etc.) Infinite series expansions, recurrence relations, manipulation of expressions involving Bessel functions, orthogonality and expansion in Fourier-Bessel series are also covered in some detail. Some important topics such as asymptotic expansions, generating function and Sturm-Lioville theory are r...
Conference on Commutative rings, integer-valued polynomials and polynomial functions
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...
Institute of Scientific and Technical Information of China (English)
K.H.DTZ
2007-01-01
1 Results The lecture will address aspects of functional organometallics related to the development of novel organometallic materials.In chromium complexes of fused arenes-regio-and diastereoselectively accessible by chromium-templated benzannulation of arylcarbenes by alkynes[1]-a haptotropic migration of the chromium fragment along the π-face of fused arenes is controlled by both thermodynamics and the substitution pattern of the arene and the metal coligand sphere,and can be applied towards an organo...
Brun, Rita; Kuo, Braden
2010-05-01
Dyspepsia is a common term used for a heterogeneous group of abdominal symptoms. Functional dyspepsia (FD) is the focus of this review. The 2006 Rome III criteria defined FD and its subgroups, postprandial distress syndrome (PDS) and epigastric pain syndrome (EPS). FD is a very common condition with a high prevalence throughout the world, adversely affecting the quality of life of patients. The pathophysiology of FD has been under investigation during the past two decades. Multiple mechanisms such as abnormal gastric emptying, visceral hypersensitivity, impaired gastric accommodation, and central nervous system factors are likely involved. Several tests are available for the assessment of various physiologic functions possibly involved in the pathogenesis of FD, and some of these could be used in clinical practice, helping to understand the abnormalities underlining patients' complaints. Currently, the possibilities of pharmacological therapy for FD are still limited, however, experience of using prokinetics, tricyclic antidepressants, selective serotonin-reuptake inhibitors (SSRIs), proton-pump inhibitors (PPIs), and several alternative techniques has been accumulated. The different combinations of alterations in physiologic gastrointestinal and central nervous system functions result in the very heterogeneous nature of FD so combined approaches to these patients could be beneficial in challenging cases. PMID:21180597
三类Semi-Bent函数的构造%Constructions of Three Classes of Semi-Bent Functions
Institute of Scientific and Technical Information of China (English)
何业锋; 马文平
2011-01-01
Semi-bent函数是一种具有高非线性度的布尔函数,它们在密码和通信领域中都有重要的应用价值.本文构造了三类由迹函数表示的semi-bent函数.证明了当限制某些参数的取值范围时,这些新构造函数的semi-bent性与Kloosterman和密切相关.并且证明了每一类新构造的含有n个变元的semi-bent函数,都存在一个semi-bent函数的子类,它们的代数次数是n/2.利用Kloosterman和的零点,也给出了小域上semi-bent函数的例子.%Semi-bent functions are a kind of Boolean functions with high nonlinearity. They have important applications in cryptography and communications. This paper gives three classes of semi-bent functions represented by trace. It is shown that the semi-bentness of the new functions is closely related to Kloosterman sums when the values of some parameters are restricted. It is also proved there exists a subclass of semi-bent functions with degree n/2 in each class of the new semi-bent functions on n variables.Several examples of the semi-bent functions in a small field are given by using the zeros of some Kloosterman sums.
Institute of Scientific and Technical Information of China (English)
2005-01-01
2005200 The effect of body position changes on lung function, lung CT imaging and pathology in an oleic acid induced acute lung injury model. JI Xin-ping (戢新平), et al. Dept Emergency, 1st Affili Hosp, China Med Univ, Shenyang 110001. Chin J Tuberc Respir Dis, 2005;28(1) :33-36. Objective: To study the effect of body position changes on lung mechanics, oxygenation, CT images and pathology in an oleic acid-induced acute lung injury (ALl) model. Methods: The study groups con-
Is functional behavioral assessment functional?
2006-01-01
Abstract Traditional methods of discipline, like punishment, suspension, and expulsion have in the past seemed beneficial, on a short-term basis, against problem behavior in schools. Four schools in Norway have recently implemented Functional Behavior Assessment (FBA) as part of a pilot project, to test the School-Wide Positive Behavioral Support (SW-PBS). A completed FBA procedure reveals the setting events, the antecedents and the consequences around the problem behavior, which provides ...
International Nuclear Information System (INIS)
The term lung function is often restricted to the assessment of volume time curves measured at the mouth. Spirometry includes the assessment of lung volumes which can be mobilised with the corresponding flow-volume curves. In addition, lung volumes that can not be mobilised, such as the residual volume, or only partially as FRC and TLC can be measured by body plethysmography combined with the determination of the airway resistance. Body plethysmography allows the correct positioning of forced breathing manoeuvres on the volume-axis, e.g. before and after pharmacotherapy. Adding the CO single breath transfer factor (TLCO), which includes the measurement of the ventilated lung volume using He, enables a clear diagnosis of different obstructive, restrictive or mixed ventilatory defects with and without trapped air. Tests of reversibility and provocation, as well as the assessment of inspiratory mouth pressures (PImax, P0.1) help to classify the underlying disorder and to clarify treatment strategies. For further information and to complete the diagnostic of disturbances of the ventilation, diffusion and/or perfusion (capillar-)arterial bloodgases at rest and under physical strain sometimes amended by ergospirometry are recommended. Ideally, lung function measurements are amended by radiological and nuclear medicine techniques. (orig.)
Asadchy, V S; Vehmas, J; Tretyakov, S A
2014-01-01
Conventional mirrors obey Snell's reflection law: a plane wave is reflected as a plane wave, at the same angle. To engineer spatial distributions of fields reflected from a mirror, one can either shape the reflector (for example, creating a parabolic reflector) or position some phase-correcting elements on top of a mirror surface (for example, designing a reflectarray antenna). Here we show, both theoretically and experimentally, that full-power reflection with general control over reflected wave phase is possible with a single-layer array of deeply sub-wavelength inclusions. These proposed artificial surfaces, metamirrors, provide various functions of shaped or nonuniform reflectors without utilizing any mirror. This can be achieved only if the forward and backward scattering of the inclusions in the array can be engineered independently, and we prove that it is possible using electrically and magnetically polarizable inclusions. The proposed sub-wavelength inclusions possess desired reflecting properties at...
Energy Technology Data Exchange (ETDEWEB)
Lee, S. R.; Park, S. K.; Kim, J. J. [Hanyang University College of Medicine, Seoul (Korea, Republic of); Jeon, H. J.; Jeon, H. S.; Kim, D. Y. [Gang Nam Hospital, Seoul (Korea, Republic of)
1984-09-15
Morphologic changes of spinal canal and dural sac during spinal movement (flexion-extension) were analysed and reported with the base of cross sectional anatomy, as early as 1942. After that, this movement was emphasized and used in myelography in many countries under the name of functional myelography, for accurate diagnosis of spinal stenosis as herniated disc, but nor used commonly in Korea. Authors analysed functional myelographic findings of 78 cases, 37 of normal and 41 of surgically confirmed herniated disc, to intend to confirm the necessity of spinal movement during myelography. The results were as follows; 1. In normal group, anterior border of dural sac is stright with flexion, but indented in extension at the level of intervertebral space and this indentation is less prominent at L5-S1. 2. In normal group with extension, posterior indentation of dural sac is more prominent at the level of intervertebral space than body, A-P diameter of dural sac is narrowed all the level of intervertebral space except L5-S1,and dural sac moved anteriorly (near to the posterior portion of spinal body or intervertebral space) at the level L5-S1 and all spinal body. 3. In disc patient, anterior indentation of dural sac is persist in both views (flexion and extension) and much more exaggerated with extension, but less prominent at L5-S1. 4. In herniated disc patient with extension, anterior movement of anterior dural border at the level of L5-S1 is much decreased than normal.
A Class of Hyper-Bent Functions Characterized by Kloosterman Sums%利用Kloosterman和刻画一类超Bent函数
Institute of Scientific and Technical Information of China (English)
唐春明; 亓延峰; 徐茂智
2015-01-01
Hyper-Bent functions as a subclass of Bent functions can be applied to coding theory , communication and cryptography .This paper considers a class of Boolean functions with Dillon exponents , characterizes these functions with exponential sums , and presents the link of hyper-Bentness of these hyper-Bent functions with Kloosterman sums and cubic sums .For some special cases , we present the concrete characterization of these hyper-Bent functions with special values of Kloosterman sums and cubic sums , and give some concrete examples of hyper-Bent functions .From our method , many hyper-Bent functions can be given.That enriches the theory of hyper-Bent functions.%超Bent函数是一类具有特殊性质的Bent函数，在编码、通信和密码学中都有着重要的应用。该文研究一类Dillon型布尔函数，使用指数和给出了此类函数的超Bent性刻画，并建立此类函数的超Bent性与Kloosterman和，三次和之间的联系。在一些特殊情形下，具体考虑此类函数的超Bent性的刻画，使用Kloosterman和以及三次和的一些特殊值来刻画这些函数的超Bent性，并给出了一些具体超Bent函数的例子，方便地给出许多超Bent函数，从而丰富和发展了超Bent函数理论。
Ishak, Nor Azizah; Zahari, Zarina; Justine, Maria
2016-01-01
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. PMID:27293970
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.
Ishak, Nor Azizah; Zahari, Zarina; Justine, Maria
2016-01-01
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. PMID:27293970
Satisfying assignments of Random Boolean CSP: Clusters and Overlaps
Istrate, Gabriel
2007-01-01
The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random $k$-SAT, nonrigorous methods from Statistical Physics support the validity of the ``one step replica symmetry breaking'' approach. Some of these predictions were rigorously confirmed in \\cite{cond-mat/0504070/prl} \\cite{cond-mat/0506053}. There it is proved that the overlap distribution of random $k$-SAT, $k\\geq 9$, has discontinuous support. Furthermore, Achliop...
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...... reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We...... fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and...
Dichotomy on intervals of strong partial Boolean clones
Schölzel, Karsten
2014-01-01
The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\\mathbf{2} := \\{0,1\\}$, the set $\\mathcal{I}(C)$ of all partial clones on $\\mathbf{2}$ whose total component is $C$, is either finite or of continuum cardinality. In this paper we show that the dichotomy holds, even if only strong partial clones are considered, i.e., partial clones which are closed under taking subfunctions: For every total clone $C$ on $\\mathbf{2}$, the set $\\mathcal{I}_{\\m...
A Boolean Analysis Predicting Industry Change: Innovation, Imitation & Business Models
Hvass, Kristian Anders
2008-01-01
The deregulated scheduled passenger airline industry is in a constant state of motion as managers continually adapt their business models to meet the challenging market environment. Such adaptation has led to a variety of airlines populating the industry; from the birth of low-cost carriers to the transformation of state-owned behemoths to lean and successful carriers. These dynamics challenge airline managers to continuously acclimate their business models and to understand industry evolu...
A Reformulation of Matrix Graph Grammars with Boolean Complexes
Pérez Velasco, Pedro Pablo; Lara, Juan De
2009-01-01
Prior publication in the Electronic Journal of Combinatorics. Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGG) as a purely algebraic approach for the study of graph dynamics, based on the representation of simple graphs by means of their adjacency matrices. The observation that, in addition to positive inf...
Fiber Selection from Diffusion Tensor Data based on Boolean Operators
Merhof, Dorit; Greiner, Günther; Buchfelder, Michael; Nimsky, Christopher
2010-01-01
Diffusion tensor imaging (DTI) allows investigating white matter structures in vivo which is of particular interest for neurosurgery. A promising approach for the reconstruction of neural pathways are streamline techniques, which are commonly referred to as fiber tracking. However, the resulting visualization of fibers within the whole brain may be complex and difficult to interpret. For this reason, a novel strategy for selecting specific tract systems based on user-defined regions of intere...
Recognition vs Reverse Engineering in Boolean Concepts Learning
Shafat, Gabriel; Levin, Ilya
2012-01-01
This paper deals with two types of logical problems--recognition problems and reverse engineering problems, and with the interrelations between these types of problems. The recognition problems are modeled in the form of a visual representation of various objects in a common pattern, with a composition of represented objects in the pattern.…
Pueblo: A Modern Pseudo-Boolean SAT Solver
Sheini, Hossein M.; Sakallah, Karem A.
2005-01-01
This paper introduces a new SAT solver that integrates logic-based reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an efficient PB literal watching strategy and several PB learning methods that take advantage of the pruning power of PB constraints while minimizing their overhead.
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.234, year: 2014
Boolean methods in operations research and related areas
Crama, Yves
2011-01-01
These are the slides of the "IFORS Distinguished Lecture" that I delivered at the INFORMS Annual meeting in November 2011. The title of the lecture is the title of a monograph co-authored by Peter L. Hammer and Sergiu Rudeanu, which appeared in 1968. Their pioneering work has stimulated a large amount of research and has been very frequently cited. Over the last year, the late Peter Hammer and myself have published two distant follow-ups to ...
Dynamical modeling of the cholesterol regulatory pathway with Boolean networks
Corcos Laurent; Kervizic Gwenael
2008-01-01
Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivo...
Agents in the shadow (cooperative games with non-cooperating players)
Waldhauser, Tamás; Couceiro, Miguel; Marichal, Jean-Luc
2011-01-01
The aim of this talk is to report on recent investigations about lattice derivatives of Boolean and pseudo-Boolean functions and their interpretations in game theory. The partial lattice derivatives of a (pseudo-) Boolean function are analogues of the classical partial derivatives, with the difference operation replaced by the minimum or the maximum operation. We focus on commutation properties of these lattice differential operators and relate them to local monotonicity properties. The least...
Form and Function: The Impact of Query Term and Operator Usage on Web Search Results.
Lucas, Wendy; Topi, Heikki
2002-01-01
Describes a study of college students that investigated Web-based search engine queries and compared relevancy ratings with expert-formulated queries. Considers the number of subject terms used and the use of Boolean operators and discuses the need for designing search engine interfaces that provide greater support in term selection and operator…
Research of Logic Function Synthesis Algorithm Based on Threshold Logic%基于阈值逻辑的逻辑函数综合算法研究
Institute of Scientific and Technical Information of China (English)
韦一; 沈继忠
2011-01-01
阈值逻辑门由于具有强大的逻辑功能且独自构成完备集而备受关注.为了设计以阈值逻辑门为单元结构的电路,该文首先分析了谱技术与阈值函数的关系,并通过零次、一次谱系数计算阈值函数的权值和阈值.对于非阈值函数,该文提出了新的逻辑函数综合算法,可以将任意非阈值函数转化为几个阈值函数和的形式.因此,使用一个或多个阈值逻辑门组成的网络可以实现任意布尔逻辑函数.该算法为共振隧穿二极管的电路设计提供一种新方法.%Threshold Logic Gate (TLG) is receiving much attention because of its logic versatility and functionally complete. For the circuit design based on TLG, a method is described to determine whether a function is threshold or not with the spectral technology. The weights and threshold can be calculated by spectral coefficients. As for non-threshold function, a novel logic synthesis algorithm is proposed, which can transform non-threshold function to the sum of some threshold functions. Furthermore, any Boolean logic function can be realized by a collection of TLG using the method in this paper. Proposed algorithm provides a method for circuit design of resonant tunneling diode.
LaChapelle, J.
2013-01-01
Functional integrals are defined in terms of locally compact topological groups and their associated Banach-valued Haar integrals. This approach generalizes the functional integral scheme of Cartier and DeWitt-Morette. The definition allows a construction of functional Mellin transforms. In turn, the functional Mellin transforms can be used to define functional traces, logarithms, and determinants. The associated functional integrals are useful tools for probing function spaces in general and...
Functional inequalities for modified Bessel functions
Baricz, Árpád; Vuorinen, Matti
2010-01-01
In this paper our aim is to show some mean value inequalities for the modified Bessel functions of the first and second kinds. Our proofs are based on some bounds for the logarithmic derivatives of these functions, which are in fact equivalent to the corresponding Tur\\'an type inequalities for these functions. As an application of the results concerning the modified Bessel function of the second kind we prove that the cumulative distribution function of the gamma-gamma distribution is log-concave. At the end of this paper several open problems are posed, which may be of interest for further research.
Kargın, Levent; Kurt, Veli
2015-01-01
In this study, obtaining the matrix analog of the Euler's reflection formula for the classical gamma function we expand the domain of the gamma matrix function and give a infinite product expansion of sinπxP. Furthermore we define Riemann zeta matrix function and evaluate some other matrix integrals. We prove a functional equation for Riemann zeta matrix function.
International Nuclear Information System (INIS)
This invention relates to the investigation of body function, especially small bowel function but also liver function, using bile acids and bile salts or their metabolic precursors labelled with radio isotopes and selenium or tellurium. (author)
Noncommutative Bessel symmetric functions
Novelli, Jean-Christophe; Thibon, Jean-Yves
2006-01-01
The consideration of tensor products of 0-Hecke algebra modules leads to natural analogs of the Bessel J-functions in the algebra of noncommutative symmetric functions. This provides a simple explanation of various combinatorial properties of Bessel functions.
Gersten, A.
1999-01-01
By applying projection operators to state vectors of coordinates we obtain subspaces in which these states are no longer normalized according to Dirac's delta function but normalized according to what we call "incomplete delta functions". We show that this class of functions satisfy identities similar to those satisfied by the Dirac delta function. The incomplete delta functions may be employed advantageously in projected subspaces and in the link between functions defined on the whole space ...
Functional Forms and Educational Production Functions
Montmarquette, C.; Mahseredjian, S.
1985-01-01
Different Functional Forms Are Proposed and Applied in the Context of Educational Production Functions. Three Different Specifications - the Linerar, Logit and Inverse Power Transformation (Ipt) - Are Used to Explain First Grade Students' Results to a Mathematics Achievement Test. with Ipt Identified As the Best Functional Form to Explain the Data, the Assumption of Differential Impact of Explanatory Variables on Achievement Following the Status of the Student As a Low Or High Achiever Is Ret...
Functional microorganisms for functional food quality.
Gobbetti, M; Cagno, R Di; De Angelis, M
2010-09-01
Functional microorganisms and health benefits represent a binomial with great potential for fermented functional foods. The health benefits of fermented functional foods are expressed either directly through the interactions of ingested live microorganisms with the host (probiotic effect) or indirectly as the result of the ingestion of microbial metabolites synthesized during fermentation (biogenic effect). Since the importance of high viability for probiotic effect, two major options are currently pursued for improving it--to enhance bacterial stress response and to use alternative products for incorporating probiotics (e.g., ice cream, cheeses, cereals, fruit juices, vegetables, and soy beans). Further, it seems that quorum sensing signal molecules released by probiotics may interact with human epithelial cells from intestine thus modulating several physiological functions. Under optimal processing conditions, functional microorganisms contribute to food functionality through their enzyme portfolio and the release of metabolites. Overproduction of free amino acids and vitamins are two classical examples. Besides, bioactive compounds (e.g., peptides, γ-amino butyric acid, and conjugated linoleic acid) may be released during food processing above the physiological threshold and they may exert various in vivo health benefits. Functional microorganisms are even more used in novel strategies for decreasing phenomenon of food intolerance (e.g., gluten intolerance) and allergy. By a critical approach, this review will aim at showing the potential of functional microorganisms for the quality of functional foods. PMID:20830633
Rough function model and rough membership function
Institute of Scientific and Technical Information of China (English)
Wang Yun; Guan Yanyong; Huang Zhiqin
2008-01-01
Two pairs of approximation operators, which are the scale lower and upper approximations as well as the real line lower and upper approximations, are defined. Their properties and antithesis characteristics are analyzed. The rough function model is generalized based on rough set theory, and the scheme of rough function theory is made more distinct and complete. Therefore, the transformation of the real function analysis from real line to scale is achieved. A series of basic concepts in rough function model including rough numbers, rough intervals, and rough membership functions are defined in the new scheme of the rough function model. Operating properties of rough intervals similar to rough sets are obtained. The relationship of rough inclusion and rough equality of rough intervals is defined by two kinds of tools, known as the lower (upper) approximation operator in real numbers domain and rough membership functions. Their relative properties are analyzed and proved strictly, which provides necessary theoretical foundation and technical support for the further discussion of properties and practical application of the rough function model.
Entire functions sharing one small function
Institute of Scientific and Technical Information of China (English)
LI Yun-tong; CAO Yao
2007-01-01
The uniqueness problem of entire functions sharing one small function was studied. By Picard's Theorem, we proved that for two transcendental entire functions f (z) and g(z), a positive integer n≥9, and a(z) (not identically eaqual to zero) being a common small function related to f (z) and g(z), if f n(z)(f(z)-1)f'(z) and gn(z)(g'z)-1)g'(z) share a(z) CM, where CM is counting multiplicity, then g(z)≡f (z). This is an extended version of Fang and Hong's theorem [ Fang ML, Hong W, A unicity theorem for entire functions concerning differential polynomials, Journal of Indian Pure Applied Mathematics, 2001, 32 (9): 1343-1348].
On $ \\delta $-perfect functions
C. K. Basu
2004-01-01
$ \\delta $-continuous [6] and $ \\delta $-perfect [5] functions are both introduced by T.~Noiri in the similar fashion as continuous and perfect functions. The purpose of the present paper is to investigate several properties of $ \\delta$-perfect functions and also to determine some topological properties which are preserved by $ \\delta$-continuous $ \\delta$-perfect functions.
Relations between Lipschitz functions and convex functions
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
[1]Zajicek, J., On the differentation of convex functions in finite and infinite dimensional spaces, Czech J. Math.,1979, 29: 340-348.[2]Hu, T. C., Klee, V. L., Larman, D. G., Optimization of globally convex functions, SIAM J. Control Optim., 1989,27: 1026-1047.[3]Cepedello Boiso, M., Approximation of Lipschitz functions by △-convex functions in Banach spaces, Israel J.Math., 1998, 106: 269-284.[4]Asplund, E., Frechet differentiability of convex functions, Acta Math., 1968, 121: 31-47.[5]Johnson, J. A., Lipschitz spaces, Pacific J. Math, 1974, 51: 177-186.[6]Stromberg, T., The operation of infimal convolution, Dissert. Math., (Rozprawy Mat.), 1996, 325: 58.[7]Kadison, R. V., Ringrose, J. R., Fundamentals of the theory of operator algebras, volume Ⅰ: Elementary Theory,Graduate Studies in Math., vol. 15, Amer. Math. Soc., 1997.[8]Phelps, R. R., Convex functions,monotone operators and differentiability, Lect. Notes in Math., vol. 1364,Springer-Verlag, 1977.[9]Lindenstrauss, J., On operators which attain their norm, Israel J. Math., 1963, 1: 139-148.[10]Press, D., Gateaux differentiable functions are somewhere Frechet differentiable, Rend. Circ. Mat. Palermo,1984, 33: 122-133.[11]Press, D., Differentiability of Lipschitz functions on Banach spaces, J. Funct. Anal., 1990, 91:312-345.[12]Lindenstrauss, J., Press, D., On Frechet differentiability of Lipschitz maps between Banach spaces, Annals of Math., 2003, 157: 257-288.[13]Press, D., Gateaux differentiable Lipschitz functions need not be Frechet differentiable on a residual set, Supplemento Rend. Circ. Mat. Palermo, Serie Ⅱ, 1982, 2: 217-222.
Generalised Elliptic Functions
England, Matthew
2011-01-01
We consider multiply periodic functions, sometimes called Abelian functions, defined with respect to the period matrices associated with classes of algebraic curves. We realise them as generalisations of the Weierstras P-function using two different approaches. These functions arise naturally as solutions to some of the important equations of mathematical physics and their differential equations, addition formulae, and applications have all been recent topics of study. The first approach discussed sees the functions defined as logarithmic derivatives of the sigma-function, a modified Riemann theta-function. We can make use of known properties of the sigma function to derive power series expansions and in turn the properties mentioned above. This approach has been extended to a wide range of non hyperelliptic and higher genus curves and an overview of recent results is given. The second approach defines the functions algebraically, after first modifying the curve into its equivariant form. This approach allows...
Filter function synthesis by Gegenbauer generating function
Directory of Open Access Journals (Sweden)
Pavlović Vlastimir D.
2006-01-01
Full Text Available Low-pass all-pole transfer functions with non-monotonic amplitude characteristic in the pass-band and at least (n -1 flatness conditions for ω = 0 are considered in this paper. A new class of filters in explicit form with one free parameter is obtained by applying generating functions of Gegenbauer polynomials. This class of filters has good selectivity and good shape of amplitude characteristics in the pass-band. The amplitude characteristics of these transfer functions have gain in the upper part of pass-band with respect to the gain for ω = 0. This way we have greater margin of attenuation in the upper part of the pass-band. This means a greater tolerance of elements or for elements with given tolerances, greater ambient temperature changes. The appropriate choice of the free parameter enables us to generate filter functions obtained with Chebyshev polynomials of the first and second kind and Legendre polynomials.
Meromorphic functions sharing four small functions
International Nuclear Information System (INIS)
It is well known that if two nonconstant meromorphic functions f and g on the complex plane C have the same inverse images counted with multiplicities for four distinct values, then g is a special type of f. In this paper, we will show that the above result remains valid if f and g share four distinct small functions counted with multiplicities truncated by 2. This is the best truncation level. (author)
DEFF Research Database (Denmark)
Raket, Lars Lau
We propose a direction it the field of statistics which we will call functional object analysis. This subfields considers the analysis of functional objects defined on continuous domains. In this setting we will focus on model-based statistics, with a particularly emphasis on mixed......-effect formulations, where the observed functional signal is assumed to consist of both fixed and random functional effects. This thesis takes the initial steps toward the development of likelihood-based methodology for functional objects. We first consider analysis of functional data defined on high...
DEFF Research Database (Denmark)
Thomsen, Søren Steffen
2009-01-01
functions have received a huge amount of attention due to new attacks on widely used hash functions. This PhD thesis, having the title "Cryptographic Hash Functions", contains both a general description of cryptographic hash functions, including their applications and expected properties as well as some...... well-known designs, and also some design and cryptanalysis in which the author took part. The latter includes a construction method for hash functions and four designs, of which one was submitted to the SHA-3 hash function competition, initiated by the U.S. standardisation body NIST. It also includes...
Confinement from Correlation Functions
Fister, Leonard
2013-01-01
We compute the Polyakov loop potential in Yang--Mills theory from the fully dressed primitively divergent correlation functions only. This is done in a variety of functional approaches ranging from functional renormalisation group equations over Dyson--Schwinger equations to two-particle irreducible functionals. We present a confinement criterion that links the infrared behaviour of propagators and vertices to the Polyakov loop expectation value. The present work extends the works of [1-3] to general functional methods and sharpens the confinement criterion presented there. The computations are based on the thermal correlation functions in the Landau gauge calculated in [4-6].
Sun, Ying
2012-08-03
This article proposes functional median polish, an extension of univariate median polish, for one-way and two-way functional analysis of variance (ANOVA). The functional median polish estimates the functional grand effect and functional main factor effects based on functional medians in an additive functional ANOVA model assuming no interaction among factors. A functional rank test is used to assess whether the functional main factor effects are significant. The robustness of the functional median polish is demonstrated by comparing its performance with the traditional functional ANOVA fitted by means under different outlier models in simulation studies. The functional median polish is illustrated on various applications in climate science, including one-way and two-way ANOVA when functional data are either curves or images. Specifically, Canadian temperature data, U. S. precipitation observations and outputs of global and regional climate models are considered, which can facilitate the research on the close link between local climate and the occurrence or severity of some diseases and other threats to human health. © 2012 International Biometric Society.
Functionalized diamond nanoparticles
Beaujuge, Pierre M.
2014-10-21
A diamond nanoparticle can be functionalized with a substituted dienophile under ambient conditions, and in the absence of catalysts or additional reagents. The functionalization is thought to proceed through an addition reaction.
Lott, Steven
2015-01-01
This book is for developers who want to use Python to write programs that lean heavily on functional programming design patterns. You should be comfortable with Python programming, but no knowledge of functional programming paradigms is needed.
Extraocular muscle function testing
Extraocular muscle function testing examines the function of the eye muscles. A health care provider observes the movement of ... evaluate weakness or other problem in the extraocular muscles. These problems may result in double vision or ...
Babusci, D.; Dattoli, G.; Germano, B.; Martinelli, M. R.; Ricci, P. E.
2011-01-01
We use the operator method to evaluate a class of integrals involving Bessel or Bessel-type functions. The technique we propose is based on the formal reduction of these family of functions to Gaussians.
Dependence for functional data
Valencia García, Dalia Jazmín
2014-01-01
Measuring dependence is a basic question when dealing with functional observations. It is of great interest to know the effect that one or more functional variables can have on other ones, and even predict values of one variable from another. Although, in the functional context, this theory has not been as extensively studied,some techniques to measure dependence in functional data have already been implemented, providing a single value which represents the degree of relation between the sets...
Parton Fragmentation Functions
Metz, Andreas
2016-01-01
The field of fragmentation functions of light quarks and gluons is reviewed. In addition to integrated fragmentation functions, attention is paid to the dependence of fragmentation functions on transverse momenta and on polarization degrees of freedom. Higher-twist and di-hadron fragmentation functions are considered as well. Moreover, the review covers both theoretical and experimental developments in single-inclusive hadron production in electron-positron annihilation, deep-inelastic lepton-nucleon scattering, and proton-proton collisions.
Chemical functionalization of graphene
Boukhvalov, D. W.; Katsnelson, M I
2008-01-01
Experimental and theoretical results on chemical functionalization of graphene are reviewed. Using hydrogenated graphene as a model system, general principles of the chemical functionalization are formulated and discussed. It is shown that, as a rule, 100% coverage of graphene by complex functional groups (in contrast with hydrogen and fluorine) is unreachable. A possible destruction of graphene nanoribbons by fluorine is considered. The functionalization of infinite graphene and graphene nan...
Pseudolinear functions and optimization
Mishra, Shashi Kant
2015-01-01
Pseudolinear Functions and Optimization is the first book to focus exclusively on pseudolinear functions, a class of generalized convex functions. It discusses the properties, characterizations, and applications of pseudolinear functions in nonlinear optimization problems.The book describes the characterizations of solution sets of various optimization problems. It examines multiobjective pseudolinear, multiobjective fractional pseudolinear, static minmax pseudolinear, and static minmax fractional pseudolinear optimization problems and their results. The authors extend these results to locally
Phylogenetic molecular function annotation
Barbara E Engelhardt; Jordan, Michael I.; Repo, Susanna T; Brenner, Steven E
2009-01-01
It is now easier to discover thousands of protein sequences in a new microbial genome than it is to biochemically characterize the specific activity of a single protein of unknown function. The molecular functions of protein sequences have typically been predicted using homology-based computational methods, which rely on the principle that homologous proteins share a similar function. However, some protein families include groups of proteins with different molecular functions. A phylogenetic ...
Graphomania: learning function plots
Leskovšek, Gregor
2013-01-01
In the first part of our thesis Graphomania: learning function plots (hereinafter Graphomania) we present profesional applications of our current problem space and a drawing graphs of functions, manipulation of the current features: zoom in, zoom out, translate = pan add vertical poles and horizontal and oblique asymptotes in the following programs: (1) Draw Function Graphs (rechneronline.de/function-graphs/), (2) Derive (mathematical assistant for your PC, version 6.10), (3) GeoGebra 4.2 (ge...
Directory of Open Access Journals (Sweden)
Mohsen Razzaghi
2000-01-01
Full Text Available A direct method for finding the solution of variational problems using a hybrid function is discussed. The hybrid functions which consist of block-pulse functions plus Chebyshev polynomials are introduced. An operational matrix of integration and the integration of the cross product of two hybrid function vectors are presented and are utilized to reduce a variational problem to the solution of an algebraic equation. Illustrative examples are included to demonstrate the validity and applicability of the technique.
DEFF Research Database (Denmark)
Rosenstand, Claus Andreas Foss; Laursen, Per Kyed
2013-01-01
How does one manage functional power relations between leading functions in vision driven digital media creation, and this from idea to master during the creation cycle? Functional power is informal, and it is understood as roles, e.g. project manager, that provide opportunities to contribute to...... method is collaborative practice studies including action research and practice studies; combined with solid industrial experience....