Random networks of Boolean cellular automata
International Nuclear Information System (INIS)
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
What is Cortinarius cylindripes Kauffman?
Bendiksen, Egil; Bendiksen, Katriina; Brandrud, Tor Erik
1992-01-01
Type studies have shown that Cortinarius cylindripes Kauffman should be reduced to a synonym of C. collinitus (Sow.: Fr.) S.F. Gray. Contradictions between the protologue of C. cylindripes and the type material are discussed. For C. cylindripes a new lectotype is indicated.
Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Completely Described Undirected Graph Structure
Directory of Open Access Journals (Sweden)
G. S. Ivanova
2016-01-01
Full Text Available The objects of research are undirected graphs. The paper considers a problem of their isomorphism. A literature analysis of its solution, has shown that there is no way to define a complete graph invariant in the form of unique structural characteristics of each its vertex, which has a computational complexity of definition better than О (n 4 .The work objective is to provide the characteristics of the graph structure, which could be used to solve the problem of their isomorphism for a time better than О (n 4 . As such characteristics, the paper proposes to use the set of codes of tree roots of all the shortest - in terms of the number of edges - paths from each vertex to the others, uniquely defining the structure of each tree. It proves the theorem that it is possible to reduce the problem of isomorphism of the undirected graphs to the isomorphism problem of their splitting into the trees of all the shortest - in terms of the number of edges - paths of each vertex to the others. An algorithm to construct the shortest paths from each vertex to all others and to compute codes of their vertices has been developed. As the latter, are used Aho-codes, which find application in recognising the isomorphism of trees. The computational complexity to obtain structural characteristics of vertices has been estimated to be about О (n 3 .The pilot studies involved the full-scale experiment using the developed complex programmes to generate raw data, i.e. analytic representation of the graph with the number of vertices equal to 1200, and a programme to provide codes of the tree roots. To have an estimate of - "the worst" in terms of time - complexity of expansion algorithm of graphs into trees of the shortest paths and define the codes of their roots has been an experimentally studied how the number of tree vertices depends on the graph density. For the worst case was obtained a dependence of the number of tree vertices on the number of graph vertices
Colored Kauffman homology and super-A-polynomials
International Nuclear Information System (INIS)
Nawata, Satoshi; Ramadevi, P.; Zodinmawia
2014-01-01
We study the structural properties of colored Kauffman homologies of knots. Quadruple-gradings play an essential role in revealing the differential structure of colored Kauffman homology. Using the differential structure, the Kauffman homologies carrying the symmetric tensor products of the vector representation for the trefoil and the figure-eight are determined. In addition, making use of relations from representation theory, we also obtain the HOMFLY homologies colored by rectangular Young tableaux with two rows for these knots. Furthermore, the notion of super-A-polynomials is extended in order to encompass two-parameter deformations of PSL(2,ℂ) character varieties
Ewing Marion Kauffman School Evaluation Impact Report Year 4. Final Report
Johnson, Matthew; Demers, Alicia; Johnson, Cleo Jacobs; Gentile, Claudia
2016-01-01
As part of its ongoing efforts to raise the academic achievement of children from low-income families in Kansas City, Missouri, the Ewing Marion Kauffman Foundation founded the Ewing Marion Kauffman School in fall 2011. The Kauffman School's mission is "to prepare students to excel academically, graduate from college, and apply their unique…
Mapping knowledge to boolean dynamic systems in Bateson's epistemology.
Malloy, Thomas E; Jensen, Gary C; Song, Timothy
2005-01-01
Gregory Bateson (1972, 1979) established an epistemology that integrates mind and nature as a necessary unity, a unity in which learning and evolution share fundamental principles and in which criteria for mental process are explicitly specified. E42 is a suite of freely available Java applets that constitute an online research lab for creating and interacting with simulations of the Boolean systems developed by Kauffman (1993) in his study of evolution where he proposed that self-organization and natural selection are co-principles "weaving the tapestry of life." This paper maps Boolean systems, developed in the study of evolution, onto Bateson's epistemology in general and onto his criteria of mental process in particular.
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.
Free Boolean Topological Groups
Directory of Open Access Journals (Sweden)
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
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
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.
Properties of Boolean orthoposets
Tkadlec, Josef
1993-10-01
A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.
Algebraic partial Boolean algebras
Smith, D
2003-01-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial...
Algebraic partial Boolean algebras
Smith, Derek
2003-04-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space Script H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A5 sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E8.
Algebraic partial Boolean algebras
Energy Technology Data Exchange (ETDEWEB)
Smith, Derek [Math Department, Lafayette College, Easton, PA 18042 (United States)
2003-04-04
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A{sub 5} sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E{sub 8}.
A Note on the PageRank of Undirected Graphs
Grolmusz, Vince
2012-01-01
The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely noted that the PageRank for undirected graphs are proportional to the degrees of the vertices of the graph. We prove that statement for a particular personalization vector in the definition of the PageRank, and we also show that in gene...
Amplification on Undirected Population Structures: Comets Beat Stars.
Pavlogiannis, Andreas; Tkadlec, Josef; Chatterjee, Krishnendu; Nowak, Martin A
2017-03-06
The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.
Detecting Statistically Significant Communities of Triangle Motifs in Undirected Networks
2016-04-26
extend the work of Perry et al. [6] by developing a statistical framework that supports the detection of triangle motif- based clusters in complex...priori, the need for triangle motif- based clustering. 2. Developed an algorithm for clustering undirected networks, where the triangle con guration was...13 5 Application to Real Networks 18 5.1 2012 FBS Football Schedule Network
Approximate Reasoning with Fuzzy Booleans
van den Broek, P.M.; Noppen, J.A.R.
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
Geometric Operators on Boolean Functions
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
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...
On the Existence of t-Identifying Codes in Undirected De Bruijn Networks
2015-08-04
UNDIRECTED DE BRUIJN NETWORKS 5a. CONTRACT NUMBER NA 5b. GRANT NUMBER NA 5c. PROGRAM ELEMENT NUMBER 62788F 6. AUTHOR(S) Victoria Horan 5d. PROJECT...remaining cases remain open. Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is n. 15. SUBJECT TERMS...Additionally, we show that the eccentricity of the undirected non-binary de Bruijn graph is n. 1 Introduction and Background Let x ∈ V (G), and
Development of Boolean calculus and its application
Tapia, M. A.
1979-01-01
Formal procedures for synthesis of asynchronous sequential system using commercially available edge-sensitive flip-flops are developed. Boolean differential is defined. The exact number of compatible integrals of a Boolean differential were calculated.
Boolean-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
Modular Decomposition of Boolean Functions
J.C. Bioch (Cor)
2002-01-01
textabstractModular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we give a uni_ed treatment of modular
Bounds for percolation thresholds on directed and undirected graphs
Hamilton, Kathleen; Pryadko, Leonid
2015-03-01
Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.
Boolean gates on actin filaments
Energy Technology Data Exchange (ETDEWEB)
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Reliable dynamics in Boolean and continuous networks
International Nuclear Information System (INIS)
Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P
2012-01-01
We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)
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.
Testing Properties of Boolean Functions
2012-01-01
The JUNTATEST algorithm is based on two simple but powerful ideas. The first idea, initially presented by Fischer et al. [52], is that there is a very...Computer and System Sciences, 61(3):428 – 456, 2000. 12 [75] Subhash Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symposium on...Sharpness of KKL on Schreier graphs, 2009. Manuscript. 6.4 [84] Michal Parnas, Dana Ron, and Alex Samorodnitsky. Testing basic boolean formu- lae . SIAM J
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
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.
Boolean Dependence Logic and Partially-Ordered Connectives
Ebbing, Johannes; Hella, Lauri; Lohmann, Peter; Virtema, Jonni
2014-01-01
We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\\alpha), where \\alpha is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of Boolean dependence logic to dependence logic and first-order logic enriched by partially-ordered connec...
DEFF Research Database (Denmark)
Brodal, G.S.; Fagerberg, Rolf; Meyer, U.
2004-01-01
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights. Our results removes the performance gap between the currently best cache-aware algorithms for these problems...
Directory of Open Access Journals (Sweden)
Augustine Yao Dzathor
2013-08-01
Full Text Available Scant literature exists on impact of organizational demographics on nascent venture performance. Business demographics were looked at through the lenses of organizational traits, resource-based view and population ecology theories. The combined as well as the individual longitudinal impact of five business demographics (nature of product, primary location of business, number of active owner-operators, business legal status and technological orientation on nascent venture performance was examined. 754 out of the 863 businesses that survived cleaning of the first four years of the Kauffman Firm Survey (KFS dataset were retained in the analysis sample to maintain the original sample stratification of the data set. Results of multiple regression revealed that business demographics globally had significant effect on nascent venture performance in year-2 and year-4 of first four years of existence of the cohort of businesses studied. Three of the individual business demographics indicators, namely: nature of product, business legal status and technological orientation also had significant but inconsistent effects on nascent venture performance across the four years under study. The study threw light on the longitudinal effects of business demographics on nascent venture performance and drew attention to the fact that business demographics can theoretically be envisioned through the lenses of trait theory, resource based view and population ecology theory.
Thakar, Juilee; Albert, Réka
The following sections are included: * Introduction * Boolean Network Concepts and History * Extensions of the Classical Boolean Framework * Boolean Inference Methods and Examples in Biology * Dynamic Boolean Models: Examples in Plant Biology, Developmental Biology and Immunology * Conclusions * References
Undirected learning styles and academic risk: Analysis of the impact of stress, strain and coping.
Kimatian, Stephen; Lloyd, Sara; Berger, Jeffrey; Steiner, Lorraine; McKay, Robert; Schwengal, Deborah
2017-01-01
Learning style inventories used in conjunction with a measure of academic achievement consistently show an association of meaning directed learning patterns with academic success, but have failed to show a clear association of undirected learning styles with academic failure. Using survey methods with anesthesia residents, this study questioned whether additional assessment of factors related to stress, strain, and coping help to better define the association between undirected learning styles and academic risk. Pearson chi squared tests. 296 subjects were enrolled from eight institutions with 142 (48%) completing the study. American Board of Anesthesiologists In Training Examinations (ITE) percentiles (ITE%) were used as a measure of academic achievement. The Vermunt Inventory of Learning Styles (ILS) was used to identify four learning patterns and 20 strategies, and the Osipow Stress Inventory-Revised (OSI-R) was used as a measure of six scales of occupational stress, four of personal strain, and four coping resources. Two learning patterns had significant relationship with ITE scores. As seen in previous studies, Meaning Directed Learning was beneficial for academic achievement while Undirected Learning was the least beneficial. Higher scores on Meaning Directed Learning correlated positively with higher ITE scores while higher Undirected and lower Meaning Directed patterns related negatively to ITE%. OSI-R measures of stress, strain and coping indicated that residents with Undirected learning patterns had higher scores on three scales related to stress, and 4 related to strain, while displaying lower scores on two scales related to coping. Residents with higher Meaning Directed patterns scored lower on two scales of stress and two scales of strain, with higher scores on two scales for coping resources. Low Meaning Directed and high Undirected learning patterns correlated with lower ITE percentiles, higher scores for stress and strain, and lower coping resources
Forced synchronization of autonomous dynamical Boolean networks
International Nuclear Information System (INIS)
Rivera-Durón, R. R.; Campos-Cantón, E.; Campos-Cantón, I.; Gauthier, Daniel J.
2015-01-01
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics
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.
A New Calculation for Boolean Derivative Using Cheng Product
Directory of Open Access Journals (Sweden)
Hao Chen
2012-01-01
Full Text Available The matrix expression and relationships among several definitions of Boolean derivatives are given by using the Cheng product. We introduce several definitions of Boolean derivatives. By using the Cheng product, the matrix expressions of Boolean derivative are given, respectively. Furthermore, the relationships among different definitions are presented. The logical calculation is converted into matrix product. This helps to extend the application of Boolean derivative. At last, an example is given to illustrate the main results.
The Permeability of Boolean Sets of Cylinders
Directory of Open Access Journals (Sweden)
Willot F.
2016-07-01
Full Text Available Numerical and analytical results on the permeability of Boolean models of randomly-oriented cylinders with circular cross-section are reported. The present work investigates cylinders of prolate (highly-elongated and oblate (nearly flat types. The fluid flows either inside or outside of the cylinders. The Stokes flow is solved using full-fields Fourier-based computations on 3D binarized microstructures. The permeability is given for varying volume fractions of pores. A new upper-bound is derived for the permeability of the Boolean model of oblate cylinders. The behavior of the permeability in the dilute limit is discussed.
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
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
Ewing Marion Kauffman Foundation, Kansas City, MO.
The Ewing Marion Kauffman Foundation began surveying Kansas City area teens during the 1984-85 school year. The Kauffman Teen Survey now addresses two sets of issues for teens. Teen Health Behaviors, addressed in this report, have been a focus of the survey since its inception. The report focuses on teen use of alcohol, tobacco, and other drugs in…
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...
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Quotients of Boolean algebras and regular subalgebras
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Pazák, Tomáš
2010-01-01
Roč. 49, č. 3 (2010), s. 329-342 ISSN 1432-0665 R&D Projects: GA AV ČR IAA100190509; GA MŠk MEB060909 Institutional research plan: CEZ:AV0Z10190503; CEZ:AV0Z10750506 Keywords : Boolean algebra * sequential topology * ZFC extension * ideal Subject RIV: BA - General Mathematics Impact factor: 0.414, year: 2010 http://link.springer.com/article/10.1007%2Fs00153-010-0174-y
Optimal stabilization of Boolean networks through collective influence
Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming
2018-03-01
Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.
Boolean Differentiation Equations Applicable in Reconfigurable Computational Medium
Directory of Open Access Journals (Sweden)
Shidlovskiy Stanislav
2016-01-01
Full Text Available High performance computing environment synthesis with parallel architecture reconstructing throughout the process itself is described. Synthesized computational medium involving Boolean differential equation calculations so as to function in real-time image processing. Automaton imaging was illustrated involving the rearrangement of every processing medium element to calculate the partial differentials of n-th order in respect to Boolean function variables. The method of obtaining setting codes for each element was also described. An example in calculating 2nd -order Boolean derivative to two differentials in respect to Boolean functions, depending on three arguments within the reconstructible computational medium of 8×8 processing elements was given.
The Number of Monotone and Self-Dual Boolean Functions
Directory of Open Access Journals (Sweden)
Haviarova L.
2014-12-01
Full Text Available In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Weimer-Jehle, Wolfgang
2008-06-01
Cross-impact analysis is the name for a familiar method for multidisciplinary systems analysis in social sciences and management sciences, especially in technology foresight, technology assessment and scenario planning. A recently proposed form of cross-impact analysis, CIB, may be of interest for physicists, sociophysicists and complex network researchers because the CIB concept reveals considerable relations to some concepts of these research fields. This article describes the basics of CIB analysis framework, its applications in the social sciences, and its relations to the equilibrium points of pair interaction systems, random graphs, and generalized Kauffman nets. Therefore CIB can be seen as a merger of concepts originating in utterly different scientific fields. This may prove to be fruitful for both sides: For sociophysicists as an example of the application of complex network concepts in the social sciences and for cross-impact practitioners as a source of theoretical insights in the background of their tool.
Large Sets in Boolean and Non-Boolean Groups and Topology
Directory of Open Access Journals (Sweden)
Ol’ga V. Sipacheva
2017-10-01
Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.
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...... relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Finer distinctions about the computational relationships among natural problems can be made than in previous formulations and some negative results are proved....
The Boolean algebra and central Galois algebras
Directory of Open Access Journals (Sweden)
George Szeto
2001-01-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
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
DEFF Research Database (Denmark)
Tegos, Stergios; Demetriadis, Stavros N.; Papadopoulos, Pantelis M.
2016-01-01
Conversational agents that draw on the framework of academically productive talk (APT) have been lately shown to be effective in helping learners sustain productive forms of peer dialogue in diverse learning settings. Yet, literature suggests that more research is required on how learners respond...... instead of the dyad (D treatment). The results suggest that although both agent intervention methods can improve students’ learning outcomes and dyad in-task performance, the directed one is more effective than the undirected one in enhancing individual domain knowledge acquisition and explicit reasoning....... Furthermore, findings show that the positive effect of the agent on dyad performance is mediated by the frequency of students’ contributions displaying explicit reasoning, while most students perceive agent involvement favorably....
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Directory of Open Access Journals (Sweden)
Stefania Casagrande
2016-10-01
Full Text Available Song is a sexually selected trait that is thought to be an honest signal of the health condition of an individual in many bird species. For species that breed opportunistically, the quantity of food may be a determinant of singing activity. However, it is not yet known whether the quality of food plays an important role in this respect. The aim of the present study was to experimentally investigate the role of two calorie-free nutrients (lutein and cholesterol in determining the expression of a sexually selected behavior (song rate and other behaviors (locomotor activity, self-maintenance activity, eating and resting in male zebra finches (Taeniopygia guttata. We predicted that males supplemented with lutein and cholesterol would sing at higher rates than controls because both lutein and cholesterol have important health-related physiological functions in birds and birdsong mirrors individual condition. To control for testosterone secretion that may upregulate birdsong, birds were exposed to a decreasing photoperiod. Our results showed that control males down-regulated testosterone in response to a decreasing photoperiod, while birds treated with lutein or cholesterol maintained a constant singing activity. Both lutein- and cholesterol-supplemented groups sang more than control groups by the end of the experiment, indicating that the quality of food can affect undirected song irrespective of circulating testosterone concentrations. None of the other measured behaviors were affected by the treatment, suggesting that, when individuals have full availability of food, sexually selected song traits are more sensitive to the effect of food quality than other behavioral traits. Overall the results support our prediction that undirected song produced by male zebra finches signals access to high-quality food.
An adaptable Boolean net trainable to control a computing robot
International Nuclear Information System (INIS)
Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.
1999-01-01
We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits
Boolean orthoposets and two-valued states on them
Tkadlec, Josef
1992-06-01
A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Intervention in Context-Sensitive Probabilistic Boolean Networks Revisited
Directory of Open Access Journals (Sweden)
Faryabi Babak
2009-01-01
Full Text Available An approximate representation for the state space of a context-sensitive probabilistic Boolean network has previously been proposed and utilized to devise therapeutic intervention strategies. Whereas the full state of a context-sensitive probabilistic Boolean network is specified by an ordered pair composed of a network context and a gene-activity profile, this approximate representation collapses the state space onto the gene-activity profiles alone. This reduction yields an approximate transition probability matrix, absent of context, for the Markov chain associated with the context-sensitive probabilistic Boolean network. As with many approximation methods, a price must be paid for using a reduced model representation, namely, some loss of optimality relative to using the full state space. This paper examines the effects on intervention performance caused by the reduction with respect to various values of the model parameters. This task is performed using a new derivation for the transition probability matrix of the context-sensitive probabilistic Boolean network. This expression of transition probability distributions is in concert with the original definition of context-sensitive probabilistic Boolean network. The performance of optimal and approximate therapeutic strategies is compared for both synthetic networks and a real case study. It is observed that the approximate representation describes the dynamics of the context-sensitive probabilistic Boolean network through the instantaneously random probabilistic Boolean network with similar parameters.
Boolean networks with robust and reliable trajectories
International Nuclear Information System (INIS)
Schmal, Christoph; Peixoto, Tiago P; Drossel, Barbara
2010-01-01
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.
The Boolean algebra of Galois algebras
Directory of Open Access Journals (Sweden)
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
Theory reduction and non-Boolean theories.
Primas, H
1977-07-19
It is suggested that biological theories should be embedded into the family of non-Boolean theories based on an orthomodular propositional calculus. The structure of universal theories that include quantal phenomena is investigated and it is shown that their subtheories form a directed set which cannot be totally orders. A precise definition of theory reduction is given; it turns out that hierarchically different descriptive levels are not related by a homomorphic map. A subtheory that is reducible to a more general theory can be associated with the emergence of novel concepts and is in general subject to a wider empirical clissification scheme than the reducing theory. The implications of these results for reductionism, holism, emergence, and their conceptual unification are discussed.
Multipath Detection Using Boolean Satisfiability Techniques
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
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.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...
A full bayesian approach for boolean genetic network inference.
Directory of Open Access Journals (Sweden)
Shengtong Han
Full Text Available Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.
Attractor Transformation by Impulsive Control in Boolean Control Network
Directory of Open Access Journals (Sweden)
Bo Gao
2013-01-01
Full Text Available Boolean control networks have recently been attracting considerable interests as computational models for genetic regulatory networks. In this paper, we present an approach of impulsive control for attractor transitions in Boolean control networks based on the recent developed matrix semitensor product theory. The reachability of attractors is estimated, and the controller is also obtained. The general derivation proposed here is exemplified with a kind of gene model, which is the protein-nucleic acid interactions network, on numerical simulations.
Synchronization in an array of coupled Boolean networks
International Nuclear Information System (INIS)
Li, Rui; Chu, Tianguang
2012-01-01
This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.
The stability of Boolean network with transmission sensitivity
Wang, Jiannan; Guo, Binghui; Wei, Wei; Mi, Zhilong; Yin, Ziqiao; Zheng, Zhiming
2017-09-01
Boolean network has been widely used in modeling biological systems and one of the key problems is its stability in response to small perturbations. Based on the hypothesis that the states of all nodes are homogenously updated, great progress has been made in previous works. In real biological networks, however, the updates of genes typically show much heterogeneity. To address such conditions, we introduce transmission sensitivity into Boolean network model. By the method of semi-annealed approximation, we illustrate that in a homogenous network, the critical condition of stability has no connection with its transmission sensitivity. As for heterogeneous networks, it reveals that correlations between network topology and transmission sensitivity can have profound effects on the its stability. This result shows a new mechanism that affects the stability of Boolean network, which could be used to control the dynamics in real biological systems.
A comparison of hypertext and Boolean access to biomedical information.
Friedman, C P; Wildemuth, B M; Muriuki, M; Gant, S P; Downs, S M; Twarog, R G; de Bliek, R
1996-01-01
This study explored which of two modes of access to a biomedical database better supported problem solving in bacteriology. Boolean access, which allowed subjects to frame their queries as combinations of keywords, was compared to hypertext access, which allowed subjects to navigate from one database node to another. The accessible biomedical data were identical across systems. Data were collected from 42 first year medical students, each randomized to the Boolean or hypertext system, before and after their bacteriology course. Subjects worked eight clinical case problems, first using only their personal knowledge and, subsequently, with aid from the database. Database retrievals enabled students to answer questions they could not answer based on personal knowledge only. This effect was greater when personal knowledge of bacteriology was lower. The results also suggest that hypertext was superior to Boolean access in helping subjects identify possible infectious agents in these clinical case problems.
Dynamic Network-Based Epistasis Analysis: Boolean Examples
Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.
2011-01-01
In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...
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....
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2017-02-01
Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.
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.
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...... with an additional multiplication property. We also show a new algorithm for verifying the product of Boolean matrices in quadratic time with exponentially small error probability, where previous methods would only give a constant error....
Document Ranking in E-Extended Boolean Logic
Czech Academy of Sciences Publication Activity Database
Holub, M.; Húsek, Dušan; Pokorný, J.
1996-01-01
Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic
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
Free Boolean algebras over unions of two well orderings
Czech Academy of Sciences Publication Activity Database
Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw
2009-01-01
Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009
Complexity of Identification and Dualization of Positive Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
1995-01-01
textabstractWe consider in this paper the problem of identifying min T(f{hook}) and max F(f{hook}) of a positive (i.e., monotone) Boolean function f{hook}, by using membership queries only, where min T(f{hook}) (max F(f{hook})) denotes the set of minimal true vectors (maximal false vectors) of
Development of Boolean calculus and its applications. [digital systems design
Tapia, M. A.
1980-01-01
The development of Boolean calculus for its application to developing digital system design methodologies that would reduce system complexity, size, cost, speed, power requirements, etc., is discussed. Synthesis procedures for logic circuits are examined particularly asynchronous circuits using clock triggered flip flops.
Learning restricted Boolean network model by time-series data.
Ouyang, Hongjia; Fang, Jie; Shen, Liangzhong; Dougherty, Edward R; Liu, Wenbin
2014-01-01
Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance [Formula: see text], the normalized Hamming distance of state transition [Formula: see text], and the steady-state distribution distance μ (ssd). Results show that the proposed algorithm outperforms the others according to both [Formula: see text] and [Formula: see text], whereas its performance according to μ (ssd) is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.
Dynamic network-based epistasis analysis: Boolean examples
Directory of Open Access Journals (Sweden)
Eugenio eAzpeitia
2011-12-01
Full Text Available In this review we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the topologies of gene interactions infered. This has been acknowledged in several previous papers and reviews, but here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson (herein, classical epistasis, defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus. Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct gene interaction topologies are hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our review complements previous accounts, not
Buscema, Massimo; Asadi-Zeydabadi, Masoud; Lodwick, Weldon; Breda, Marco
2016-04-01
Significant applications such as the analysis of Alzheimer's disease differentiated from dementia, or in data mining of social media, or in extracting information of drug cartel structural composition, are often modeled as graphs. The structural or topological complexity or lack of it in a graph is quite often useful in understanding and more importantly, resolving the problem. We are proposing a new index we call the H0function to measure the structural/topological complexity of a graph. To do this, we introduce the concept of graph pruning and its associated algorithm that is used in the development of our measure. We illustrate the behavior of our measure, the H0 function, through different examples found in the appendix. These examples indicate that the H0 function contains information that is useful and important characteristics of a graph. Here, we restrict ourselves to undirected.
Noisy random Boolean formulae: a statistical physics perspective.
Mozeika, Alexander; Saad, David; Raymond, Jack
2010-10-01
Properties of computing Boolean circuits composed of noisy logical gates are studied using the statistical physics methodology. A formula-growth model that gives rise to random Boolean functions is mapped onto a spin system, which facilitates the study of their typical behavior in the presence of noise. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding macroscopic phase transitions. The framework is employed for deriving results on error-rates at various function-depths and function sensitivity, and their dependence on the gate-type and noise model used. These are difficult to obtain via the traditional methods used in this field.
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...
Boolean Functions with a Simple Certificate for CNF Complexity
Czech Academy of Sciences Publication Activity Database
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Elements of Boolean-Valued Dempster-Shafer Theory
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2000-01-01
Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics
SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis
International Nuclear Information System (INIS)
Worrell, R.B.
1985-01-01
Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully
Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.
Klarner, Hannes; Siebert, Heike
2015-01-01
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Boolean models can explain bistability in the lac operon.
Veliz-Cuba, Alan; Stigler, Brandilyn
2011-06-01
The lac operon in Escherichia coli has been studied extensively and is one of the earliest gene systems found to undergo both positive and negative control. The lac operon is known to exhibit bistability, in the sense that the operon is either induced or uninduced. Many dynamical models have been proposed to capture this phenomenon. While most are based on complex mathematical formulations, it has been suggested that for other gene systems network topology is sufficient to produce the desired dynamical behavior. We present a Boolean network as a discrete model for the lac operon. Our model includes the two main glucose control mechanisms of catabolite repression and inducer exclusion. We show that this Boolean model is capable of predicting the ON and OFF steady states and bistability. Further, we present a reduced model which shows that lac mRNA and lactose form the core of the lac operon, and that this reduced model exhibits the same dynamics. This work suggests that the key to model qualitative dynamics of gene systems is the topology of the network and Boolean models are well suited for this purpose.
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
Approximating attractors of Boolean networks by iterative CTL model checking
Directory of Open Access Journals (Sweden)
Hannes eKlarner
2015-09-01
Full Text Available This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: faithfulness which requires that the oscillating variables of all attractors in a trapspace correspond to their dimensions, univocality which requires that there is a unique attractor in each trap space and completeness which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal and complete which suggests that they are in general good approximations for the asymptotics of Boolean networks.
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
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.
On the Computation of Comprehensive Boolean Gröbner Bases
Inoue, Shutaro
We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-08-28
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
Digital clocks: simple Boolean models can quantitatively describe circadian systems.
Akman, Ozgur E; Watterson, Steven; Parton, Andrew; Binns, Nigel; Millar, Andrew J; Ghazal, Peter
2012-09-07
The gene networks that comprise the circadian clock modulate biological function across a range of scales, from gene expression to performance and adaptive behaviour. The clock functions by generating endogenous rhythms that can be entrained to the external 24-h day-night cycle, enabling organisms to optimally time biochemical processes relative to dawn and dusk. In recent years, computational models based on differential equations have become useful tools for dissecting and quantifying the complex regulatory relationships underlying the clock's oscillatory dynamics. However, optimizing the large parameter sets characteristic of these models places intense demands on both computational and experimental resources, limiting the scope of in silico studies. Here, we develop an approach based on Boolean logic that dramatically reduces the parametrization, making the state and parameter spaces finite and tractable. We introduce efficient methods for fitting Boolean models to molecular data, successfully demonstrating their application to synthetic time courses generated by a number of established clock models, as well as experimental expression levels measured using luciferase imaging. Our results indicate that despite their relative simplicity, logic models can (i) simulate circadian oscillations with the correct, experimentally observed phase relationships among genes and (ii) flexibly entrain to light stimuli, reproducing the complex responses to variations in daylength generated by more detailed differential equation formulations. Our work also demonstrates that logic models have sufficient predictive power to identify optimal regulatory structures from experimental data. By presenting the first Boolean models of circadian circuits together with general techniques for their optimization, we hope to establish a new framework for the systematic modelling of more complex clocks, as well as other circuits with different qualitative dynamics. In particular, we anticipate
Digital clocks: simple Boolean models can quantitatively describe circadian systems
Akman, Ozgur E.; Watterson, Steven; Parton, Andrew; Binns, Nigel; Millar, Andrew J.; Ghazal, Peter
2012-01-01
The gene networks that comprise the circadian clock modulate biological function across a range of scales, from gene expression to performance and adaptive behaviour. The clock functions by generating endogenous rhythms that can be entrained to the external 24-h day–night cycle, enabling organisms to optimally time biochemical processes relative to dawn and dusk. In recent years, computational models based on differential equations have become useful tools for dissecting and quantifying the complex regulatory relationships underlying the clock's oscillatory dynamics. However, optimizing the large parameter sets characteristic of these models places intense demands on both computational and experimental resources, limiting the scope of in silico studies. Here, we develop an approach based on Boolean logic that dramatically reduces the parametrization, making the state and parameter spaces finite and tractable. We introduce efficient methods for fitting Boolean models to molecular data, successfully demonstrating their application to synthetic time courses generated by a number of established clock models, as well as experimental expression levels measured using luciferase imaging. Our results indicate that despite their relative simplicity, logic models can (i) simulate circadian oscillations with the correct, experimentally observed phase relationships among genes and (ii) flexibly entrain to light stimuli, reproducing the complex responses to variations in daylength generated by more detailed differential equation formulations. Our work also demonstrates that logic models have sufficient predictive power to identify optimal regulatory structures from experimental data. By presenting the first Boolean models of circadian circuits together with general techniques for their optimization, we hope to establish a new framework for the systematic modelling of more complex clocks, as well as other circuits with different qualitative dynamics. In particular, we
An Association Rule Mining Algorithm Based on a Boolean Matrix
Directory of Open Access Journals (Sweden)
Hanbing Liu
2007-09-01
Full Text Available Association rule mining is a very important research topic in the field of data mining. Discovering frequent itemsets is the key process in association rule mining. Traditional association rule algorithms adopt an iterative method to discovery, which requires very large calculations and a complicated transaction process. Because of this, a new association rule algorithm called ABBM is proposed in this paper. This new algorithm adopts a Boolean vector "relational calculus" method to discovering frequent itemsets. Experimental results show that this algorithm can quickly discover frequent itemsets and effectively mine potential association rules.
A Construction of Boolean Functions with Good Cryptographic Properties
2014-01-01
over Fn2 defined by Wf (u) = ∑ x∈Fn2 (−1)f(x)+u·x, where u ∈ Fn2 and u · x is an inner product , for instance, u · x = u1x1 + u2x3 + · · · + unxn, where u...later on for all these classes. We mention also the paper of Pasalic [27], which introduces the notion of high degree product (HDP) to mea- sure the...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum
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...
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
Complexity classifications for different equivalence and audit problems for Boolean circuits
BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
2010-01-01
We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.
Proposed method to construct Boolean functions with maximum possible annihilator immunity
Goyal, Rajni; Panigrahi, Anupama; Bansal, Rohit
2017-07-01
Nonlinearity and Algebraic(annihilator) immunity are two core properties of a Boolean function because optimum values of Annihilator Immunity and nonlinearity are required to resist fast algebraic attack and differential cryptanalysis respectively. For a secure cypher system, Boolean function(S-Boxes) should resist maximum number of attacks. It is possible if a Boolean function has optimal trade-off among its properties. Before constructing Boolean functions, we fixed the criteria of our constructions based on its properties. In present work, our construction is based on annihilator immunity and nonlinearity. While keeping above facts in mind,, we have developed a multi-objective evolutionary approach based on NSGA-II and got the optimum value of annihilator immunity with good bound of nonlinearity. We have constructed balanced Boolean functions having the best trade-off among balancedness, Annihilator immunity and nonlinearity for 5, 6 and 7 variables by the proposed method.
Directory of Open Access Journals (Sweden)
Reynold V. Galope
2014-06-01
Full Text Available This paper integrates the Kauffman Firm Survey with the Small Business Innovation Research (SBIR recipient dataset to examine in more depth the characteristics of small business start-ups that received R&D subsidy from SBIR. Our selection analysis first shows that SBIR program funds are distributed disproportionately to start-ups whose owner has a post-graduate education. The odds of being granted SBIR R&D subsidies are also higher for those who had prior R&D experience and owned patents at the start of their business operations. Start-ups that are operating in the high-technology sector are also more likely to receive SBIR funds than start-ups in traditional sectors. Surprisingly, start-ups that did not sell goods and services are more likely to receive SBIR grants. Interestingly, location matters but at a different direction: start-ups located in states that are not known for their R&D performance are more likely to receive SBIR funding.
Chemical Visualization of Boolean Functions: A Simple Chemical Computer
Blittersdorf, R.; Müller, J.; Schneider, F. W.
1995-08-01
We present a chemical realization of the Boolean functions AND, OR, NAND, and NOR with a neutralization reaction carried out in three coupled continuous flow stirred tank reactors (CSTR). Two of these CSTR's are used as input reactors, the third reactor marks the output. The chemical reaction is the neutralization of hydrochloric acid (HCl) with sodium hydroxide (NaOH) in the presence of phenolphtalein as an indicator, which is red in alkaline solutions and colorless in acidic solutions representing the two binary states 1 and 0, respectively. The time required for a "chemical computation" is determined by the flow rate of reactant solutions into the reactors since the neutralization reaction itself is very fast. While the acid flow to all reactors is equal and constant, the flow rate of NaOH solution controls the states of the input reactors. The connectivities between the input and output reactors determine the flow rate of NaOH solution into the output reactor, according to the chosen Boolean function. Thus the state of the output reactor depends on the states of the input reactors.
Boolean models of biosurfactants production in Pseudomonas fluorescens.
Directory of Open Access Journals (Sweden)
Adrien Richard
Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
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.
Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.
Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde
2015-08-28
In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.
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.
Directory of Open Access Journals (Sweden)
Nicole Geberzahn
Full Text Available BACKGROUND: Birdsong is a popular model system in research areas such as vocal communication, neuroethology or neuroendocrinology of behaviour. As most research has been conducted on species with male-only song production, the hormone-dependency of male song is well established. However, female singing and its mechanisms are poorly understood. METHODOLOGY/PRINCIPAL FINDINGS: We characterised the song and its endocrine correlates of blue-capped cordon-bleus (Uraeginthus cyanocephalus, a species in which both sexes sing. Like other estrildids, they produce directed song during courtship and undirected (or solitary song in isolation, i.e. when the mate is not visible or absent. We compare solitary song of blue-capped cordon-bleus to published descriptions of the song of its relative, the zebra finch (Taeniopygia guttata. Solitary song of cordon-bleus shared some overall song features with that of zebra finches but differed in spectro-temporal song features, sequential stereotypy and sequential organisation. The song of cordon-bleus was dimorphic with respect to the larger size of syllable repertoires, the higher song duration and the lower variability of pitch goodness (measuring the pureness of harmonic sounds in males. However, in both sexes the overall plasma testosterone concentrations were low (ca. 300 pg/ml and did not correlate with the sexually dimorphic song motor pattern. Despite such low concentrations, the increase in the rate of solitary song coincided with an increase in the level of testosterone. Furthermore, the latency to start singing after the separation from the mate was related to hormone levels. CONCLUSIONS/SIGNIFICANCE: Our findings suggest that the occurrence of solitary song but not its motor pattern might be under the control of testosterone in female and male cordon-bleus.
Adapted Boolean network models for extracellular matrix formation
Directory of Open Access Journals (Sweden)
Wollbold Johannes
2009-07-01
Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF
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
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Muñoz, Stalin; Carrillo, Miguel; Azpeitia, Eugenio; Rosenblueth, David A.
2018-01-01
Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic) attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin. PMID:29559993
Boolean modeling in systems biology: an overview of methodology and applications
International Nuclear Information System (INIS)
Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh
2012-01-01
Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)
Reconfigurable Boolean logic using magnetic single-electron transistors.
Directory of Open Access Journals (Sweden)
M Fernando Gonzalez-Zalba
Full Text Available We propose a novel hybrid single-electron device for reprogrammable low-power logic operations, the magnetic single-electron transistor (MSET. The device consists of an aluminium single-electron transistor with a GaMnAs magnetic back-gate. Changing between different logic gate functions is realized by reorienting the magnetic moments of the magnetic layer, which induces a voltage shift on the Coulomb blockade oscillations of the MSET. We show that we can arbitrarily reprogram the function of the device from an n-type SET for in-plane magnetization of the GaMnAs layer to p-type SET for out-of-plane magnetization orientation. Moreover, we demonstrate a set of reprogrammable Boolean gates and its logical complement at the single device level. Finally, we propose two sets of reconfigurable binary gates using combinations of two MSETs in a pull-down network.
Reconfigurable Boolean Logic Using Magnetic Single-Electron Transistors
Gonzalez-Zalba, M. Fernando; Ciccarelli, Chiara; Zarbo, Liviu P.; Irvine, Andrew C.; Campion, Richard C.; Gallagher, Bryan L.; Jungwirth, Tomas; Ferguson, Andrew J.; Wunderlich, Joerg
2015-01-01
We propose a novel hybrid single-electron device for reprogrammable low-power logic operations, the magnetic single-electron transistor (MSET). The device consists of an aluminium single-electron transistor with a GaMnAs magnetic back-gate. Changing between different logic gate functions is realized by reorienting the magnetic moments of the magnetic layer, which induces a voltage shift on the Coulomb blockade oscillations of the MSET. We show that we can arbitrarily reprogram the function of the device from an n-type SET for in-plane magnetization of the GaMnAs layer to p-type SET for out-of-plane magnetization orientation. Moreover, we demonstrate a set of reprogrammable Boolean gates and its logical complement at the single device level. Finally, we propose two sets of reconfigurable binary gates using combinations of two MSETs in a pull-down network. PMID:25923789
Identification of Boolean Networks Using Premined Network Topology Information.
Zhang, Xiaohua; Han, Huaxiang; Zhang, Weidong
2017-02-01
This brief aims to reduce the data requirement for the identification of Boolean networks (BNs) by using the premined network topology information. First, a matching table is created and used for sifting the true from the false dependences among the nodes in the BNs. Then, a dynamic extension to matching table is developed to enable the dynamic locating of matching pairs to start as soon as possible. Next, based on the pseudocommutative property of the semitensor product, a position-transform mining is carried out to further improve data utilization. Combining the above, the topology of the BNs can be premined for the subsequent identification. Examples are given to illustrate the efficiency of reducing the data requirement. Some excellent features, such as the online and parallel processing ability, are also demonstrated.
ZKBoo: Faster Zero-Knowledge for Boolean Circuits
DEFF Research Database (Denmark)
Giacomelli, Irene; Madsen, Jesper; Orlandi, Claudio
2016-01-01
variants of IKOS, which highlights their pros and cons for practically rele- vant soundness parameters; ◦ A generalization and simplification of their approach, which leads to faster Σ-protocols (that can be made non-interactive using the Fiat-Shamir heuristic) for state- ments of the form “I know x...... such that y = φ (x)” (where φ is a circuit and y a public value); ◦ A case study, where we provide explicit protocols, implementations and benchmarking of zero-knowledge protocols for the SHA-1 and SHA-256 circuits.......In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-of- concept implementation. As an highlight, we can generate (resp. verify) a non-interactive proof for the SHA-1 circuit in approximately 13...
Algebraic characteristics and satisfiability threshold of random Boolean equations
Guo, Binghui; Wei, Wei; Sun, Yifan; Zheng, Zhiming
2010-03-01
The satisfiability of a class of random Boolean equations named massive algebraic system septated to linear and nonlinear subproblems is studied in this paper. On one hand, the correlation between the magnetization of generators and the clustering of solutions of the linear subproblem is investigated by analyzing the Gaussian elimination process. On the other hand, the characteristics of maximal elements of solutions of the nonlinear subproblem are studied by introducing the partial order among solutions. Based on the algebraic characteristics of these two subproblems, the upper and lower bounds of satisfiability threshold of massive algebraic system are obtained by unit-clause propagation and leaf-removal process, and coincide as the ratio of nonlinear equations q>0.739 in which analytical values of the satisfiability threshold can be derived. Furthermore, a complete algorithm with heuristic decimation is proposed to observe the approximation of the satisfiability threshold, which performs more efficiently than the classical ones.
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.
Unlimited multistability and Boolean logic in microbial signalling
DEFF Research Database (Denmark)
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca
2015-01-01
reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We...... further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two......-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger...
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
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.
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 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.
Constructivizability of the Boolean algebra B(ω) with a distinguished automorphism
Czech Academy of Sciences Publication Activity Database
Bazhenov, N. A.; Tukhbatullina, Regina
2012-01-01
Roč. 51, č. 5 (2012), s. 384-403 ISSN 0002-5232 Institutional support: PRVOUK-P23 Keywords : Boolean algebra * constructivizability * degree spectra of structures Subject RIV: AH - Economics Impact factor: 0.493, year: 2012
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.
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.
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....
2017-09-01
duties due to Sailors, across the globe, who stand the watch. As Winston Churchill once said, “we sleep safely at night because rough men stand ready...Chapter 2 contains definitions and preliminary generalized Boolean function material. This is followed by Chapters 3–5, which contain the bulk of the...Generalized Boolean Functions Sic Parvis Magna Sir Francis DrakeA In this chapter we begin by covering some basic definitions and properties which we will make
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
Graphene-based non-Boolean logic circuits
Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.
2013-10-01
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.
Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.
Dallidis, Stylianos E; Karafyllidis, Ioannis G
2014-09-01
To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.
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
Unlimited multistability and Boolean logic in microbial signalling.
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca; Soyer, Orkun S
2015-07-06
The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and allow their engineering through synthetic biology.
Structures and Boolean Dynamics in Gene Regulatory Networks
Szedlak, Anthony
This dissertation discusses the topological and dynamical properties of GRNs in cancer, and is divided into four main chapters. First, the basic tools of modern complex network theory are introduced. These traditional tools as well as those developed by myself (set efficiency, interset efficiency, and nested communities) are crucial for understanding the intricate topological properties of GRNs, and later chapters recall these concepts. Second, the biology of gene regulation is discussed, and a method for disease-specific GRN reconstruction developed by our collaboration is presented. This complements the traditional exhaustive experimental approach of building GRNs edge-by-edge by quickly inferring the existence of as of yet undiscovered edges using correlations across sets of gene expression data. This method also provides insight into the distribution of common mutations across GRNs. Third, I demonstrate that the structures present in these reconstructed networks are strongly related to the evolutionary histories of their constituent genes. Investigation of how the forces of evolution shaped the topology of GRNs in multicellular organisms by growing outward from a core of ancient, conserved genes can shed light upon the ''reverse evolution'' of normal cells into unicellular-like cancer states. Next, I simulate the dynamics of the GRNs of cancer cells using the Hopfield model, an infinite range spin-glass model designed with the ability to encode Boolean data as attractor states. This attractor-driven approach facilitates the integration of gene expression data into predictive mathematical models. Perturbations representing therapeutic interventions are applied to sets of genes, and the resulting deviations from their attractor states are recorded, suggesting new potential drug targets for experimentation. Finally, I extend the Hopfield model to modular networks, cyclic attractors, and complex attractors, and apply these concepts to simulations of the cell cycle
Guo, Wensheng; Yang, Guowu; Wu, Wei; He, Lei; Sun, Mingyu
2014-01-01
In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
The spruce budworm and forest: a qualitative comparison of ODE and Boolean models
Directory of Open Access Journals (Sweden)
Raina Robeva
2016-01-01
Full Text Available Boolean and polynomial models of biological systems have emerged recently as viable companions to differential equations models. It is not immediately clear however whether such models are capable of capturing the multi-stable behaviour of certain biological systems: this behaviour is often sensitive to changes in the values of the model parameters, while Boolean and polynomial models are qualitative in nature. In the past few years, Boolean models of gene regulatory systems have been shown to capture multi-stability at the molecular level, confirming that such models can be used to obtain information about the system’s qualitative dynamics when precise information regarding its parameters may not be available. In this paper, we examine Boolean approximations of a classical ODE model of budworm outbreaks in a forest and show that these models exhibit a qualitative behaviour consistent with that derived from the ODE models. In particular, we demonstrate that these models can capture the bistable nature of insect population outbreaks, thus showing that Boolean models can be successfully utilized beyond the molecular level.
Directory of Open Access Journals (Sweden)
Tomáš Mrkvička
2011-03-01
Full Text Available Methods for testing the Boolean model assumption from binary images are briefly reviewed. Two hundred binary images of mammary cancer tissue and 200 images of mastopathic tissue were tested individually on the Boolean model assumption. In a previous paper, it had been found that a Monte Carlo method based on the approximation of the envelopes by a multi-normal distribution with the normalized intrinsic volume densities of parallel sets as a summary statistics had the highest power for this purpose. Hence, this method was used here as its first application to real biomedical data. It was found that mastopathic tissue deviates from the Boolean model significantly more strongly than mammary cancer tissue does.
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.
Mechanical system reliability analysis using a combination of graph theory and Boolean function
International Nuclear Information System (INIS)
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V
2017-04-01
We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.
Improving the quantum cost of reversible Boolean functions using reorder algorithm
Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf
2018-05-01
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Le Yu
2007-05-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into Ã‚Â“pureÃ‚Â” subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm
Boolean Matching Filters Based on Row and Column Weights of Reed–Muller Polarity Coefficient Matrix
Directory of Open Access Journals (Sweden)
Chip-Hong Chang
2002-01-01
Full Text Available In this article, we have shown, by means of the EXOR Ternary Decision Diagram that the number of literals and product terms of the Fixed Polarity Reed–Muller (FPRM expansions can be used to fully classify all Boolean functions in NP equivalent class and NPN equivalent class, respectively. Efficient graph based algorithms to compute the complete weight vectors have been presented. The proof and computation method has led to the derivation of a set of characteristic signatures that has low probability of aliasing when used as the Boolean matching filters in library mapping.
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Xiao Yufei
2007-01-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into "pure" subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm, this paper
Directory of Open Access Journals (Sweden)
Ivana Dragović
2015-01-01
Full Text Available Fuzzy inference systems (FIS enable automated assessment and reasoning in a logically consistent manner akin to the way in which humans reason. However, since no conventional fuzzy set theory is in the Boolean frame, it is proposed that Boolean consistent fuzzy logic should be used in the evaluation of rules. The main distinction of this approach is that it requires the execution of a set of structural transformations before the actual values can be introduced, which can, in certain cases, lead to different results. While a Boolean consistent FIS could be used for establishing the diagnostic criteria for any given disease, in this paper it is applied for determining the likelihood of peritonitis, as the leading complication of peritoneal dialysis (PD. Given that patients could be located far away from healthcare institutions (as peritoneal dialysis is a form of home dialysis the proposed Boolean consistent FIS would enable patients to easily estimate the likelihood of them having peritonitis (where a high likelihood would suggest that prompt treatment is indicated, when medical experts are not close at hand.
Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...
Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type
Matoušek, Milan; Pták, Pavel
2015-12-01
Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.
Yes/No/Maybe: A Boolean attempt at feedback | Louw | Journal for ...
African Journals Online (AJOL)
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 ...
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…
GBL-2D Version 1.0: a 2D geometry boolean library.
Energy Technology Data Exchange (ETDEWEB)
McBride, Cory L. (Elemental Technologies, American Fort, UT); Schmidt, Rodney Cannon; Yarberry, Victor R.; Meyers, Ray J. (Elemental Technologies, American Fort, UT)
2006-11-01
This report describes version 1.0 of GBL-2D, a geometric Boolean library for 2D objects. The library is written in C++ and consists of a set of classes and routines. The classes primarily represent geometric data and relationships. Classes are provided for 2D points, lines, arcs, edge uses, loops, surfaces and mask sets. The routines contain algorithms for geometric Boolean operations and utility functions. Routines are provided that incorporate the Boolean operations: Union(OR), XOR, Intersection and Difference. A variety of additional analytical geometry routines and routines for importing and exporting the data in various file formats are also provided. The GBL-2D library was originally developed as a geometric modeling engine for use with a separate software tool, called SummitView [1], that manipulates the 2D mask sets created by designers of Micro-Electro-Mechanical Systems (MEMS). However, many other practical applications for this type of software can be envisioned because the need to perform 2D Boolean operations can arise in many contexts.
Computable categoricity of the Boolean algebra B(omega) with a distinguished automorphism
Czech Academy of Sciences Publication Activity Database
Bazhenov, N. A.; Tukhbatullina, Regina
2013-01-01
Roč. 52, č. 2 (2013), s. 89-97 ISSN 0002-5232 Institutional support: PRVOUK-P23 Keywords : Boolean algebra with distinguished automorphism * computable categoricity * categoricity spectrum Subject RIV: BA - General Mathematics Impact factor: 0.488, year: 2013
An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
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.
Comparison of Detection and Classification Algorithms Using Boolean and Fuzzy Techniques
Directory of Open Access Journals (Sweden)
Rahul Dixit
2012-01-01
Full Text Available Modern military ranging, tracking, and classification systems are capable of generating large quantities of data. Conventional “brute-force” computational techniques, even with Moore’s law for processors, present a prohibitive computational challenge, and often, the system either fails to “lock onto” a target of interest within the available duty cycle, or the data stream is simply discarded because the system runs out of processing power or time. In searching for high-fidelity convergence, researchers have experimented with various reduction techniques, often using logic diagrams to make inferences from related signal data. Conventional Boolean and fuzzy logic systems generate a very large number of rules, which often are difficult to handle due to limitations in the processors. Published research has shown that reasonable approximations of the target are preferred over incomplete computations. This paper gives a figure of merit for comparing various logic analysis methods and presents results for a hypothetical target classification scenario. Novel multiquantization Boolean approaches also reduce the complexity of these multivariate analyses, making it possible to better use the available data to approximate target classification. This paper shows how such preprocessing can reasonably preserve result confidence and compares the results between Boolean, multi-quantization Boolean, and fuzzy techniques.
Hindersin, Laura; Traulsen, Arne
2015-01-01
We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of selection are graphs for which the fixation probability is increased for advantageous mutants and decreased for disadvantageous mutants. A few examples of such amplifiers have been developed, but so far it is unclear how many such structures exist and how to construct them. Here, we show that almost any undirected random graph is an amplifier of selection for Birth-death updating, where an individual is selected to reproduce with probability proportional to its fitness and one of its neighbors is replaced by that offspring at random. If we instead focus on death-Birth updating, in which a random individual is removed and its neighbors compete for the empty spot, then the same ensemble of graphs consists of almost only suppressors of selection for which the fixation probability is decreased for advantageous mutants and increased for disadvantageous mutants. Thus, the impact of population structure on evolutionary dynamics is a subtle issue that will depend on seemingly minor details of the underlying evolutionary process. PMID:26544962
Cordón García, Oscar; Moya Anegón, Félix de; Zarco Fernández, Carmen
2000-01-01
[ES] Although the fuzzy retrieval model constitutes a powerful extension of the boolean one, being able to deal with the imprecision and subjectivity existing in the Information Retrieval process, users are not usually able to express their query requirements in the form of an extended boolean query including weights. To solve this problem, different tools to assist the user in the query formulation have been proposed. In this paper, the genetic algorithm-programming technique is considered t...
CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS
Directory of Open Access Journals (Sweden)
P. N. Bibilo
2016-01-01
Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.
Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
DEFF Research Database (Denmark)
Gutin, Gregory; Yeo, Anders
2012-01-01
A function f: -1,1n→R is called pseudo-Boolean. It is well-known that each pseudo-Boolean function f can be written as f(x)=∑ I∈Ff̂(I) χI(x), where F⊆I:I⊆[n], [n]=1,2,...,n, χI(x)= ∏ i∈I xi and f̂(I) are non-zero reals. The degree of f is max|I|:I∈F and the width of f is the minimum integer ρ suc...... for each q>papplications, we prove a stronger inequality: || f||4≤( 2ρ+1)14|| f||2....
Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
Czech Academy of Sciences Publication Activity Database
Kainen, P.C.; Kůrková, Věra; Sanguineti, M.
2005-01-01
Roč. 4, č. 4 (2005), s. 355-368 ISSN 1570-1166 R&D Projects: GA ČR GA201/02/0428; GA ČR GA201/05/0557 Grant - others:Area MC 6(EU) Project 22 Institutional research plan: CEZ:AV0Z10300504 Keywords : high-dimensional optimization * minimizing sequences * Boolean decision functions * decision tree Subject RIV: BA - General Mathematics
Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2009-01-01
Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Representations and Rates of Approximation of Real-Valued Boolean Functions by Neural Networks
Czech Academy of Sciences Publication Activity Database
Kůrková, Věra; Savický, Petr; Hlaváčková, Kateřina
1998-01-01
Roč. 11, č. 4 (1998), s. 651-659 ISSN 0893-6080 R&D Projects: GA AV ČR IAA2030602; GA AV ČR IAA2075606; GA ČR GA201/95/0976 Keywords : real-valued Boolean function * percepron network * rate of approximation * variation with respect to half-spaces * decision tree * Hadamard communication matrix Subject RIV: BA - General Mathematics Impact factor: 1.017, year: 1998
Completely positive matrices over Boolean algebras and their CP-rank
Directory of Open Access Journals (Sweden)
Mohindru Preeti
2015-04-01
Full Text Available Drew, Johnson and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n2/4]. In this paper, we prove this conjecture for n × n completely positive matrices over Boolean algebras (finite or infinite. In addition,we formulate various CP-rank inequalities of completely positive matrices over special semirings using semiring homomorphisms.
Stötzel, Claudia; Röblitz, Susanna; Siebert, Heike
2015-01-01
In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs) into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.
Harris, Daniel R.; Henderson, Darren W.; Kavuluru, Ramakanth; Stromberg, Arnold J.; Johnson, Todd R.
2015-01-01
We present a custom, Boolean query generator utilizing common-table expressions (CTEs) that is capable of scaling with big datasets. The generator maps user-defined Boolean queries, such as those interactively created in clinical-research and general-purpose healthcare tools, into SQL. We demonstrate the effectiveness of this generator by integrating our work into the Informatics for Integrating Biology and the Bedside (i2b2) query tool and show that it is capable of scaling. Our custom generator replaces and outperforms the default query generator found within the Clinical Research Chart (CRC) cell of i2b2. In our experiments, sixteen different types of i2b2 queries were identified by varying four constraints: date, frequency, exclusion criteria, and whether selected concepts occurred in the same encounter. We generated non-trivial, random Boolean queries based on these 16 types; the corresponding SQL queries produced by both generators were compared by execution times. The CTE-based solution significantly outperformed the default query generator and provided a much more consistent response time across all query types (M=2.03, SD=6.64 vs. M=75.82, SD=238.88 seconds). Without costly hardware upgrades, we provide a scalable solution based on CTEs with very promising empirical results centered on performance gains. The evaluation methodology used for this provides a means of profiling clinical data warehouse performance. PMID:25192572
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.
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.
Directory of Open Access Journals (Sweden)
Liam G Fearnley
Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.
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.
Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.
Directory of Open Access Journals (Sweden)
Maria Simak
Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.
Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya
2014-01-01
In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Directory of Open Access Journals (Sweden)
Liang Jinghang
2012-08-01
Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a
Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik
2015-01-01
Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The
Variances as order parameter and complexity measure for random Boolean networks
International Nuclear Information System (INIS)
Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel
2005-01-01
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
International Nuclear Information System (INIS)
Yoo, Seokwon; Lee, Jinhyoung; Bang, Jeongho; Lee, Changhyoup
2014-01-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)
A new separation algorithm for the Boolean quadric and cut polytopes
DEFF Research Database (Denmark)
Sørensen, Michael Malmros; Letchford, Adam N.
2014-01-01
present a new algorithm, which separates over a class of valid inequalities that includes all odd bicycle wheel inequalities and (2p+1,2)(2p+1,2)-circulant inequalities. It exploits, in a non-trivial way, three known results in the literature: one on the separation of View the MathML source{0,12}-cuts......A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...
Approximating the Influence of a monotone Boolean function in O(\\sqrt{n}) query complexity
Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri
2011-01-01
The {\\em Total Influence} ({\\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \\ifnum\\plusminus=1 $f: \\{\\pm1\\}^n \\longrightarrow \\{\\pm1\\}$, \\else $f: \\bitset^n \\to \\bitset$, \\fi which we denote by $I[f]$. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of $(1\\pm \\eps)$ by performing $O(\\frac{\\sqrt{n}\\log...
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
Continuous time boolean modeling for biological signaling: application of Gillespie algorithm
Directory of Open Access Journals (Sweden)
Stoll Gautier
2012-08-01
Full Text Available Abstract Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. Background There exist two major types of mathematical modeling approaches: (1 quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2 and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Results Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be
Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method
International Nuclear Information System (INIS)
EI-Shanshoury, A.I.
2011-01-01
This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian
2018-04-01
Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.
Construction of a fuzzy and all Boolean logic gates based on DNA
DEFF Research Database (Denmark)
M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse
2015-01-01
to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....
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.
Baccelli, François; Błaszczyszyn, Bartłomiej
2001-01-01
Projet MCR; We define and analyze a random coverage process of the $d$-dimensional Euclidian space which allows one to describe a continuous spectrum that ranges from the Boolean model to the Poisson-Voronoi tessellation to the Johnson-Mehl model. Like for the Boolean model, the minimal stochastic setting consists of a Poisson point process on this Euclidian space and a sequence of real valued random variables considered as marks of this point process. In this coverage process, the cell attac...
Chen, Xi; Akutsu, Tatsuya; Tamura, Takeyuki; Ching, Wai-Ki
2013-01-01
Boolean Networks (BNs) and Probabilistic Boolean Networks (PBNs) are studied in this paper from the viewpoint of control problems. For BN CONTROL, by applying external control, we propose to derive the network to the desired state within a few time steps. For PBN CONTROL, we propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, we propose to minimise the maximum cost of the terminal state to which the network will enter. We also present a hardness result suggesting that PBN CONTROL is harder than BN CONTROL.
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
Directory of Open Access Journals (Sweden)
Yutaro Nagae
2017-01-01
Full Text Available A parameterised Boolean equation system (PBES is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded as a declarative program defining functions that take a datum and returns a Boolean value. The membership problem of PBESs is a problem to decide whether a given element is in the defined set or not, which corresponds to an execution of the program. This paper introduces reduced proof graphs, and studies a technique to solve the membership problem of PBESs, which is undecidable in general, by transforming it into a reduced proof graph. A vertex X(v in a proof graph represents that the data v is in the set X, if the graph satisfies conditions induced from a given PBES. Proof graphs are, however, infinite in general. Thus we introduce vertices each of which stands for a set of vertices of the original ones, which possibly results in a finite graph. For a subclass of disjunctive PBESs, we clarify some conditions which reduced proof graphs should satisfy. We also show some examples having no finite proof graph except for reduced one. We further propose a reduced dependency space, which contains reduced proof graphs as sub-graphs if a proof graph exists. We provide a procedure to construct finite reduced dependency spaces, and show the soundness and completeness of the procedure.
Bistability and Asynchrony in a Boolean Model of the L-arabinose Operon in Escherichia coli.
Jenkins, Andy; Macauley, Matthew
2017-08-01
The lactose operon in Escherichia coli was the first known gene regulatory network, and it is frequently used as a prototype for new modeling paradigms. Historically, many of these modeling frameworks use differential equations. More recently, Stigler and Veliz-Cuba proposed a Boolean model that captures the bistability of the system and all of the biological steady states. In this paper, we model the well-known arabinose operon in E. coli with a Boolean network. This has several complex features not found in the lac operon, such as a protein that is both an activator and repressor, a DNA looping mechanism for gene repression, and the lack of inducer exclusion by glucose. For 11 out of 12 choices of initial conditions, we use computational algebra and Sage to verify that the state space contains a single fixed point that correctly matches the biology. The final initial condition, medium levels of arabinose and no glucose, successfully predicts the system's bistability. Finally, we compare the state space under synchronous and asynchronous update and see that the former has several artificial cycles that go away under a general asynchronous update.
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Directory of Open Access Journals (Sweden)
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
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.
Lima, Ricardo
2016-06-16
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Directory of Open Access Journals (Sweden)
Chao Luo
Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.
Super-transient scaling in time-delay autonomous Boolean network motifs
Energy Technology Data Exchange (ETDEWEB)
D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)
2016-09-15
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
The universal magnetic tunnel junction logic gates representing 16 binary Boolean logic operations
Lee, Junwoo; Suh, Dong Ik; Park, Wanjun
2015-05-01
The novel devices are expected to shift the paradigm of a logic operation by their own nature, replacing the conventional devices. In this study, the nature of our fabricated magnetic tunnel junction (MTJ) that responds to the two external inputs, magnetic field and voltage bias, demonstrated seven basic logic operations. The seven operations were obtained by the electric-field-assisted switching characteristics, where the surface magnetoelectric effect occurs due to a sufficiently thin free layer. The MTJ was transformed as a universal logic gate combined with three supplementary circuits: A multiplexer (MUX), a Wheatstone bridge, and a comparator. With these circuits, the universal logic gates demonstrated 16 binary Boolean logic operations in one logic stage. A possible further approach is parallel computations through a complimentary of MUX and comparator, capable of driving multiple logic gates. A reconfigurable property can also be realized when different logic operations are produced from different level of voltages applying to the same configuration of the logic gate.
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.
Integer programming-based method for observability of singleton attractors in Boolean networks.
Cheng, Xiaoqing; Qiu, Yushan; Hou, Wenpin; Ching, Wai-Ki
2017-02-01
Boolean network (BN) is a popular mathematical model for revealing the behaviour of a genetic regulatory network. Furthermore, observability, an important network feature, plays a significant role in understanding the underlying network. Several studies have been done on analysis of observability of BNs and complex networks. However, the observability of attractor cycles, which can serve as biomarker detection, has not yet been addressed in the literature. This is an important, interesting and challenging problem that deserves a detailed study. In this study, a novel problem was first proposed on attractor observability in BNs. Identification of the minimum set of consecutive nodes can be used to discriminate different attractors. Furthermore, it can serve as a biomarker for different disease types (represented as different attractor cycles). Then a novel integer programming method was developed to identify the desired set of nodes. The proposed approach is demonstrated and verified by numerical examples. The computational results further illustrates that the proposed model is effective and efficient.
Tran, Van; McCall, Matthew N; McMurray, Helene R; Almudevar, Anthony
2013-01-01
Boolean networks (BoN) are relatively simple and interpretable models of gene regulatory networks. Specifying these models with fewer parameters while retaining their ability to describe complex regulatory relationships is an ongoing methodological challenge. Additionally, extending these models to incorporate variable gene decay rates, asynchronous gene response, and synergistic regulation while maintaining their Markovian nature increases the applicability of these models to genetic regulatory networks (GRN). We explore a previously-proposed class of BoNs characterized by linear threshold functions, which we refer to as threshold Boolean networks (TBN). Compared to traditional BoNs with unconstrained transition functions, these models require far fewer parameters and offer a more direct interpretation. However, the functional form of a TBN does result in a reduction in the regulatory relationships which can be modeled. We show that TBNs can be readily extended to permit self-degradation, with explicitly modeled degradation rates. We note that the introduction of variable degradation compromises the Markovian property fundamental to BoN models but show that a simple state augmentation procedure restores their Markovian nature. Next, we study the effect of assumptions regarding self-degradation on the set of possible steady states. Our findings are captured in two theorems relating self-degradation and regulatory feedback to the steady state behavior of a TBN. Finally, we explore assumptions of synchronous gene response and asynergistic regulation and show that TBNs can be easily extended to relax these assumptions. Applying our methods to the budding yeast cell-cycle network revealed that although the network is complex, its steady state is simplified by the presence of self-degradation and lack of purely positive regulatory cycles.
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.
Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.
Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu
2009-07-01
The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
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.
Directory of Open Access Journals (Sweden)
Peter H.S. Riad
2011-01-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
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
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).
An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.
Jiang, Han; Li, Xue; Xu, Qiuliang
2016-12-01
The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.
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.
Kaplan, J C; Junien, C
2000-12-01
The major impact of the completion of the human genome sequence will be the understanding of diseases, with deduced therapy. In the field of genetic disorders, we will complete the catalogue of monogenic diseases, also called Mendelian diseases because they obey the Boolean logic of Mendel's laws. The major challenge now is to decipher the polygenic and multifactorial etiology of common diseases, such as cancer, cardio-vascular, nutritional, allergic, auto-immune and degenerative diseases. In fact, every gene, when mutated, is a potential disease gene, and we end up with the new concept of 'reverse medicine'; i.e., deriving new diseases or pathogenic pathways from the knowledge of the structure and function of every gene. By going from sequence to function (functional genomics and proteomics) we will gain insight into basic mechanisms of major functions such as cell proliferation, differentiation and development, which are perturbed in many pathological processes. By learning the meaning of some non-coding and of regulatory sequences our understanding will gain in complexity, generating a molecular and supramolecular integrated physiology, helping to build a molecular patho-physiology of the different syndromes. Besides those cognitive advances, there are also other issues at stake, such as: progress in diagnostic and prediction (predictive medicine); progress in therapy (pharmacogenomics and gene-based therapy); ethical issues; impact on business.
Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.
Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S
2011-02-01
The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
Witt, Carsten
2006-01-01
Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This paper presents a first rigorous analysis of the (mu+1) EA on pseudo-Boolean functions. Using three well-known example functions from the analysis of the (1+1) EA, we derive bounds on the expected runtime and success probability. For two of these functions, upper and lower bounds on the expected runtime are tight, and on all three functions, the (mu+1) EA is never more efficient than the (1+1) EA. Moreover, all lower bounds grow with mu. On a more complicated function, however, a small increase of mu probably decreases the expected runtime drastically. This paper develops a new proof technique that bounds the runtime of the (mu+1) EA. It investigates the stochastic process for creating family trees of individuals; the depth of these trees is bounded. Thereby, the progress of the population towards the optimum is captured. This new technique is general enough to be applied to other population-based EAs.
Steady-State Analysis of Genetic Regulatory Networks Modelled by Probabilistic Boolean Networks
Directory of Open Access Journals (Sweden)
Wei Zhang
2006-04-01
Full Text Available Probabilistic Boolean networks (PBNs have recently been introduced as a promising class of models of genetic regulatory networks. The dynamic behaviour of PBNs can be analysed in the context of Markov chains. A key goal is the determination of the steady-state (long-run behaviour of a PBN by analysing the corresponding Markov chain. This allows one to compute the long-term influence of a gene on another gene or determine the long-term joint probabilistic behaviour of a few selected genes. Because matrix-based methods quickly become prohibitive for large sizes of networks, we propose the use of Monte Carlo methods. However, the rate of convergence to the stationary distribution becomes a central issue. We discuss several approaches for determining the number of iterations necessary to achieve convergence of the Markov chain corresponding to a PBN. Using a recently introduced method based on the theory of two-state Markov chains, we illustrate the approach on a sub-network designed from human glioma gene expression data and determine the joint steadystate probabilities for several groups of genes.
On control of singleton attractors in multiple Boolean networks: integer programming-based method.
Qiu, Yushan; Tamura, Takeyuki; Ching, Wai-Ki; Akutsu, Tatsuya
2014-01-01
Boolean network (BN) is a mathematical model for genetic network and control of genetic networks has become an important issue owing to their potential application in the field of drug discovery and treatment of intractable diseases. Early researches have focused primarily on the analysis of attractor control for a randomly generated BN. However, one may also consider how anti-cancer drugs act in both normal and cancer cells. Thus, the development of controls for multiple BNs is an important and interesting challenge. In this article, we formulate three novel problems about attractor control for two BNs (i.e., normal cell and cancer cell). The first is about finding a control that can significantly damage cancer cells but has a limited damage to normal cells. The second is about finding a control for normal cells with a guaranteed damaging effect on cancer cells. Finally, we formulate a definition for finding a control for cancer cells with limited damaging effect on normal cells. We propose integer programming-based methods for solving these problems in a unified manner, and we conduct computational experiments to illustrate the efficiency and the effectiveness of our method for our multiple-BN control problems. We present three novel control problems for multiple BNs that are realistic control models for gene regulation networks and adopt an integer programming approach to address these problems. Experimental results indicate that our proposed method is useful and effective for moderate size BNs.
The boolean algebra with restricted variables as a tool for fault tree modularization
International Nuclear Information System (INIS)
Caldarola, L.; Wickenhaeuser, A.
1981-08-01
The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de
Construction of a fuzzy and Boolean logic gates based on DNA.
Zadegan, Reza M; Jepsen, Mette D E; Hildebrandt, Lasse L; Birkedal, Victoria; Kjems, Jørgen
2015-04-17
Logic gates are devices that can perform logical operations by transforming a set of inputs into a predictable single detectable output. The hybridization properties, structure, and function of nucleic acids can be used to make DNA-based logic gates. These devices are important modules in molecular computing and biosensing. The ideal logic gate system should provide a wide selection of logical operations, and be integrable in multiple copies into more complex structures. Here we show the successful construction of a small DNA-based logic gate complex that produces fluorescent outputs corresponding to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation
Pinilla, Samuel; Poveda, Juan; Arguello, Henry
2018-03-01
Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.
Nadkarni, P M
1997-08-01
Concept Locator (CL) is a client-server application that accesses a Sybase relational database server containing a subset of the UMLS Metathesaurus for the purpose of retrieval of concepts corresponding to one or more query expressions supplied to it. CL's query grammar permits complex Boolean expressions, wildcard patterns, and parenthesized (nested) subexpressions. CL translates the query expressions supplied to it into one or more SQL statements that actually perform the retrieval. The generated SQL is optimized by the client to take advantage of the strengths of the server's query optimizer, and sidesteps its weaknesses, so that execution is reasonably efficient.
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.
Ari, Eszter; Ittzés, Péter; Podani, János; Thi, Quynh Chi Le; Jakó, Eena
2012-04-01
Boolean analysis (or BOOL-AN; Jakó et al., 2009. BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction. Mol. Phylogenet. Evol. 52, 887-97.), a recently developed method for sequence comparison uses the Iterative Canonical Form of Boolean functions. It considers sequence information in a way entirely different from standard phylogenetic methods (i.e. Maximum Parsimony, Maximum-Likelihood, Neighbor-Joining, and Bayesian analysis). The performance and reliability of Boolean analysis were tested and compared with the standard phylogenetic methods, using artificially evolved - simulated - nucleotide sequences and the 22 mitochondrial tRNA genes of the great apes. At the outset, we assumed that the phylogeny of Hominidae is generally well established, and the guide tree of artificial sequence evolution can also be used as a benchmark. These offer a possibility to compare and test the performance of different phylogenetic methods. Trees were reconstructed by each method from 2500 simulated sequences and 22 mitochondrial tRNA sequences. We also introduced a special re-sampling method for Boolean analysis on permuted sequence sites, the P-BOOL-AN procedure. Considering the reliability values (branch support values of consensus trees and Robinson-Foulds distances) we used for simulated sequence trees produced by different phylogenetic methods, BOOL-AN appeared as the most reliable method. Although the mitochondrial tRNA sequences of great apes are relatively short (59-75 bases long) and the ratio of their constant characters is about 75%, BOOL-AN, P-BOOL-AN and the Bayesian approach produced the same tree-topology as the established phylogeny, while the outcomes of Maximum Parsimony, Maximum-Likelihood and Neighbor-Joining methods were equivocal. We conclude that Boolean analysis is a promising alternative to existing methods of sequence comparison for phylogenetic reconstruction and congruence analysis. Copyright Â© 2012 Elsevier Inc. All
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.
Directory of Open Access Journals (Sweden)
Shohag Barman
Full Text Available Inferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.In this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.Taken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.
International Nuclear Information System (INIS)
Piriou, Pierre-Yves; Faure, Jean-Marc; Lesage, Jean-Jacques
2017-01-01
This paper presents a modeling framework that permits to describe in an integrated manner the structure of the critical system to analyze, by using an enriched fault tree, the dysfunctional behavior of its components, by means of Markov processes, and the reconfiguration strategies that have been planned to ensure safety and availability, with Moore machines. This framework has been developed from BDMP (Boolean logic Driven Markov Processes), a previous framework for dynamic repairable systems. First, the contribution is motivated by pinpointing the limitations of BDMP to model complex reconfiguration strategies and the failures of the control of these strategies. The syntax and semantics of GBDMP (Generalized Boolean logic Driven Markov Processes) are then formally defined; in particular, an algorithm to analyze the dynamic behavior of a GBDMP model is developed. The modeling capabilities of this framework are illustrated on three representative examples. Last, qualitative and quantitative analysis of GDBMP models highlight the benefits of the approach.
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.
Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory
International Nuclear Information System (INIS)
Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S.
2013-01-01
Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices
Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin
2016-05-19
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.
Fusama, Mie; Miura, Yasushi; Yukioka, Kumiko; Kuroiwa, Takanori; Yukioka, Chikako; Inoue, Miyako; Nakanishi, Tae; Murata, Norikazu; Takai, Noriko; Higashi, Kayoko; Kuritani, Taro; Maeda, Keiji; Sano, Hajime; Yukioka, Masao; Nakahara, Hideko
2015-09-01
To evaluate whether the psychological state is related to the Boolean-based definition of patient global assessment (PGA) remission in patients with rheumatoid arthritis (RA). Patients with RA who met the criteria of swollen joint count (SJC) ≤ 1, tender joint count (TJC) ≤ 1 and C-reactive protein (CRP) ≤ 1 were divided into two groups, PGA remission group (PGA ≤ 1 cm) and non-remission group (PGA > 1 cm). Anxiety was evaluated utilizing the Hospital Anxiety and Depression Scale-Anxiety (HADS-A), while depression was evaluated with HADS-Depression (HADS-D) and the Center for Epidemiologic Studies Depression Scale (CES-D). Comparison analyses were done between the PGA remission and non-remission groups in HADS-A, HADS-D and CES-D. Seventy-eight patients met the criteria for SJC ≤ 1, TJC ≤ 1 and CRP ≤ 1. There were no significant differences between the PGA remission group (n = 45) and the non-remission group (n = 33) in age, sex, disease duration and Steinbrocker's class and stage. HADS-A, HADS-D and CES-D scores were significantly lower in the PGA remission group. Patients with RA who did not meet the PGA remission criteria despite good disease condition were in a poorer psychological state than those who satisfied the Boolean-based definition of clinical remission. Psychological support might be effective for improvement of PGA, resulting in the attainment of true remission.
Directory of Open Access Journals (Sweden)
Mahdieh Saadat Foomani
2017-01-01
Full Text Available Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where these special types of waste can be disposed of securely. Since landfills are permanent sites, special attention must be afforded in selecting the location. This paper investigated the use of the Boolean theory and Fuzzy logic in combination with Analytic Hierarchy Process (AHP methods by applying GIS and IDRISI software for the selection of a hazardous waste landfill site in the Iranian province of Hormozgan. The best location was determined via the Fuzzy and the Boolean methodologies. By collating the area selected for the hazardous waste landfill, this study found that Fuzzy logic with an AND operator had the best options for this purpose. In the end, the most suitable area for a hazardous waste landfill was about 1.6 km2 which was obtained by employing Fuzzy in combination with AHP and by using an AND operator. In addition, all the fundamental criteria affecting the landfill location were considered.
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
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.
Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing
2017-09-19
The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.
Directory of Open Access Journals (Sweden)
Alexander Schnell
Full Text Available In our paper, we analyze new exact approaches for the multi-mode resource-constrained project scheduling (MRCPSP problem with the aim of makespan minimization. For the single-mode RCPSP (SRCPSP recent exact algorithms combine a Branch and Bound algorithm with principles from Constraint Programming (CP and Boolean Satisfiability Solving (SAT. We extend the above principles for the solution of MRCPSP instances. This generalization is on the one hand achieved on the modeling level. We propose three CP-based formulations of the MRCPSP for the G12 CP platform and the optimization framework SCIP which both provide solution techniques combining CP and SAT principles. For one of the latter we implemented a new global constraint for SCIP, which generalizes the domain propagation and explanation generation principles for renewable resources in the context of multi-mode jobs. Our constraint applies the above principles in a more general way than the existing global constraint in SCIP. We compare our approaches with the state-of-the-art exact algorithm from the literature on MRCPSP instances with 20 and 30 jobs. Our computational experiments show that we can outperform the latter approach on these instances. Furthermore, we are the first to close (find the optimal solution and prove its optimality for 628 open instances with 50 and 100 jobs from the literature. In addition, we improve the best known lower bound of 2815 instances and the best known upper bound of 151 instances. Keywords: Multi-mode resource-constrained project scheduling, Constraint programming, SAT solving, SCIP, Lazy clause generation, Exact algorithm
Stochastic Pseudo-Boolean Optimization
2011-07-31
equivalence of (P1) and (P2). In the case r = 2, we explore how to improve the computational efficiency in terms of solving the proposed La - grangian...a general guideline for branching, our La - grangian relaxation method naturally lends itself to an efficient branching rule. For each xi, let wi = ∑ j...program- ming. Informatica , 3:225–240, 1992. [112] G. Palubeckis. Multistart tabu search strategies for the unconstrained binary quadratic opti
Generalized Boolean Functions as Combiners
2017-06-01
backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit between two parties as well as many...the backbone of many computer functions. Cryptography drives online commerce and allows privileged information safe transit be- tween two parties as...Functions 5 2.1 Linear Feedback Shift Registers . . . . . . . . . . . . . . . . . . 5 2.2 Combiners . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
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.
Financing Child Care. A Public Policy Report from the Ewing Marion Kauffman Foundation. Winter 2002.
Ewing Marion Kauffman Foundation, Kansas City, MO.
This public policy report focuses on financing child care in the United States. The report contains brief articles on the following topics: (1) child care wages in comparison to other positions; (2) benefits to businesses when employees have high-quality child care; (3) resources for funding early education systems; (4) comparison of the cost of…
Braggion, F. (Fabio); Dwarkasing, M. (Mintra); S. Ongena (Steven)
2017-01-01
textabstractWe empirically test if household wealth inequality affects borrowing constraints of young entrepreneurs. We construct a measure of wealth inequality at the US county level based on the distribution of financial rents in 2004. We find that in more unequal areas, entrepreneurs are less
Boolean Approach to Dichotomic Quantum Measurement Theories
Energy Technology Data Exchange (ETDEWEB)
Nagata, K. [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of); Nakamura, T. [Keio University, Yokohama (Japan); Batle, J. [Universitat de les Illes Balears, Balearic Islands (Spain); Abdalla, S. [King Abdulaziz University Jeddah, Jeddah (Saudi Arabia); Farouk, A. [Al-Zahra College for Women, Muscat (Egypt)
2017-02-15
Recently, a new measurement theory based on truth values was proposed by Nagata and Nakamura [Int. J. Theor. Phys. 55, 3616 (2016)], that is, a theory where the results of measurements are either 0 or 1. The standard measurement theory accepts a hidden variable model for a single Pauli observable. Hence, we can introduce a classical probability space for the measurement theory in this particular case. Additionally, we discuss in the present contribution the fact that projective measurement theories (the results of which are either +1 or −1) imply the Bell, Kochen, and Specker (BKS) paradox for a single Pauli observable. To justify our assertion, we present the BKS theorem in almost all the two-dimensional states by using a projective measurement theory. As an example, we present the BKS theorem in two-dimensions with white noise. Our discussion provides new insight into the quantum measurement problem by using this measurement theory based on the truth values.
On boolean combinations forming piecewise testable languages
Czech Academy of Sciences Publication Activity Database
Masopust, Tomáš; Thomazo, M.
2017-01-01
Roč. 682, June 19 (2017), s. 165-179 ISSN 0304-3975 Institutional support: RVO:67985840 Keywords : automata * languages * k-piecewise testability Subject RIV: BA - General Mathematics OBOR OECD: Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.698, year: 2016 http://www. science direct.com/ science /article/pii/S030439751730066X
Boolean-valued second-order logic
Ikegami, D.; Väänänen, J.
2015-01-01
In so-called full second-order logic, the second-order variables range over all subsets and relations of the domain in question. In so-called Henkin second-order logic, every model is endowed with a set of subsets and relations which will serve as the range of the second-order variables. In our
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. © 2015 The Author(s).
Cryptographic Properties of Monotone Boolean Functions
2016-01-01
of Fn 2 , we denote the inner product and the intersection, respectively, by x ⋅ y = x 1 y 1 + x 2 y 2 + ⋅ ⋅ ⋅ + xnyn , x ∗ y = (x1y1, x2y2...the subscript S, and write δ(u). For v ∈ Fn 2 , we use the usual multi-index notation xv for the product of variables, with indices running through the...distinct variables or not). Then, denoting g = (g 1 , . . . , gn), the vectorial composition f ∘ g (viewed as a function in the union of the vari- ables of
On boolean combinations forming piecewise testable languages
Czech Academy of Sciences Publication Activity Database
Masopust, Tomáš; Thomazo, M.
2017-01-01
Roč. 682, June 19 (2017), s. 165-179 ISSN 0304-3975 Institutional support: RVO:67985840 Keywords : automata * languages * k-piecewise testability Subject RIV: BA - General Mathematics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.698, year: 2016 http://www.sciencedirect.com/science/article/pii/S030439751730066X
Georgious, I. T.; Sun, C. T.
1992-01-01
The history of temperature rise due to internal dissipation of mechanical energy in insulated off-axis uniaxial specimens of the unidirectional thermoplastic composite (AS4/PEEK) has been measured. The experiment reveals that the rate of temperature rise is a polynomial function of stress amplitude: It consists of a quadratic term and a sixth power term. This fact implies that the specific heat of the composite depends on the stretching its microstructure undergoes during deformation. The Einstein theory for specific heat is used to explain the dependence of the specific heat on the stretching of the microstructure.
Convergence speed of consensus problems over undirected scale-free networks
International Nuclear Information System (INIS)
Sun Wei; Dou Li-Hua
2010-01-01
Scale-free networks and consensus behaviour among multiple agents have both attracted much attention. To investigate the consensus speed over scale-free networks is the major topic of the present work. A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions, while preserving the diversity of network topologies. The time cost or iterations for networks to reach a certain level of consensus is discussed, considering the influence from power-law parameters. They are both demonstrated to be reversed power-law functions of the algebraic connectivity, which is viewed as a measurement on convergence speed of the consensus behaviour. The attempts of tuning power-law parameters may speed up the consensus procedure, but it could also make the network less robust over time delay at the same time. Large scale of simulations are supportive to the conclusions. (general)
Stangler, Dane
2010-01-01
Into early 2010, more than two years after the recession began, the American economy continues to send out mixed signals with respect to economic recovery: GDP (gross domestic product) growth looks set to recover, while unemployment is projected to remain high for many more years. The most important economic matter facing the country is job…
Zarra, T; Giuliani, S; Naddeo, V; Belgiorno, V
2012-01-01
Odour emissions from wastewater treatment plants (WWTPs) are considered to be the main causes of disturbance noticed by the exposed population and have relevant impacts on both tourism economy and land costs. Odour impact from WWTPs is generated by primary and secondary odour emissions. Primary odour emissions are related especially to the wastewater type and variability discharged into the sewer and directed to the WWTP, and to the wastewater collection and sewage system. Secondary odours are related to the treatment units of the plant. Several studies describe the key role of primary odour emissions and how they are strongly related to odour impacts of WWTPs. In this way, a opportune characterization of the emission capacity of primary odour could be an effective way to control odour emission in the WWTPs. In this study the odour emission capacity (OEC) of different domestic sewers was described and investigated; a correlation between the OEC and the main physical-chemical parameters of wastewater quality was also carried out. Results of this study identify the optimum conditions for sampling and measuring OEC in wastewaters and define its dependence by wastewater quality. These results can contribute to setting the standards for the maximum odourant content of wastewater that are discharged into the publicly owned sewage system.
1990-06-01
void); static void cont2 (void); static void cont3 (void); static void cont4 (void); static void confimn__graph-exit(void); static void nornial-exit...attach [Pagedowni to the cont3 function * setonkey(0x I 00,cont3,0); LILNE WIDTH = 3; cls(1); drawRect(-309,210,310,-200,1 1); drawLine(- 100,-80...34,28); write-horz str(- 1 80,-98 ,Ŕ(-)" ,28); cont3 (); static void cont3 (void) /* attach [Pageup] to the cont2 function * setonkey(0x4900,cont2,0
Djalali, Sima; Ursprung, Nadine; Rosemann, Thomas; Senn, Oliver; Tandjung, Ryan
2015-11-01
The adoption and use of health information technology (IT) continues to grow around the globe. In Switzerland, the government nor professional associations have to this day provided incentives for health IT adoption. We aim to assess the proportion of physicians who are routinely working with electronic health data and describe to what extent physicians exchange electronic health data with peers and other health care providers. Additionally, we aim to estimate the effect of physicians' attitude towards health IT on the adoption of electronic workflows. Between May and July 2013, we conducted a cross-sectional survey of 1200 practice based physicians in Switzerland. Respondents were asked to report on their technical means and where applicable their paper-based workarounds to process laboratory data, examination results, referral letters and physician's letters. Physicians' view of barriers and facilitators towards health IT use was determined by a composite score. A response rate of 57.1% (n=685) was reached. The sample was considered to be representative for physicians in Swiss ambulatory care. 35.2% of the respondents documented patients' health status with the help of a longitudinal semi-structured electronic text record generated by one or more encounters in the practice. Depending on the task within a workflow, around 11-46% of the respondents stated to rely on electronic workflow practices to process laboratory and examination data and dispatch referral notes and physician's letters. The permanent use of electronic workflow processes was infrequent. Instead, respondents reported paper-based workarounds affecting specific tasks within a workflow. Physicians' attitude towards health IT was significantly associated with the adoption of electronic workflows (OR 1.04-1.31, p<0.05), but the effect sizes of factors related to the working environment (e.g., regional factors, medical specialty, type of practice) were larger. At present, only a few physicians in Swiss ambulatory care routinely work with electronic health data. Until more of their peers participate in electronic exchange of structured clinical information, most physicians will continue to stay in paper-based systems and workarounds. The survey found that physicians with a positive attitude towards health IT were more likely to adopt electronic workflows, but the impact is minor. It will likely be necessary to introduce financial incentives and develop national standards in order to promote the adoption by a critical mass of practicing clinicians. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.
Reconfigurable Boolean logic using magnetic single-electron transistors
Czech Academy of Sciences Publication Activity Database
Gonzalez-Zalba, M.F.; Ciccarelli, C.; Zarbo, Liviu; Irvine, A.C.; Campion, R.C.; Gallagher, B. L.; Jungwirth, Tomáš; Ferguson, A.J.; Wunderlich, Joerg
2015-01-01
Roč. 10, č. 4 (2015), e0125142 E-ISSN 1932-6203 R&D Projects: GA MŠk(CZ) LM2011026; GA ČR GB14-37427G EU Projects: European Commission(XE) 268066 - 0MSPIN Institutional support: RVO:68378271 Keywords : single-electron transitor * reconfigurable logic * ferromagnetic semiconductor Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 3.057, year: 2015
Affine Equivalence and Constructions of Cryptographically Strong Boolean Functions
2013-09-01
3 (mod n) aiaj, . . . , n⊕ i, j=1 i+j≡n (mod n) aiaj, n⊕ i=1 i+j≡1 (mod n) aiaj = C(a1, adn /2e+1, a2, adn /2e+2, . . . , adn /2e) if...a3, . . . , ak, a2k+1, ak+1) = C(a1, adn /2e+1, a2, adn /2e+2, . . . , adn /2e). 46 If n = 2k for k = 0, 1, 2, ..., n⊕ i=1 i+j≡2 (mod n) aiaj = a1a1...3.4.5, C(a1, . . . , an) 2 = C(a1, adn /2e+1, a2, adn /2e+2, . . . , adn /2e) = C((a1, . . . , an)Pτ ) = C(aτ(1), . . . , aτ(n)). 64 Therefore, (a1
On Weak and Strong 2k- bent Boolean Functions
2016-01-01
s8 (u) + β2Wf⊕ s8 (ū) + β3Wf⊕s2⊕ s8 (u) + β4Wf⊕s2⊕ s8 (ū) + β5Wf⊕s4⊕ s8 (u) + β6Wf⊕s4⊕ s8 (ū...β7Wf⊕s2⊕s4⊕ s8 (u) + β8Wf⊕s2⊕s4⊕ s8 (ū), where β1 = 1 + ζ + ζ2 + ζ3 + ζ4 + ζ5 + ζ6 + ζ7, β2 = 1− ζ + ζ2 − ζ3 + ζ4 − ζ5 + ζ6 − ζ7, β3 = 1 + ζ − ζ2 − ζ3...n odd hold, where: (i) f⊕ s8 is bent-negabent-octabent with the conditions that (Wf⊕ s8 (u), Wf⊕ s8 (ū), Wf⊕s2⊕ s8 (u), Wf⊕s2⊕ s8 (ū), Wf⊕s4⊕ s8 (u), Wf⊕s4⊕ s8
On bent and semi-bent quadratic Boolean functions
DEFF Research Database (Denmark)
Charpin, P.; Pasalic, Enes; Tavernier, C.
2005-01-01
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...... correlation and high nonlinearity. We say that such a sequence is generated by a semi-bent function. Some new families of such function, represented by f(x) = Sigma(i=1)(n-1/2) c(i)Tr(x(2t+1)), n odd and c(i) is an element of F-2, have recently (2002) been introduced by Khoo et al. We first generalize....... The 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...
Adaptive Eager Boolean Encoding for Arithmetic Reasoning in Verification
2005-05-01
satisfy E 0 , the following equality also holds: Y 2 (º 2 ( 0 ² (4.8) Note that for some # , tk , and $ ,up , if # $ , then we must have ô...equality with uninterpreted functions. In Correct Hardware Design and Veri- fication Methods (CHARME ’99), pages 37–53, September 1999. [159] Girish
Fitting Boolean networks from steady state perturbation data.
Almudevar, Anthony; McCall, Matthew N; McMurray, Helene; Land, Hartmut
2011-10-05
Gene perturbation experiments are commonly used for the reconstruction of gene regulatory networks. Typical experimental methodology imposes persistent changes on the network. The resulting data must therefore be interpreted as a steady state from an altered gene regulatory network, rather than a direct observation of the original network. In this article an implicit modeling methodology is proposed in which the unperturbed network of interest is scored by first modeling the persistent perturbation, then predicting the steady state, which may then be compared to the observed data. This results in a many-to-one inverse problem, so a computational Bayesian approach is used to assess model uncertainty. The methodology is first demonstrated on a number of synthetic networks. It is shown that the Bayesian approach correctly assigns high posterior probability to the network structure and steady state behavior. Further, it is demonstrated that where uncertainty of model features is indicated, the uncertainty may be accurately resolved with further perturbation experiments. The methodology is then applied to the modeling of a gene regulatory network using perturbation data from nine genes which have been shown to respond synergistically to known oncogenic mutations. A hypothetical model emerges which conforms to reported regulatory properties of these genes. Furthermore, the Bayesian methodology is shown to be consistent in the sense that multiple randomized applications of the fitting algorithm converge to an approximately common posterior density on the space of models. Such consistency is generally not feasible for algorithms which report only single models. We conclude that fully Bayesian methods, coupled with models which accurately account for experimental constraints, are a suitable tool for the inference of gene regulatory networks, in terms of accuracy, estimation of model uncertainty, and experimental design.
Novel Prostate Cancer Pathway Modeling using Boolean Implication
2012-09-01
cause of cancer deaths in men. Diagnosis and pathogenesis of this disease is poorly understood. Prostate specific antigen (PSA) test is still the...cells (Supplementary Fig. 13a,b). We also noticed that MUC2+/TFF3high cells, for the most part, did not express CFTR, the gene mutated in cystic ... fibrosis . The differential expression of DLL4 is of potential rele- vance to the clinical development of novel anti-tumor therapeutic agents directed
Marking for Structure using Boolean Feedback | Louw | Journal for ...
African Journals Online (AJOL)
This paper presents evidence that marking student texts with well considered checklists is more effective than marking by hand. An experiment conducted on first-year students illustrated that the checklists developed to mark introductions, conclusions and paragraphs yielded better revision results than handwritten ...
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
Bose, Saurabh; Lawrence, Celestine Preetham; Liu, Zhihua; Makarenko, K.S.; van Damme, Rudolf M.J.; Broersma, Haitze J.; van der Wiel, Wilfred Gerard
2015-01-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
On bent and semi-bent quadratic Boolean functions
DEFF Research Database (Denmark)
Charpin, P.; Pasalic, Enes; Tavernier, C.
2005-01-01
The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross...... their results to even n. We further investigate the conditions on the choice of ci for explicit definitions of new infinite families having three and four trace terms. Also, a class of nonpermutation polynomials whose composition with a quadratic function yields again a quadratic semi-bent function is specified...
On a Conjecture for Balanced Symmetric Boolean Functions
2009-01-01
Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law...Alexanderson, Sums of partition sets in generalized Pascal triangles I, Fibonacci Quarterly 14 (1976), pp. 117–125. [8] T. Lengyel, On the order of lacunary
Non-Boolean computing with nanomagnets for computer vision applications.
Bhanja, Sanjukta; Karunaratne, D K; Panchumarthy, Ravi; Rajaram, Srinath; Sarkar, Sudeep
2016-02-01
The field of nanomagnetism has recently attracted tremendous attention as it can potentially deliver low-power, high-speed and dense non-volatile memories. It is now possible to engineer the size, shape, spacing, orientation and composition of sub-100 nm magnetic structures. This has spurred the exploration of nanomagnets for unconventional computing paradigms. Here, we harness the energy-minimization nature of nanomagnetic systems to solve the quadratic optimization problems that arise in computer vision applications, which are computationally expensive. By exploiting the magnetization states of nanomagnetic disks as state representations of a vortex and single domain, we develop a magnetic Hamiltonian and implement it in a magnetic system that can identify the salient features of a given image with more than 85% true positive rate. These results show the potential of this alternative computing method to develop a magnetic coprocessor that might solve complex problems in fewer clock cycles than traditional processors.
Finding small OBDDs for incompletely specified truth tables is hard
DEFF Research Database (Denmark)
Kristensen, Jesper Torp; Miltersen, Peter Bro
2006-01-01
We present an efficient reduction mapping undirected graphs G with n = 2^k vertices for integers k to tables of partially specified Boolean functions g: {0,1}^(4k+1) -> {0,1,*} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary...... decision diagram with at most (2m + 2)n^2 + 4n decision nodes. From this it follows that the problem of finding a minimum-sized consistent OBDD for an incompletely specified truth table is NP-hard and also hard to approximate...
Finding small OBDDs for incompletely specified truth tables is hard
DEFF Research Database (Denmark)
Miltersen, Peter Bro; Kristensen, Jesper Torp
2006-01-01
We present an efficient reduction mapping undirected graphs G with n = 2^k vertices for integers k to tables of partially specified Boolean functions g: {0,1}^(4k+1) -> {0,1,*} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary dec...... decision diagram with at most (2m + 2)n^2 + 4n decision nodes. From this it follows that the problem of finding a minimum-sized consistent OBDD for an incompletely specified truth table is NP-hard and also hard to approximate....
Directory of Open Access Journals (Sweden)
Augustine Y. Dzathor
2013-07-01
Full Text Available This study attempts to revive and clarify the debate on ‘the entrepreneurial man’. We longitudinally examined the effects of seven founding-owner-operator characteristics (prior industry experience, level of formal education, age, gender, ethnicity and time committed to business operations on nascent venture performance. Our results indicate that owner work experience, level of education and hours worked in the business have significant effect on nascent venture performance, while inadequate owner reputation and luck of ethnic social capital may negatively affect nascent venture performance. Our findings also suggest that characteristic of the ‘entrepreneurial man’ are dynamic and leans towards a temporal contingency model. Different entrepreneur characteristics seem to assume prominence in firm performance at different times in a nascent venture’s life trajectory.
Rankin, Blake M; Ben-Amotz, Dor; Widom, B
2015-09-14
Molecular processes, ranging from hydrophobic aggregation and protein binding to mesoscopic self-assembly, are typically driven by a delicate balance of energetic and entropic non-covalent interactions. Here, we focus on a broad class of such processes in which multiple ligands bind to a central solute molecule as a result of solute-ligand (direct) and/or ligand-ligand (cooperative) interaction energies. Previously, we described a weighted random mixing (WRM) mean-field model for such processes and compared the resulting adsorption isotherms and aggregate size distributions with exact finite lattice (FL) predictions, for lattices with up to n = 20 binding sites. Here, we compare FL predictions obtained using both Bethe-Guggenheim (BG) and WRM approximations, and find that the latter two approximations are complementary, as they are each most accurate in different aggregation regimes. Moreover, we describe a computationally efficient method for exhaustively counting nearest neighbors in FL configurations, thus making it feasible to obtain FL predictions for systems with up n = 48 binding sites, whose properties approach the thermodynamic (infinite lattice) limit. We further illustrate the applicability of our results by comparing lattice model and molecular dynamics simulation predictions pertaining to the aggregation of methane around neopentane.
Bent and bent(4) spectra of Boolean functions over finite fields
DEFF Research Database (Denmark)
Anbar Meidl, Nurdagül; Meidl, Wilfried
2017-01-01
to the conventional Walsh transform, and hence a 0-bent4 function is bent. In this article we generalize the concept of partially bent functions to the transforms V-f(c). We show that every quadratic function is partially bent, and hence it is plateaued with respect to any of the transforms V-f(c). In detail we...... analyse two quadratic monomials. The first has values as small as possible in its spectra with respect to all transforms V-f(c), and the second has a flat spectrum for a large number of c. Moreover, we show that every quadratic function is c-bent4 for at least three distinct c. In the last part we analyse...... a cubic monomial. We show that it is c-bent(4) only for c = 1, the function is then called negabent, which shows that non-quadratic functions exhibit a different behaviour. (C) 2017 Elsevier Inc. All rights reserved....
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure
Czech Academy of Sciences Publication Activity Database
Fränzle, M.; Herde, C.; Teige, T.; Ratschan, Stefan; Schubert, T.
2007-01-01
Roč. 1, - (2007), s. 209-236 ISSN 1574-0617 Grant - others:AVACS(DE) SFB/TR 14 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval-based arithmetic constraint solving * SAT modulo theories Subject RIV: BA - General Mathematics
Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.
Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence
2012-01-01
Abstract Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. Background There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real...
A Boolean extension of a frame and a representation of discontinuity ...
African Journals Online (AJOL)
Point-free modeling of mappings that are not necessarily continuous has been so far based on the extension of a frame to its frame of sublocales, mimicking the replacement of a topological space by its discretization. This otherwise successful procedure has, however, certain disadvantages making it not quite parallel with ...
Boolean Reasoning and Informed Search in the Minimization of Logic Circuits
1992-03-01
prime implicants, and the set LABS of labels, the formula F is formed in the following manner: Step 1. Combine the sets PSoa ,,ch and PSu,,a of labels to...program. This allowed experimentation to determine the strengths and weaknesses of each program. Based on the experiments, the authors of the program
Gschwind, Michael K [Chappaqua, NY
2011-03-01
Mechanisms for implementing a floating point only single instruction multiple data instruction set architecture are provided. A processor is provided that comprises an issue unit, an execution unit coupled to the issue unit, and a vector register file coupled to the execution unit. The execution unit has logic that implements a floating point (FP) only single instruction multiple data (SIMD) instruction set architecture (ISA). The floating point vector registers of the vector register file store both scalar and floating point values as vectors having a plurality of vector elements. The processor may be part of a data processing system.
LTREE - a lisp-based algorithm for cutset generation using Boolean reduction
International Nuclear Information System (INIS)
Finnicum, D.J.; Rzasa, P.W.
1985-01-01
Fault tree analysis is an important tool for evaluating the safety of nuclear power plants. The basic objective of fault tree analysis is to determine the probability that an undesired event or combination of events will occur. Fault tree analysis involves four main steps: (1) specifying the undesired event or events; (2) constructing the fault tree which represents the ways in which the postulated event(s) could occur; (3) qualitative evaluation of the logic model to identify the minimal cutsets; and (4) quantitative evaluation of the logic model to determine the probability that the postulated event(s) will occur given the probability of occurrence for each individual fault. This paper describes a LISP-based algorithm for the qualitative evaluation of fault trees. Development of this algorithm is the first step in a project to apply expert systems technology to the automation of the fault tree analysis process. The first section of this paper provides an overview of LISP and its capabilities, the second section describes the LTREE algorithm and the third section discusses the on-going research areas
Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer
2012-03-01
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE...BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR...believing in me. I thank my mother-in- law , Denise, and her husband, Rodney, for their support during some critical times. Without the tireless efforts of
From Boolean logic to switching circuits and automata. Towards modern information technology
Energy Technology Data Exchange (ETDEWEB)
Stankovic, Radomir S. [Nis Univ. (RS). Dept. of Computer Science; Astola, Jaakko [Tampere Univ. of Technology (Finland). Dept. of Signal Processing
2011-07-01
Logic networks and automata are facets of digital systems. The change of the design of logic networks from skills and art into a scientific discipline was possible by the development of the underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented in the works by George J. Boole and the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of the work by other scholars. The formulation and rise of Switching Theory is such an example. This book presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it. The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious. Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic. (orig.)
Directory of Open Access Journals (Sweden)
Richard J. Epstein
2009-08-01
Full Text Available Two problems now threaten the future of anticancer drug development: (i the information explosion has made research into new target-specific drugs more duplication-prone, and hence less cost-efficient; and (ii high-throughput genomic technologies have failed to deliver the anticipated early windfall of novel first-in-class drugs. Here it is argued that the resulting crisis of blockbuster drug development may be remedied in part by innovative exploitation of informatic power. Using scenarios relating to oncology, it is shown that rapid data-mining of the scientific literature can refine therapeutic hypotheses and thus reduce empirical reliance on preclinical model development and early-phase clinical trials. Moreover, as personalised medicine evolves, this approach may inform biomarker-guided phase III trial strategies for noncytotoxic (antimetastatic drugs that prolong patient survival without necessarily inducing tumor shrinkage. Though not replacing conventional gold standards, these findings suggest that this computational research approach could reduce costly ‘blue skies’ R&D investment and time to market for new biological drugs, thereby helping to reverse unsustainable drug price inflation.
Directory of Open Access Journals (Sweden)
Richard J. Epstein
2009-01-01
Full Text Available Two problems now threaten the future of anticancer drug development: (i the information explosion has made research into new target-specific drugs more duplication-prone, and hence less cost-efficient; and (ii high-throughput genomic technologies have failed to deliver the anticipated early windfall of novel first-in-class drugs. Here it is argued that the resulting crisis of blockbuster drug development may be remedied in part by innovative exploitation of informatic power. Using scenarios relating to oncology, it is shown that rapid data-mining of the scientific literature can refine therapeutic hypotheses and thus reduce empirical reliance on preclinical model development and early-phase clinical trials. Moreover, as personalised medicine evolves, this approach may inform biomarker-guided phase III trial strategies for noncytotoxic (antimetastatic drugs that prolong patient survival without necessarily inducing tumor shrinkage. Though not replacing conventional gold standards, these findings suggest that this computational research approach could reduce costly ‘blue skies’ R&D investment and time to market for new biological drugs, thereby helping to reverse unsustainable drug price inflation.
2015-12-24
T P(t), (81) where T is the clock period, and for the inexact circuit the energy is Ẽ(t) = T P̃(t). (82) In digital circuits , the total power P...Y , Cb, or Cr) data X input vector to a digital logic circuit Y output of a digital logic circuit Y luminance Z quantization factor matrix zi,j (i...accuracy in digital logic circuits . The contribution of this research will be to advance the state of the art of inexact computing by optimizing the JPEG
The Boolean Algebra of Cubical Areas as a Tensor Product in the Category of Semilattices with Zero
Directory of Open Access Journals (Sweden)
Nicolas Ninin
2014-10-01
Full Text Available In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such programs are given a semantics using cubical areas. Such a semantics is said to be geometric. The collection of all these cubical areas enjoys a structure of tensor product in the category of semi-lattice with zero. These results naturally extend to fully fledged concurrent programs up to some technical tricks.
Cohen, Daniel H
2012-01-01
To evaluate methods of logic, set theory, and information theory in developing a conceptual framework that would be useful in an educational process as well as in developing a consistent and rational method for hospital status determination. To implement these methods on a daily basis in interaction with nurse case managers, physicians, and in documentation of the process. A tertiary private, not-for-profit institution within the department of case management and utilization review. These methods were well accepted by those involved in the decision process and allowed a Case Management Assignment Protocol to function well in the hospital environment with a low level of disagreement and conflict. Medical information can be processed effectively with conceptual models of logic and information theory. The used commercial screening systems are described well by set theory and are intersecting sets of patient variables and characteristics. These methods can be used in educational processes in practice settings apart from those using the Case Management Assignment Protocol. It provides a basis for evaluation of patients' presentations that use important factors such as clinical uncertainty, patient specific data, and reference to preexisting admission criteria.
Hariharan, S.; Karthikeyan, B.
2018-03-01
In the evolution of nanotechnology research for smart and precise sensor fabrication, here we report the implementation of simple logic gate operations performing by luminescent nanostructures in biomolecule environment based on photoluminescence (PL) technique. This present work deals with the luminescence property of α-Bi2O3 and Ag modified α-Bi2O3 nanostructures for D-glucose and Bovine serum albumin (BSA) sensing applications. These nanostructures are prepared by simple co-precipitation method and their morphology are examined using transmission electron microscope (TEM). We explore the PL characteristics of the prepared nanostructures and observe their change in PL intensity in the presence of D-glucose and BSA molecules. Enhancement in PL intensity is observed in the presence of D-glucose and BSA. Based on the PL response of prepared nanostructures in the biomolecule environment, we demonstrate biophotonic logic gates including YES, PASS 0, OR and INHIBIT gates.
Cells adapt to their environment via homeostatic processes that are regulated by complex molecular networks. Our objective was to learn key elements of these networks in HepG2 cells using ToxCast High-content imaging (HCI) measurements taken over three time points (1, 24, and 72h...
Zohuri, Bahman
2017-01-01
This book provides a technical approach to a Business Resilience System with its Risk Atom and Processing Data Point based on fuzzy logic and cloud computation in real time. Its purpose and objectives define a clear set of expectations for Organizations and Enterprises so their network system and supply chain are totally resilient and protected against cyber-attacks, manmade threats, and natural disasters. These enterprises include financial, organizational, homeland security, and supply chain operations with multi-point manufacturing across the world. Market shares and marketing advantages are expected to result from the implementation of the system. The collected information and defined objectives form the basis to monitor and analyze the data through cloud computation, and will guarantee the success of their survivability's against any unexpected threats. This book will be useful for advanced undergraduate and graduate students in the field of computer engineering, engineers that work for manufacturing com...
PREFACE: Complex Networks: from Biology to Information Technology
Barrat, A.; Boccaletti, S.; Caldarelli, G.; Chessa, A.; Latora, V.; Motter, A. E.
2008-06-01
networks consists of an overview of recent studies on hierarchical networks of phase oscillators. By analysing the evolution of the synchronous dynamics, one can infer details about the underlying network topology. Thus a connection between the dynamical and topological properties of the system is established. The paper Network synchronisation: optimal and pessimal scale-free topologies by Donetti et al explores an optimisation algorithm to study the properties of optimally synchronisable unweighted networks with scale-free degree distribution. It is shown that optimisation leads to a tendency towards disassortativity while networks that are optimally 'un-synchronisable' have a highly assortative string-like structure. The paper Critical line in undirected Kauffman Boolean networks—the role of percolation by Fronczak and Fronczak demonstrates that the percolation underlying the process of damage spreading impacts the position of the critical line in random boolean networks. The critical line results from the fact that the ordered behaviour of small clusters shields the chaotic behaviour of the giant component. In Impact of the updating scheme on stationary states of networks, Radicchi et al explore an interpolation between synchronous and asynchronous updating in a one-dimensional chain of Ising spins to locate a phase transition between phases with an absorbing and a fluctuating stationary state. The properties of attractors in the yeast cell-cycle network are also shown to depend sensitively on the updating mode. As this last contribution shows, a large part of the theoretical activity in the field can be applied to the study of biological systems. The section Biological Applications brings together the following contributions: In Applying weighted network measures to microarray distance matrices, Ahnert et al present a new approach to the analysis of weighted networks, which provides a generalisation to any network measure defined on unweighted networks. The
Analysis problems for sequential dynamical systems and communicating state machines
Energy Technology Data Exchange (ETDEWEB)
Barrett, C. L. (Christopher L.); Hunt, H. B. (Harry B.); Marathe, M. V. (Madhav V.); Ravi, S. S.; Rosenkrantz, D. J. (Daniel J.); Stearns, R. E. (Richard E.)
2001-01-01
A simple sequential dynamical system (SDS) is a triple (G, F, {pi}), where (i) G(V, E) is an undirected graph with n nodes with each node having a 1-bit state, (ii) F = {l_brace} f{sub 1},f{sub 2},...,f{sub n}{r_brace} is a set of local transition functions with f{sub i} denoting a Boolean function associated with node Vv{sub i} and (iii) {pi} is a fixed permutation of (i.e., a total order on) the nodes in V. A single SDS transition is obtained by updating the states of the nodes in V by evaluating the function associated with each of them in the order given by {pi}. Such a (finite) SDS is a mathematical abstraction of simulation systems [BMR99, BR99]. In this paper, we characterize the computational complexity of determining several phase space properties of SDSs. The properties considered are t-REACHABILITY ('Can a given SDS starting from configuration I reach configuration B in t or fewer transitions?'), REACHABILITY('Can a given SDS starting from configuration I ever reach configuration B?') and FIXED POINT REACHABILITY ('Can a given SDS starting from configuration I ever reach configuration in which it stays for ever?'). Our main result is a sharp dichotomy between classes of SDSs whose behavior is 'easy' to predict and those whose behavior is 'hard' to predict. Specifically, we show the following. (1) The t-REACHABILITY, REACHABILITY and the FIXED POINT REACHABILITY problems for SDSs are PSPACE-complete, even when restricted to graphs of bounded bandwidth (and hence of bounded pathwidth and treewidth) and when the function associated with each node is symmetric. The result holds even for regular graphs of constant degree where all the nodes compute the same symmetric Boolean function. (2) In contrast, the t-REACHABILITYm REACHABILITY and FIXED POINT REACHABILITY problems are solvable in polynomial time for SDSs when the Boolean function associated with each node is symmetric and monotone. Two important
Learning Statistical Patterns in Relational Data Using Probabilistic Relational Models
National Research Council Canada - National Science Library
Koller, Daphne
2005-01-01
.... This effort focused on developing undirected probabilistic models for representing and learning graph patterns, learning patterns involving links between objects, learning discriminative models...
International Nuclear Information System (INIS)
Blanca, Ernest
1974-10-01
Alpha-numeric boolean expressions, written in the form of sums of products and/or products of sums with many brackets, may be minimized in two steps: syntaxic recognition analysis using precedence operator grammar, syntaxic reduction analysis. These two phases of execution and the different programs of the corresponding machine algorithm are described. Examples of minimization of alpha-numeric boolean expressions written with the help of brackets, utilisation note of the program CHOPIN and theoretical considerations related to language, grammar, precedence operator grammar, sequential systems, boolean sets, boolean representations and treatments of boolean expressions, boolean matrices and their use in grammar theory, are discussed and described. (author) [fr
Khovanov-Rozansky Graph Homology and Composition Product
DEFF Research Database (Denmark)
Wagner, Emmanuel
2008-01-01
In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov–Rozansky graph homology.......In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov–Rozansky graph homology....
Business (and crises) as usual
Energy Technology Data Exchange (ETDEWEB)
1980-05-12
Steven K. Kauffman, general manager of the New York City Transit Authority, is interviewed concerning his views on: the transit authority's equipment shortage; plans for aquiring new and rebuilt subway and rail cars during 1980; a long-range study that indicates the transit authority needs $18 billion during the next 10 years to completely rebuild itself; and the effects of the energy crisis on ridership trends and operating costs. Kauffman cites a lack of knowlegable workers as the transit authority's biggest single problem. (2 graphs, 2 photos)
Chinese Postman Problem on edge-colored multigraphs
DEFF Research Database (Denmark)
Gutin, Gregory; Jones, Mark; Sheng, Bin
2017-01-01
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges......, for which the problem is NP-hard....
DEFF Research Database (Denmark)
Jensen, Finn Verner; Lauritzen, Steffen Lilholt
2001-01-01
This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs.......This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs....
Southwest Energy Innovation Forum: Summary Report
Ewing Marion Kauffman Foundation, 2010
2010-01-01
The Ewing Marion Kauffman Foundation, Arizona State University (ASU), and U.S. Department of Energy's Advanced Research Projects Agency-Energy (ARPA-E) co-convened a conference on Energy Innovation in the Southwest region of the United States that included participation by entrepreneurs, state government officials, representatives of academia,…
Ewing Marion Kauffman Foundation, Kansas City, MO.
For some time the Ewing Marion Kauffman Foundation has been studying the attributes that characterize effective nonprofit organizations. These attributes were identified after a review of the literature, discussions with national leaders, meetings with administrators and funders of nonprofit organizations, and the information from case studies by…
Project Choice: Lessons Learned.
Ewing Marion Kauffman Foundation, Kansas City, MO.
Project Choice began with a simple goal: to increase the number of inner-city students who graduate from high school on time and become productive members of society. To that end, Ewing M. Kauffman, his Foundation, and associates designed and implemented a program that promised postsecondary education or training to some students in the Kansas…
A Clean Energy Roadmap: Forging the Path Ahead
Ewing Marion Kauffman Foundation, 2010
2010-01-01
In 2010, the Ewing Marion Kauffman Foundation co-convened three cross-sector summits to develop recommendations for growing energy innovation in the United States. The first summit was held in Washington, D.C., on May 7, 2010, in partnership with the White House. Gallup and the city of Omaha, Nebraska, hosted the second summit on June 16, 2010,…
Ewing Marion Kauffman Foundation, 2011
2011-01-01
An August 2010 Harris Interactive[R] survey, commissioned by the Ewing Marion Kauffman Foundation, posed questions about entrepreneurship to 5,077 U.S. young people ages eight to twenty-four. The results show that business ownership continues to capture the imaginations of America's youth, particularly for those who know a successful entrepreneur…
Both Suspension and Alternatives Work, Depending on One's Aim
Bear, George G.
2012-01-01
In this commentary on the special series, I argue that whereas a zero-tolerance approach to school discipline is "something stupid" (Kauffman & Brigham, 2000) the use of suspension might not be. Despite its limitations, suspension and other forms of punishment serve as effective deterrents of behavior problems for most children, especially when…
76 FR 70711 - Senior Executive Service; Performance Review Board
2011-11-15
..., HARDEV S KAEMPF, DOUGLAS E KANE, MICHAEL C KAPLAN, STAN M KAUFFMAN, RICHARD L KEARNEY, JAMES H KELLY..., DANIEL KEITH HOFFMAN, DENNIS J HOGAN, KATHLEEN B HOLECEK, MARK L HOLLAND, MICHAEL D HOLLAND, MICHAEL J HOLLETT, DOUGLAS W HOLLRITH, JAMES W HORTON, LINDA L HOWARD, MICHAEL F HOWELL JR, J T HUIZENGA, DAVID G...
Flux balance analysis of genome-scale metabolic model of rice ...
Indian Academy of Sciences (India)
2015-09-28
Sep 28, 2015 ... genome-scale metabolic model of rice leaf using Flux Balance Analysis to investigate whether it has potential .... is number of reactions. In steady state. S.v = 0. (2) where v is the flux vector of reactions (Kauffman et al. 2003). Objective function is. Z = w.v. (3). 820 .... All the reactions are not included.
2725-IJBCS-Article-Taiye Shade Olusegun
African Journals Online (AJOL)
hp
Sex education should be introduced as a means of increasing students' awareness of infections and ... life-threatening, invasive disease (Kauffman ..... Itching. Vaginal discharge. Abdominal. Pain. Painful urination. Burning feeling. Redness/ soreness. Pelvic pain. 16 – 20 44. 6 (13.6). 7 (15.9). 10 (22.7). 4 (9.1). 6 (13.6).
Shifting Niches for Community Structure Detection
DEFF Research Database (Denmark)
Grappiolo, Corrado; Togelius, Julian; Yannakakis, Georgios N.
2013-01-01
We present a new evolutionary algorithm for com- munity structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure...
African Journals Online (AJOL)
ES Obe
. Eulerian graphs uses two of the techniques commonly employed for travelling salesman problem (TSP). In the case of undirected graphs, the problem is formulated as an integer linear programming typically containing a large constraint set.
A PLUG-AND-PLAY ARCHITECTURE FOR PROBABILISTIC PROGRAMMING
2017-04-01
presented in " Artificial Intelligence : A Modern Approach", 2nd ed., p. 494. */ random Boolean Earthquake ~ BooleanDistrib(0.002); random Boolean...inference. Artificial Intelligence and Statistics, 2014 [11] Taisuke Sato and Yoshitaka Kameya. PRISM: A language for symbolic-statistical modeling...if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS. 1. REPORT DATE (DD-MM-YYYY) APRIL
A new construction of highly nonlinear S-boxes
DEFF Research Database (Denmark)
Beelen, Peter; Leander, Gregor
2012-01-01
In this paper we give a new construction of highly nonlinear vectorial Boolean functions. This construction is based on coding theory, more precisely we use concatenation to construct Boolean functions from codes over $\\mathbb{F}_q$ containing a first-order generalized Reed–Muller code. As it turns...... out this construction has a very compact description in terms of Boolean functions, which is of independent interest. The construction allows one to design functions with better nonlinearities than known before....
Directory of Open Access Journals (Sweden)
José Jairo Soriano Méndez
2012-06-01
Full Text Available This paper proposes the analysis and design of a Temperature Fuzzy controller using concresor based on Boolean relations (CBR. Firstly, presents the design of a Boolean controller. Later, fuzzy controller is designed based on Boolean controller raised previously. The control surfaces with and without simplification, show the features of proposes methodology. Additionally we analyze the effects of the simplifications made in the control rules.
State spaces of orthomodular structures
Navara, Mirko
2000-01-01
We present several known and one new description of orthomodular structures (orthomodular lattices, orthomodular posets and orthoalgebras). Originally, orthomodular structures were viewed as pasted families of Boolean algebras. Here we introduce semipasted families of Boolean algebras as an alternative description which is not as detailed, but substantially simplex. Semipasted families of Boolean algebras correspond to orthomodular structures in such a way that states and evaluation functiona...
Logic without energy or bandwidth limits
Caulfield, Henry J.; Westphal, Jonathan
2003-07-01
Boolean logic is an inherently irreversible, hence lossy operation. It has a well-known energy cost and an obvious time cost. To avoid those costs, we must do a different kind of logic. But, it is Boolean logic that we wish to do. We solved that dilemma by using a quantum optical logic gate that is fully reversible that yields the Boolean result after the irreversible loss of information in detection occurs.
Wang, Rong; Wang, Li; Yang, Yong; Li, Jiajia; Wu, Ying; Lin, Pan
2016-11-01
Attention deficit hyperactivity disorder (ADHD) is the most common childhood neuropsychiatric disorder and affects approximately 6 -7 % of children worldwide. Here, we investigate the statistical properties of undirected and directed brain functional networks in ADHD patients based on random matrix theory (RMT), in which the undirected functional connectivity is constructed based on correlation coefficient and the directed functional connectivity is measured based on cross-correlation coefficient and mutual information. We first analyze the functional connectivity and the eigenvalues of the brain functional network. We find that ADHD patients have increased undirected functional connectivity, reflecting a higher degree of linear dependence between regions, and increased directed functional connectivity, indicating stronger causality and more transmission of information among brain regions. More importantly, we explore the randomness of the undirected and directed functional networks using RMT. We find that for ADHD patients, the undirected functional network is more orderly than that for normal subjects, which indicates an abnormal increase in undirected functional connectivity. In addition, we find that the directed functional networks are more random, which reveals greater disorder in causality and more chaotic information flow among brain regions in ADHD patients. Our results not only further confirm the efficacy of RMT in characterizing the intrinsic properties of brain functional networks but also provide insights into the possibilities RMT offers for improving clinical diagnoses and treatment evaluations for ADHD patients.
Bypassing BDD Construction for Reliability Analysis
DEFF Research Database (Denmark)
Williams, Poul Frederick; Nikolskaia, Macha; Rauzy, Antoine
2000-01-01
In this note, we propose a Boolean Expression Diagram (BED)-based algorithm to compute the minimal p-cuts of boolean reliability models such as fault trees. BEDs make it possible to bypass the Binary Decision Diagram (BDD) construction, which is the main cost of fault tree assessment.......In this note, we propose a Boolean Expression Diagram (BED)-based algorithm to compute the minimal p-cuts of boolean reliability models such as fault trees. BEDs make it possible to bypass the Binary Decision Diagram (BDD) construction, which is the main cost of fault tree assessment....
Data Centre Infrastructure & Data Storage @ Facebook
CERN. Geneva; Garson, Matt; Kauffman, Mike
2018-01-01
Several speakers from the Facebook company will present their take on the infrastructure of their Data Center and Storage facilities, as follows: 10:00 - Facebook Data Center Infrastructure, by Delfina Eberly, Mike Kauffman and Veerendra Mulay Insight into how Facebook thinks about data center design, including electrical and cooling systems, and the technology and tooling used to manage data centers. 11:00 - Storage at Facebook, by Matt Garson An overview of Facebook infrastructure, focusing on different storage systems, in particular photo/video storage and storage for data analytics. About the speakers Mike Kauffman, Director, Data Center Site Engineering Delfina Eberly, Infrastructure, Site Services Matt Garson, Storage at Facebook Veerendra Mulay, Infrastructure
Proving a market for a startup befor scaling using the hypothesis-driven entrepreneurship process
Zyznewsky, Marko
2016-01-01
The year is 2015 and the startup and tech business ecosphere has never seen more activity. In New York City alone, the tech startup industry is on track to amass $8 billion dollars in total funding – the highest in 7 years (CB Insights, 2015). According to the Kauffman Index of Entrepreneurship (2015), this figure represents just 20% of the total funding in the United States. Thanks to platforms that link entrepreneurs with investors, there are simply more funding opportunities...
Adaptive walks on time-dependent fitness landscapes
Wilke, Claus O.; Martinetz, Thomas
1999-01-01
The idea of adaptive walks on fitness landscapes as a means of studying evolutionary processes on large time scales is extended to fitness landscapes that are slowly changing over time. The influence of ruggedness and of the amount of static fitness contributions are investigated for model landscapes derived from Kauffman's $NK$ landscapes. Depending on the amount of static fitness contributions in the landscape, the evolutionary dynamics can be divided into a percolating and a non-percolatin...
A RESOURCE-BASED VIEW OF NEW FIRM SURVIVAL: NEW PERSPECTIVES ON THE ROLE OF INDUSTRY AND EXIT ROUTE
SUSAN COLEMAN; CARMEN COTEI; JOSEPH FARHAT
2013-01-01
This article explores factors affecting the survival and exit routes of new firms created in 2004 using data from the Kauffman Firm Survey. We draw upon the Resource-Based View to test several hypotheses regarding the impact of both tangible and intangible resources on new firm survival in both service and non-service firms. We also distinguish between two types of exit: closures (permanently stopped operations) and mergers or acquisitions. Our results reveal that, although service and non-se...
Lamarche, Paul; Maillet, Lara
2016-09-19
Purpose Improving the performance of health care organizations is now perceived as essential in order to better address the needs of the populations and respect their ability to pay for the services. There is no consensus on what is performance. It is increasingly considered as the optimal execution of four functions that every organization must achieve in order to survive and develop: reach goals; adapt to its environment; produce goods or services and maintain values; and a satisfying organizational climate. There is also no consensus on strategies to improve this performance. The paper aims to discuss these issues. Design/methodology/approach This paper intends to analyze the performance of primary health care organizations from the perspective of Kauffman's model. It mainly aims to understand the often contradictory, paradoxical and unexpected results that emerge from studies on this topic. Findings To do so, the first section briefly presents Kauffman's model and lays forward its principal components. The second section presents three studies on the performance of primary organizations and brings out the contradictory, paradoxical and unexpected results they obtained. The third section explains these results in the light of Kauffman's model. Originality/value Kauffman's model helps give meaning to the results of researches on performance of primary health care organizations that were qualified as paradoxical or unexpected. The performance of primary health care organizations then cannot be understood by only taking into account the characteristics of these organizations. The complexity of the environments in which they operate must simultaneously be taken into account. This paper brings original development of an integrated view of the performance of organizations, their own characteristics and those of the local environment in which they operated.
Nova Nayarit-Ballesteros; María Salud Rubio-Lozano; Enrique Delgado-Suárez; Danilo Méndez-Medina; Diego Braña-Varela; Oscar Rodas-Suárez
2016-01-01
Objective. To determine the serotype and antibiotic resistance profile of Salmonella spp. isolated from retail ground beef in Mexico City. Materials and methods. A total of 100 samples of ground beef were analyzed. The pathogen was isolated by conventional methods and confirmed by PCR (invA gene, 284 bp). The antibiotic resistance profile was determined by the Kirby-Bauer method while serotyping was performed according to the Kauffman-White scheme. Results. We isolated a total of 19 strains o...
Clean elements in abelian rings
Indian Academy of Sciences (India)
equivalent to being clean for an abelian ring is 'topologically boolean'. In line with [1] we say that a ring R (not necessarily commutative) is right (resp. left) topologically boolean, or a right (resp. left) tb-ring for short, if for every pair of distinct maximal right (resp. left) ideals of R there is an idempotent in exactly one of them.
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
DEFF Research Database (Denmark)
Williams, Poul Frederick; Biere, Armin; Clarke, Edmund M.
2000-01-01
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Diagrams (BDDs), the traditionally used canonical representation. The method is based on standard fixed point algorithms...
Venema, Yde
2003-01-01
We define a nontrivial variety of boolean algebras with operators such that every member of the variety is atomless. This shows that not every variety of boolean algebras with operators is generated by its atomic members, and thus establishes a strong incompleteness result in (multi-)modal logic.
A composition theorem for decision tree complexity
Montanaro, Ashley
2013-01-01
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
van den Berg, B.|info:eu-repo/dai/nl/314499172; Heunen, C.
2012-01-01
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by proving it for partial Boolean algebras (including orthomodular lattices), the new notion of partial C*-algebras (including noncommutative C*-algebras), and variations such as partial complete Boolean
Nonstandard Approach to Possibility Measures
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
1996-01-01
Roč. 4, č. 3 (1996), s. 275-301 ISSN 0218-4885 R&D Projects: GA AV ČR IAA1030504; GA ČR GA201/93/0781 Keywords : possibility measure * boolean-valued measure * nonstandard model * Boolean model * probability measure
The Compositional Rule of Inference and Zadeh’s Extension Principle for Non-normal Fuzzy Sets
van den Broek, P.M.; Noppen, J.A.R.; Castillo, Oscar
2007-01-01
Defining the standard Boolean operations on fuzzy Booleans with the compositional rule of inference (CRI) or Zadeh's extension principle gives counter-intuitive results. We introduce and motivate a slight adaptation of the CRI, which only effects the results for non-normal fuzzy sets. It is shown
Predecessor and permutation existence problems for sequential dynamical systems
Energy Technology Data Exchange (ETDEWEB)
Barrett, C. L. (Christopher L.); Hunt, H. B. (Harry B.); Marathe, M. V. (Madhav V.); Rosenkrantz, D. J. (Daniel J.); Stearns, R. E. (Richard E.)
2002-01-01
A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in BMR99, BR991 as a formal model for analyzing simulation systems. An SDS S is a triple (G, F,n ),w here (i) G(V,E ) is an undirected graph with n nodes with each node having a state, (ii) F = (fi, fi, . . ., fn), with fi denoting a function associated with node ui E V and (iii) A is a permutation of (or total order on) the nodes in V, A configuration of an SDS is an n-vector ( b l, bz, . . ., bn), where bi is the value of the state of node vi. A single SDS transition from one configuration to another is obtained by updating the states of the nodes by evaluating the function associated with each of them in the order given by n. Here, we address the complexity of two basic problems and their generalizations for SDSs. Given an SDS S and a configuration C, the PREDECESSOR EXISTENCE (or PRE) problem is to determine whether there is a configuration C' such that S has a transition from C' to C. (If C has no predecessor, C is known as a garden of Eden configuration.) Our results provide separations between efficiently solvable and computationally intractable instances of the PRE problem. For example, we show that the PRE problem can be solved efficiently for SDSs with Boolean state values when the node functions are symmetric and the underlying graph is of bounded treewidth. In contrast, we show that allowing just one non-symmetric node function renders the problem NP-complete even when the underlying graph is a tree (which has a treewidth of 1). We also show that the PRE problem is efficiently solvable for SDSs whose state values are from a field and whose node functions are linear. Some of the polynomial algorithms also extend to the case where we want to find an ancestor configuration that precedes a given configuration by a logarithmic number of steps. Our results extend some of the earlier results by Sutner [Su95] and Green [@87] on the complexity of
EEG microstates during different phases of Transcendental Meditation practice.
Faber, Pascal L; Travis, Frederick; Milz, Patricia; Parim, Niyazi
2017-08-01
Two phases of Transcendental Meditation (TM)-transcending and undirected mentation-were compared to each other and to task-free resting using multichannel EEG recorded from 20 TM practitioners. An EEG microstate analysis identified four classes of microstates which were labeled A, B, C and D, based on their similarity to previously published classes. For each class of microstates, mean duration, coverage and occurrence were computed. Resting and transcending differed from undirected mentation with decreased prominence of Class A and increased prominence of Class D microstates. In addition, transcending showed decreased prominence of Class C microstates compared to undirected mentation. Based on previous findings on the functional significance of the microstate classes, the results indicate an increased reference to reality and decreased visualization during resting and transcending compared to undirected mentation. Also, our results indicate decreased saliency of internally generated mentations during transcending compared to undirected mentation reflecting a more detached and less evaluative processing. It is proposed that the continuous cycling through these two phases of meditation during a TM session might facilitate and train the flexible modulation of the parameters of these microstates of these particular classes which are known to be altered in psychiatric disorders. This might promote beneficial stabilizing effects for the practitioner of TM.
Inanc, Nevsun; Yilmaz-Oner, Sibel; Can, Meryem; Sokka, Tuulikki; Direskeneli, Haner
2014-09-01
To investigate the effect of depression, anxiety, fatigue, and fibromyalgia (FM) on the remission status in patients with rheumatoid arthritis (RA), defined according to the 28-joint count Disease Activity Score (DAS28)-erythrocyte sedimentation rate (ESR) and the Boolean-based new American College of Rheumatology/European League Against Rheumatism remission criteria. The subjects were patients with RA who participated in a hospital-based observational cohort. Patients who met the DAS28-ESR remission criteria at their latest visit were invited to participate in our study. The patient groups fulfilling or not fulfilling the Boolean remission criteria were identified and compared with each other with regard to the presence of depression, anxiety, fatigue (0-50), and FM. The relationship between psychosocial factors and Simplified Disease Activity Index (SDAI) remission, which is the index-based definition of remission in RA, was also investigated. A total of 87 out of 428 patients (20%) with RA met the DAS28-ESR remission criteria and 32 (37%) of these also met the Boolean remission criteria, while 55 (63%) did not. Forty patients were also in SDAI remission. In the Boolean remission group, 2 patients had depression and 2 had anxiety (p = 0.004). In the Boolean nonremission group, 19 patients had depression and 13 had anxiety (p = 0.04). Continuous scales of anxiety (3.34 ± 3.76 vs 5.83 ± 4.70, p = 0.012) and depression (2.18 ± 2.75 vs 4.63 ± 4.10, p = 0.001) were also lower in the Boolean remission group in comparison with the nonremission group. Though FM syndrome was detected in only 1 patient of the Boolean remission group and in 7 patients of the Boolean nonremission group (p = 0.249), patients' polysymptomatic distress scores of FM in the Boolean remission group were significantly lower than those of the nonremission group (3.12 ± 3.25 vs 6.27 ± 5.19, p = 0.001). The mean fatigue scores were 9.5 ± 10.6 in the Boolean remission group and 16.8 ± 12.8 in
Minimal cut-set methodology for artificial intelligence applications
International Nuclear Information System (INIS)
Weisbin, C.R.; de Saussure, G.; Barhen, J.; Oblow, E.M.; White, J.C.
1984-01-01
This paper reviews minimal cut-set theory and illustrates its application with an example. The minimal cut-set approach uses disjunctive normal form in Boolean algebra and various Boolean operators to simplify very complicated tree structures composed of AND/OR gates. The simplification process is automated and performed off-line using existing computer codes to implement the Boolean reduction on the finite, but large tree structure. With this approach, on-line expert diagnostic systems whose response time is critical, could determine directly whether a goal is achievable by comparing the actual system state to a concisely stored set of preprocessed critical state elements
Algorithms for Quantum Branching Programs Based on Fingerprinting
Directory of Open Access Journals (Sweden)
Farid Ablayev
2009-11-01
Full Text Available In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs. Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as Equality, Palindrome, and Permutation Matrix Test. We also propose a generalization of our method and apply it to the Boolean variant of the Hidden Subgroup Problem.
Multilayer Neural Networks with Extensively Many Hidden Units
International Nuclear Information System (INIS)
Rosen-Zvi, Michal; Engel, Andreas; Kanter, Ido
2001-01-01
The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is performed by general symmetric Boolean functions, whereas the hidden layer is connected to the output by either discrete or continuous couplings. Introducing an overlap in the space of Boolean functions as order parameter, the storage capacity is found to scale with the logarithm of the number of implementable Boolean functions. The generalization behavior is smooth for continuous couplings and shows a discontinuous transition to perfect generalization for discrete ones
Quantum Random Networks for Type 2 Quantum Computers
National Research Council Canada - National Science Library
Allara, David L; Hasslacher, Brosl
2006-01-01
Random boolean networks (RBNs) have been studied theoretically and computationally in order to be able to use their remarkable self-healing and large basins of altercation properties as quantum computing architectures, especially...
A programmable artificial retina
International Nuclear Information System (INIS)
Bernard, T.M.; Zavidovique, B.Y.; Devos, F.J.
1993-01-01
An artificial retina is a device that intimately associates an imager with processing facilities on a monolithic circuit. Yet, except for simple environments and applications, analog hardware will not suffice to process and compact the raw image flow from the photosensitive array. To solve this output problem, an on-chip array of bare Boolean processors with halftoning facilities might be used, providing versatility from programmability. By setting the pixel memory size to 3 b, the authors have demonstrated both the technological practicality and the computational efficiency of this programmable Boolean retina concept. Using semi-static shifting structures together with some interaction circuitry, a minimal retina Boolean processor can be built with less than 30 transistors and controlled by as few as 6 global clock signals. The successful design, integration, and test of such a 65x76 Boolean retina on a 50-mm 2 CMOS 2-μm circuit are presented
SAT-Based Software Certification
National Research Council Canada - National Science Library
Chaki, Sagar
2006-01-01
... predicate abstraction and validated by generating and proving verification conditions. In addition, the first part of the report proposes the use of theorem provers based on Boolean propositional satisfiability (SAT...
CBP Customs Rulings Online Search System (CROSS)
Department of Homeland Security — CROSS is a searchable database of CBP rulings that can be retrieved based on simple or complex search characteristics using keywords and Boolean operators. CROSS has...
Jauch-Piron logics with finiteness conditions
Rogalewicz, Vladimír
1991-04-01
We show that there are no non-Boolean block-finite orthomodular posets possessing a unital set of Jauch-Piron states. Thus, an orthomodular poset representing a quantum physical system must have infinitely many blocks.
Savage, Leonard J
1972-01-01
Classic analysis of the foundations of statistics and development of personal probability, one of the greatest controversies in modern statistical thought. Revised edition. Calculus, probability, statistics, and Boolean algebra are recommended.
Skein Invariants of Links and Their State Sum Models
Directory of Open Access Journals (Sweden)
Louis H. Kauffman
2017-10-01
Full Text Available We present the new skein invariants of classical links, H [ H ] , K [ K ] and D [ D ] , based on the invariants of links, H, K and D, denoting the regular isotopy version of the Homflypt polynomial, the Kauffman polynomial and the Dubrovnik polynomial. The invariants are obtained by abstracting the skein relation of the corresponding invariant and making a new skein algorithm comprising two computational levels: first producing unlinked knotted components, then evaluating the resulting knots. The invariants in this paper, were revealed through the skein theoretic definition of the invariants Θ d related to the Yokonuma–Hecke algebras and their 3-variable generalization Θ , which generalizes the Homflypt polynomial. H [ H ] is the regular isotopy counterpart of Θ . The invariants K [ K ] and D [ D ] are new generalizations of the Kauffman and the Dubrovnik polynomials. We sketch skein theoretic proofs of the well-definedness and topological properties of these invariants. The invariants of this paper are reformulated into summations of the generating invariants (H, K, D on sublinks of the given link L, obtained by partitioning L into collections of sublinks. The first such reformulation was achieved by W.B.R. Lickorish for the invariant Θ and we generalize it to the Kauffman and Dubrovnik polynomial cases. State sum models are formulated for all the invariants. These state summation models are based on our skein template algorithm which formalizes the skein theoretic process as an analogue of a statistical mechanics partition function. Relationships with statistical mechanics models are articulated. Finally, we discuss physical situations where a multi-leveled course of action is taken naturally.
Heuristics in Conflict Resolution
Drescher, Christian; Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten
2010-01-01
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SAT area, the heuristic aspects involved in conflict analysis have not yet receive...
A Scalable, Reconfigurable, and Dependable Time-Triggered Architecture
2003-07-01
Davis and Hilary Putnam . A computing procedure for quantification theory. Journal of the ACM, 7(3):201–215, 1960. 10. Leonardo de Moura, Harald Rueß...resolution(cc) then return unsatisfiable Figure 5. Davis- Putnam procedure. the logical context of the $ -sat triggers backtracking in the search for vari- able...the main loop of the Davis- Putnam procedure found in most Boolean SAT solvers [17]. The algorithm starts with an empty boolean assignment, and
TENTACLE: Multi-Camera Immersive Surveillance System
2011-12-01
Control Center software which is installed at Camp Ripley BQS Boolean Query Syntax C2 Command and control CCIRM Collection Coordination and...thresholding and morphology (dilation and erosion) to clean up noise and strengthen the area of interest in the foreground mask. (6.) Find the...knowledge of the IPL parameters “discovered” during the login process. The syntax of the query is the Boolean Query Syntax (BQS) as defined in Annex F
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
Bounds on the Average Sensitivity of Nested Canalizing Functions
Klotz, Johannes Georg; Heckel, Reinhard; Schober, Steffen
2012-01-01
Nested canalizing Boolean (NCF) functions play an important role in biological motivated regulative networks and in signal processing, in particular describing stack filters. It has been conjectured that NCFs have a stabilizing effect on the network dynamics. It is well known that the average sensitivity plays a central role for the stability of (random) Boolean networks. Here we provide a tight upper bound on the average sensitivity for NCFs as a function of the number of relevant input vari...
NUMERICAL SIMULATION OF DIGITAL VLSI TOTAL DOSE FUNCTIONAL FAILURES
Directory of Open Access Journals (Sweden)
O. A. Kalashnikov
2016-10-01
Full Text Available The technique for numerical simulation of digital VLSI total dose failures is presented, based on fuzzy logic sets theory. It assumes transfer from boolean logic model of a VLSI with values {0,1} to fuzzy model with continuous interval [0,1], and from boolean logic functions to continuous minimax functions. The technique is realized as a calculation system and allows effective estimating of digital VLSI radiation behavior without experimental investigation.
A Quantum Computing Approach to Model Checking for Advanced Manufacturing Problems
2014-07-01
is zero (the corresponding variable is excluded). The conditions are that for each (si, tj) pair at least one of the variables that distinguish...between the two states must be selected. Thus, there is a total of mхn conditions . Under this formulation, the minimal separating set can be solved...its Boolean operands is TRUE. The Boolean satisfiability problem consists in finding an assignment of truth-values for all the variables such that
Data structures theory and practice
Berztiss, A T
1971-01-01
Computer Science and Applied Mathematics: Data Structures: Theory and Practice focuses on the processes, methodologies, principles, and approaches involved in data structures, including algorithms, decision trees, Boolean functions, lattices, and matrices. The book first offers information on set theory, functions, and relations, and graph theory. Discussions focus on linear formulas of digraphs, isomorphism of digraphs, basic definitions in the theory of digraphs, Boolean functions and forms, lattices, indexed sets, algebra of sets, and order pair and related concepts. The text then examines
Cryptographic Properties of the Hidden Weighted Bit Function
2013-12-23
is an inner product , for instance, ω ·x = ω1x1 +ω2x2 + · · ·+ωnxn. It is easy to see that a Boolean function f is balanced if and only if Wf (0) = 0...K. Feng, An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity, in: IWCC 2009, In: LNCS
A Comparative study of two methodologies for large binary datasets analysis.
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.; Řezanková, H.
2012-01-01
Roč. 22, č. 6 (2012), s. 565-582 ISSN 1210-0552 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070 Program:ED Institutional support: RVO:67985807 Keywords : dimension reduction * statistics * data mining * Boolean factor analysis * Boolean matrix factorization * information gain * likelihood-maximization * bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 0.362, year: 2012
An order parameter for networks of automata
International Nuclear Information System (INIS)
Flyvbjerg, H.
1988-05-01
An exact polynomial equation is given for the size of the stable core of networks of automata with random connections. When the connectivity K of a network equals 1, 2, 3, 4, or 5 this equation is exactly solvable. It is found that the size of the stable core is an order parameter for a phase transition well known from Kauffman's model. A new derivation of critical parameter values follows. The phase structure is found to be independent of the updating scheme used in the dynamical law for the network. (orig.)
More than the sum of the parts: Nested analysis in action
Kauffman, Craig
2012-01-01
After reading Lieberman’s (2005) article on nested analysis, I was eager to test the purported benefits by adopting this multi-method approach in my dissertation research (Kauffman 2012). After using it, I am even more convinced of Lieberman’s assertion that both quantitative and qualitative methodologies “can inform each other to the extent that the analytic payoff is greater than the sum of the parts” (2005: 436). My purpose here is to provide an example of nested analysis in action to illu...
Decoherence, determinism and chaos revisited
Energy Technology Data Exchange (ETDEWEB)
Noyes, H.P.
1994-11-15
We suggest that the derivation of the free space Maxwell Equations for classical electromagnetism, using a discrete ordered calculus developed by L.H. Kauffman and T. Etter, necessarily pushes the discussion of determinism in natural science down to the level of relativistic quantum mechanics and hence renders the mathematical phenomena studied in deterministic chaos research irrelevant to the question of whether the world investigated by physics is deterministic. We believe that this argument reinforces Suppes` contention that the issue of determinism versus indeterminism should be viewed as a Kantian antinomy incapable of investigation using currently available scientific tools.
Decoherence, determinism and chaos revisited
International Nuclear Information System (INIS)
Noyes, H.P.
1994-01-01
We suggest that the derivation of the free space Maxwell Equations for classical electromagnetism, using a discrete ordered calculus developed by L.H. Kauffman and T. Etter, necessarily pushes the discussion of determinism in natural science down to the level of relativistic quantum mechanics and hence renders the mathematical phenomena studied in deterministic chaos research irrelevant to the question of whether the world investigated by physics is deterministic. We believe that this argument reinforces Suppes' contention that the issue of determinism versus indeterminism should be viewed as a Kantian antinomy incapable of investigation using currently available scientific tools
Chaotic behavior in the disorder cellular automata
International Nuclear Information System (INIS)
Ko, J.-Y.; Hung, Y.-C.; Ho, M.-C.; Jiang, I-M.
2008-01-01
Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is formulated based on Rule 22 and other totalistic rules. The numerical results reveal excellent agreement between the model and original automata. Furthermore, the inhomogeneous situation is also discussed
Palmu, Emmi
2017-01-01
Aiemmat tutkimukset ovat osoittaneet vaikeiden käyttäytymisen vaikeuksien olevan yhtey-dessä kouluvaikeuksiin ja koulupudokkuuteen (Kauffman 1997, Goldstein 1995; MacMillan & Reschly 1998). Tämän oppilasryhmän koulunkäynnin tukeminen on tärkeää syrjäytymistä ennaltaehkäisevää toimintaa. Suomessa perusopetuslain mukaan oppilailla on oikeus tarvitsemaansa tukeen ja erityisopetukseen. Erityisopetuksessa on oppilaita, joille järjestetään opetusta kouluopetuksen ulkopuolella erityisin järjestelyin...
The Complete Science Fair Handbook. For Teachers and Parents of Students in Grades 4-8.
Fredericks, Anthony D.; Asimov, Isaac
Interest in a science fair is low when students feel undirected and lack the information they need to produce a successful project. For many students, parents, and teachers, planning and carrying out a science fair project may be very frustrating. This book is designed to be a reference that helps teachers guide students through this process. The…
Solid-phase extraction procedures in systematic toxicological analysis
Franke, J.P.; de Zeeuw, R.A
1998-01-01
In systematic toxicological analysis (STA) the substance(s) present is (are) not known at the start of the analysis. in such an undirected search the extraction procedure cannot be directed to a given substance but must be a general procedure where a compromise must be reached in that the substances
DEFF Research Database (Denmark)
Wøhlk, Sanne; Laporte, Gilbert
2017-01-01
The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected complete graph. Our work is motivated by the need to solve large instances of the Capacitated Arc Routing Problem (CARP) arising in the optimization of garbage...
Efficient heuristics for the Rural Postman Problem | Groves | ORiON
African Journals Online (AJOL)
A local search framework for the (undirected) Rural Postman Problem (RPP) is presented in this paper. The framework allows local search approaches that have been applied successfully to the well–known Travelling Salesman Problem also to be applied to the RPP. New heuristics for the RPP, based on this framework, ...
Visualizing White Matter Structure of the Brain using Dijkstra's Algorithm
Everts, Maarten H.; Bekker, Henk; Roerdink, Jos B. T. M.; Zinterhof, P; Loncaric, S; Uhl, A; Carini, A
2009-01-01
An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating
Visualizing White Matter Structure of the Brain using Dijkstra’s Algorithm
Everts, Maarten H.; Bekker, Hendrik; Roerdink, Jos B.T.M.
2009-01-01
An undirected weighted graph may be constructed from diffusion weighted magnetic resonance imaging data. Every node represents a voxel and the edge weights between nodes represent the white matter connectivity between neighboring voxels. In this paper we propose and test a new method for calculating
Approximate distance oracles for planar graphs with improved query time-space tradeoff
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
2016-01-01
We consider approximate distance oracles for edge-weighted n-vertex undirected planar graphs. Given fixed ϵ > 0, we present a (1 + ϵ)-approximate distance oracle with O(n(log log n)2) space and O((loglogr?,)3) query time. This improves the previous best product of query time and space...
BDgraph: An R Package for Bayesian Structure Learning in Graphical Models
Mohammadi, A.; Wit, E.C.
2017-01-01
Graphical models provide powerful tools to uncover complicated patterns in multivariate data and are commonly used in Bayesian statistics and machine learning. In this paper, we introduce an R package BDgraph which performs Bayesian structure learning for general undirected graphical models with
NEAT : an efficient network enrichment analysis test
Signorelli, Mirko; Vinciotti, Veronica; Wit, Ernst C
2016-01-01
BACKGROUND: Network enrichment analysis is a powerful method, which allows to integrate gene enrichment analysis with the information on relationships between genes that is provided by gene networks. Existing tests for network enrichment analysis deal only with undirected networks, they can be
Families of Fixed Degree Graphs for Processor Interconnection
DEFF Research Database (Denmark)
Jerrum, Mark; Skyum, Sven
1984-01-01
A construction is presented which, given a fixed undirected graph of low degree and small average path length, yields an infinite sequence of low diameter graphs of increasing order and fixed degree. As examples of the construction, infinite sequences of low diameter graphs are presented with deg...
DEFF Research Database (Denmark)
Chechik, Shiri; Wulff-Nilsen, Christian
2016-01-01
A spanner if of a weighted undirected graph G is a "sparse" subgraph that approximately preserves distances between every pair of vertices in G. We refer to if as a δ-spanner of G for some parameter δ ≥ 1 if the distance in H between every vertex pair is at most a factor δ bigger than in G. In th...
Bayesian Inference in Hidden Markov Random Fields for Binary Data Defined on Large Lattices
Friel, N.; Pettitt, A.N.; Reeves, R.; Wit, E.
Hidden Markov random fields represent a complex hierarchical model, where the hidden latent process is an undirected graphical structure. Performing inference for such models is difficult primarily because the likelihood of the hidden states is often unavailable. The main contribution of this
The influence of hyper-parameters in the infinite relational model
DEFF Research Database (Denmark)
Albers, Kristoffer Jon; Mørup, Morten; Schmidt, Mikkel Nørgaard
2016-01-01
The infinite relational model (IRM) is a Bayesian nonparametric stochastic block model; a generative model for random networks parameterized for uni-partite undirected networks by a partition of the node set and symmetric matrix of inter-partion link probabilities. The prior for the node clusters...
Approximability of Robust Network Design
Olver, N.K.; Shepherd, F.B.
2014-01-01
We consider robust (undirected) network design (RND) problems where the set of feasible demands may be given by an arbitrary convex body. This model, introduced by Ben-Ameur and Kerivin [Ben-Ameur W, Kerivin H (2003) New economical virtual private networks. Comm. ACM 46(6):69-73], generalizes the
Goyal, N.; Olver, N.K.; Shepherd, F.B.
2013-01-01
We consider the following network design problem. We are given an undirected graph G = (V,E) with edge costs c(e) and a set of terminal nodes W ⊆ V. A hose demand matrix is any symmetric matrix D, indexed by the terminals, such that for each i ∈ W, Σ
Communications and Cooperation in Public Network Situations
Suijs, J.P.M.; Borm, P.E.M.; Hamers, H.J.M.; Koster, M.A.L.; Quant, M.
2001-01-01
This paper focuses on sharing the costs and revenues of maintaining a public network communication structure.Revenues are assumed to be bilateral and communication links are publicly available but costly.It is assumed that agents are located at the vertices of an undirected graph in which the edges
A nonlinear merging protocol for consensus in multi-agent systems on signed and weighted graphs
Feng, Shasha; Wang, Li; Li, Yijia; Sun, Shiwen; Xia, Chengyi
2018-01-01
In this paper, we investigate the multi-agent consensus for networks with undirected graphs which are not connected, especially for the signed graph in which some edge weights are positive and some edges have negative weights, and the negative-weight graph whose edge weights are negative. We propose a novel nonlinear merging consensus protocol to drive the states of all agents to converge to the same state zero which is not dependent upon the initial states of agents. If the undirected graph whose edge weights are positive is connected, then the states of all agents converge to the same state more quickly when compared to most other protocols. While the undirected graph whose edge weights might be positive or negative is unconnected, the states of all agents can still converge to the same state zero under the premise that the undirected graph can be divided into several connected subgraphs with more than one node. Furthermore, we also discuss the impact of parameter r presented in our protocol. Current results can further deepen the understanding of consensus processes for multi-agent systems.
DEFF Research Database (Denmark)
Ottosen, Thorsten Jørgen; Vomlel, Jiri
2010-01-01
Whenever objects and their interaction is modelled via undirected graphs, it is often of great interest to know the cliques of the graph. For several problems the graph changes frequently over time, and we therefore seek methods for updating the information about the cliques in a dynamic fashion ...... Bron-Kerbosch. The applications include fuzzy clustering and optimal triangulation of Bayesian networks....
Metalearning Capacity and Threshold Concept Engagement
Ward, Sophie C.; Meyer, Jan H. F.
2010-01-01
This study aims to further our understanding of metalearning activity through the analysis of qualitative data gathered from 370 first-year microeconomics students in three UK universities. The students were asked to produce undirected reflective essays in response to a personal "learning profile" generated before, and after, the…
DEFF Research Database (Denmark)
Cao, Qian; Song, Y. D.; Guerrero, Josep M.
2016-01-01
This paper proposes a distributed algorithm for coordination of flywheel energy storage matrix system (FESMS) cooperated with wind farm. A simple and distributed ratio consensus algorithm is proposed to solve FESMS dispatch problem. The algorithm is based on average consensus for both undirected...
A classification of cubic symmetric graphs of order 16p2
Indian Academy of Sciences (India)
In this paper, we classify all connected cubic symmetric graphs of order 16p2 for each prime p. Keywords. Regular coverings; symmetric graphs; invariant subspaces. 1. Introduction. Throughout this paper, graphs are assumed to be finite, simple, undirected and connected. For the group-theoretic concepts and notations not ...
Graphs inducing totally balanced and submodular Chinese postman games
Josune Albizuri, M.; Hamers, H.J.M.
2014-01-01
A Chinese postman (CP) game is induced by a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this line of
Communication on the structure of biological networks
Indian Academy of Sciences (India)
An epidemic can also spread faster in neuronal networks than in the other biological networks studied here. Thus, the underlying undirected architecture of a neuronal network possesses certain conformation which is favourable for spreading different entities or information. Now, to explore the topological characteristics that ...
Semisymmetric cubic graphs of order 16p2 16p2 16p2
Indian Academy of Sciences (India)
Abstract. An undirected graph without isolated vertices is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. In this paper, we inquire the existence of connected semisymmetric cubic graphs of order. 16p2. It is shown that for every odd prime p, there exists a ...
Job Heterogeneity and Coordination Frictions
DEFF Research Database (Denmark)
Kennes, John; le Maire, Daniel
the job ladder, how the identification of assortative matching is fundamentally different in directed and undirected search models, how our theory accounts for business cycle facts related to inter-temporal changes in job offer distributions, and how our model could also be used to identify...
Semisymmetric cubic graphs of order 16p2 16p2 16p2
Indian Academy of Sciences (India)
An undirected graph without isolated vertices is said to be semisymmetric if its full automorphism group acts transitively on its edge set but not on its vertex set. In this paper, we inquire the existence of connected semisymmetric cubic graphs of order 162. It is shown that for every odd prime , there exists a semisymmetric ...
Deep Belief Networks for dimensionality reduction
Noulas, A.K.; Kröse, B.J.A.
2008-01-01
Deep Belief Networks are probabilistic generative models which are composed by multiple layers of latent stochastic variables. The top two layers have symmetric undirected connections, while the lower layers receive directed top-down connections from the layer above. The current state-of-the-art
Analysis of protein-protein interaction networks by means of annotated graph mining algorithms
Rahmani, Hossein
2012-01-01
This thesis discusses solutions to several open problems in Protein-Protein Interaction (PPI) networks with the aid of Knowledge Discovery. PPI networks are usually represented as undirected graphs, with nodes corresponding to proteins and edges representing interactions among protein pairs. A large
MIPCE: An MI-based protein complex extraction technique
Indian Academy of Sciences (India)
2015-09-28
Sep 28, 2015 ... complexity of protein interaction data, many methods which are based on modelling the PPI data with graphs have been developed for analysing the structure of PPI networks. PPI networks are represented as undirected graphs with nodes corresponding to proteins and edges representing the interactions ...
Categorical constructions in graph theory
Directory of Open Access Journals (Sweden)
Richard T. Bumby
1986-01-01
Full Text Available This paper presents some graph-theoretic questions from the viewpoint of the portion of category theory which has become common knowledge. In particular, the reader is encouraged to consider whether there is only one natural category of graphs and how theories of directed graphs and undirected graphs are related.
Dynamic Network Formation Using Ant Colony Optimization
2009-03-01
Problem (DVRP) ............................................ 36 2.7.2 Dynamic Traveling Salesman Problem (DTSP) ....................................... 41...47 2.8.3 Distributed Traveling Salesman Problem ................................................. 48 2.8.4 FIRE Ant...uses the fixed cost of the network in its calculation and commodities are not included in the problem formulation . Using a probabilistic undirected
Importance analysis based on logical differential calculus and Binary Decision Diagram
International Nuclear Information System (INIS)
Zaitseva, Elena; Levashenko, Vitaly; Kostolny, Jozef
2015-01-01
System availability evaluation, sensitivity analysis, Importance Measures, and optimal design are important issues that have become research topics for reliability engineering. There are different mathematical approaches to the development of these topics. The structure function based approach is one of them. Structure function enables one to analyse a system of any complexity. But computational complexity of structure function based methods is time consuming for large-scale networks. We propose to use two mathematical approaches for decision to this problem for system importance analysis. The first of them is Direct Partial Boolean Derivative. New equations for calculating the Importance Measures are developed in terms of these derivatives. The second is Binary Decision Diagram (BDD), that supports efficient manipulation of Boolean algebra. Two algorithms for calculating Direct Partial Boolean Derivative based on BDD of structure function are proposed in this paper. The experimental results show the efficiency of new algorithms for calculating Direct Partial Boolean Derivative and Importance Measures. - Highlights: • New approach for calculation of Importance Measures is proposed. • Direct Partial Boolean Derivatives are used for calculation of Importance Measures. • New equations for Importance Measures are obtained. • New algorithm to calculate Direct Partial Boolean Derivatives by BDD is developed
Is Your Gut Conscious? Is an Extraterrestrial?
Vos Post, Jonathan
2011-10-01
This paper speculates on questions intending to be taken scientifically rather than metaphysically: "Can the human gut (enteric nervous system) be conscious?"; "Can your immune system think?"; "Could consciousness be coded in DNA?"; "What do we mean when asserting that an Extraterrestrial is Thinking, or is Conscious? We explore through reference to theory, experiment, and computational models by Christof Koch (Caltech), Barbara Wold (Caltech), and Stuart Kauffman (University of Calgary, Tampere University of Technology, Santa Fe Institute). We use a tentative new definition of thinking, designed to be applicable for humans, cetecea, corvids, artificial intelligences, and extraterrestrial intelligences of any substrate (i.e. Life as We Do Not Know It): "Thinking is the occurrence, transformation, and storage in a mind or brain (or simulation thereof) of information-bearing structures (representations) of one kind or another, such as thoughts, concept, percepts, ideas, impressions, notions, rules, schemas, images, phantasms, or subpersonal representations." We use the framework for Consciousness developed by Francis Crick and Christof Koch. We try to describe scientific goals, but discuss Philosophy sufficient to avoid naïve philosophical category errors (thus are careful not to conflate thought, consciousness, and language) Penrose, Hameroff, and Kauffman speculate (differently) that CNS consciousness is a macroscopic quantum phenomenon. Might intestinal, immune system, or genetic regulatory network dynamics exhibit emergent cooperative quantum effects? The speculations are in the context of Evolution by Natural Selection, presumed to operate throughout the Cosmos, and recent work in the foundations of Computational Biology and Quantum Mechanics.
Social context-induced song variation affects female behavior and gene expression.
Directory of Open Access Journals (Sweden)
Sarah C Woolley
2008-03-01
Full Text Available Social cues modulate the performance of communicative behaviors in a range of species, including humans, and such changes can make the communication signal more salient. In songbirds, males use song to attract females, and song organization can differ depending on the audience to which a male sings. For example, male zebra finches (Taeniopygia guttata change their songs in subtle ways when singing to a female (directed song compared with when they sing in isolation (undirected song, and some of these changes depend on altered neural activity from a specialized forebrain-basal ganglia circuit, the anterior forebrain pathway (AFP. In particular, variable activity in the AFP during undirected song is thought to actively enable syllable variability, whereas the lower and less-variable AFP firing during directed singing is associated with more stereotyped song. Consequently, directed song has been suggested to reflect a "performance" state, and undirected song a form of vocal motor "exploration." However, this hypothesis predicts that directed-undirected song differences, despite their subtlety, should matter to female zebra finches, which is a question that has not been investigated. We tested female preferences for this natural variation in song in a behavioral approach assay, and we found that both mated and socially naive females could discriminate between directed and undirected song-and strongly preferred directed song. These preferences, which appeared to reflect attention especially to aspects of song variability controlled by the AFP, were enhanced by experience, as they were strongest for mated females responding to their mate's directed songs. We then measured neural activity using expression of the immediate early gene product ZENK, and found that social context and song familiarity differentially modulated the number of ZENK-expressing cells in telencephalic auditory areas. Specifically, the number of ZENK-expressing cells in the
Earthquake Complex Network Analysis Before and After the Mw 8.2 Earthquake in Iquique, Chile
Pasten, D.
2017-12-01
The earthquake complex networks have shown that they are abble to find specific features in seismic data set. In space, this networkshave shown a scale-free behavior for the probability distribution of connectivity, in directed networks and theyhave shown a small-world behavior, for the undirected networks.In this work, we present an earthquake complex network analysis for the large earthquake Mw 8.2 in the north ofChile (near to Iquique) in April, 2014. An earthquake complex network is made dividing the three dimensional space intocubic cells, if one of this cells contain an hypocenter, we name this cell like a node. The connections between nodes aregenerated in time. We follow the time sequence of seismic events and we are making the connections betweennodes. Now, we have two different networks: a directed and an undirected network. Thedirected network takes in consideration the time-direction of the connections, that is very important for the connectivityof the network: we are considering the connectivity, ki of the i-th node, like the number of connections going out ofthe node i plus the self-connections (if two seismic events occurred successive in time in the same cubic cell, we havea self-connection). The undirected network is made removing the direction of the connections and the self-connectionsfrom the directed network. For undirected networks, we are considering only if two nodes are or not connected.We have built a directed complex network and an undirected complex network, before and after the large earthquake in Iquique. We have used magnitudes greater than Mw = 1.0 and Mw = 3.0. We found that this method can recognize the influence of thissmall seismic events in the behavior of the network and we found that the size of the cell used to build the network isanother important factor to recognize the influence of the large earthquake in this complex system. This method alsoshows a difference in the values of the critical exponent γ (for the probability
Fault tree analysis with multistate components
International Nuclear Information System (INIS)
Caldarola, L.
1979-02-01
A general analytical theory has been developed which allows one to calculate the occurence probability of the top event of a fault tree with multistate (more than states) components. It is shown that, in order to correctly describe a system with multistate components, a special type of Boolean algebra is required. This is called 'Boolean algebra with restrictions on varibales' and its basic rules are the same as those of the traditional Boolean algebra with some additional restrictions on the variables. These restrictions are extensively discussed in the paper. Important features of the method are the identification of the complete base and of the smallest irredundant base of a Boolean function which does not necessarily need to be coherent. It is shown that the identification of the complete base of a Boolean function requires the application of some algorithms which are not used in today's computer programmes for fault tree analysis. The problem of statistical dependence among primary components is discussed. The paper includes a small demonstrative example to illustrate the method. The example includes also statistical dependent components. (orig.) [de
Chemical Graph Transformation with Stereo-Information
DEFF Research Database (Denmark)
Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel
2017-01-01
Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...
The Vulnerability of Some Networks including Cycles via Domination Parameters
Directory of Open Access Journals (Sweden)
Tufan Turaci
2016-01-01
Full Text Available Let G=(V(G,E(G be an undirected simple connected graph. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Finding the vulnerability values of communication networks modeled by graphs is important for network designers. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. The domination number and its variations are the most important vulnerability parameters for network vulnerability. Some variations of domination numbers are the 2-domination number, the bondage number, the reinforcement number, the average lower domination number, the average lower 2-domination number, and so forth. In this paper, we study the vulnerability of cycles and related graphs, namely, fans, k-pyramids, and n-gon books, via domination parameters. Then, exact solutions of the domination parameters are obtained for the above-mentioned graphs.
Consensus of Switched Multiagent Systems under Relative State Constraints
Directory of Open Access Journals (Sweden)
Qingling Wang
2017-01-01
Full Text Available The consensus problem is presented for the switched multiagent system (MAS, where the MAS is switched between continuous- and discrete-time systems with relative state constraints. With some standard assumptions, we obtain the fact that the switched MAS with relative state constraints can achieve consensus under both fixed undirected graphs and switching undirected graphs. Furthermore, based on the absolute average value of initial states, we propose sufficient conditions for consensus of the switched MAS. The challenge of this study is that relative state constraints are considered, which will make the consensus problem much more complex. One of the main contributions is that, for the switched MAS with relative state constraints, we explore the solvability of the consensus problem. Finally, we present two simulation examples to show the effectiveness of the results.
Markov Networks in Evolutionary Computation
Shakya, Siddhartha
2012-01-01
Markov networks and other probabilistic graphical modes have recently received an upsurge in attention from Evolutionary computation community, particularly in the area of Estimation of distribution algorithms (EDAs). EDAs have arisen as one of the most successful experiences in the application of machine learning methods in optimization, mainly due to their efficiency to solve complex real-world optimization problems and their suitability for theoretical analysis. This book focuses on the different steps involved in the conception, implementation and application of EDAs that use Markov networks, and undirected models in general. It can serve as a general introduction to EDAs but covers also an important current void in the study of these algorithms by explaining the specificities and benefits of modeling optimization problems by means of undirected probabilistic models. All major developments to date in the progressive introduction of Markov networks based EDAs are reviewed in the book. Hot current researc...
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
DEFF Research Database (Denmark)
Bensmail, Julien; Renault, Gabriel
2016-01-01
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently...... conjectured by Baudon et al. that every undirected graph admits a decomposition into at most three locally irregular graphs, except for a well-characterized set of indecomposable graphs. We herein consider an oriented version of this conjecture. Namely, can every oriented graph be decomposed into at most...... three locally irregular oriented graphs, i.e. whose adjacent vertices have distinct outdegrees? We start by supporting this conjecture by verifying it for several classes of oriented graphs. We then prove a weaker version of this conjecture. Namely, we prove that every oriented graph can be decomposed...
Maiorana-McFarland class: Degree optimization and algebraic properties
DEFF Research Database (Denmark)
Pasalic, Enes
2006-01-01
degree of functions in the extended Maiorana-McFarland (MM) class (nonlinear resilient functions F : GF (2)(n) -> GF (2)(m) derived from linear codes). We also show that in the Boolean case, the same subclass seems not to have an optimized algebraic immunity, hence not providing a maximum resistance......In this paper, we consider a subclass of the Maiorana-McFarland class used in the design of resilient nonlinear Boolean functions. We show that these functions allow a simple modification so that resilient Boolean functions of maximum algebraic degree may be generated instead of suboptimized degree...... in the original class. Preserving a high-nonlinearity value immanent to the original construction method, together with the degree optimization gives in many cases functions with cryptographic properties superior to all previously known construction methods. This approach is then used to increase the algebraic...
Logic-based aggregation methods for ranking student applicants
Directory of Open Access Journals (Sweden)
Milošević Pavle
2017-01-01
Full Text Available In this paper, we present logic-based aggregation models used for ranking student applicants and we compare them with a number of existing aggregation methods, each more complex than the previous one. The proposed models aim to include depen- dencies in the data using Logical aggregation (LA. LA is a aggregation method based on interpolative Boolean algebra (IBA, a consistent multi-valued realization of Boolean algebra. This technique is used for a Boolean consistent aggregation of attributes that are logically dependent. The comparison is performed in the case of student applicants for master programs at the University of Belgrade. We have shown that LA has some advantages over other presented aggregation methods. The software realization of all applied aggregation methods is also provided. This paper may be of interest not only for student ranking, but also for similar problems of ranking people e.g. employees, team members, etc.
Classical databases and knowledge organization
DEFF Research Database (Denmark)
Hjørland, Birger
2015-01-01
This paper considers classical bibliographic databases based on the Boolean retrieval model (such as MEDLINE and PsycInfo). This model is challenged by modern search engines and information retrieval (IR) researchers, who often consider Boolean retrieval a less efficient approach. The paper...... examines this claim and argues for the continued value of Boolean systems, which suggests two further considerations: (1) the important role of human expertise in searching (expert searchers and “information literate” users) and (2) the role of library and information science and knowledge organization (KO...... implications for the maintenance of information science and KO as research fields, as well as for the information profession as a profession in its own right....
States On Orthocomplemented Difference Posets (Extensions)
Hroch, Michal; Pták, Pavel
2016-08-01
We continue the investigation of orthocomplemented posets that are endowed with a symmetric difference (ODPs). The ODPs are orthomodular and, therefore, can be viewed as "enriched" quantum logics. In this note, we introduced states on ODPs. We derive their basic properties and study the possibility of extending them over larger ODPs. We show that there are extensions of states from Boolean algebras over unital ODPs. Since unital ODPs do not, in general, have to be set-representable, this result can be applied to a rather large class of ODPs. We then ask the same question after replacing Boolean algebras with "nearly Boolean" ODPs (the pseudocomplemented ODPs). Making use of a few results on ODPs, some known and some new, we construct a pseudocomplemented ODP, P, and a state on P that does not allow for extensions over larger ODPs.
Shifting Niches for Community Structure Detection
DEFF Research Database (Denmark)
Grappiolo, Corrado; Togelius, Julian; Yannakakis, Georgios N.
2013-01-01
We present a new evolutionary algorithm for com- munity structure detection in both undirected and unweighted (sparse) graphs and fully connected weighted digraphs (complete networks). Previous investigations have found that, although evolutionary computation can identify community structure...... experimentally compare the new algorithm to the well-known algorithms of Pizzuti and Tasgin, and find that we outperform those algorithms for sparse graphs under some conditions, and drastically outperform them on complete networks under all tested conditions....
Space-efficient path-reporting approximate distance oracles
DEFF Research Database (Denmark)
Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian
2016-01-01
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlogn space bound of Thorup and Zwick if approximate paths rather than distances need...... to be reported. For approximate distance labeling and labeled routing, we break the previously best known space bound of O(logn) words per vertex. The cost for such space efficiency is an increased stretch....
Distributed processing in receivers based on tensor for cooperative communications systems
Igor FlÃvio SimÃes de Sousa
2014-01-01
In this dissertation, we present a distributed data estimation and detection approach for the uplink of a network that uses CDMA at transmitters (users). The analyzed network can be represented by an undirected and connected graph, where the nodes use a distributed estimation algorithm based on consensus averaging to perform joint channel and symbol estimation using a receiver based on tensor signal processing. The centralized receiver, developed for a central base station, and the distribute...
A Model-Based Diagnosis Framework for Distributed Systems
2002-05-04
none norn. none PPtI-video-failA P1 2 -video-foil Xvideo 6 audio video none none none. none Prt-audio-failA P 1 2 -video-/lil ADBI1fajil Table 1...audio, and Xvideo denotes degrated video. R computes a tree-decomposition in which each node of the tree is a clique, and undirected edges correspond to
A classification of cubic symmetric graphs of order 16p2
Indian Academy of Sciences (India)
Introduction. Throughout this paper, graphs are assumed to be finite, simple, undirected and connected. For the group-theoretic concepts and notations not defined here we refer to [18]. For a graph X, we denote by V(X), E(X), A(X) and Aut(X) the vertex set, the edge set, the arc set and the full automorphism group of X, ...
Deep Belief Networks for dimensionality reduction
Noulas, A.K.; Kröse, B.J.A.
2008-01-01
Deep Belief Networks are probabilistic generative models which are composed by multiple layers of latent stochastic variables. The top two layers have symmetric undirected connections, while the lower layers receive directed top-down connections from the layer above. The current state-of-the-art training method for DBNs is contrastive divergence, an efficient learning technique that can approximate and follow the gradient of the data likelihood with respect to the model parameters. In this wo...
Lusci, Alessandro; Pollastri, Gianluca; Baldi, Pierre
2013-01-01
Shallow machine learning methods have been applied to chemoinformatics problems with some success. As more data becomes available and more complex problems are tackled, deep machine learning methods may also become useful. Here we present a brief overview of deep learning methods and show in particular how recursive neural network approaches can be applied to the problem of predicting molecular properties. However molecules are typically described by undirected cyclic graphs, while recursive ...
Graphical description of the action of Clifford operators on stabilizer states
Elliott, Matthew B.; Eastin, Bryan; Caves, Carlton M.
2007-01-01
We introduce a graphical representation of stabilizer states and translate the action of Clifford operators on stabilizer states into graph operations on the corresponding stabilizer-state graphs. Our stabilizer graphs are constructed of solid and hollow nodes, with (undirected) edges between nodes and with loops and signs attached to individual nodes. We find that local Clifford transformations are completely described in terms of local complementation on nodes and along edges, loop compleme...
Kinerja Lingkungan Terhadap Return on Asset Melalui Corporate Social Responsibility Discloure
Restuningdiah, Nurika
2010-01-01
The purpose of this research was to examine the impact of environmental perfor-mance to Corporate Social Responsibility (CSR) disclosure, the impact of CSR disclosure toReturn on Asset, and the undirect impact of of environmental performance to Return onAsset through CSR disclosure. Path Analysis of 18 public companies listed in Indonesia StockExchange and participated in the Proper Program from 2007 -2008 through a judgment sam-pling technique indicated that environmental performance had a p...
On the deployment of agents by binary information
De Persis, Claudio; Cao, Ming; Ceragioli, Francesca
2011-01-01
We study the problem of deploying on a line a group of N agents with kinematic continuous-time model x˙i = ui , i = 1,...,N , (1) with xi ,ui ∈ R. The agents are connected through an undirected chain graph G = (V ,E ), with V = {1,2,...,N} and E = {(1,2),...,(i,i + 1),...,(N − 1,N)}. Moreover, we
Suborbital graphs of the symmetric group S n acting on unordered r ...
African Journals Online (AJOL)
In this paper we construct the suborbital graphs of the symmetric group Sn acting on unordered r‐element subsets of X = {1, 2, 3, ..., n}, χ(r) (r,n ∈ ℕ) and analyse their properties. It is shown that the suborbital graphs are undirected, connected if r <½n, and have girth three if n ≥ 3r. Key words: Symmetric group, r‐element ...
DEFF Research Database (Denmark)
Agreste, Santa; De Meo, Pasquale; Fiumara, Giacomo
2017-01-01
Detecting communities in graphs is a fundamental tool to understand the structure of Web-based systems and predict their evolution. Many community detection algorithms are designed to process undirected graphs (i.e., graphs with bidirectional edges) but many graphs on the Web-e.g., microblogging ...... the best trade-off between accuracy and computational performance and, therefore, it has to be considered as a promising tool for Web Data Analytics purposes....
Network similarity and statistical analysis of earthquake seismic data
Deyasi, Krishanu; Chakraborty, Abhijit; Banerjee, Anirban
2016-01-01
We study the structural similarity of earthquake networks constructed from seismic catalogs of different geographical regions. A hierarchical clustering of underlying undirected earthquake networks is shown using Jensen-Shannon divergence in graph spectra. The directed nature of links indicates that each earthquake network is strongly connected, which motivates us to study the directed version statistically. Our statistical analysis of each earthquake region identifies the hub regions. We cal...
External Memory Algorithms for Diameter and All-Pair Shortest-Paths on Sparse Graphs
DEFF Research Database (Denmark)
Arge, Lars; Meyer, Ulrich; Toma, Laura
2004-01-01
We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block......-size and M is the size of internal memory. For weighted undirected graphs we present a cache-aware APSP algorithm that performs O(V · ( V E B +E B log E B )) I/Os. We also present efficient cacheaware algorithms that find paths between all pairs of vertices in an unweighted graph with lengths within a small...... additive constant of the shortest path length. All of our results improve earlier results known for these problems. For approximate APSP we provide the first nontrivial results. Our diameter result uses O(V + E) extra space, and all of our other algorithms use O(V 2) space....
Boyle, Elizabeth A; Duffy, Tim; Dunleavy, Karen
2003-06-01
Vermunt's (1994) Inventory of Learning Styles (ILS) integrates four components of learning: processing strategies, regulation strategies, mental models of learning and learning orientations. Using explanatory factor analysis, Vermunt (1998) identified four different learning styles, meaning-directed, reproduction-directed, application-directed and undirected, which displayed characteristic patterns of factor loadings across the four components of learning. The aims of the current study were to test the generalisability of Vermunt's integrated model of learning with a sample of students from a British university and to establish whether different learning styles were associated with different academic outcomes. A total of 273 students from a British university took part. Confirmatory factor analysis was used to test Vermunt's four-factor model of learning styles and compare it with alternative models. Interrelationships between components of the ILS were examined in more detail using regression analyses. The relationship between learning style and academic outcome was also examined. Fit indices indicated that Vermunt's four-factor model of learning styles provided the best fit for the current sample. Path estimates associated with meaning-directed and reproduction-directed learning styles loaded across components as described by Vermunt but application-directed and undirected learning styles loaded mainly on conceptions and orientations components. Undirected learning style had a low negative association with academic performance, while the meaning-directed learning style had a low positive association with academic performance. Although the ILS did identify Vermunt's four learning styles, different learning environments influence the precise characteristics of each learning style.
Proposal and Evaluation of BLE Discovery Process Based on New Features of Bluetooth 5.0
Directory of Open Access Journals (Sweden)
Ángela Hernández-Solana
2017-08-01
Full Text Available The device discovery process is one of the most crucial aspects in real deployments of sensor networks. Recently, several works have analyzed the topic of Bluetooth Low Energy (BLE device discovery through analytical or simulation models limited to version 4.x. Non-connectable and non-scannable undirected advertising has been shown to be a reliable alternative for discovering a high number of devices in a relatively short time period. However, new features of Bluetooth 5.0 allow us to define a variant on the device discovery process, based on BLE scannable undirected advertising events, which results in higher discovering capacities and also lower power consumption. In order to characterize this new device discovery process, we experimentally model the real device behavior of BLE scannable undirected advertising events. Non-detection packet probability, discovery probability, and discovery latency for a varying number of devices and parameters are compared by simulations and experimental measurements. We demonstrate that our proposal outperforms previous works, diminishing the discovery time and increasing the potential user device density. A mathematical model is also developed in order to easily obtain a measure of the potential capacity in high density scenarios.
Extracting weights from edge directions to find communities in directed networks
International Nuclear Information System (INIS)
Lai, Darong; Lu, Hongtao; Nardini, Christine
2010-01-01
Community structures are found to exist ubiquitously in real-world complex networks. We address here the problem of community detection in directed networks. Most of the previous literature ignores edge directions and applies methods designed for community detection in undirected networks, which discards valuable information and often fails when different communities are defined on the basis of incoming and outgoing edges. We suggest extracting information about edge directions using a PageRank random walk and translating such information into edge weights. After extraction we obtain a new weighted directed network in which edge directions can then be safely ignored. We thus transform community detection in directed networks into community detection in reweighted undirected networks. Such an approach can benefit directly from the large volume of algorithms for the detection of communities in undirected networks already developed, since it is not obvious how to extend these algorithms to account for directed networks and the procedure is often difficult. Validations on synthetic and real-world networks demonstrate that the proposed framework can effectively detect communities in directed networks
Proposal and Evaluation of BLE Discovery Process Based on New Features of Bluetooth 5.0.
Hernández-Solana, Ángela; Perez-Diaz-de-Cerio, David; Valdovinos, Antonio; Valenzuela, Jose Luis
2017-08-30
The device discovery process is one of the most crucial aspects in real deployments of sensor networks. Recently, several works have analyzed the topic of Bluetooth Low Energy (BLE) device discovery through analytical or simulation models limited to version 4.x. Non-connectable and non-scannable undirected advertising has been shown to be a reliable alternative for discovering a high number of devices in a relatively short time period. However, new features of Bluetooth 5.0 allow us to define a variant on the device discovery process, based on BLE scannable undirected advertising events, which results in higher discovering capacities and also lower power consumption. In order to characterize this new device discovery process, we experimentally model the real device behavior of BLE scannable undirected advertising events. Non-detection packet probability, discovery probability, and discovery latency for a varying number of devices and parameters are compared by simulations and experimental measurements. We demonstrate that our proposal outperforms previous works, diminishing the discovery time and increasing the potential user device density. A mathematical model is also developed in order to easily obtain a measure of the potential capacity in high density scenarios.
Probably Almost Bayes Decisions
DEFF Research Database (Denmark)
Anoulova, S.; Fischer, Paul; Poelt, S.
1996-01-01
In this paper, we investigate the problem of classifying objects which are given by feature vectors with Boolean entries. Our aim is to "(efficiently) learn probably almost optimal classifications" from examples. A classical approach in pattern recognition uses empirical estimations of the Bayesian...... discriminant functions for this purpose. We analyze this approach for different classes of distribution functions of Boolean features:kth order Bahadur-Lazarsfeld expansions andkth order Chow expansions. In both cases, we obtain upper bounds for the required sample size which are small polynomials...
Bessiere, Pierre; Ahuactzin, Juan Manuel; Mekhnacha, Kamel
2013-01-01
Probability as an Alternative to Boolean LogicWhile logic is the mathematical foundation of rational reasoning and the fundamental principle of computing, it is restricted to problems where information is both complete and certain. However, many real-world problems, from financial investments to email filtering, are incomplete or uncertain in nature. Probability theory and Bayesian computing together provide an alternative framework to deal with incomplete and uncertain data. Decision-Making Tools and Methods for Incomplete and Uncertain DataEmphasizing probability as an alternative to Boolean
Symmetric Logic Synthesis with Phase Assignment
Benschop, N. F.
2001-01-01
Decomposition of any Boolean Function BF_n of n binary inputs into an optimal inverter coupled network of Symmetric Boolean functions SF_k (k \\leq n) is described. Each SF component is implemented by Threshold Logic Cells, forming a complete and compact T-Cell Library. Optimal phase assignment of input polarities maximizes local symmetries. The "rank spectrum" is a new BF_n description independent of input ordering, obtained by mapping its minterms onto an othogonal n \\times n grid of (transi...
Banach spaces of continuous functions as dual spaces
Dales, H G; Lau, A T -M; Strauss, D
2016-01-01
This book gives a coherent account of the theory of Banach spaces and Banach lattices, using the spaces C_0(K) of continuous functions on a locally compact space K as the main example. The study of C_0(K) has been an important area of functional analysis for many years. It gives several new constructions, some involving Boolean rings, of this space as well as many results on the Stonean space of Boolean rings. The book also discusses when Banach spaces of continuous functions are dual spaces and when they are bidual spaces.
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
On Computational Power of Quantum Read-Once Branching Programs
Directory of Open Access Journals (Sweden)
Farid Ablayev
2011-03-01
Full Text Available In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively small (usually logarithmic in the size of input number of qubits. Then we show that the described class of Boolean functions is closed under the polynomial projections.
Modeling digital switching circuits with linear algebra
Thornton, Mitchell A
2014-01-01
Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transf
Blyth, T S; Sneddon, I N; Stark, M
1972-01-01
Residuation Theory aims to contribute to literature in the field of ordered algebraic structures, especially on the subject of residual mappings. The book is divided into three chapters. Chapter 1 focuses on ordered sets; directed sets; semilattices; lattices; and complete lattices. Chapter 2 tackles Baer rings; Baer semigroups; Foulis semigroups; residual mappings; the notion of involution; and Boolean algebras. Chapter 3 covers residuated groupoids and semigroups; group homomorphic and isotone homomorphic Boolean images of ordered semigroups; Dubreil-Jacotin and Brouwer semigroups; and loli
The zonal satellite problem. III Symmetries
Directory of Open Access Journals (Sweden)
Mioc V.
2002-01-01
Full Text Available The two-body problem associated with a force field described by a potential of the form U =Sum(k=1,n ak/rk (r = distance between particles, ak = real parameters is resumed from the only standpoint of symmetries. Such symmetries, expressed in Hamiltonian coordinates, or in standard polar coordinates, are recovered for McGehee-type coordinates of both collision-blow-up and infinity-blow-up kind. They form diffeomorphic commutative groups endowed with a Boolean structure. Expressed in Levi-Civita’s coordinates, the problem exhibits a larger group of symmetries, also commutative and presenting a Boolean structure.
Learning Read-constant Polynomials of Constant Degree modulo Composites
DEFF Research Database (Denmark)
Chattopadhyay, Arkadev; Gavaldá, Richard; Hansen, Kristoffer Arnsfelt
2011-01-01
Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...
Implementing size-optimal discrete neural networks require analog circuitry
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-01
This paper starts by overviewing results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on a constructive solution for Kolmogorov`s superpositions the authors show that implementing Boolean functions can be done using neurons having an identity transfer function. Because in this case the size of the network is minimized, it follows that size-optimal solutions for implementing Boolean functions can be obtained using analog circuitry. Conclusions and several comments on the required precision are ending the paper.
On automatic synthesis of analog/digital circuits
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-31
The paper builds on a recent explicit numerical algorithm for Kolmogorov`s superpositions, and will show that in order to synthesize minimum size (i.e., size-optimal) circuits for implementing any Boolean function, the nonlinear activation function of the gates has to be the identity function. Because classical and--or implementations, as well as threshold gate implementations require exponential size, it follows that size-optimal solutions for implementing arbitrary Boolean functions can be obtained using analog (or mixed analog/digital) circuits. Conclusions and several comments are ending the paper.
No-cloning theorem on quantum logics
International Nuclear Information System (INIS)
Miyadera, Takayuki; Imai, Hideki
2009-01-01
This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloning on effect algebras and hidden variables.
Nayarit-Ballesteros, Nova; Rubio-Lozano, María Salud; Delgado-Suárez, Enrique; Méndez-Medina, Danilo; Braña-Varela, Diego; Rodas-Suárez, Oscar
2016-06-01
To determine the serotype and antibiotic resistance profile of Salmonella spp. isolated from retail ground beef in Mexico City. A total of 100 samples of ground beef were analyzed. The pathogen was isolated by conventional methods and confirmed by PCR (invA gene, 284 bp).The antibiotic resistance profile was determined by the Kirby-Bauer method while serotyping was performed according to the Kauffman-White scheme. We isolated a total of 19 strains of Lomita (6), Derby (4), Senftenberg (2), Javiana and Cannsttat (1) and undetermined (5) serotypes. The strains showed a high resistance rate to ampicillin (18/19), carbenicillin (16/19), tetracyclin (13/19), and trimethoprim-sulfamethoxazole (13/19). Multidrug resistance was observed in 14 isolates. Several Salmonella spp. serotypes of public health significance are circulating in ground beef sold in the major Mexican city. Some of these strains are multi-drug resistance.
Directory of Open Access Journals (Sweden)
Gómez Giraldo Luis Jair
2012-05-01
Full Text Available La biodiversidad es un suceso ecológico realmente sorprendente en tanto existe una extraordinaria homogeneidad química y bioquímica de base, en todos los seres vivos. Se considera que se dan por lo menos tres fenómenos que la explican: la evolución darwiniana, es decir, la evolución ramificada; el «acoplamiento estructural» según lo define H. Maturana; y, por último, los fenómenos termodinámicos, tal como los expone S. Kauffman con apoyo en los conceptos de “organización” y “organización propagativa diversificadota”, y los interpretan E. D. Schneider y J. J. Kay a partir de la Tierra como sistema termodinámico. Su importancia explicativa en la crisis ambiental, manifiesta entre otros sucesos en el calentamiento global, es de gran relevancia.
DEFF Research Database (Denmark)
Baggesen, Dorte Lau; Nielsen, L.R.; Sørensen, Gitte
2007-01-01
Aims: To analyse the relative importance of different biological and technical factors on the analytical sensitivity of conventional culture methods for detection of Salmonella Dublin in cattle faeces. Methods and Results: Faeces samples collected from six adult bovines from different salmonella...... novobiocin, followed by combinations of culture media (three types) and selective media (two types). The sensitivity of each combination and sources of variation in detection were determined by a generalized linear mixed model using a split-plot design. Conclusions: Biological factors, such as faecal origin...... and S. Dublin strain influenced the sensitivity more than technical factors. Overall, the modified semisolid Rappaport Vassiliadis (MSRV)-culture medium had the most reliable detection capability, whereas detection with selenite cystine broth and Mueller Kauffman tetrathionate broth combinations varied...
Manturov, Vassily
2004-01-01
Since discovery of the Jones polynomial, knot theory has enjoyed a virtual explosion of important results and now plays a significant role in modern mathematics. In a unique presentation with contents not found in any other monograph, Knot Theory describes, with full proofs, the main concepts and the latest investigations in the field.The book is divided into six thematic sections. The first part discusses "pre-Vassiliev" knot theory, from knot arithmetics through the Jones polynomial and the famous Kauffman-Murasugi theorem. The second part explores braid theory, including braids in different spaces and simple word recognition algorithms. A section devoted to the Vassiliev knot invariants follows, wherein the author proves that Vassiliev invariants are stronger than all polynomial invariants and introduces Bar-Natan''s theory on Lie algebra respresentations and knots.The fourth part describes a new way, proposed by the author, to encode knots by d-diagrams. This method allows the encoding of topological obje...
Salmonella epidemiology: A whirlwind of change.
Besser, John M
2018-05-01
The field of infectious disease epidemiology for Salmonella and other enteric pathogens is undergoing some of the most profound changes since the time of Kauffman and White. Rapid advances in "big data" technologies such as genomics and metagenomics are making it possible to monitor and control salmonellosis in new and exciting ways. Epidemiological methods are becoming increasingly robust through the routine use of standardized hypothesis-generating questionnaires, iterative open-ended interviewing, informational trace-backs and new modeling techniques for describing the attribution of disease to food sources. In addition, Salmonella epidemiology is facing important challenges and new opportunities due to the rapid adoption of culture independent diagnostic test panels by clinical laboratories. Where is this unprecedented wave of change taking us? This chapter will examine emerging trends in Salmonella epidemiology, and take a peek into the not-so-distant future. Published by Elsevier Ltd.
Is international conservation aid enough?
Law, Elizabeth A.
2016-02-01
Bare et al (2015 Environ. Res. Lett. 10 125010) ask an important question: is international conservation enough? Since the 1990’s international conservation donors have spent over 3.4 billion on biodiversity conservation related projects in sub-Saharan Africa. Both donors and recipients have a right to know if this is effective. Surprisingly, this question is rarely asked. It is a difficult question—involving many rival social, environmental, and economic explanations. Bare, Kauffman and Miller uncover some interesting associations, supporting existing hypotheses and proposing their own: that conservation aid alone is insufficient to mitigate drivers of deforestation (and in some cases may even exacerbate forest loss). This controversial result warrants further investigation—but what is needed now is nuance and robustness in further analyses, to have more confidence in the critique and it’s implications for international conservation aid.
Skein modules of links in cylinders over surfaces
Directory of Open Access Journals (Sweden)
Jens Lieberum
2002-01-01
Full Text Available We define the Conway skein module (M of ordered based links in a 3-manifold M. This module gives rise to (M-valued invariants of usual links in M. We determine a basis of the ℤ[z]-module (Σ×[0,1]/Tor ( (Σ×[0,1], where Σ is the real projective plane or a surface with boundary. For cylinders over the Möbius strip or the projective plane, we derive special properties of the Conway skein module, among them a refinement of a theorem of Hartley and Kawauchi about the Conway polynomial of strongly positive amphicheiral knots in S3. In addition, we determine the Homfly and Kauffman skein modules of Σ×[0,1] where Σ is an oriented surface with boundary.
Corrosion behavior of low energy, high temperature nitrogen ion-implanted AISI 304 stainless steel
Ghoranneviss, M.; Shokouhy, A.; Larijani, M. M.; Haji Hosseini, S. H.; Yari, M.; Anvari, A.; Gholipur Shahraki, M.; Sari, A. H.; Hantehzadeh, M. R.
2007-01-01
This work presents the results of a low-energy nitrogen ion implantation of AISI 304 type stainless steel (SS) at a moderate temperature of about 500°C. The nitrogen ions are extracted from a Kauffman-type ion source at an energy of 30 keV, and ion current density of 100 μA cm^{-2}. Nitrogen ion concentration of 6 × 10^{17}, 8 × 10^{17} and 10^{18} ions cm^{-2}, were selected for our study. The X-ray diffraction results show the formation of CrN polycrystalline phase after nitrogen bombardment and a change of crystallinity due to the change in nitrogen ion concentration. The secondary ion mass spectrometry (SIMS) results show the formation of CrN phases too. Corrosion test has shown that corrosion resistance is enhanced by increasing nitrogen ion concentration.
Directory of Open Access Journals (Sweden)
Nova Nayarit-Ballesteros
2016-05-01
Full Text Available Objective. To determine the serotype and antibiotic resistance profile of Salmonella spp. isolated from retail ground beef in Mexico City. Materials and methods. A total of 100 samples of ground beef were analyzed. The pathogen was isolated by conventional methods and confirmed by PCR (invA gene, 284 bp. The antibiotic resistance profile was determined by the Kirby-Bauer method while serotyping was performed according to the Kauffman-White scheme. Results. We isolated a total of 19 strains of Lomita (6, Derby (4, Senftenberg (2, Javiana and Cannsttat (1 and undeter- mined (5 serotypes. The strains showed a high resistance rate to ampicillin (18/19, carbenicillin (16/19, tetracyclin (13/19, and trimethoprim-sulfamethoxazole (13/19. Multidrug resistance was observed in 14 isolates. Conclusions. Several Salmonella spp. serotypes of public health significance are circulating in ground beef sold in the major Mexican city. Some of these strains are multi-drug resistance.
Origin of life experts might find inspiration at CERN
Katarina Anthony & Anaïs Schaeffer
2011-01-01
“How did life appear on Earth?” That was the unanswered question on attendees’ minds at a single-day workshop held at CERN, 20 May. The brainstorming session featured experts from the biology field and CERN physicists. Although the million-dollar question wasn't answered, the group explored the possibility of organising a large-scale research project that could do just that. Darwin’s vision of "descent with modification" from his "B" notebook. According to workshop chair Stuart Kauffman, an American theoretical biologist, currently Finland Distinguished Professor (FiDiPro) at the Tampere University of Technology: “The Origin of Life problem began with Louis Pasteur, who refused to believe in the ‘spontaneous generation principle’ of life. All life, he said, comes from life. This left Pasteur in a conundrum: how did life start in the first place?” As a renowne...
Examining the contributions of a community coalition in addressing urban health determinants.
Watson-Thompson, Jomella; May, Margaret J; Jefferson, Jessie; Young, Yolanda; Young, Alan; Schultz, Jerry
2018-01-01
Community coalitions facilitate changes in community outcomes and conditions by addressing issues and determinants of health and well-being. The purpose of the present study was to examine the process of a community coalition, the Ivanhoe Neighborhood Council (INC), in addressing community-prioritized urban health determinants aimed at improving living conditions in a neighborhood in Kansas City, Missouri. Using an empirical case study design, the implementation of the community change framework supported through the Kauffman Neighborhood Initiative is examined. The results suggest that the INC was effective in implementing 117 community changes, and these changes were associated with modest improvements in targeted outcomes related to housing and crime. A 10 year follow-up probe indicates that the majority of recurring community changes were sustained. The results indicate that the comprehensive community initiative was important in facilitating community change that may have contributed to improvements in addressing urban health determinants.
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
On P versus NP \\cap co-NP for Decision Trees and Read-Once Branching Programs
Czech Academy of Sciences Publication Activity Database
Jukna, S.; Razborov, A.; Savický, Petr; Wegener, I.
1999-01-01
Roč. 8, č. 4 (1999), s. 357-370 ISSN 1016-3328 R&D Projects: GA ČR GA201/95/0976 Institutional research plan: AV0Z1030915 Keywords : computational complexity * Boolean functions * decision trees * branching programs * P versus NP intersection co-NP Subject RIV: BA - General Mathematics Impact factor: 0.161, year: 1999
A Top-down Approach to Genetic Circuit Synthesis and Optimized Technology Mapping
DEFF Research Database (Denmark)
Baig, Hasan; Madsen, Jan
2017-01-01
Genetic logic circuits are becoming popular as an emerging field of technology. They are composed of genetic parts of DNA and work inside a living cell to perform a dedicated boolean function triggered by the presence or absence of certain proteins or other species....
Defining the Symmetry of the Universal Semi-Regular Autonomous Asynchronous Systems
Directory of Open Access Journals (Sweden)
Serban E. Vlad
2012-02-01
Full Text Available The regular autonomous asynchronous systems are the non-deterministic Boolean dynamical systems and universality means the greatest in the sense of the inclusion. The paper gives four definitions of symmetry of these systems in a slightly more general framework, called semi-regularity, and also many examples.
Weak Distributivity. A Problem of von Neumann and the Mystery of Measurability
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas
2006-01-01
Roč. 12, č. 2 (2006), s. 241-266 ISSN 1079-8986 R&D Projects: GA AV ČR(CZ) IAA100190509 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * weak distributivity * submeasure Subject RIV: BA - General Mathematics Impact factor: 0.525, year: 2006
Algebraic characterizations of measure algebras
Czech Academy of Sciences Publication Activity Database
Jech, Thomas
2008-01-01
Roč. 136, č. 4 (2008), s. 1285-1294 ISSN 0002-9939 R&D Projects: GA AV ČR IAA100190509 Institutional research plan: CEZ:AV0Z10190503 Keywords : Von - Neumann * sequential topology * Boolean-algebras * Souslins problem * Submeasures Subject RIV: BA - General Mathematics Impact factor: 0.584, year: 2008
African Journals Online (AJOL)
Items 151 - 200 of 278 ... Abstract. Gawie Schlebusch, Motsamai Thobedi. Vol 45, No 2 (2011), Linking reading literacy assessment and teaching: Rethinking preservice teacher training programmes in the Foundation Phase, Abstract. C Nel. Vol 49, No 1 (2015), Marking for Structure using Boolean Feedback, Abstract. H Louw.
Generating and Solving Symbolic Parity Games
Kant, Gijs; van de Pol, Jan Cornelis
We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System (PBES) and then instantiates the PBES to a parity game. We
Efficient Multi-Party Computation over Rings
DEFF Research Database (Denmark)
Cramer, Ronald; Fehr, Serge; Ishai, Yuval
2003-01-01
by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these techniques: – Generality. Existing protocols do not apply to computation over more general algebraic structures (except via a brute-force simulation of computation in these structures). – Efficiency. The best...
Fuzzy and rough formal concept analysis: a survey
Poelmans, J.; Ignatov, D.I.; Kuznetsov, S.O.; Dedene, G.
2014-01-01
Formal Concept Analysis (FCA) is a mathematical technique that has been extensively applied to Boolean data in knowledge discovery, information retrieval, web mining, etc. applications. During the past years, the research on extending FCA theory to cope with imprecise and incomplete information made
Developing and Testing an Online Tool for Teaching GIS Concepts Applied to Spatial Decision-Making
Carver, Steve; Evans, Andy; Kingston, Richard
2004-01-01
The development and testing of a Web-based GIS e-learning resource is described. This focuses on the application of GIS for siting a nuclear waste disposal facility and the associated principles of spatial decision-making using Boolean and weighted overlay methods. Initial student experiences in using the system are analysed as part of a research…
GIS-based Multi-Criteria Analysis of Wind Farm Development
DEFF Research Database (Denmark)
Hansen, Henning Sten
2005-01-01
, which can provide tools for analysing the complex trade-offs between choice alternatives with different environmental and socio-economic impacts. The weaknesses of the Boolean logic have been recognised in recent years and a fuzzy logic approach is applied in the system design. The developed methodology...
Inferring Toxicological Responses of HepG2 Cells from ...
Understanding the dynamic perturbation of cell states by chemicals can aid in for predicting their adverse effects. High-content imaging (HCI) was used to measure the state of HepG2 cells over three time points (1, 24, and 72 h) in response to 976 ToxCast chemicals for 10 different concentrations (0.39-200µM). Cell state was characterized by p53 activation (p53), c-Jun activation (SK), phospho-Histone H2A.x (OS), phospho-Histone H3 (MA), alpha tubulin (Mt), mitochondrial membrane potential (MMP), mitochondrial mass (MM), cell cycle arrest (CCA), nuclear size (NS) and cell number (CN). Dynamic cell state perturbations due to each chemical concentration were utilized to infer coarse-grained dependencies between cellular functions as Boolean networks (BNs). BNs were inferred from data in two steps. First, the data for each state variable were discretized into changed/active (> 1 standard deviation), and unchanged/inactive values. Second, the discretized data were used to learn Boolean relationships between variables. In our case, a BN is a wiring diagram between nodes that represent 10 previously described observable phenotypes. Functional relationships between nodes were represented as Boolean functions. We found that inferred BN show that HepG2 cell response is chemical and concentration specific. We observed presence of both point and cycle BN attractors. In addition, there are instances where Boolean functions were not found. We believe that this may be either
Classes of feedforward neural networks and their circuit complexity
Shawe-Taylor, John S.; Anthony, Martin H.G.; Kern, Walter
1992-01-01
This paper aims to place neural networks in the context of boolean circuit complexity. We define appropriate classes of feedforward neural networks with specified fan-in, accuracy of computation and depth and using techniques of communication complexity proceed to show that the classes fit into a
Better Size Estimation for Sparse Matrix Products
DEFF Research Database (Denmark)
Amossen, Rasmus Resen; Campagna, Andrea; Pagh, Rasmus
2010-01-01
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse Boolean matrix product. Let n denote the total number of non-zero entries in the input matrices. We show how to compute a 1 ± ε approximation (with small probability of error) in expected t...
The Impact of the North Korean Nuclear Crisis on Northeast Asia
2007-12-01
reactor. In June 1994, North Korea’s President Kim Il-sung reactivated a longstanding invitation to former U.S. President Jimmy Carter to visit...BOOLEAN&startDocNo=226&results UrlKey=29_T853026030&cisb=22_T853026029&treeMax=true&treeWidth=0& csi=151977&docNo=240 (accessed July 18, 2007). Choo
Topology of Document Retrieval Systems.
Everett, Daniel M.; Cater, Steven C.
1992-01-01
Explains the use of a topological structure to examine the closeness between documents in retrieval systems and analyzes the topological structure of a vector-space model, a fuzzy-set model, an extended Boolean model, a probabilistic model, and a TIRS (Topological Information Retrieval System) model. Proofs for the results are appended. (17…
Relationships between average depth and number of misclassifications for decision trees
Chikalov, Igor
2014-02-14
This paper presents a new tool for the study of relationships between the total path length or the average depth and the number of misclassifications for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [9] and datasets representing Boolean functions with 10 variables.
Dien,cephalic Instability and Aggression*
African Journals Online (AJOL)
For example, 16 subsyndromes of schizophrenia have been so delineated.'· It is likely that there are many more than three indicants of diencephalic instability and the indentification of subsyndromes may well involve tracing a path through a Boolean lattice. Aggressive behaviour is the indicant of particular interest here.
Introducing Online Bibliographic Service to its Users: The Online Presentation
Crane, Nancy B.; Pilachowski, David M.
1978-01-01
A description of techniques for introducing online services to new user groups includes discussion of terms and their definitions, evolution of online searching, advantages and disadvantages of online searching, production of the data bases, search strategies, Boolean logic, costs and charges, "do's and don'ts," and a user search questionnaire. (J…
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
-, č. 3 (2014), s. 3-11 ISSN 1999-8554 Institutional support: RVO:67985807 Keywords : boolean factor analysis * attractor neural network * likelihood function maximization * KEGG database Subject RIV: IN - Informatics, Computer Science http://www.radiotec.ru/ cat alog.php? cat =jr7&art=14354
Fuzzy Information Retrieval Using Genetic Algorithms and Relevance Feedback.
Petry, Frederick E.; And Others
1993-01-01
Describes an approach that combines concepts from information retrieval, fuzzy set theory, and genetic programing to improve weighted Boolean query formulation via relevance feedback. Highlights include background on information retrieval systems; genetic algorithms; subproblem formulation; and preliminary results based on a testbed. (Contains 12…
Linear and branching metrics for quantitative transition systems
de Alfaro, L.; Faella, M.; Stoelinga, Mariëlle Ida Antoinette; Díaz, J.; Karhumäki, J.; Lepistö, A.; Sannella, D.
2004-01-01
We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0,1]. Trace inclusion and equivalence give rise to asymmetrical and
Local Model Checking of Weighted CTL with Upper-Bound Constraints
DEFF Research Database (Denmark)
Jensen, Jonas Finnemann; Larsen, Kim Guldstrand; Srba, Jiri
2013-01-01
boolean domain to nonnegative integers in order to cope with the weights. We present both global and local algorithms for the fixed-point computation on symbolic dependency graphs and argue for the advantages of our approach compared to the direct encoding of the model checking problem into dependency...
SITE SUITABILITY ANALYSIS AND ROUTE OPTIMIZATION FOR ...
African Journals Online (AJOL)
Fimba
hence the application of GIS and Remote Sensing to waste disposal Site Suitability analysis and route optimization for solid waste in Yola town. Different factors or criteria were considered in relation to solid waste disposal sites. In order to achieve the aim of this paper, the Boolean logic was used, where suitable areas were ...
Target-Based Maintenance of Privacy Preserving Association Rules
Ahluwalia, Madhu V.
2011-01-01
In the context of association rule mining, the state-of-the-art in privacy preserving data mining provides solutions for categorical and Boolean association rules but not for quantitative association rules. This research fills this gap by describing a method based on discrete wavelet transform (DWT) to protect input data privacy while preserving…
Algorithms, The λ Calculus and Programming
Indian Academy of Sciences (India)
IAS Admin
even a machine can do it. 1. Place the integers one below the other such that their least significant digits are aligned. 2. Start from the least significant digits and .... RESONANCE | April 2013. GENERAL | ARTICLE. The λ calculus is deceptively simple. The Boolean values TRUE and. FALSE do not have any meaning in.
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 ...... leave a substantial gap, a challenge for future work....
Evaluation and analysis of term scoring methods for term extraction
Verberne, S.; Sappelli, M.; Hiemstra, D.; Kraaij, W.
2016-01-01
We evaluate five term scoring methods for automatic term extraction on four different types of text collections: personal document collections, news articles, scientific articles and medical discharge summaries. Each collection has its own use case: author profiling, boolean query term suggestion,
Using the Perceptron Algorithm to Find Consistent Hypotheses
Anthony, M.; Shawe-Taylor, J.
1993-01-01
The perceptron learning algorithm yields quite naturally an algorithm for finding a linearly separable boolean function consistent with a sample of such a function. Using the idea of a specifying sample, we give a simple proof that this algorithm is not efficient, in general.
Sound Probabilistic #SAT with Projection
Directory of Open Access Journals (Sweden)
Vladimir Klebanov
2016-10-01
Full Text Available We present an improved method for a sound probabilistic estimation of the model count of a boolean formula under projection. The problem solved can be used to encode a variety of quantitative program analyses, such as concerning security of resource consumption. We implement the technique and discuss its application to quantifying information flow in programs.
On the Combinatorics of SAT and the Complexity of Planar Problems
DEFF Research Database (Denmark)
Talebanfard, Navid
In this thesis we study several problems arising in Boolean satisfiability ranging from lower bounds for SAT algorithms and proof systems to extremal properties of formulas. The first problem is about construction of hard instances for k-SAT algorithms. For PPSZ algorithm [40] we give the first...
Whose side are you on? : Finding solutions in a biased search-tree
Heule, M.J.H.; Van Maaren, H.
2008-01-01
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior on unsatisfiable instances. Direction heuristics select which Boolean value to assign to a decision variable. They are
1986-06-12
range exceeding the INTEGER’LAST values and with a component that is a null BOOLEAN array, this compilar raises NUMERIC ERROR when the type is declared...Computer Systems Division Software Development . Program Structure and Compilation A ’main’ program must be a non-generic subprogram that is either a
A Counterexample Guided Abstraction Refinement Framework for Verifying Concurrent C Programs
2005-05-24
Davis and Hilary Putnam . A computing procedure for quantification theory. Journal of the ACM (JACM), 7(3):201–215, June 1960. [53] C. Demartini, R... Putnam -Loveland [51, 52] algorithm that handles these constraints directly. PBS accepts as input standard CNF formulas augmented with pseudo-Boolean
A MuDDy Experience-ML Bindings to a BDD Library
DEFF Research Database (Denmark)
Larsen, Ken Friis
2009-01-01
Binary Decision Diagrams (BDDs) are a data structure used to efficiently represent boolean expressions on canonical form. BDDs are often the core data structure in model checkers. MuDDy is an ML interface (both for Standard ML and Objective Caml) to the BDD package BuDDy that is written in C. Thi...
Guide to Human Factors Information Sources.
1984-11-01
intermediary, a computer search is sometimes unnecessary. A lucid way of presenting a search objective is either by Boolean (and/or) expressions or by Venn...1965). Human factors evaluation in system development. New York: John Wiley & Sons. 56. Murray, E. J. (1965). Sleep, dreams , and arousal. New York
How to Circumvent Church Numerals
DEFF Research Database (Denmark)
Goldberg, Mayer; Torgersen, Mads
2002-01-01
In this work we consider a standard numeral system in the lambda-calculus, and the elementary arithmetic and Boolean functions and predicates defined on this numeral system, and show how to construct terms that "circumvent" or "defeat" these functions: The equality predicate is satisfied when com...
On algorithmic equivalence of instruction sequences for computing bit string functions
Bergstra, J.A.; Middelburg, C.A.
2015-01-01
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We
On algorithmic equivalence of instruction sequences for computing bit string functions
Bergstra, J.A.; Middelburg, C.A.
2014-01-01
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We
Quantum Probability Zero-One Law for Sequential Terminal Events
Rehder, Wulf
1980-07-01
On the basis of the Jauch-Piron quantum probability calculus a zero-one law for sequential terminal events is proven, and the significance of certain crucial axioms in the quantum probability calculus is discussed. The result shows that the Jauch-Piron set of axioms is appropriate for the non-Boolean algebra of sequential events.
DEFF Research Database (Denmark)
Jarre, Astrid; Paterson, B.; Moloney, C.L.
2008-01-01
rule-based Boolean and fuzzy-logic models have been used successfully as knowledge-based decision support tools. This study compares two such systems relevant to fisheries management in an EAF developed for the southern Benguela. The first is a rule-based system for the prediction of anchovy...
Czech Academy of Sciences Publication Activity Database
Šorel, Michal; Šíma, Jiří
2004-01-01
Roč. 62, - (2004), s. 93-110 ISSN 0925-2312 R&D Projects: GA AV ČR IAB2030007; GA MŠk LN00A056 Keywords : radial basis function * neural network * finite automaton * Boolean circuit * computational power Subject RIV: BA - General Mathematics Impact factor: 0.641, year: 2004
Solving a discrete model of the lac operon using Z3
Gutierrez, Natalia A.
2014-05-01
A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.
Reconfigurable Magnetic Logic Combined with Nonvolatile Memory Writing
Luo, Zhaochu
2016-11-16
In the magnetic logic, four basic Boolean logic operations can be programmed by a magnetic bit at room temperature with a high output ratio (>103%). In the same clock cycle, benefiting from the built-in spin Hall effect, logic results can be directly written into magnetic bits using an all-electric method.
A Characterization of Banach Spaces Containing l1
Rosenthal, Haskell P.
1974-01-01
It is proved that a Banach space contains a subspace isomorphic to l1 if (and only if) it has a bounded sequence with no weak-Cauchy subsequence. The proof yields that a sequence of subsets of a given set has a subsequence that is either convergent or Boolean independent. PMID:16592162
A characterization of banach spaces containing L.
Rosenthal, H P
1974-06-01
It is proved that a Banach space contains a subspace isomorphic to l(1) if (and only if) it has a bounded sequence with no weak-Cauchy subsequence. The proof yields that a sequence of subsets of a given set has a subsequence that is either convergent or Boolean independent.
The Algorithmic Complexity of Modular Decomposition
J.C. Bioch (Cor)
2001-01-01
textabstractModular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. We propose an O(mn)-algorithm for the recognition of a modular set of a monotone Boolean function f with m prime implicants and n variables.
Introduction to image processing and analysis
Russ, John C
2007-01-01
ADJUSTING PIXEL VALUES Optimizing Contrast Color Correction Correcting Nonuniform Illumination Geometric Transformations Image Arithmetic NEIGHBORHOOD OPERATIONS Convolution Other Neighborhood Operations Statistical Operations IMAGE PROCESSING IN THE FOURIER DOMAIN The Fourier Transform Removing Periodic Noise Convolution and Correlation Deconvolution Other Transform Domains Compression BINARY IMAGES Thresholding Morphological Processing Other Morphological Operations Boolean Operations MEASUREMENTS Global Measurements Feature Measurements Classification APPENDIX: SOFTWARE REFERENCES AND LITERATURE INDEX.
Creating Büchi automata for multi-valued model checking
Vijzelaar, Stefan J.J.; Fokkink, Wan J.
2017-01-01
In explicit state model checking of linear temporal logic properties, a Büchi automaton encodes a temporal property. It interleaves with a Kripke model to form a state space, which is searched for counterexamples. Multi-valued model checking considers additional truth values beyond the Boolean true
Linear and Branching System Metrics
J., Hilston; de Alfaro, Luca; Faella, Marco; M.Z., Kwiatkowska; Telek, M.; Stoelinga, Mariëlle Ida Antoinette
We extend the classical system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as elements of arbitrary metric spaces. Trace inclusion and equivalence give rise to asymmetrical
On the Equational Definition of the Least Prefixed Point
DEFF Research Database (Denmark)
Santocanale, Luigi
2003-01-01
We propose a method to axiomatize by equations the least prefixed point of an order preserving function. We discuss its domain of application and show that the Boolean modal μ-calculus has a complete equational axiomatization. The method relies on the existence of a “closed structure” and its...
Czech Academy of Sciences Publication Activity Database
Balcar, B.; Doucha, Michal; Hrušák, M.
2015-01-01
Roč. 32, č. 1 (2015), s. 69-81 ISSN 0167-8094 R&D Projects: GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : forcing * Boolean algebras * base tree Subject RIV: BA - General Mathematics Impact factor: 0.614, year: 2015 http://link.springer.com/article/10.1007/s11083-013-9316-2
On the Complexity of Numerical Analysis
DEFF Research Database (Denmark)
Allender, Eric; Bürgisser, Peter; Kjeldgaard-Pedersen, Johan
2005-01-01
an integer N, decide whether N>0. We show that PosSLP lies in the counting hierarchy, and we show that if A is any language in the Boolean part of Polynomial-time over the Reals accepted by a machine whose machine constants are algebraic real numbers, then A is in P^PosSLP. Combining our results with work...
Mapping aflatoxin risk from milk consumption using biophysical and ...
African Journals Online (AJOL)
based mapping using Boolean overlays without weighting was implemented in the ArcGIS v10.3 platform. Areas of convergence were overlaid with regions of historical outbreaks to come up with likely locations of aflatoxin risk and target ...
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
DEFF Research Database (Denmark)
Fränzle, Martin; Herde, Christian
2005-01-01
In this paper we present HySat, a new bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL-based pseudo-Boolean SAT solver and a linear programming routine as core engine. In contrast to related tools like MathSAT, ICS, or CVC, our tool exploits all...