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...
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.
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.
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.
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.
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.
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
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}.
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
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
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.
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
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...
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....
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 Factor Analysis by Attractor Neural Network
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2007-01-01
Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007
Boolean-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
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.
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.
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...
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)
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
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
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.
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.
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.
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...
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
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.
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.
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
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.
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
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.
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
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.
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.
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.
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)
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....
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...
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....
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
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
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.
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).
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
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...
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 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
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
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.
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).
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
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.
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.
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)
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.
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
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.
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.
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
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.
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
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.
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…
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.
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.
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
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."
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.
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 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
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.
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.
Position-sensing detector for logical operations using incoherent light
Vikram, Chandra S.; Caulfield, Henry J.
2005-11-01
The application of a position-sensing detector to optical logic operations has been introduced and experimentally demonstrated for the first time. We describe some possible architectures for all 16 two-input Boolean gates as well as for multi-input gates.
Anthraquinone-based demultiplexer and other multiple operations at ...
Indian Academy of Sciences (India)
Boolean operations such as NOR, XOR, XNOR, INH – and the most common combinational circuits, i.e., half– and full–adders and –subtractors, multiplexer, demultiplexer.10–18. An important function in information technology is signal multiplexing/demultiplexing. A 2:1 multiplexer. (MUX) is a circuit with two data inputs, ...
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
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
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
Asynchronous Operators of Sequential Logic Venjunction & Sequention
Vasyukevich, Vadim
2011-01-01
This book is dedicated to new mathematical instruments assigned for logical modeling of the memory of digital devices. The case in point is logic-dynamical operation named venjunction and venjunctive function as well as sequention and sequentional function. Venjunction and sequention operate within the framework of sequential logic. In a form of the corresponding equations, they organically fit analytical expressions of Boolean algebra. Thus, a sort of symbiosis is formed using elements of asynchronous sequential logic on the one hand and combinational logic on the other hand. So, asynchronous
The approximation of bivariate Chlodowsky-Sz?sz-Kantorovich-Charlier-type operators
Agrawal, Purshottam Narain; Baxhaku, Behar; Chauhan, Ruchi
2017-01-01
Abstract In this paper, we introduce a bivariate Kantorovich variant of combination of Szász and Chlodowsky operators based on Charlier polynomials. Then, we study local approximation properties for these operators. Also, we estimate the approximation order in terms of Peetre’s K-functional and partial moduli of continuity. Furthermore, we introduce the associated GBS-case (Generalized Boolean Sum) of these operators and study the degree of approximation by means of the Lipschitz class of Bög...
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.
Unambiguous discrimination among oracle operators
International Nuclear Information System (INIS)
Chefles, Anthony; Kitagawa, Akira; Takeoka, Masahiro; Sasaki, Masahide; Twamley, Jason
2007-01-01
We address the problem of unambiguous discrimination among oracle operators. The general theory of unambiguous discrimination among unitary operators is extended with this application in mind. We prove that entanglement with an ancilla cannot assist any discrimination strategy for commuting unitary operators. We also obtain a simple, practical test for the unambiguous distinguishability of an arbitrary set of unitary operators on a given system. Using this result, we prove that the unambiguous distinguishability criterion is the same for both standard and minimal oracle operators. We then show that, except in certain trivial cases, unambiguous discrimination among all standard oracle operators corresponding to integer functions with fixed domain and range is impossible. However, we find that it is possible to unambiguously discriminate among the Grover oracle operators corresponding to an arbitrarily large unsorted database. The unambiguous distinguishability of standard oracle operators corresponding to totally indistinguishable functions, which possess a strong form of classical indistinguishability, is analysed. We prove that these operators are not unambiguously distinguishable for any finite set of totally indistinguishable functions on a Boolean domain and with arbitrary fixed range. Sets of such functions on a larger domain can have unambiguously distinguishable standard oracle operators, and we provide a complete analysis of the simplest case, that of four functions. We also examine the possibility of unambiguous oracle operator discrimination with multiple parallel calls and investigate an intriguing unitary superoperator transformation between standard and entanglement-assisted minimal oracle operators
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.
A Generalized If-Then-Else Operator for the Representation of Multi-Output Functions
Directory of Open Access Journals (Sweden)
Ilya Levin
2013-01-01
Full Text Available The paper deals with fundamentals of systems of Boolean functions called multi-output functions (MOFs. A new approach to representing MOFs is introduced based on a Generalized If-Then-Else (GITE function. It is shown that known operations on MOFs may be expressed by a GITE function. The GITE forms the algebra of MOFs. We use the properties of this algebra to solve an MOF-decomposition problem. The solution provides a compact representation of MOFs.
The approximation of bivariate Chlodowsky-Szász-Kantorovich-Charlier-type operators
Directory of Open Access Journals (Sweden)
Purshottam Narain Agrawal
2017-08-01
Full Text Available Abstract In this paper, we introduce a bivariate Kantorovich variant of combination of Szász and Chlodowsky operators based on Charlier polynomials. Then, we study local approximation properties for these operators. Also, we estimate the approximation order in terms of Peetre’s K-functional and partial moduli of continuity. Furthermore, we introduce the associated GBS-case (Generalized Boolean Sum of these operators and study the degree of approximation by means of the Lipschitz class of Bögel continuous functions. Finally, we present some graphical examples to illustrate the rate of convergence of the operators under consideration.
The approximation of bivariate Chlodowsky-Szász-Kantorovich-Charlier-type operators.
Agrawal, Purshottam Narain; Baxhaku, Behar; Chauhan, Ruchi
2017-01-01
In this paper, we introduce a bivariate Kantorovich variant of combination of Szász and Chlodowsky operators based on Charlier polynomials. Then, we study local approximation properties for these operators. Also, we estimate the approximation order in terms of Peetre's K-functional and partial moduli of continuity. Furthermore, we introduce the associated GBS-case (Generalized Boolean Sum) of these operators and study the degree of approximation by means of the Lipschitz class of Bögel continuous functions. Finally, we present some graphical examples to illustrate the rate of convergence of the operators under consideration.
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.
"Chemical transformers" from nanoparticle ensembles operated with logic.
Motornov, Mikhail; Zhou, Jian; Pita, Marcos; Gopishetty, Venkateshwarlu; Tokarev, Ihor; Katz, Evgeny; Minko, Sergiy
2008-09-01
The pH-responsive nanoparticles were coupled with information-processing enzyme-based systems to yield "smart" signal-responsive hybrid systems with built-in Boolean logic. The enzyme systems performed AND/OR logic operations, transducing biochemical input signals into reversible structural changes (signal-directed self-assembly) of the nanoparticle assemblies, thus resulting in the processing and amplification of the biochemical signals. The hybrid system mimics biological systems in effective processing of complex biochemical information, resulting in reversible changes of the self-assembled structures of the nanoparticles. The bioinspired approach to the nanostructured morphing materials could be used in future self-assembled molecular robotic systems.
Operator algebras generated by commuting projections a vector measure approach
Ricker, Werner
1999-01-01
This book presents a systematic investigation of the theory of those commutative, unital subalgebras (of bounded linear operators acting in a Banach space) which are closed for some given topology and are generated by a uniformly bounded Boolean algebra of projections. One of the main aims is to employ the methods of vector measures and integration as a unifying theme throughout. This yields proofs of several classical results which are quite different to the classical ones. This book is directed to both those wishing to learn this topic for the first time and to current experts in the field.
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.
Numerical solution of the problem of selecting the optimum method of operating oil wells
Energy Technology Data Exchange (ETDEWEB)
Skryago, A.M.; Chirikov, L.I.; Fridman, G.Sh.; Kolokolov, A.A.; Panteleyev, G.V.; Terent' yev, S.A.; Zabudskiy, G.G.
1981-01-01
A mathematical model is studied for selecting the optimum method of operating the wells of an oil field, which is a linear Boolean programming problem. It is shown that this problem is equivalent to the generalized packet problem and a single product variant model of sectoral planning. Numerical calculations on the computer using as the initial problem the modified method of E. Balash, for the generalized packet problem the method of M.F. Kazakovaya, and the single product variant problem of sectoral planning the method of A. Ye. Bakhtin, show the greatest effectiveness for the problem studied of A. Ye. Bakhtin's method.
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
Dostal, Jiri
1993-01-01
This book provides the reader with the practical knowledge necessary to select and use operational amplifier devices. It presents an extensive treatment of applications and a practically oriented, unified theory of operational circuits.Provides the reader with practical knowledge necessary to select and use operational amplifier devices. Presents an extensive treatment of applications and a practically oriented, unified theory of operational circuits
Directory of Open Access Journals (Sweden)
Anda VELICANU
2010-09-01
Full Text Available This paper contains a brief description of the most important operations that can be performed on spatial data such as spatial queries, create, update, insert, delete operations, conversions, operations on the map or analysis on grid cells. Each operation has a graphical example and some of them have code examples in Oracle and PostgreSQL.
Directory of Open Access Journals (Sweden)
Ram U. Verma
2000-01-01
Full Text Available We present the solvability of a class of nonlinear variational inequalities involving pseudomonotone operators in a locally convex Hausdorff topological vector spaces setting. The obtained result generalizes similar variational inequality problems on monotone operators.
'Memristive' switches enable 'stateful' logic operations via material implication.
Borghetti, Julien; Snider, Gregory S; Kuekes, Philip J; Yang, J Joshua; Stewart, Duncan R; Williams, R Stanley
2010-04-08
The authors of the International Technology Roadmap for Semiconductors-the industry consensus set of goals established for advancing silicon integrated circuit technology-have challenged the computing research community to find new physical state variables (other than charge or voltage), new devices, and new architectures that offer memory and logic functions beyond those available with standard transistors. Recently, ultra-dense resistive memory arrays built from various two-terminal semiconductor or insulator thin film devices have been demonstrated. Among these, bipolar voltage-actuated switches have been identified as physical realizations of 'memristors' or memristive devices, combining the electrical properties of a memory element and a resistor. Such devices were first hypothesized by Chua in 1971 (ref. 15), and are characterized by one or more state variables that define the resistance of the switch depending upon its voltage history. Here we show that this family of nonlinear dynamical memory devices can also be used for logic operations: we demonstrate that they can execute material implication (IMP), which is a fundamental Boolean logic operation on two variables p and q such that pIMPq is equivalent to (NOTp)ORq. Incorporated within an appropriate circuit, memristive switches can thus perform 'stateful' logic operations for which the same devices serve simultaneously as gates (logic) and latches (memory) that use resistance instead of voltage or charge as the physical state variable.
Tsichritzis, Dionysios C; Rheinboldt, Werner
1974-01-01
Operating Systems deals with the fundamental concepts and principles that govern the behavior of operating systems. Many issues regarding the structure of operating systems, including the problems of managing processes, processors, and memory, are examined. Various aspects of operating systems are also discussed, from input-output and files to security, protection, reliability, design methods, performance evaluation, and implementation methods.Comprised of 10 chapters, this volume begins with an overview of what constitutes an operating system, followed by a discussion on the definition and pr
Boehme, Thomas K
1987-01-01
Operational Calculus, Volume II is a methodical presentation of operational calculus. An outline of the general theory of linear differential equations with constant coefficients is presented. Integral operational calculus and advanced topics in operational calculus, including locally integrable functions and convergence in the space of operators, are also discussed. Formulas and tables are included.Comprised of four sections, this volume begins with a discussion on the general theory of linear differential equations with constant coefficients, focusing on such topics as homogeneous and non-ho
Keyl, M.; Kiukas, J.; Werner, R. F.
2016-05-01
In this paper, we introduce Schwartz operators as a non-commutative analog of Schwartz functions and provide a detailed discussion of their properties. We equip them, in particular, with a number of different (but equivalent) families of seminorms which turns the space of Schwartz operators into a Fréchet space. The study of the topological dual leads to non-commutative tempered distributions which are discussed in detail as well. We show, in particular, that the latter can be identified with a certain class of quadratic forms, therefore making operations like products with bounded (and also some unbounded) operators and quantum harmonic analysis available to objects which are otherwise too singular for being a Hilbert space operator. Finally, we show how the new methods can be applied by studying operator moment problems and convergence properties of fluctuation operators.
Sellmaier, Florian; Schmidhuber, Michael
2015-01-01
The book describes the basic concepts of spaceflight operations, for both, human and unmanned missions. The basic subsystems of a space vehicle are explained in dedicated chapters, the relationship of spacecraft design and the very unique space environment are laid out. Flight dynamics are taught as well as ground segment requirements. Mission operations are divided into preparation including management aspects, execution and planning. Deep space missions and space robotic operations are included as special cases. The book is based on a course held at the German Space Operation Center (GSOC).
International Nuclear Information System (INIS)
Chieh, J. J.; Hong, C. Y.; Yang, S. Y.; Horng, H. E.; Yang, H. C.
2010-01-01
We propose two optical fiber-based schemes using two magnetic fluid optical fiber modulators in series or in parallel for optical logic signal processing and operation. Here, each magnetic fluid optical fiber modulator consists of a bare multimode fiber surrounded by magnetic fluid in which the refractive index is adjustable by applying external magnetic fields amplifying the input electrical signal to vary the transmission intensity of the optical fiber-based scheme. The physical mechanisms for the performances of the magnetic fluid optical fiber devices, such as the transmission loss related to Boolean number of the logic operation as well as the dynamic response, are studied by the characteristics of superparamagnetic nanoparticles and magnetic fluids. For example, in the dynamic response composed of the retarding and response sub-procedures except the response times of the actuation coil, the theoretical evaluation of the retarding time variation with cladding magnetic fluids length has good agreement with the experimental results.
A new kind of Bernstein-Schurer-Stancu-Kantorovich-type operators based onq-integers.
Chauhan, Ruchi; Ispir, Nurhayat; Agrawal, P N
2017-01-01
Agrawal et al. (Boll. Unione Mat. Ital. 8:169-180, 2015) introduced a Stancu-type Kantorovich modification of the operators proposed by Ren and Zeng (Bull. Korean Math. Soc. 50(4):1145-1156, 2013) and studied a basic convergence theorem by using the Bohman-Korovokin criterion, the rate of convergence involving the modulus of continuity, and the Lipschitz function. The concern of this paper is to obtain Voronoskaja-type asymptotic result by calculating an estimate of fourth order central moment for these operators and discuss the rate of convergence for the bivariate case by using the complete and partial moduli of continuity and the degree of approximation by means of a Lipschitz-type function and the Peetre K -functional. Also, we consider the associated GBS (generalized Boolean sum) operators and estimate the rate of convergence for these operators with the help of a mixed modulus of smoothness. Furthermore, we show the rate of convergence of these operators (univariate case) to certain functions with the help of the illustrations using Maple algorithms and in the bivariate case, the rate of convergence of these operators is compared with the associated GBS operators by illustrative graphics.
International Nuclear Information System (INIS)
Anon.
1979-01-01
Operations of the SuperHILAC, the Bevatron/Bevalac, and the 184-inch Synchrocyclotron during the period from October 1977 to September 1978 are discussed. These include ion source development, accelerator facilities, the Heavy Ion Spectrometer System, and Bevelac biomedical operations
DEFF Research Database (Denmark)
Nielsen, Thomas Rosendal; Hustvedt, Kjersti
2017-01-01
by Bakhtinian theory, Brian Edmiston developed a solution to this in the 1990s: the principle of ‘dialogic sequencing’. Aiming to escape the conflict between relativism and absolutism, we present an alternative to Edmiston’s approach, based on Niklas Luhmann’s theory of ‘operational closure’: operational...
Indian Academy of Sciences (India)
M Suresh Babu is currently a fourth year undergraduate student in the Department of. Computer Science and. Engineering, Narayana. Engineering College,. Nellore, Andhra Pradesh. He would like to work in operating systems, computer networks and also in Internet security concepts. Keywords. Operating systems, file sys-.
2014-10-16
the so-called Threat Image Pro 51 April 2014 Operational Stress on Internet and eCommerce THE WALL STREET JOURNAL. TECH TECHNOLOGY Massive OpenSSL...8217!;:;a.L~ and · ...... -n ... ,.,. ... ,. 53 September 24, 2014 Operational Stress on Internet and eCommerce ::;:\\\\ t?nQCldQt?~ . REVIEWS
Tetsuya, Saito; Nauta, Bram
2008-01-01
To provide an operation amplifier which improves power source voltage removal ratios while assuring phase compensation characteristics, and therefore can be realized with a small-scale circuit and low power consumption. SOLUTION: The operation amplifier comprises: a differential amplifier circuit 1;
Tetsuya, Saito; Nauta, Bram
2011-01-01
PROBLEM TO BE SOLVED: To provide an operation amplifier which improves power source voltage removal ratios while assuring phase compensation characteristics, and therefore can be realized with a small-scale circuit and low power consumption. SOLUTION: The operation amplifier comprises: a
Tetsuya, S.; Nauta, Bram
2007-01-01
PROBLEM TO BE SOLVED: To provide an operation amplifier which improves power source voltage removal ratios while assuring phase compensation characteristics, and therefore can be realized with a small-scale circuit and low power consumption. ; SOLUTION: The operation amplifier comprises: a
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.
Energy Technology Data Exchange (ETDEWEB)
Lee, Ji Bok; Jeon, Byung Jin; Kwack, Byung Ho [and others
1997-01-01
HANARO was configurated its first operating core in 1995. Long term operation test was conducted up to 3-1 cycle during 1996, in order to investigate the reactor characteristics due to fuel depletion and additional fuel loading. Now HANARO has accumulated 168.4 days of total operation time and 2,687.5 MWD of total thermal output. Reactor analysis, producing operation datum and its validation with test, periodic inspection and maintenance of the facility are continuously conducted for safe operation of the HANARO. Conducted the verification tests for installed utilization facilities, and successfully performed the radiation emergency drill. The shutdown report of TRIGA Mark II and III was submitted to MOST, and decommissioning will be started from 1997. (author). 70 tabs., 50 figs., 27 refs.
International Nuclear Information System (INIS)
Bender, C.M.
1984-01-01
The finite-element method enables us to convert the operator differential equations of a quantum field theory into operator difference equations. These difference equations are consistent with the requirements of quantum mechanics and they do not exhibit fermion doubling, a problem that frequently plagues lattice treatments of fermions. Guage invariance can also be incorporated into the difference equations. On a finite lattice the operator difference equations can be solved in closed form. For the case of the Schwinger model the anomaly is computed and results in excellent agreement are obtained with the known continuum value
Shaw, J
2013-01-01
Reactor Operation covers the theoretical aspects and design information of nuclear reactors. This book is composed of nine chapters that also consider their control, calibration, and experimentation.The opening chapters present the general problems of reactor operation and the principles of reactor control and operation. The succeeding chapters deal with the instrumentation, start-up, pre-commissioning, and physical experiments of nuclear reactors. The remaining chapters are devoted to the control rod calibrations and temperature coefficient measurements in the reactor. These chapters also exp
Almeida, João; Oliveira, José; Pinto, Alberto
2018-01-01
This proceedings book presents selected contributions from the XVIII Congress of APDIO (the Portuguese Association of Operational Research) held in Valença on June 28–30, 2017. Prepared by leading Portuguese and international researchers in the field of operations research, it covers a wide range of complex real-world applications of operations research methods using recent theoretical techniques, in order to narrow the gap between academic research and practical applications. Of particular interest are the applications of, nonlinear and mixed-integer programming, data envelopment analysis, clustering techniques, hybrid heuristics, supply chain management, and lot sizing and job scheduling problems. In most chapters, the problems, methods and methodologies described are complemented by supporting figures, tables and algorithms. The XVIII Congress of APDIO marked the 18th installment of the regular biannual meetings of APDIO – the Portuguese Association of Operational Research. The meetings bring toget...
International Nuclear Information System (INIS)
Wirstad, J.
1983-12-01
The traditional operator job is changing, which among other things has generated a need for better job training. Surprisingly increased process automation has lead to increased operator qualifications, i.e. basic job training but also up-date and rehearsal training within certain fixed intervals. There are several, similar models for instructional system development available in the literature. One model which is of special interest integrates Operator Training development and Man-Machine Interfaces development. The extent to which Systematic Operator Training has been implemented varies with branches and companies. The nuclear power branch is given as an example in the report. This branch probably represents something better than the average among the process industries.(author)
National Research Council Canada - National Science Library
Proks, Josef
2000-01-01
Peace operations are more and more important in the contemporary world. The end of the Cold War increased not only possibilities of solving disputes by the international community but also by the number and diversity of threats and issues...
2015-01-01
A one-sentence definition of operator theory could be: The study of (linear) continuous operations between topological vector spaces, these being in general (but not exclusively) Fréchet, Banach, or Hilbert spaces (or their duals). Operator theory is thus a very wide field, with numerous facets, both applied and theoretical. There are deep connections with complex analysis, functional analysis, mathematical physics, and electrical engineering, to name a few. Fascinating new applications and directions regularly appear, such as operator spaces, free probability, and applications to Clifford analysis. In our choice of the sections, we tried to reflect this diversity. This is a dynamic ongoing project, and more sections are planned, to complete the picture. We hope you enjoy the reading, and profit from this endeavor.
Applied Operations Research: Operator's Assistant
Cole, Stuart K.
2015-01-01
NASA operates high value critical equipment (HVCE) that requires trouble shooting, periodic maintenance and continued monitoring by Operations staff. The complexity HVCE and information required to maintain and trouble shoot HVCE to assure continued mission success as paper is voluminous. Training on new HVCE is commensurate with the need for equipment maintenance. LaRC Research Directorate has undertaken a proactive research to support Operations staff by initiation of the development and prototyping an electronic computer based portable maintenance aid (Operator's Assistant). This research established a goal with multiple objectives and a working prototype was developed. The research identified affordable solutions; constraints; demonstrated use of commercial off the shelf software; use of the US Coast Guard maintenance solution; NASA Procedure Representation Language; and the identification of computer system strategies; where these demonstrations and capabilities support the Operator, and maintenance. The results revealed validation against measures of effectiveness and overall proved a substantial training and capability sustainment tool. The research indicated that the OA could be deployed operationally at the LaRC Compressor Station with an expectation of satisfactorily results and to obtain additional lessons learned prior to deployment at other LaRC Research Directorate Facilities. The research revealed projected cost and time savings.
International Nuclear Information System (INIS)
McRae, L.P.; Six, D.E.
1991-01-01
In 1987, Westinghouse Hanford Company began operating a first-generation integrated safeguards system in the Plutonium Finishing Plant storage vaults. This Vault Safety and Inventory System is designed to integrate data into a computer-based nuclear material inventory monitoring system. The system gathers, in real time, measured physical parameters that generate nuclear material inventory status data for thousands of stored items and sends tailored report to the appropriate users. These data include canister temperature an bulge data reported to Plant Operations and Material Control and Accountability personnel, item presence and identification data reported to Material Control and Accountability personnel, and unauthorized item movement data reported to Security response forces and Material Control and Accountability personnel. The Westinghouse Hanford Company's experience and operational benefits in using this system for reduce radiation exposure, increase protection against insider threat, and real-time inventory control are discussed in this paper
International Nuclear Information System (INIS)
Natalizio, A.; Anderson, J.W.D.; Sills, H.E.
1988-01-01
Abundant, cheap computing power has provided industry with a far greater opportunity than was available one or two decades ago to automate industrial processes and to improve the man-machine interface. Exciting innovations in knowledge representation methods arising from artificial intelligence research pave the way for advanced support systems for assisting plant operators. AECL has recognized the importance of knowledge based system technology, particularly expert systems, in the achievement of this objective and also, as a strategic technology to be fully exploited in the next generation of CANDU reactors. Operator Companion, an expert system intended to diagnose plant faults and advise the operator on appropriate restoring or corrective actions, is a major undertaking which is receiving support within the research and engineering groups of AECL
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.
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...
International Nuclear Information System (INIS)
2010-01-01
The chapter presents the operational indicators related to budget, travel costs and tickets, the evolution of the annual program for regulatory inspection, the scientific production, requested patents and the numbers related to the production of the services offered by the Institution
Indian Academy of Sciences (India)
areas in which this type is useful are multimedia, virtual reality, and advanced scientific projects such as undersea exploration and planetary rovers. Because of the expanded uses for soft real-time functionality, it is finding its way into most current operating systems, including major versions of Unix and Windows NT OS.
National Research Council Canada - National Science Library
Lewis, William
1995-01-01
.... Indeed, despite the energetic leadership of Under Secretary-General Kofi R. Annan who directs the Department of Peacekeeping Operations, the organization has increasing difficulty in acquiring properly trained and equipped forces in time to intervene in conflict situations and humanitarian crises.
International Nuclear Information System (INIS)
Anon.
1980-01-01
This section is concerned with the operation of both the tandem-linac system and the Dynamitron, two accelerators that are used for entirely different research. Developmental activities associated with the tandem and the Dynamitron are also treated here, but developmental activities associated with the superconducting linac are covered separately because this work is a program of technology development in its own right
DEFF Research Database (Denmark)
Stüben, Henning; Tietjen, Anne
2006-01-01
Abstract: This paper seeks to challenge the notion of context from an operational perspective. Can we grasp the forces that shape the complex conditions for an architectural or urban design within the notion of context? By shifting the gaze towards the agency of architecture, contextual analysis...
Indian Academy of Sciences (India)
The process concept and concurrency are at the heart of modern operating systems (OS). A process is the unit of work in a computer system. A process must be in main memory during execution. To improve the utilization of central processing unit. (CPU) as well as the speed of its response to its users, the computer must ...
2003-01-01
Operational Circular N° 4 - April 2003 Conditions for use by members of the CERN personnel of vehicles belonging to or rented by CERN - This circular has been drawn up. Operational Circular N° 5 - October 2000 Use of CERN computing facilities - Further details on the personal use of CERN computing facilities Operational Circular N° 5 and its Subsidiary Rules http://cern.ch/ComputingRules defines the rules for the use of CERN computing facilities. One of the basic principles governing such use is that it must come within the professional duties of the user concerned, as defined by the user's divisional hierarchy. However, personal use of the computing facilities is tolerated or allowed provided : a) It is in compliance with Operational Circular N° 5 and not detrimental to official duties, including those of other users; b) the frequency and duration is limited and there is a negligible use of CERN resources; c) it does not constitute a political, commercial and/or profit-making activity; d) it is not...
Brown, Robert B.
1994-01-01
A software pilot model for Space Shuttle proximity operations is developed, utilizing fuzzy logic. The model is designed to emulate a human pilot during the terminal phase of a Space Shuttle approach to the Space Station. The model uses the same sensory information available to a human pilot and is based upon existing piloting rules and techniques determined from analysis of human pilot performance. Such a model is needed to generate numerous rendezvous simulations to various Space Station assembly stages for analysis of current NASA procedures and plume impingement loads on the Space Station. The advantages of a fuzzy logic pilot model are demonstrated by comparing its performance with NASA's man-in-the-loop simulations and with a similar model based upon traditional Boolean logic. The fuzzy model is shown to respond well from a number of initial conditions, with results typical of an average human. In addition, the ability to model different individual piloting techniques and new piloting rules is demonstrated.
Your Lung Operation: After Your Operation
Full Text Available ... Surgeons Education Patients and Family Skills Programs Your Lung Operation Your Lung Operation DVD After Your Operation Back to Your Lung Operation Your Lung Operation DVD Welcome Your Lung ...
International Nuclear Information System (INIS)
Launeau, F.
2016-01-01
The CIGEO facility dedicated to the geological disposal of high- and intermediate-level radioactive wastes will be composed of 2 parts: an underground facility at a depth of 500 m to dispose the waste packages in tunnels and a surface facility to take delivery of the wastes and prepare the packages. The underground facility will be built progressively and will cover a surface of 15 km 2 at the end of Cigeo operating-life. A large part of the surface facility (located a few km away from the waste reception place) will be dedicated to the works led deep underground to build the tunnels and will receive drilling cuttings. The article describes also the ramp and carts to lead waste packages underground. Most of the operations will be automated. The definitive closure of the tunnels will be made with swelling clay and concrete plugs. (A.C.)
DEFF Research Database (Denmark)
Wistoft, Karen; Højlund, Holger
2012-01-01
educational approaches. Methods: Mixed qualitative design: survey based on telephone interviews with health managers (n=72), personal and focus group interviews with health professionals (n=84) and pupils (n=108) from 18 school classes, and comparative case studies in five selected municipalities of various...... educational goals, learning content, or value clarification. Health pedagogy is often a matter of retrospective rationalization rather than the starting point of planning. Health and risk behaviour approaches override health educational approaches. Conclusions: Operational links between health education...
International Nuclear Information System (INIS)
Pruvost, N.; Tsitouras, J.
1981-01-01
The objectives of Operation Poorman were to design and build a portable seismic system and to set up and use this system in a cold-weather environment. The equipment design uses current technology to achieve a low-power, lightweight system that is configured into three modules. The system was deployed in Alaska during wintertime, and the results provide a basis for specifying a mission-ready seismic verification system
DEFF Research Database (Denmark)
Wistoft, Karen
2010-01-01
and have been the object of great expectations concerning the ability to incorporate health concerns into every welfare area through health promotion strategies. The paper draws on results and analyses of a collective research project funded by the Danish National Research Council and carried out...... as networks: second, a semantic perspective on discourses and concepts of health, and, third, a health pedagogical perspective on participation, intervention, and roles. This paper argues for the importance of 'operative links' between different levels in health strategies. It is proposed that such links...
International Nuclear Information System (INIS)
Knuefer; Lindauer
1980-01-01
Besides that at spectacular events a combination of component failure and human error is often found. Especially the Rasmussen-Report and the German Risk Assessment Study show for pressurised water reactors that human error must not be underestimated. Although operator errors as a form of human error can never be eliminated entirely, they can be minimized and their effects kept within acceptable limits if a thorough training of personnel is combined with an adequate design of the plant against accidents. Contrary to the investigation of engineering errors, the investigation of human errors has so far been carried out with relatively small budgets. Intensified investigations in this field appear to be a worthwhile effort. (orig.)
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
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
Operator theory, operator algebras and applications
Lebre, Amarino; Samko, Stefan; Spitkovsky, Ilya
2014-01-01
This book consists of research papers that cover the scientific areas of the International Workshop on Operator Theory, Operator Algebras and Applications, held in Lisbon in September 2012. The volume particularly focuses on (i) operator theory and harmonic analysis (singular integral operators with shifts; pseudodifferential operators, factorization of almost periodic matrix functions; inequalities; Cauchy type integrals; maximal and singular operators on generalized Orlicz-Morrey spaces; the Riesz potential operator; modification of Hadamard fractional integro-differentiation), (ii) operator algebras (invertibility in groupoid C*-algebras; inner endomorphisms of some semi group, crossed products; C*-algebras generated by mappings which have finite orbits; Folner sequences in operator algebras; arithmetic aspect of C*_r SL(2); C*-algebras of singular integral operators; algebras of operator sequences) and (iii) mathematical physics (operator approach to diffraction from polygonal-conical screens; Poisson geo...
Your Lung Operation: After Your Operation
Full Text Available ... Safety Resources About the Patient Education Program The Recovery Room Choosing Wisely Educational Programs Educational Programs Educational ... Lung Operation After Your Operation Your Discharge and Recovery Complete Video After Your Operation Guidance for after ...
Your Lung Operation: After Your Operation
Full Text Available ... Overview ACS-AEI Consortium Quarterly ACS Chapter News Cancer ... American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation Your Lung Operation DVD After Your Operation ...
A Survey on Operator Monotonicity, Operator Convexity, and Operator Means
Directory of Open Access Journals (Sweden)
Pattrawut Chansangiam
2015-01-01
Full Text Available This paper is an expository devoted to an important class of real-valued functions introduced by Löwner, namely, operator monotone functions. This concept is closely related to operator convex/concave functions. Various characterizations for such functions are given from the viewpoint of differential analysis in terms of matrix of divided differences. From the viewpoint of operator inequalities, various characterizations and the relationship between operator monotonicity and operator convexity are given by Hansen and Pedersen. In the viewpoint of measure theory, operator monotone functions on the nonnegative reals admit meaningful integral representations with respect to Borel measures on the unit interval. Furthermore, Kubo-Ando theory asserts the correspondence between operator monotone functions and operator means.
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
Yang, Bin; Zhang, Xiao-Bing; Kang, Li-Ping; Huang, Zhi-Mei; Shen, Guo-Li; Yu, Ru-Qin; Tan, Weihong
2014-07-01
DNA strand displacement cascades have been engineered to construct various fascinating DNA circuits. However, biological applications are limited by the insufficient cellular internalization of naked DNA structures, as well as the separated multicomponent feature. In this work, these problems are addressed by the development of a novel DNA nanodevice, termed intelligent layered nanoflare, which integrates DNA computing at the nanoscale, via the self-assembly of DNA flares on a single gold nanoparticle. As a ``lab-on-a-nanoparticle'', the intelligent layered nanoflare could be engineered to perform a variety of Boolean logic gate operations, including three basic logic gates, one three-input AND gate, and two complex logic operations, in a digital non-leaky way. In addition, the layered nanoflare can serve as a programmable strategy to sequentially tune the size of nanoparticles, as well as a new fingerprint spectrum technique for intelligent multiplex biosensing. More importantly, the nanoflare developed here can also act as a single entity for intracellular DNA logic gate delivery, without the need of commercial transfection agents or other auxiliary carriers. By incorporating DNA circuits on nanoparticles, the presented layered nanoflare will broaden the applications of DNA circuits in biological systems, and facilitate the development of DNA nanotechnology.DNA strand displacement cascades have been engineered to construct various fascinating DNA circuits. However, biological applications are limited by the insufficient cellular internalization of naked DNA structures, as well as the separated multicomponent feature. In this work, these problems are addressed by the development of a novel DNA nanodevice, termed intelligent layered nanoflare, which integrates DNA computing at the nanoscale, via the self-assembly of DNA flares on a single gold nanoparticle. As a ``lab-on-a-nanoparticle'', the intelligent layered nanoflare could be engineered to perform a variety of
Your Lung Operation: After Your Operation
Full Text Available ... Careers at ACS Careers at ACS About ACS Career Types Working at ACS ... ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation Your Lung Operation DVD ...
Your Lung Operation: After Your Operation
Full Text Available ... Participate Resources Webinars for Young Surgeons YFA E-News Resident and Associate Society Resident and Associate Society ... Leader International Exchange Scholar Program Resources RAS E-News Medical Students Operation Giving Back Operation Giving Back ...
Your Lung Operation: After Your Operation
Full Text Available ... to Participate Resources Webinars for Young Surgeons YFA E-News Resident and Associate Society Resident and Associate ... ACS Leader International Exchange Scholar Program Resources RAS E-News Medical Students Operation Giving Back Operation Giving ...
Space station operations management
Cannon, Kathleen V.
1989-01-01
Space Station Freedom operations management concepts must be responsive to the unique challenges presented by the permanently manned international laboratory. Space Station Freedom will be assembled over a three year period where the operational environment will change as significant capability plateaus are reached. First Element Launch, Man-Tended Capability, and Permanent Manned Capability, represent milestones in operational capability that is increasing toward mature operations capability. Operations management concepts are being developed to accomodate the varying operational capabilities during assembly, as well as the mature operational environment. This paper describes operations management concepts designed to accomodate the uniqueness of Space Station Freedoom, utilizing tools and processes that seek to control operations costs.
International Nuclear Information System (INIS)
Liu Rong; Yang Shuchun; Peng Jun; Zhou Shoukang
2003-01-01
Experiences and work methods with High Flux Engineering Test Reactor (HFETR) operation are introduced, which have been accumulated in a long period of operation, in the aspects as reactor operation, test, maintenance, operator training and incident management. It's clear that the safety operation of HFETR has been ensured, and the methods are valid. (authors)
Heat transfer operators associated with quantum operations
International Nuclear Information System (INIS)
Aksak, C; Turgut, S
2011-01-01
Any quantum operation applied on a physical system is performed as a unitary transformation on a larger extended system. If the extension used is a heat bath in thermal equilibrium, the concomitant change in the state of the bath necessarily implies a heat exchange with it. The dependence of the average heat transferred to the bath on the initial state of the system can then be found from the expectation value of a Hermitian operator, which is named as the heat transfer operator (HTO). The purpose of this paper is to investigate the relation between the HTOs and the associated quantum operations. Since any given quantum operation on a system can be realized by different baths and unitaries, many different HTOs are possible for each quantum operation. On the other hand, there are also strong restrictions on the HTOs which arise from the unitarity of the transformations. The most important of these is the Landauer erasure principle. This paper is concerned with the question of finding a complete set of restrictions on the HTOs that are associated with a given quantum operation. An answer to this question has been found only for a subset of quantum operations. For erasure operations, these characterizations are equivalent to the generalized Landauer erasure principle. For the case of generic quantum operations, however, it appears that the HTOs obey further restrictions which cannot be obtained from the entropic restrictions of the generalized Landauer erasure principle.
1985-01-01
A nationwide survey of transit operators indicated that absenteeism among transit operators is a significant problem and that the associated costs are substantial. The objective of the research reported here was to determine the scope of operator abs...
Conduct of operations: establishing operational focus and setting operational standards
International Nuclear Information System (INIS)
Lane, L.; McGuigan, K.
1998-01-01
Due to the nature of our business, we have often tended to focus on the technological aspects of the nuclear industry. The focus of this paper is directed towards the importance of addressing the people skills, attitudes, and 'culture' within, and surrounding, our facilities as key areas of improvement. Within Ontario Hydro Nuclear (OLIN) we have developed the terminology 'event free' operation and 'event free' culture. 'Event Free' recognizes errors as a part of human performance. 'Event Free' takes into account human weaknesses, and provides tools (such as standards) to manage, control, and mitigate errors. In essence, 'Event Free' encompasses two concepts: 1. Prevent errors from occurring; 2. If an error is made, catch it before it can affect safe operation of the facility, learn from the error, and ensure that it does not happen again. In addressing these business realities, Ontario Hydro has identified a number of key support mechanisms and corresponding performance standards that are essential for achieving operating excellence and an 'event free' business culture. This paper will discuss two operational aspects of an 'event free' culture, the first being a set of expectations to enhance the culture, and the second an example of cultural change: 1. Operating Standards - establishing clear expectations for human performance in operating staff; 2. Operational Focus - the understanding that, as a nuclear worker, you should consider every task, activity, in fact everything you do in this business, for the potential to affect safe and reliable operation of a nuclear facility. Note that although the term 'Operational' appears in the title, this concept applies to every individual in the nuclear business, from the cleaner, to the Board of Directors, to the external supplier. (author)
DEFF Research Database (Denmark)
Welch, Lawrence S.; Benito, Gabriel R. G.; Petersen, Bent
Introduction and theory -- Introduction -- Theoretical approaches -- Modes of operation -- Franchising -- Licensing -- Management contracts -- International subcontracting -- Project operations -- Exports -- Alliances -- Foreign direct investment -- Strategies -- Mode switching and stretching...
National Aeronautics and Space Administration — The AES Autonomous Mission Operations project will develop understanding of the impacts of increasing communication time delays on mission operations and develop...
Saxton Transportation Operations Laboratory
Federal Laboratory Consortium — The Saxton Transportation Operations Laboratory (Saxton Laboratory) is a state-of-the-art facility for conducting transportation operations research. The laboratory...
Orbits of operators and operator semigroups
Czech Academy of Sciences Publication Activity Database
Müller, Vladimír
-, č. 1737 (2011), s. 78-90 ISSN 1880-2818. [Noncommutative structure in operator theory and its application. Kyoto, 27.10.2010-29.10.2010] R&D Projects: GA ČR GA201/09/0473; GA AV ČR IAA100190903 Institutional research plan: CEZ:AV0Z10190503 Keywords : orbits of operators * hypercyclicity * semigroups of operators Subject RIV: BA - General Mathematics
Your Lung Operation: After Your Operation
Full Text Available ... Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management and Emergency ...
Separable quadratic stochastic operators
International Nuclear Information System (INIS)
Rozikov, U.A.; Nazir, S.
2009-04-01
We consider quadratic stochastic operators, which are separable as a product of two linear operators. Depending on properties of these linear operators we classify the set of the separable quadratic stochastic operators: first class of constant operators, second class of linear and third class of nonlinear (separable) quadratic stochastic operators. Since the properties of operators from the first and second classes are well known, we mainly study the properties of the operators of the third class. We describe some Lyapunov functions of the operators and apply them to study ω-limit sets of the trajectories generated by the operators. We also compare our results with known results of the theory of quadratic operators and give some open problems. (author)
Jung, Il Bong; Lim, Pil Sang; Park, Sang Soo
2005-04-01
We construct examples which distinguish clearly the classes of p-hyponormal operators for 0normaloid operators on the complex Hilbert space. Only a few examples of p-hyponormal operators have been examined. Our technique can provide many examples related to the above operators.
International Nuclear Information System (INIS)
Sonoda, Hidenori
1992-01-01
We give a formula for the derivatives of a correlation function of composite operators with respect to the parameters (i.e. the strong fine structure constant and the quark mass) of QCD in four- dimensional euclidean space. The formula is given as spatial integration of the operator conjugate to a parameter. The operator product of a composite operator and a conjugate operator has an unintegrable part, and the formula requires divergent subtractions. By imposing consistency conditions we drive a relation between the anomalous dimensions of the composite operators and the unintegrable part of the operator product coefficients. (orig.)
International Nuclear Information System (INIS)
Lupton, L.R.; Anderson, L.L.; Basso, R.A.J.
1989-11-01
As CANDU plants become more complex, and are operated under tighter constraints and for longer periods between outages, plant operations staff will have to absorb more information to correctly and rapidly respond to upsets. A development program is underway at AECL to use expert systems and interactive media tools to assist operations staff of existing and future CANDU plants. The complete system for plant information access and display, on-line advice and diagnosis, and interactive operating procedures is called the Operator Companion. A prototype, consisting of operator consoles, expert systems and simulation modules in a distributed architecture, is currently being developed to demonstrate the concepts of the Operator Companion
Elementary operators on self-adjoint operators
Molnar, Lajos; Semrl, Peter
2007-03-01
Let H be a Hilbert space and let and be standard *-operator algebras on H. Denote by and the set of all self-adjoint operators in and , respectively. Assume that and are surjective maps such that M(AM*(B)A)=M(A)BM(A) and M*(BM(A)B)=M*(B)AM*(B) for every pair , . Then there exist an invertible bounded linear or conjugate-linear operator and a constant c[set membership, variant]{-1,1} such that M(A)=cTAT*, , and M*(B)=cT*BT, .
Your Lung Operation: After Your Operation
Full Text Available ... Education Trauma Education Achieving Zero Preventable Deaths Trauma Systems Conference Advanced Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for ...
Your Lung Operation: After Your Operation
Full Text Available ... Up to Date with ACS Association Management JACS Jobs Events Find a Surgeon Patients and Family Contact My Profile Shop ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation ...
Your Lung Operation: After Your Operation
Full Text Available ... Online Guide to Choosing a Surgical Residency Practice Management Workshops Patients and Family Patient Education Patient Education ... Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management and ...
Your Lung Operation: After Your Operation
Full Text Available ... Education Trauma Education Achieving Zero Preventable Deaths Trauma Systems Conference Advanced Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management ...
Your Lung Operation: After Your Operation
Full Text Available ... as pneumonia and deep vein thrombosis. Jump to: The Day of Your Lung Operation Read Next Your ... and Associates Medical Students International Surgeons Media ACS Links About ACS ACS Foundation Have a ...
Your Lung Operation: After Your Operation
Full Text Available ... at ACS ACS and Veterans Diversity at ACS ... and Family Contact My Profile Shop ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation ...
Nonlocal Operational Calculi for Dunkl Operators
Directory of Open Access Journals (Sweden)
Ivan H. Dimovski
2009-03-01
Full Text Available The one-dimensional Dunkl operator $D_k$ with a non-negative parameter $k$, is considered under an arbitrary nonlocal boundary value condition. The right inverse operator of $D_k$, satisfying this condition is studied. An operational calculus of Mikusinski type is developed. In the frames of this operational calculi an extension of the Heaviside algorithm for solution of nonlocal Cauchy boundary value problems for Dunkl functional-differential equations $P(D_ku = f$ with a given polynomial $P$ is proposed. The solution of these equations in mean-periodic functions reduces to such problems. Necessary and sufficient condition for existence of unique solution in mean-periodic functions is found.
Your Lung Operation: After Your Operation
Full Text Available ... Stay Up to Date with ACS Association Management Jobs Events Find a Surgeon Patients and Family Contact My Profile Shop ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation ...
Your Lung Operation: After Your Operation
Full Text Available ... Education Trauma Education Achieving Zero Preventable Deaths Trauma Systems Conference Advanced Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management and ...
Your Lung Operation: After Your Operation
Full Text Available ... Mentoring for Excellence in Trauma Surgery Advanced Trauma Life Support Verification, Review, and Consultation Program for Hospitals ... Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills ...
Stability Operations: Learning from Operation Iraqi Freedom
National Research Council Canada - National Science Library
Clay, Troy A
2007-01-01
.... This paper examines some of these failures and analyzes the importance of security and its influence on using economic means during the initial stages of post-conflict operations to facilitate...
Your Lung Operation: After Your Operation
Full Text Available ... ACS ACS and Veterans Diversity at ACS ... and Family Contact My Profile Shop ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation ...
Jaeger, Trent
2008-01-01
Operating systems provide the fundamental mechanisms for securing computer processing. Since the 1960s, operating systems designers have explored how to build "secure" operating systems - operating systems whose mechanisms protect the system against a motivated adversary. Recently, the importance of ensuring such security has become a mainstream issue for all operating systems. In this book, we examine past research that outlines the requirements for a secure operating system and research that implements example systems that aim for such requirements. For system designs that aimed to
Training and Tactical Operationally Responsive Space Operations
Sorensen, B.; Strunce, R., Jr.
Current space assets managed by traditional space system control resources provide communication, navigation, intelligence, surveillance, and reconnaissance (ISR) capabilities using satellites that are designed for long life and high reliability. The next generation Operationally Responsive Space (ORS) systems are aimed at providing operational space capabilities which will provide flexibility and responsiveness to the tactical battlefield commander. These capabilities do not exist today. The ORS communication, navigation, and ISR satellites are being designed to replace or supplement existing systems in order to enhance the current space force. These systems are expected to rapidly meet near term space needs of the tactical forces. The ORS concept includes new tactical satellites specifically designed to support contingency operations such as increased communication bandwidth and ISR imagery over the theater for a limited period to support air, ground, and naval force mission. The Concept of Operations (CONOPS) that exists today specifies that in addition to operational control of the satellite, the tasking and scheduling of the ORS tactical satellite for mission data collection in support of the tactical warfighter will be accomplished within the Virtual Mission Operations Center (VMOC). This is very similar to what is currently being accomplished in a fixed Mission Operations Center on existing traditional ISR satellites. The VMOC is merely a distributed environment and the CONOPS remain virtually the same. As a result, there is a significant drawback to the current ORS CONOPS that does not account for the full potential of the ORS paradigm for supporting tactical forces. Although the CONOPS approach may be appropriate for experimental Tactical Satellites (TacSat), it ignores the issues associated with the In-Theater Commander's need to own and operate his dedicated TacSat for most effective warfighting as well as the Warfighter specific CONOPS. What is needed
Ranking Operations Management conferences
Steenhuis, H.J.; de Bruijn, E.J.; Gupta, Sushil; Laptaned, U
2007-01-01
Several publications have appeared in the field of Operations Management which rank Operations Management related journals. Several ranking systems exist for journals based on , for example, perceived relevance and quality, citation, and author affiliation. Many academics also publish at conferences
Heselton, Ken
2004-01-01
Containing key information for operators and managers of large and small plants, this is an indispensable guide for those at advanced and early stages of their careers, as well as for managers interested in reducing operating expenses.
Autonomous Systems and Operations
National Aeronautics and Space Administration — The AES Autonomous Systems and Operations (ASO) project will develop an understanding of the impacts of increasing communication time delays on mission operations,...
National Oceanic and Atmospheric Administration, Department of Commerce — Operator cards are required for any operator of a charter/party boat and or a commercial vessel (including carrier and processor vessels) issued a vessel permit from...
Directory of Open Access Journals (Sweden)
Yuan Jiangtao
2007-01-01
Full Text Available This paper discusses some spectral properties of class operators for , , , and . It is shown that if is a class operator, then the Riesz idempotent of with respect to each nonzero isolated point spectrum is selfadjoint and . Afterwards, we prove that every class operator has SVEP and property , and Weyl's theorem holds for when .
Convolution Operators on Groups
Derighetti, Antoine
2011-01-01
This volume is devoted to a systematic study of the Banach algebra of the convolution operators of a locally compact group. Inspired by classical Fourier analysis we consider operators on Lp spaces, arriving at a description of these operators and Lp versions of the theorems of Wiener and Kaplansky-Helson.
International Nuclear Information System (INIS)
Grenet, G.; Kibler, M.
1978-06-01
A closed polynomial formula for the qth component of the diagonal operator equivalent of order k is derived in terms of angular momentum operators. The interest in various fields of molecular and solid state physics of using such a formula in connection with symmetry adapted operator equivalents is outlined
International Nuclear Information System (INIS)
Satoh, Kotaro
1990-01-01
The present status of the TRISTAN operation is summarized mainly after the installation of superconducting cavities in the 1988 summer shutdown. The paper describes the initial experience of the superconducting cavity operation, the colliding operation at 30.4 GeV and the beam injection. Future improvement is also reported. (author)
Operations and maintenance philosophy
International Nuclear Information System (INIS)
DUNCAN, G.P.
1999-01-01
This Operations and Maintenance (O and M) Philosophy document is intended to establish a future O and M vision, with an increased focus on minimizing worker exposure, ensuring uninterrupted retrieval operations, and minimizing operation life-cycle cost. It is intended that this document would incorporate O and M lessons learned into on-going and future project upgrades
Analysis and Algorithms for Imperfect Sensor Deployment and Operations
2016-05-23
total amount of flow that crosses the node. Given an origin- destination route for each commodity, there exists a Boolean random variable ...as an intermediate node on the commodity’s path, the random variable is irrelevant.) We assume that these random 15 DISTRIBUTION A: Distribution...contributed to the core curriculum two universities in large-scale and discrete optimization. 1 Introduction The economical and effective placement of
Operational symmetries basic operations in physics
Saller, Heinrich
2017-01-01
This book describes the endeavour to relate the particle spectrum with representations of operational electroweak spacetime, in analogy to the atomic spectrum as characterizing representations of hyperbolic space. The spectrum of hyperbolic position space explains the properties of the nonrelativistic atoms; the spectrum of electroweak spacetime is hoped to explain those of the basic interactions and elementary particles. In this book, the theory of operational symmetries is developed from the numbers, from Plato’s and Kepler’s symmetries over the simple Lie groups to their applications in nonrelativistic, special relativistic and general relativistic quantum theories with the atomic spectrum for hyperbolic position and, in first attempts, the particle spectrum for electroweak spacetime. The standard model of elementary particles and interactions is characterized by a symmetry group. In general, as initiated by Weyl and stressed by Heisenberg, quantum theory can be built as a theory of operation groups an...
Operator licensing examiner standards
International Nuclear Information System (INIS)
1993-01-01
The Operator Licensing Examiner Standards provide policy and guidance to NRC examiners and establish the procedures and practices for examining licensees and applicants for reactor operator and senior reactor operator licenses at power reactor facilities pursuant to Part 55 of Title 10 of the Code of Federal Regulations (10 CFR 55). The Examiner Standards are intended to assist NRC examiners and facility licensees to better understand the initial and requalification examination processes and to ensure the equitable and consistent administration of examinations to all applicants. These standards are not a substitute for the operator licensing regulations and are subject to revision or other internal operator licensing policy changes
Aleksandrov, A. B.; Peller, V. V.
2016-08-01
The goal of this survey is a comprehensive study of operator Lipschitz functions. A continuous function f on the real line {R} is said to be operator Lipschitz if \\Vert f(A)-f(B)\\Vert≤slant{const}\\Vert A-B\\Vert for arbitrary self-adjoint operators A and B. Sufficient conditions and necessary conditions are given for operator Lipschitzness. The class of operator differentiable functions on {R} is also studied. Further, operator Lipschitz functions on closed subsets of the plane are considered, and the class of commutator Lipschitz functions on such subsets is introduced. An important role for the study of such classes of functions is played by double operator integrals and Schur multipliers. Bibliography: 77 titles.
Your Lung Operation: After Your Operation
Full Text Available ... Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management and Emergency Preparedness Rural Trauma Team Development ... 202-5001 (E) postmaster@facs.org Copyright © 1996-2018 by the American College of Surgeons, Chicago, IL ...
Your Lung Operation: After Your Operation
Full Text Available ... and Videos Hotel and Travel Clinical Congress 2017 Future Clinical Congresses MyCME About MyCME About MyCME Claim ... Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills ...
Your Lung Operation: After Your Operation
Full Text Available ... Contact My Profile Shop ( 0 ) Cart Donate American College of Surgeons Education Patients and Family Skills Programs Your Lung Operation ... facs.org Copyright © 1996-2018 by the American College of Surgeons, Chicago, IL 60611-3295 | Privacy Policy | Terms of Use
Hermeneutic operative calculus
Ramakrishnan, Sivakumar; Isawasan, Pradeep; Mohanan, Vasuky
2014-07-01
The predicate calculus used currently by mathematical logic in computer science, philosophy and linguistic was found to be too restrictive and inadequate for describing the grammar of natural and artificial language. Therefore many higher order logics have been developed to overcome the limitation of predicate calculus. In this paper a new representation of logic using mathematical principles has been developed for the natural language called Hermeneutic Operative Calculus. This Hermeneutic Operative Calculus is a new language interpretive calculus developed to account for the syntactic, semantic and pragmatic features of natural language and allows removing the restrictions of any particular natural language in the semantic field its map out. The logic of Hermeneutic Operative Calculus capable of represent the syntactic and semantic of factual information of a natural language precisely in any language. The logic of this Hermeneutic Operative Calculus has two different forms of operations called object and meta-operations. The object operation allow for listing the various objects, picturing the various propositions and so forth. The meta-operation would specify what cannot be specified by the object operation like semantical stances of a proposition. The basic operative processes of linguistics and cognitive logic will be mathematically conceptualized and elaborated in this paper.
DEFF Research Database (Denmark)
closely working with, and which are best suited to illuminate a particular aspect of organising and managing global operations in networks. The book addresses the following broadly defined themes: • Contexts of global operations networks, • Configurations of global operations networks, • Capabilities......, international comparative studies providing comprehensive insights from it are still rare. With the objective of bridging this gap, Global Operations Networks (GONE) project (sponsored by the Danish Research Council) brought together numerous academic and industrial partners from Denmark, Sweden and Finland...... of global operations and operations strategy. This summative volume utilises the rich and diverse empirical foundation generated during the project activities in Denmark, Sweden and Finland. Chapters of the book are based on quantitative data and multiple case studies which the project partners have been...
Brandli, A. E.; Eckelkamp, R. E.; Kelly, C. M.; Mccandless, W.; Rue, D. L.
1990-01-01
The objective of an operations management system is to provide an orderly and efficient method to operate and maintain aerospace vehicles. Concepts are described for an operations management system and the key technologies are highlighted which will be required if this capability is brought to fruition. Without this automation and decision aiding capability, the growing complexity of avionics will result in an unmanageable workload for the operator, ultimately threatening mission success or survivability of the aircraft or space system. The key technologies include expert system application to operational tasks such as replanning, equipment diagnostics and checkout, global system management, and advanced man machine interfaces. The economical development of operations management systems, which are largely software, will require advancements in other technological areas such as software engineering and computer hardware.
Energy Technology Data Exchange (ETDEWEB)
1988-01-01
The Nuclear Waste Policy Act of 1982 assigned to the Department of Energy's (DOE) Office of Civilian Waste Management the responsibility for disposing of high-level waste and spent fuel. A significant part of that responsibility involves transporting nuclear waste materials within the federal waste management system; that is, from the waste generator to the repository. The lead responsibility for transportation operations has been assigned to Oak Ridge Operations, with Oak Ridge National Laboratory (ORNL) providing technical support through the Transportation Operations Support Task Group. One of the ORNL support activities involves assessing what facilities, equipment and services are required to assure that an acceptable, cost-effective and safe transportation operations system can be designed, operated and maintained. This study reviews, surveys and assesses the experience of Nuclear Assurance Corporation (NAC) in operating a fleet of spent-fuel shipping casks to aid in developing the spent-fuel transportation system.
International Nuclear Information System (INIS)
1988-01-01
The Nuclear Waste Policy Act of 1982 assigned to the Department of Energy's (DOE) Office of Civilian Waste Management the responsibility for disposing of high-level waste and spent fuel. A significant part of that responsibility involves transporting nuclear waste materials within the federal waste management system; that is, from the waste generator to the repository. The lead responsibility for transportation operations has been assigned to Oak Ridge Operations, with Oak Ridge National Laboratory (ORNL) providing technical support through the Transportation Operations Support Task Group. One of the ORNL support activities involves assessing what facilities, equipment and services are required to assure that an acceptable, cost-effective and safe transportation operations system can be designed, operated and maintained. This study reviews, surveys and assesses the experience of Nuclear Assurance Corporation (NAC) in operating a fleet of spent-fuel shipping casks to aid in developing the spent-fuel transportation system
International Nuclear Information System (INIS)
Marella, J.R.
1995-01-01
A determination of minimum requirements for purge exhaust ventilation system operability has been performed. HLWE and HLW Regulatory Program personnel have evaluated the various scenarios of equipment conditions and HLWE has developed the requirements for purge exhaust systems. This report is provided to document operability requirements to assist Tank Farm personnel to determine whether a system is operable/inoperable and to define required compensatory actions
Cyberwarfare and Operational Art
2017-05-25
warfare within the framework of operational art. The case study evaluated the Russian Federation cyber operations in time and space to support a theory ...case study evaluated the Russian Federation cyber operations in time and space to support a theory that cyber and land force actions can transform...1 Cyberspace manifested on March 18, 1940, when Alan Turing developed the "electromechanical mind ." Turing along with others at Bletchley Park
2012-12-06
draw a qualitative appreciation for the application of theoretical principles during planning and the execution of operational art . The following... History at The United States Center for Military History . John Sloan Brown, "The Maturation of Operational Art : Desert Shield and Desert Storm " in...Historical Perspectives of the Operational Art , ed. Michael D. Krause and R. Cody Phillips (Washington, DC: Center of Military History , 2005), 440
1985-01-01
Long-term and short-term objectives for the development of a network operating system for the Space Station are stated. The short-term objective is to develop a prototype network operating system for a 100 megabit/second fiber optic data bus. The long-term objective is to establish guidelines for writing a detailed specification for a Space Station network operating system. Major milestones are noted. Information is given in outline form.
Operator licensing examiner standards
International Nuclear Information System (INIS)
1987-05-01
The Operator Licensing Examiner Standards provide policy and guidance to NRC examiners and establish the procedures and practices for examining and licensing of applicants for NRC operator licenses pursuant to Part 55 of Title 10 of the Code of Federal Regulations (10 CFR 55). They are intended to assist NRC examiners and facility licensees to understand the examination process better and to provide for equitable and consistent administration of examinations to all applicants by NRC examiners. These standards are not a substitute for the operator licensing regulations and are subject to revision or other internal operator examination licensing policy changes
Sunder, V S
2016-01-01
The primarily objective of the book is to serve as a primer on the theory of bounded linear operators on separable Hilbert space. The book presents the spectral theorem as a statement on the existence of a unique continuous and measurable functional calculus. It discusses a proof without digressing into a course on the Gelfand theory of commutative Banach algebras. The book also introduces the reader to the basic facts concerning the various von Neumann–Schatten ideals, the compact operators, the trace-class operators and all bounded operators. .
Arduini, G.; Lamont, M.; Pieloni, T.; Rumolo, G.
The HL-LHC will introduce a number of novel operational features and challenges including luminosity leveling. After a brief recap of the possible leveling techniques, the potential impact of the operational regime on overall efficiency is discussed. A breakdown of the operational cycle and the standard operational year, together with a discussion of fault time is presented. The potential performance is then explored and estimates of the required machine availability and efficiency for 250 fb-1 per year are given. Finally the e-cloud challenges, scrubbing runs requirements, and machine development potential are outlined.
International Nuclear Information System (INIS)
1990-04-01
The Operating Units Status Report --- Licensed Operating Reactors provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management from the Headquarters staff on NRC's Office of Enforcement (OE), from NRC's Regional Offices, and from utilities. The three sections of the report are: monthly highlights and statistics for commercial operating units, and errata from previously reported data; a compilation of detailed information on each unit, provided by NRC's Regional Offices, OE Headquarters and the utilities; and an appendix for miscellaneous information such as spent fuel storage capability, reactor-years of experience and non- power reactors in the US
National Research Council Canada - National Science Library
2007-01-01
...), human rights, rules of engagement, emergency essential civilians supporting military operations, contingency contractor personnel, foreign and deployment, criminal law, environmental law, fiscal law...
International Nuclear Information System (INIS)
1989-11-01
The US Nuclear Regulatory Commission's monthly Licensed Operating Reactors Status Summary Report provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management, from the Headquarters Staff of NRC's Office of Inspection and Enforcement, from NRC's Regional Offices, and from utilities. Since all of the data concerning operation of the units is provided by the utility operators less than two weeks after the end of the month, necessary corrections to published information are shown on the errata page
International Nuclear Information System (INIS)
Klinda, J.; Lieskovska, Z.
1998-01-01
Within the Union Nations (UN) framework, the Slovak Republic participated in following activities on environment protection co-operation: UN European Economic Commission, UN Industrial Development Organization, UN Development Programme, UN Human Habitat Organization, UN Environment Programme, and UN Commission on Sustainable Development. Relevant activities of the Slovak Republic in these co-operations as well as in European Union and OECD activities are reviewed. International conventions and other forms of multilateral co-operation, bilateral co-operation, and international programmes and projects in which the Slovak Republic took participate are presented
Operation RANGER. Volume 5. Program Reports - Operational
1952-07-01
Naval Electronics Laboratory, San Diego 52, Calif. Commanding Officer and Director, David Taylor Model Basin, Washington 7, D. C. Chief, Bureau of...By G. A. Kent and B. G. Holzman 3. Ground Instrumentation Provided by Sandia Corporation for Use during Operation Ranger By E. J. Klir.k and R. I...For this reason the most expert forecasting service will be required. It is anticipated that Col. Holzman , Air Weather Service, will be the chief
Operational Transformation In Co-Operative Editing
Directory of Open Access Journals (Sweden)
Mandeep Kaur
2015-08-01
Full Text Available Cooperative Editing Systems in real-time allows a virtual team to view and edit a shared document at the same time. The document shared must be synchronized in order to ensure consistency for all the participants. This paper describes the Operational Transformation the evolution of its techniques its various applications major issues and achievements. In addition this paper will present working of a platform where two users can edit a code programming file at the same time.
Operator interface programs for KSTAR operation
International Nuclear Information System (INIS)
Lee, Sangil; Park, Mikyung; Park, Jinseop; Na, Hoonkyun; Kwon, M.
2013-01-01
Beginning the first plasma discharging experiment of KSTAR since 2008, KSTAR performed the third plasma discharging experiment by 2010. During the experiment of three times, KSTAR OPerator Interface (OPI) programs have been developed for KSTAR operation by itself. OPI programs used in KSTAR were implemented by KSTAR widget plug-in Toolkit (KWT). The KWT means the plug-in library implemented by Qt-based user interface development software. The main purpose of developing the KWT library is to implement full automation libraries having interface with the automated EPICS channel access (CA) guaranteeing the flexibility for requirements of operators. In addition, it has advantages in minimizing human code error and maximizing utilization of the limited human resource. According to the increasing of control systems, a number of OPI servers connected to one EPICS gateway server caused the connection problem and increased the amount of the network data packets. To solve these problems, an algorithm of “CachedChannelAccess” for shared memory base was implemented into an inner logic of the KWT library. KSTAR control system monitoring (CSM) program is one of applications developed by using KWT library. The function of CSM program is to notify alarm to operators by checking health status of every server's network health status and resource (cpu, memory, network packets, disk usage rate and system/user defined process) usage state. Another application is a post-shot sequencing program which is activated after every shot is completed. This application is to display major plasma parameters and diagnostic data in chart form, to save this data to database, and to transfer a chart image file to a web server. This paper describes the technical details how to develop OPI applications which have high productivity using Qt on the EPICS-based control system
Basic Sewage Treatment Operation.
Ontario Ministry of the Environment, Toronto.
This manual was developed for use at workshops designed to introduce operators to the fundamentals of sewage plant operation. The course consists of lecture-discussions and hands-on activities. Each of the lessons has clearly stated behavioral objectives to tell the trainee what he should know or do after completing that topic. Areas covered in…
Hampson, Gregory V; Cook, Steven P; Frederiksen, Steven R
Operation Bali Assist was the Australian Defence Force evacuation of injured Australians and other foreign nationals after the Bali terrorist bombing. This operation was the largest Australian aeromedical evacuation since the Vietnam War. It relied on military and civilian cooperation to move the critically injured initially from Denpasar to Darwin, and then on to specialist units around Australia.
Health care operations management
Carter, M.W.; Hans, Elias W.; Kolisch, R.
2012-01-01
Health care operations management has become a major topic for health care service providers and society. Operations research already has and further will make considerable contributions for the effective and efficient delivery of health care services. This special issue collects seven carefully
Hans, Elias W.; Nieberg, T.
2007-01-01
The operating room (OR) department of a hospital forms the heart of the organization, where the single largest cost is incurred. This document presents and reports on the “Operating Room Manager Game,” developed to give insight into managing a large hospital's OR department at various levels of
Nuclear Powerplant Safety: Operations.
Department of Energy, Washington, DC. Nuclear Energy Office.
Powerplant systems and procedures that ensure the day-to-day health and safety of people in and around the plant is referred to as operational safety. This safety is the result of careful planning, good engineering and design, strict licensing and regulation, and environmental monitoring. Procedures that assure operational safety at nuclear…
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Reliance Cell Operator. Reliance was the only bidder for cellular licences for Assam and NE. Services allowed only in Guwahati and Shillong due to “security reasons”. Only major cities in the country with only one operator.
Directory of Open Access Journals (Sweden)
Sergio Arturo Celani
2006-01-01
Full Text Available We characterize the simple and subdirectly irreducible distributive algebras in some varieties of distributive lattices with unary operators, including topological and monadic positive modal algebras. Finally, for some varieties of Heyting algebras with operators we apply these results to determine the simple and subdirectly irreducible algebras.
Operation auxiliary system (SAO)
International Nuclear Information System (INIS)
Lolich, J.; Santome, D.; Drexler, J.
1990-01-01
This work presents an auxiliary system for nuclear power plants operation (SAO). The development purpose consisted in a computing supervision system to be installed at different sites of a reactor, mainly in the control room. The inclusion of this system to a nuclear power plant minimizes the possibility of human error for the facility operation. (Author) [es
DEFF Research Database (Denmark)
Gardner, Richard J.; Kiderlen, Markus
A structural theory of operations between real-valued (or extended-real-valued) functions on a nonempty subset A of Rn is initiated. It is shown, for example, that any operation ∗ on a cone of functions containing the constant functions, which is pointwise, positively homogeneous, monotonic...
Marine Corps Inst., Washington, DC.
Developed as part of the Marine Corps Institute (MCI) correspondence training program, this course on crane and excavator operation is designed to enable the crane and excavator operator to perform his/her duties more proficiently. Introductory materials include specific information for MCI students, a course introduction, and a study guide…
Elliptic Quadratic Operator Equations
Ganikhodjaev, Rasul; Mukhamedov, Farrukh; Saburov, Mansoor
2017-01-01
In the present paper is devoted to the study of elliptic quadratic operator equations over the finite dimensional Euclidean space. We provide necessary and sufficient conditions for the existence of solutions of elliptic quadratic operator equations. The iterative Newton-Kantorovich method is also presented for stable solutions.
Faris, Grant
2012-01-01
Integrate the mission operations assurance function into the flight team providing: (1) value added support in identifying, mitigating, and communicating the project's risks and, (2) being an essential member of the team during the test activities, training exercises and critical flight operations.
Indian Academy of Sciences (India)
and includes virtual memory, shared libraries, demand loading, ... Memory Management is a scheme by which an operating system shares the memory in a computer ..... Suggested Reading and Websites. [1] Andrew S Tannenbaum and Albert S Woodhull,. Operating Systems: Design and Implementation,. Second Edition ...
Tanenbaum, A.S.; van Renesse, R.
1985-01-01
Distributed operating systems have many aspects in common with centralized ones, but they also differ in certain ways. This paper is intended as an introduction to distributed operating systems, and especially to current university research about them. After a discussion of what constitutes a
Technical Concept - Operation Bren
1962-01-01
and consonant with safe operation of those facilities. C-1, C-4, and C-6 (see the organization chart on p. 20) shall be responsible to the TD for...source will be shipped to NTS in accordance with AEC regulations. 19 Chapter 8 ORGANIZATION AND RESPONSIBILITIES The organization chart for Operation
Directory of Open Access Journals (Sweden)
Ovidiu T. Pop
2007-01-01
Full Text Available Using the method of Jakimovski and Leviatan from their work in 1969, we construct a general class of linear positive operators. We study the convergence, the evaluation for the rate of convergence in terms of the first modulus of smoothness and we give a Voronovskaja-type theorem for these operators.
Generalizations of OWA Operators
Czech Academy of Sciences Publication Activity Database
Mesiar, Radko; Stupňanová, A.; Yager, R. R.
2015-01-01
Roč. 23, č. 6 (2015), s. 2154-2152 ISSN 1063-6706 Institutional support: RVO:67985556 Keywords : Choquet integral * ordered modular average (OMA) operator * ordered weighted average (OWA) operator Subject RIV: BA - General Mathematics Impact factor: 6.701, year: 2015 http://library.utia.cas.cz/separaty/2015/E/mesiar-0453103.pdf
South Carolina State Dept. of Education, Columbia. Office of Vocational Education.
This module on special operations, one in a series dealing with industrial sewing machines, their attachments, and operation, covers two topics: topstitching and mitering. For each topic these components are provided: an introduction, directions, an objective, learning activities, student information, a student self-check, and a check-out…
2014-06-01
operations such as food and furniture deliveries, maintenance operations, event manager companies, etc. An app called gMobiMate would be available for...vehicles by providing them with a smart routing and attachment of documents to give more information about the tasks or incidents. 35. The third form
International Nuclear Information System (INIS)
McConnell, L.G.; Woodhead, L.W.; Fanjoy, G.R.
1982-03-01
The CANDU Pressurized Heavy Water (CANDU-PHW) type of nuclear electric generating station has been developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This paper highlights Ontario Hydro's operating experience using the CANDU-PHW system, with a focus on the operating performance and costs, reliability of system components and nuclear safety considerations both to the workers and the public
Waterworks Operator Training Manual.
Missouri Univ., Columbia. Instructional Materials Lab.
Sixteen self-study waterworks operators training modules are provided. Module titles are the following: basic mathematics, basic chemistry, analysis procedures, microbiology, basic electricity, hydraulics, chlorination, plant operation, surface water, ground water, pumps, cross connections, distribution systems, safety, public relations, and…
Aircraft operations management manual
1992-01-01
The NASA aircraft operations program is a multifaceted, highly diverse entity that directly supports the agency mission in aeronautical research and development, space science and applications, space flight, astronaut readiness training, and related activities through research and development, program support, and mission management aircraft operations flights. Users of the program are interagency, inter-government, international, and the business community. This manual provides guidelines to establish policy for the management of NASA aircraft resources, aircraft operations, and related matters. This policy is an integral part of and must be followed when establishing field installation policy and procedures covering the management of NASA aircraft operations. Each operating location will develop appropriate local procedures that conform with the requirements of this handbook. This manual should be used in conjunction with other governing instructions, handbooks, and manuals.
Assessing Operational Situations
DEFF Research Database (Denmark)
Zhang, Xinxin
In spite of the high level of automation commonly applied to today’s engineering system, humans’ skill and knowledge still plays a central role in the systems’ daily operation, critical decision making, and accident management. The complexity of the engineered system poses great challenge for human...... operators to perceive and understand the operational situation. The research domain of situation awareness approaches the operational challenges from the human cognition perspective while the presented thesis aims at supporting situation assessment from the system perspective. The thesis has reviewed...... different perspectives on situation awareness in the human factor studies and uses the knowledge reflectively for system representation and analysis. The human cognitive activities during complex plant operation and how they perceive a situation and what kind of knowledge has to be established in the human...
Sustainable Building Operation
DEFF Research Database (Denmark)
Jensen, Jesper Ole
2009-01-01
building operation as an 'umbrella' for various ways of reducing flows of energy, water and waste in the daily operation of the buildings, for instance by regular monitoring the consumption, by using 'green accounting', by applying policies for sustainability etc. The paper is based on case studies...... of sustainable building operation and a survey amongst building administrators from the private and the social housing sector. Our results show that there are many good examples on sustainable building operation in Danish housing estates, where local building managers, residents etc. have gained impressive...... results. In the broader sense, however, there is a limited used of available methods and technologies. Barriers for the use of sustainable building operation have been identified, and related to different types of ownership (social housing, private rented, owner-occupied and private co-ops). The survey...
Tanenbaum, Andrew S
2015-01-01
Modern Operating Systems, Fourth Edition, is intended for introductory courses in Operating Systems in Computer Science, Computer Engineering, and Electrical Engineering programs. It also serves as a useful reference for OS professionals ' The widely anticipated revision of this worldwide best-seller incorporates the latest developments in operating systems (OS) technologies. The Fourth Edition includes up-to-date materials on relevant'OS. Tanenbaum also provides information on current research based on his experience as an operating systems researcher. ' Modern Operating Systems, Third Editionwas the recipient of the 2010 McGuffey Longevity Award. The McGuffey Longevity Award recognizes textbooks whose excellence has been demonstrated over time.'http://taaonline.net/index.html " Teaching and Learning Experience This program will provide a better teaching and learning experience-for you and your students. It will help: ' *Provide Practical Detail on the Big Picture Concepts: A clear and entertaining writing s...
International Nuclear Information System (INIS)
Decreton, M.
1998-01-01
Maintenance, repair, and dismantling operations in nuclear facilities have to be performed remotely when high radiation doses exclude hands-on operation, but also to minimize contamination risks and occupational doses to the operators. Computer-aided and sensor-based tele-operation enhances safety, reliability, and performance by helping the operator in difficult tasks with poor remote environmental perception. The objectives of work in this domain are to increase the scientific knowledge of the studied phenomena, to improve the interpretation of data, to improve the piloting og experimental devices during irradiation, to reveal and to understand possible unexpected phenomena occurring during irradiation. This scientific report describes the achievements for 1997 in the area of radiation tolerance for of remote-sensing, optical fibres and optical fibre sensors
Moore, Hyatt E; Andlauer, Olivier; Simon, Noah; Mignot, Emmanuel
2014-04-01
Determining diagnostic criteria for specific disorders is often a tedious task that involves determining optimal diagnostic thresholds for symptoms and biomarkers using receiver-operating characteristic (ROC) statistics. To help this endeavor, we developed softROC, a user-friendly graphic-based tool that lets users visually explore possible ROC tradeoffs. The software requires MATLAB installation and an Excel file containing threshold symptoms/biological measures, with corresponding gold standard diagnoses for a set of patients. The software scans the input file for diagnostic and symptom/biomarkers columns, and populates the graphical-user-interface (GUI). Users select symptoms/biomarkers of interest using Boolean algebra as potential inputs to create diagnostic criteria outputs. The software evaluates subtests across the user-established range of cut-points and compares them to a gold standard in order to generate ROC and quality ROC scatter plots. These plots can be examined interactively to find optimal cut-points of interest for a given application (e.g. sensitivity versus specificity needs). Split-set validation can also be used to set up criteria and validate these in independent samples. Bootstrapping is used to produce confidence intervals. Additional statistics and measures are provided, such as the area under the ROC curve (AUC). As a testing set, softROC is used to investigate nocturnal polysomnogram measures as diagnostic features for narcolepsy. All measures can be outputted to a text file for offline analysis. The softROC toolbox, with clinical training data and tutorial instruction manual, is provided as supplementary material and can be obtained online at http://www.stanford.edu/~hyatt4/software/softroc or from the open source repository at http://www.github.com/informaton/softroc. Copyright © 2014 Elsevier Ltd. All rights reserved.
Gohberg, Israel
2001-01-01
rii application of linear operators on a Hilbert space. We begin with a chapter on the geometry of Hilbert space and then proceed to the spectral theory of compact self adjoint operators; operational calculus is next presented as a nat ural outgrowth of the spectral theory. The second part of the text concentrates on Banach spaces and linear operators acting on these spaces. It includes, for example, the three 'basic principles of linear analysis and the Riesz Fredholm theory of compact operators. Both parts contain plenty of applications. All chapters deal exclusively with linear problems, except for the last chapter which is an introduction to the theory of nonlinear operators. In addition to the standard topics in functional anal ysis, we have presented relatively recent results which appear, for example, in Chapter VII. In general, in writ ing this book, the authors were strongly influenced by re cent developments in operator theory which affected the choice of topics, proofs and exercises. One ...
Stirling machine operating experience
Energy Technology Data Exchange (ETDEWEB)
Ross, B. [Stirling Technology Co., Richland, WA (United States); Dudenhoefer, J.E. [Lewis Research Center, Cleveland, OH (United States)
1994-09-01
Numerous Stirling machines have been built and operated, but the operating experience of these machines is not well known. It is important to examine this operating experience in detail, because it largely substantiates the claim that stirling machines are capable of reliable and lengthy operating lives. The amount of data that exists is impressive, considering that many of the machines that have been built are developmental machines intended to show proof of concept, and are not expected to operate for lengthy periods of time. Some Stirling machines (typically free-piston machines) achieve long life through non-contact bearings, while other Stirling machines (typically kinematic) have achieved long operating lives through regular seal and bearing replacements. In addition to engine and system testing, life testing of critical components is also considered. The record in this paper is not complete, due to the reluctance of some organizations to release operational data and because several organizations were not contacted. The authors intend to repeat this assessment in three years, hoping for even greater participation.
The Battle for Crete (Operation Mercury): An Operational Analysis
2001-05-18
NAVAL WAR COLLEGE Newport, R.I. The Battle for Crete (Operation Mercury ): An Operational Analysis by Kenneth J. Cox Lieutenant Colonel, U.S. Army...Title (Include Security Classification): The Battle for Crete (Operation Mercury ): An Operational Analysis (UNCLASSIFIED) 9. Personal Authors...Security Classification of this page Unclassified 3 ABSTRACT The Battle for Crete (Operation Mercury ): An Operational Analysis In May
Energy Technology Data Exchange (ETDEWEB)
Lee, Young Jae; Lee, Hae Cho; Lee, Ho Yeun; Kim, Young Taek; Lee, Sung Kyu; Park, Jeong Suk; Nam, Ji Wha; Kim, Soon Kon; Yang, Sung Un; Sohn, Jae Min; Moon, Soon Sung; Park, Bong Sik; Lee, Byung Heon; Park, Sun Hee; Kim, Jin Hee; Hwang, Hyeoi Sun; Lee, Hee Ja; Hwang, In A. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1993-12-01
The report described the operation and the trouble shooting of main computer and KAERINet. The results of the project are as follows; 1. The operation and trouble shooting of the main computer system. (Cyber 170-875, Cyber 960-31, VAX 6320, VAX 11/780). 2. The operation and trouble shooting of the KAERINet. (PC to host connection, host to host connection, file transfer, electronic-mail, X.25, CATV etc.). 3. The development of applications -Electronic Document Approval and Delivery System, Installation the ORACLE Utility Program. 22 tabs., 12 figs. (Author) .new.
International Nuclear Information System (INIS)
Plaziat, J.F.; Moulin, P.; Van Beurden, R.; Ballet, E.
2005-01-01
Building an internal gas market implies establishing harmonized rules for cross border trading between operators. To that effect, the European association EASEE-gas is carrying out standards and procedures, commonly called 'inter-operability'. Set up in 2002, the Association brings together all segments of the gas industry: producers, transporters, distributors, traders and shippers, suppliers, consumers and service providers. This workshop presents the latest status on issues such as barriers to gas trade in Europe, rules and procedures under preparation by EASEE-gas, and the implementation schedule of these rules by operators. This article gathers 5 presentations about this topic given at the gas conference
Operational proof of automation
International Nuclear Information System (INIS)
Jaerschky, R.; Reifenhaeuser, R.; Schlicht, K.
1976-01-01
Automation of the power plant process may imply quite a number of problems. The automation of dynamic operations requires complicated programmes often interfering in several branched areas. This reduces clarity for the operating and maintenance staff, whilst increasing the possibilities of errors. The synthesis and the organization of standardized equipment have proved very successful. The possibilities offered by this kind of automation for improving the operation of power plants will only sufficiently and correctly be turned to profit, however, if the application of these technics of equipment is further improved and if its volume is tallied with a definite etc. (orig.) [de
Computerized operator decision aids
International Nuclear Information System (INIS)
Long, A.B.
1984-01-01
This article explores the potential benefits associated with the use of computers in nuclear plants by the operating crew as an aid in making decisions. Pertinent findings are presented from recently completed projects to establish the context in which operating decisions have to be made. Key factors influencing the decision-making process itself are also identified. Safety parameter display systems, which are being implemented in various forms by the nuclear industry, are described within the context of decision making. In addition, relevant worldwide research and development activities are examined as potential enhancements to computerized operator decision aids to further improve plant safety and availability
International Nuclear Information System (INIS)
McConnell, L.G.; Woodhead, L.W.; Fanjoy, G.R.; Thurygill, E.W.
1980-05-01
The CANDU-PHW program is based upon 38 years of heavy water reactor experience with 35 years of operating experience. Canada has had 72 reactor years of nuclear-electric operations experience with 10 nuclear units in 4 generating stations during a period of 18 years. All objectives have been met with outstanding performance: worker safety, public safety, environmental emissions, reliable electricity production, and low electricity cost. The achievement has been realized through total teamwork involving all scientific disciplines and all project functions (research, design, manufacturing, construction, and operation). (auth)
Information Operations: Where Next?
National Research Council Canada - National Science Library
Buchholz, David R
2005-01-01
... to standardized IO training and integration across the combatant commands. For this reason and others there is a compelling argument for the major responsibility for DoD information operations integration to fall under the control of U.S...
Nuclear material operations manual
International Nuclear Information System (INIS)
Tyler, R.P.
1981-02-01
This manual provides a concise and comprehensive documentation of the operating procedures currently practiced at Sandia National Laboratories with regard to the management, control, and accountability of nuclear materials. The manual is divided into chapters which are devoted to the separate functions performed in nuclear material operations-management, control, accountability, and safeguards, and the final two chapters comprise a document which is also issued separately to provide a summary of the information and operating procedures relevant to custodians and users of radioactive and nuclear materials. The manual also contains samples of the forms utilized in carrying out nuclear material activities. To enhance the clarity of presentation, operating procedures are presented in the form of playscripts in which the responsible organizations and necessary actions are clearly delineated in a chronological fashion from the initiation of a transaction to its completion
Payroll Operational Data Store
Social Security Administration — The Payroll ODS will provide a single repository of payroll data to produce accurate and timely financial reports to support operating, budget, and policy decisions.
Energy Technology Data Exchange (ETDEWEB)
NONE
1997-10-01
This document is the first edition of Argonne`s new Operating Plan. The Operating Plan complements the strategic planning in the Laboratory`s Institutional Plan by focusing on activities that are being pursued in the immediate fiscal year, FY 1998. It reflects planning that has been done to date, and it will serve in the future as a resource and a benchmark for understanding the Laboratory`s performance. The heart of the Institutional Plan is the set of major research initiatives that the Laboratory is proposing to implement in future years. In contrast, this Operating Plan focuses on Argonne`s ongoing R&D programs, along with cost-saving measures and other improvements being implemented in Laboratory support operations.
Department of Homeland Security — This map layer includes crushed stone operations in the United States. These data were obtained from information reported voluntarily to the USGS by the aggregate...
Operations Strategy in practice
DEFF Research Database (Denmark)
Rytter, Niels Gorm; Koch, Christian; Boer, Harry
2005-01-01
In this paper, we describe and illustrate a new, action-based longitudinal case study approach, which aims at helping scholars narrow the gap between the theory and practice of Operations Strategy (OS). First, we elaborate on the need for new research methods for studying OS in practice. Then, we...... and disadvantages of the method. Finally, we draw conclusions on its potential for operations strategy and operations management studies.......In this paper, we describe and illustrate a new, action-based longitudinal case study approach, which aims at helping scholars narrow the gap between the theory and practice of Operations Strategy (OS). First, we elaborate on the need for new research methods for studying OS in practice. Then, we...
International Nuclear Information System (INIS)
1989-08-01
THE OPERATING UNITS STATUS REPORT - LICENSED OPERATING REACTORS provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management from the Headquarters staff of NRC's Office of Enforcement (OE), from NRC's Regional Offices, and from utilities. The three sections of the report are: monthly highlights and statistics for commercial operating units, and errata from previously reported data; a compilation of detailed information on each unit, provided by NRC's Regional Offices, OE Headquarters and the utilities; and an appendix for miscellaneous information such as spent fuel storage capability, reactor-years of experience and non-power reactors in the US
Administrative & Operational Circulars - Reminder
HR Department
2011-01-01
All Administrative and Operational Circulars are available on the intranet site of the Human Resources Department at the following address: http://cern.ch/hr-docs/admincirc/admincirc.asp Department Head Office
Construction Minerals Operations
Department of Homeland Security — This map layer includes construction minerals operations in the United States. The data represent commodities covered by the Minerals Information Team (MIT) of the...
Department of Homeland Security — This map layer includes sand and gravel operations in the United States. These data were obtained from information reported voluntarily to the USGS by the aggregate...
International Nuclear Information System (INIS)
Cimesa, S.
2007-01-01
Slovenian Nuclear Safety Administration (SNSA) has developed its own system for tracking, screening and evaluating the operating experiences of the nuclear installations. The SNSA staff regularly tracks the operating experiences throughout the world and screens them on the bases of applicability for the Slovenian nuclear facilities. The operating experiences, which pass the screening, are thoroughly evaluated and also recent operational events in these facilities are taken into account. If needed, more information is gathered to evaluate the conditions of the Slovenian facilities and appropriate corrective actions are considered. The result might be the identification of the need for modification at the licensee, the need for modification of internal procedures in the SNSA or even the proposal for the modification of regulations. Information system helps everybody to track the process of evaluation and proper logging of activities. (author)
U.S. Environmental Protection Agency — This dataset consists of operable unit data from multiple Superfund sites in U.S. EPA Region 8. These data were acquired from multiple sources at different times and...
Observer's Report - Okinawa Operation
National Research Council Canada - National Science Library
Todd, W. N., Jr
1945-01-01
... for temporary duty in connection with the Okinawa Operation. By verbal agreement between observers, it was decided that each officer would cover certain activities and thus have a complete coverage without duplication...
International Nuclear Information System (INIS)
Church, B.W.
1981-01-01
A brief overview is given of weapon test site decontamination activities carried out by Nevada Operations Office. Tabulated data is given of event name, date, location, year of cleanup, and radioisotopes that were present, activity levels, and cost of cleanup
International Nuclear Information System (INIS)
1991-08-01
The Nuclear Regulatory Commission's annual summary of licensed nuclear power reactor data is based primarily on the report of operating data submitted by licensees for each unit for the month of December because that report contains data for the month of December, the year to date (in this case calendar 1990) and cumulative data, usually from the date of commercial operation. The data is not independently verified, but various computer checks are made. The report is divided into two sections. The first contains summary highlights and the second contains data on each individual unit in commercial operation. Section 1 capacity and availability factors are simple arithmetic averages. Section 2 items in the cumulative column are generally as reported by the licensee and notes as to the use of weighted averages and starting dates other than commercial operation are provided
International Nuclear Information System (INIS)
Flinchem, J.
1980-01-01
This document contains procedures which apply to operations performed on individual P-1c machines in the Machine Interface Test System (MITS) at AiResearch Manufacturing Company's Torrance, California Facility
Operant Conditioning and Education.
de Noronha, Mario
A case study of a learning disabled 8-year-old with behavior disturbancs is presented to highlight the use of operant conditioning in cutting down educational costs and easing the teacher's class management problems. (CL)
Information Operations: Where Next?
National Research Council Canada - National Science Library
Buchholz, David R
2005-01-01
... (DoD) information operations. Doctrine already addresses the issue of combatant commander responsibility for ensuring that IO is planned and executed in the respective commands, but an IO vacuum exists with respect...
Nuclear material operations manuals
International Nuclear Information System (INIS)
Tyler, R.P.
1979-06-01
This manual is intended to provide a concise and comprehensive documentation of the operating procedures currently practiced at Sandia Laboratories with regard to the management, control, and accountability of radioactive and nuclear materials. The manual is divided into chapters which are devoted to the separate functions performed in nuclear material operations-management, control, accountability, and safeguards, and the final two chapters comprise a document which is also issued separately to provide a summary of the information and operating procedures relevant to custodians and users of radioactive and nuclear materials. The manual also contains samples of the forms utilized in carrying out nuclear material activities. To enhance the clarity of presentation, operating procedures are presented in the form of playscripts in which the responsible organizations and necessary actions are clearly delineated in a chronological fashion from the initiation of a transaction to its completion
LCOGT network observatory operations
Pickles, Andrew; Hjelstrom, Annie; Boroson, Todd; Burleson, Ben; Conway, Patrick; De Vera, Jon; Elphick, Mark; Haworth, Brian; Rosing, Wayne; Saunders, Eric; Thomas, Doug; White, Gary; Willis, Mark; Walker, Zach
2014-08-01
We describe the operational capabilities of the Las Cumbres Observatory Global Telescope Network. We summarize our hardware and software for maintaining and monitoring network health. We focus on methodologies to utilize the automated system to monitor availability of sites, instruments and telescopes, to monitor performance, permit automatic recovery, and provide automatic error reporting. The same jTCS control system is used on telescopes of apertures 0.4m, 0.8m, 1m and 2m, and for multiple instruments on each. We describe our network operational model, including workloads, and illustrate our current tools, and operational performance indicators, including telemetry and metrics reporting from on-site reductions. The system was conceived and designed to establish effective, reliable autonomous operations, with automatic monitoring and recovery - minimizing human intervention while maintaining quality. We illustrate how far we have been able to achieve that.
Nuclear material operations manual
Energy Technology Data Exchange (ETDEWEB)
Tyler, R.P.
1981-02-01
This manual provides a concise and comprehensive documentation of the operating procedures currently practiced at Sandia National Laboratories with regard to the management, control, and accountability of nuclear materials. The manual is divided into chapters which are devoted to the separate functions performed in nuclear material operations-management, control, accountability, and safeguards, and the final two chapters comprise a document which is also issued separately to provide a summary of the information and operating procedures relevant to custodians and users of radioactive and nuclear materials. The manual also contains samples of the forms utilized in carrying out nuclear material activities. To enhance the clarity of presentation, operating procedures are presented in the form of playscripts in which the responsible organizations and necessary actions are clearly delineated in a chronological fashion from the initiation of a transaction to its completion.
1980-05-28
An evaluation of the utility of lighter-than-air vehicles (airships) for Alaskan service suggests that very large vehicles operating at low speeds would transport heavy loads to remote areas with excellent fuel economy, but that the potential market ...
Operator licensing examiner standards
International Nuclear Information System (INIS)
1983-10-01
The Operator Licensing Examiner Standards provide policy and guidance to NRC examiners and establish the procedures and practices for examining and licensing of applicants for NRC operator licenses pursuant to Part 55 of Title 10 of the Code of Federal Regulations (10 CFR 55). They are intended to assist NRC examiners and facility licensees to understand the examination process better and to provide for equitable and consistent administration of examinations to all applicants by NRC examiners. These standards are not a substitute for the operator licensing regulations and are subject to revision or other internal operator examination licensing policy changes. As appropriate, these standards will be revised periodically to accommodate comments and reflect new information or experience
International Nuclear Information System (INIS)
Sackett, J.I.; Allen, N.L.; Dean, E.M.; Fryer, R.M.; Larson, H.A.; Lehto, W.K.
1978-01-01
The mission of the Experimental Breeder Reactor II (EBR-II) has envolved from that of a small LMFBR demonstration plant to a major irradiation-test facility. Because of that evolution, many operational-safety issues have been encountered. This paper describes the EBR-II operational-safety experience in four areas: protection-system design, safety-document preparation, tests of off-normal reactor conditions, and tests of elements with breached cladding. (author)
International Nuclear Information System (INIS)
McConnell, L.G.; Woodhead, L.W.; Fanjoy, G.R.
1982-09-01
The CANDU (CANada Deuterium Uranium) Pressurized Heavy Water (PHW) type of nuclear-electric generating station was developed jointly by Atomic Energy of Canada Limited and Ontario Hydro. This paper summarizes Ontario Hydro's operating experience using the CANDU-PHW system, with a focus on the operating performance and costs, reliability of system components, and nuclear safety considerations to both the workers and the public
Hansen, Frank; Pedersen, Gert K.
2002-01-01
We establish what we consider to be the definitive versions of Jensen's operator inequality and Jensen's trace inequality for functions defined on an interval. This is accomplished by the introduction of genuine non-commutative convex combinations of operators, as opposed to the contractions used in earlier versions of the theory. As a consequence, we no longer need to impose conditions on the interval of definition. We show how this relates to the pinching inequality of Davis, and how Jensen...
Operational Waste Volume Projection
Energy Technology Data Exchange (ETDEWEB)
STRODE, J.N.
1999-08-24
Waste receipts to the double-shell tank system are analyzed and wastes through the year 2018 are projected based on assumption as of July 1999. A computer simulation of site operations is performed, which results in projections of tank fill schedules, tank transfers, evaporator operations, tank retrieval, and aging waste tank usage. This projection incorporates current budget planning and the clean-up schedule of the Tri-Party Agreement.
JIRKŮ, Radek
2012-01-01
This thesis introduces readers to the MINIX operating system, which was used in the creation of the Linux OS. It discusses the history and development of the system and explains its core and the file system. Also solves MINIX installation and configuration of the virtual machine at each step and deals with disputes that had a creator of Minix creator of Linux. In conclusion, compared with Linux MINIX and summarizes the advantages and disadvantages and the use of the operating system at present.
Gabriela ANGHELACHE; Ana Cornelia OLTEANU
2011-01-01
Losses resulting from operational risk events from a complex interaction between organizational factors, personal and market participants that do not fit a simple classification scheme. Taking into account past losses (ex. Barings, Daiwa, etc.) we can say that operational risk is a major financial losses in the banking sector, although until recently have been underestimated, considering that they are generally minor, note setting survival of a bank.
Gabriela ANGHELACHE; Ana-Cornelia OLTEANU (PUIU); Alina-Nicoleta RADU
2010-01-01
Beginning with the fact that performant strategies of the financial institutions have programmes and management procedures for the banking risks, which have as main objective to minimize the probability of risk generation and the bank’s potential exposure, this paper wants to present the operational risk measurement. Therefore, the first part presents the conceptual approach of the operational risks through the point of view of the financial institutions exposed to this type of risk. The seco...
2008-09-01
Mittel als Faktoren strategischer Zielsetzung. Ueberlegungen zu Napoleons Feldzug in Russland 1812 (Hamburg: Fuehrungs- akademie der Bundeswehr, November...continuous recon- naissance and surveillance of the basing and operating areas of the enemy forces. To achieve success in the main sector, it is...operation lies in uninterrupted recon- naissance /surveillance and good intelligence on the enemy’s situation, a high state of combat readiness and
Rotations in Stability Operations
2012-04-25
forces to the protected population .” An “ overwhelming presence” was essential to the initial success in Haiti and an “inadequate” number of troops was...stability operations until they achieve the endstate rather than rotating them allows the military to use overwhelming presence, successfully handle...must deploy a force that provides an overwhelming presence in the area of operations with the mission to achieve the endstate. 14. SUBJECT
Power reactors operational diagnosis
International Nuclear Information System (INIS)
Dach, K.; Pecinka, L.
1976-01-01
The definition of reactor operational diagnostics is presented and the fundamental trends of research are determined. The possible sources of power reactor malfunctions, the methods of defect detection, the data evaluation and the analysis of the results are discussed in detail. In view of scarcity of a theoretical basis and of insufficient in-core instrumentation, operational diagnostics cannot be as yet incorporated in a computer-aided reactor control system. (author)
Quality in drilling operations
Energy Technology Data Exchange (ETDEWEB)
Duncan, E.; Gervais, I. [Sedco Forex Jacintoport Facility, Channelview, TX (United States); Le Moign, Y.; Pangarkar, S.; Stibbs, B. [Sedco Forex, Montrouge (France); McMorran, P. [Sedco Forex, Pau (France); Nordquist, E. [Dubai Petroleum Company, Dubai (United Arab Emirates); Pittman, T. [Sedco Forex, Perth (Australia); Schindler, H. [Sedco Forex, Dubai (United Arab Emirates); Scott, P. [Woodside Offshore Petroleum Pty. Ltd., Perth (Australia)
1996-12-31
Driven by cost and profitability pressures, quality has taken on new meaning and importance in the oil field during the past decade. In drilling operations, new initiatives have led to cooperative team efforts between operators and drilling contractors to enhance quality. In this article examples are given of how one drilling contractor, by adopting a quality culture, is reaping major benefits for its clients as well as its employees. 22 figs., 19 refs.
Operational Waste Volume Projection
Energy Technology Data Exchange (ETDEWEB)
STRODE, J.N.
2000-08-28
Waste receipts to the double-shell tank system are analyzed and wastes through the year 2015 are projected based on generation trends of the past 12 months. A computer simulation of site operations is performed, which results in projections of tank fill schedules, tank transfers, evaporator operations, tank retrieval, and aging waste tank usage. This projection incorporates current budget planning and the clean-up schedule of the Tri-Party Agreement. Assumptions were current as of June. 2000.
Directory of Open Access Journals (Sweden)
Gabriela ANGHELACHE
2011-06-01
Full Text Available Losses resulting from operational risk events from a complex interaction between organizational factors, personal and market participants that do not fit a simple classification scheme. Taking into account past losses (ex. Barings, Daiwa, etc. we can say that operational risk is a major financial losses in the banking sector, although until recently have been underestimated, considering that they are generally minor, note setting survival of a bank.
International Nuclear Information System (INIS)
Bodington, J.C.
1991-01-01
This article addresses the evaluation of power projects for the purpose of determining their marketability. The topics of the article include deciding to sell, reasons to buy, appraising a project, determining worth of the project assets as well as the operating project itself, and negotiating the deal. With a comprehensive understanding of a project's worth, and strict attention to the details of a sales agreement, ownership of operating independent energy facilities can be transferred with maximum benefit for both buyer and seller
International Nuclear Information System (INIS)
Puglisi, M.; Cornacchia, M.
1981-01-01
The need for a very low final amplifier output impedance, always associated with class A operation, requires a very large power waste in the final tube. The recently suggested pulsed rf operation, while saving a large amount of power, increases the inherent final amplifier non linearity. A method is presented for avoiding the large signal non linear analysis and it is shown how each component of the beam induced voltage depends upon all the beam harmonics via some coupling coefficients which are evaluated
Rudić, Ratko
2016-01-01
This thesis outlines history, development and design of microkernel based operating systems. While the idea of microkernel based architecture emerged early in computer science, there are still very few systems adopting this technology. Microkernel operating systems are divided into several different groups and families that frequently share rules, design decisions and development processes. This master thesis focuses on the main representatives of these groups as well as their mutual...
Operating experience: safety perspective
International Nuclear Information System (INIS)
Piplani, Vivek; Krishnamurthy, P.R.; Kumar, Neeraj; Upadhyay, Devendra
2015-01-01
Operating Experience (OE) provides valuable information for improving NPP safety. This may include events, precursors, deviations, deficiencies, problems, new insights to safety, good practices, lessons and corrective actions. As per INSAG-10, an OE program caters as a fundamental means for enhancing the defence-in-depth at NPPs and hence should be viewed as ‘Continuous Safety Performance Improvement Tool’. The ‘Convention on Nuclear Safety’ also recognizes the OE as a tool of high importance for enhancing the NPP safety and its Article 19 mandates each contracting party to establish an effective OE program at operating NPPs. The lessons drawn from major accidents at Three Mile Island, Chernobyl and Fukushima Daiichi NPPs had prompted nuclear stalwarts to change their safety perspective towards NPPs and to frame sound policies on issues like safety culture, severe accident prevention and mitigation. An effective OE program, besides correcting current/potential problems, help in proactively improving the NPP design, operating and maintenance procedures, practices, training, etc., and thus plays vital role in ensuring safe and efficient operation of NPPs. Further it enhances knowledge with regard to equipment operating characteristics, system performance trends and provides data for quantitative and qualitative safety analysis. Besides all above, an OE program inculcates a learning culture in the organisation and thus helps in continuously enhancing the expertise, technical competency and knowledge base of its staff. Nuclear and Radiation Facilities in India are regulated by Atomic Energy Regulatory Board (AERB). Operating Plants Safety Division (OPSD) of AERB is involved in managing operating experience activities. This paper provides insights about the operating experience program of OPSD, AERB (including its on-line data base namely OPSD STAR) and its utilisation in improving the regulations and safety at Indian NPPs/projects. (author)
2010-11-01
competitive civil service selection process. Mr. Mark H. Johnson ( DISES ) is the Director of JIOWC, and USAR Colonel Vincent D. Crabb is the Deputy...of Public Affairs (PA), Civil -Military Operations (CMO), and Defense Support to Public Diplomacy (DSPD) contribute to the accomplishment of the IO...and internal publics with interest in the Department of Defense. 6 (2) Civil -Military Operations (CMO) are the activities of a commander that
Varsi, Giulio
In the last decade, the operation of a spacecraft after launch has emerged as a major component of the total cost of the mission. This trend is sustained by the increasing complexity, flexibility, and data gathering capability of the space assets and by their greater reliability and consequent longevity. The trend can, however, be moderated by the progressive transfer of selected functions from the ground to the spacecraft and by application, on the ground, of new technology. Advances in ground operations derive from the introduction in the mission operations environment of advanced microprocessor-based workstations in the class of a few million instructions per second and from the selective application of artificial intelligence technology. In the last few years a number of these applications have been developed, tested in operational settings and successfully demonstrated to users. Some are now being integrated in mission operations facilities. An analysis of mission operations indicates that the key areas are: concurrent control of multiple missions; automated/interactive production of command sequences of high integrity at low cost; automated monitoring of spacecraft health and automated aides for fault diagnosis; automated allocation of resources; automated processing of science data; and high-fidelity, high-speed spacecraft simulation. Examples of major advances in selected areas are described.
Pipeline system operability review
Energy Technology Data Exchange (ETDEWEB)
Eriksson, Kjell [Det Norske Veritas (Norway); Davies, Ray [CC Technologies, Dublin, OH (United States)
2005-07-01
Pipeline operators are continuously working to improve the safety of their systems and operations. In the US both liquid and gas pipeline operators have worked with the regulators over many years to develop more systematic approaches to pipeline integrity management. To successfully manage pipeline integrity, vast amounts of data from different sources needs to be collected, overlaid and analyzed in order to assess the current condition and predict future degradation. The efforts undertaken by the operators has had a significant impact on pipeline safety, nevertheless, during recent years we have seen a number of major high profile accidents. One can therefore ask how effective the pipeline integrity management systems and processes are. This paper will present one methodology 'The Pipeline System Operability Review' that can evaluate and rate the effectiveness of both the management systems and procedures, as well as the technical condition of the hardware. The result from the review can be used to compare the performance of different pipelines within one operating company, as well as benchmark with international best practices. (author)
Reactor operational transient analysis
International Nuclear Information System (INIS)
Shin, W.K.; Chae, S.K.; Han, K.I.; Yang, K.S.; Chung, H. D.; Kim, H.G.; Moon, H.J.; Ryu, Y.H.
1983-01-01
To build up efficient capability of safety review and inspection for the nuclear power plants, four area of studies have performed as follows: 1) In order to search the most optimized operating method during load follow operating schemes, automatic control and normal control, are compared each other under the CAOC condition. The analysis performed by DDID code has shown that the reactor has to be controlled by the operator manually during load follow operation. 2) Through the sensitivity analysis by COBRA code, the operating parameters, such as coolant pressure, flow rate, inlet temperature, and power distribution are shown to be important to the determination of DNBR. Expecially, inlet temperature of primary coolant system is appeared as the most senstive parameter on DNBR. 3) FRAPCON code is adapted to study the sensitivity of several operational parameters on the mechanical properties of reactor fuel rod. 4) The calculations procedure which is required to be obtained the neutron fluence at the reactor vessel and the spectrum at the surveillance capsule is established. The results of computation are conpared with those of FSAR and SWRI report and proved its applicability to reactor surveillance program. (Author)
Operator licensing examiner standards
International Nuclear Information System (INIS)
1994-06-01
The Operator Licensing Examiner Standards provide policy and guidance to NRC examiners and establish the procedures and practices for examining licensees and applicants for reactor operator and senior reactor operator licenses at power reactor facilities pursuant to Part 55 of Title 10 of the Code of Federal Regulations (10 CFR 55). The Examiner Standards are intended to assist NRC examiners and facility licensees to better understand the initial and requalification examination processes and to ensure the equitable and consistent administration of examinations to all applicants. These standards are not a substitute for the operator licensing regulations and are subject to revision or other internal operator licensing policy changes. Revision 7 was published in January 1993 and became effective in August 1993. Supplement 1 is being issued primarily to implement administrative changes to the requalification examination program resulting from the amendment to 10 CFR 55 that eliminated the requirement for every licensed operator to pass an NRC-conducted requalification examination as a condition for license renewal. The supplement does not substantially alter either the initial or requalification examination processes and will become effective 30 days after its publication is noticed in the Federal Register. The corporate notification letters issued after the effective date will provide facility licensees with at least 90 days notice that the examinations will be administered in accordance with the revised procedures
International Nuclear Information System (INIS)
Oohashi, Hideaki.
1982-01-01
Purpose: To enable a reactor operator to perform safety and sure inspection for a reactor and take manual start-up operations for the necessary systems at optimum timing with neither misoperation nor misjudging after the occurrence of reactor accidents. Constitution: If a signal judging circuit judges the generation of an accident signal for a reactor, the circuit issues an output signal to start the time counting operation of a time counter thereby inform the elapse of time after the occurrence of the reactor accident. Further, a time signal generated on every predetermined time from the time counter and a process signal indicating the reactor status are logically judged and, if the conditions for taking manual start-up operations, are satisfied, a start-up instruction signal is generated. An information signal is formed depending on the start-up instruction and the content of the start-up instruction is displayed on every predetermined time by the information signal, whereby the operator can perform the manual start-up operations at the optimum timings. (Moriyama, K.)
HP upgrade operational streamlining
Edge, David R.; Emenheiser, Kenneth S.; Hanrahan, William P., III; Mccollums, D.; Seery, Paul J.; Ricklefs, Randall L.
1993-01-01
New computer technology and resources must be successfully integrated into CDSLR station operations to manage new complex operational tracking requirements, support the on site production of new data products, support ongoing station performance improvements, and to support new station communication requirements. The NASA CDSLR Network is in the process of upgrading station computer resources with HP UNIX workstations, designed to automate a wide range of operational station requirements. The primary HP upgrade objective was to relocate computer intensive data system tasks from the controller computer to a new advanced computer environment designed to meet the new data system requirements. The HP UNIX environment supports fully automated real time data communications, data management, data processing, and data quality control. Automated data compression procedures are used to improve the efficiency of station data communications. In addition, the UNIX environment supports a number of semi-automated technical and administrative operational station tasks. The x window user interface generates multiple simultaneous color graphics displays, providing direct operator visibility and control over a wide range of operational station functions.
Wu, L.; Liu, S.; Yang, Yingjie
2016-01-01
Traditional integer order buffer operator is extended to fractional order buffer operator, the corresponding relationship between the weakening buffer operator and the strengthening buffer operator is revealed. Fractional order buffer operator not only can generalize the weakening buffer operator and the strengthening buffer operator, but also realize tiny adjustment of buffer effect. The effectiveness of GM(1,1) with the fractional order buffer operator is validated by six cases.
Automated emergency operating procedures
International Nuclear Information System (INIS)
Perez-Ramirez, G.; Nelson, P.F.
1990-01-01
This paper describes the development of a training tool for the symptom oriented emergency operating procedures used at the Laguna Verde Nuclear Power Plant. EOPs and operator training are intended to assist the operator for managing accident situations. A prototype expert system based on the EOPs has been developed for operator training. The demonstration expert system was developed using a commercial shell. The knowledge base consists of two parts. The specific operator actions to be executed for 5 selected accident sequences and the EOPs steps for the reactor pressure vessel control of the water level, pressure, and power. The knowledge is expressed in the form of IF-THEN production rules. A typical training session will display a set of conditions and will prompt the trainee to indicate the appropriate step to perform. This mode will guide the trainee through selected accident sequences. A second mode of the expert system will prompt the trainee for the current plant conditions and the expert system will respond with the EOPs which are required to be performed under these conditions. This allows the trainee to study What if situations
Operator representations of frames
DEFF Research Database (Denmark)
Christensen, Ole; Hasannasab, Marzieh
2017-01-01
The purpose of this paper is to consider representations of frames {fk}k∈I in a Hilbert space ℋ of the form {fk}k∈I = {Tkf0}k∈I for a linear operator T; here the index set I is either ℤ or ℒ0. While a representation of this form is available under weak conditions on the frame, the analysis...... of the properties of the operator T requires more work. For example it is a delicate issue to obtain a representation with a bounded operator, and the availability of such a representation not only depends on the frame considered as a set, but also on the chosen indexing. Using results from operator theory we show...... that by embedding the Hilbert space ℋ into a larger Hilbert space, we can always represent a frame via iterations of a bounded operator, composed with the orthogonal projection onto ℋ. The paper closes with a discussion of an open problem concerning representations of Gabor frames via iterations of a bounded...
International Nuclear Information System (INIS)
Shimomura, Y.; Huget, M.; Mizoguchi, T.; Murakami, Y.; Polevoi, A.; Shimada, M.; Aymar, R.; Chuyanov, V.; Matsumoto, H.
2001-01-01
ITER is planned to be the first fusion experimental reactor in the world operating for research in physics and engineering. The first 10 years' operation will be devoted primarily to physics issues at low neutron fluence and the following 10 years' operation to engineering testing at higher fluence. ITER can accommodate various plasma configurations and plasma operation modes such as inductive high Q modes, long pulse hybrid modes, non-inductive steady-state modes, with large ranges of plasma current, density, beta and fusion power, and with various heating and current drive methods. This flexibility will provide an advantage for coping with uncertainties in the physics database, in studying burning plasmas, in introducing advanced features and in optimizing the plasma performance for the different programme objectives. Remote sites will be able to participate in the ITER experiment. This concept will provide an advantage not only in operating ITER for 24 hours per day but also in involving the world-wide fusion communities and in promoting scientific competition among the Parties. (author)
International Nuclear Information System (INIS)
1989-06-01
The US Nuclear Regulatory Commission's monthly LICENSED OPERATING REACTORS Status Summary Report provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management, from the Headquarters Staff of NRC's Office of Inspection and Enforcement, from NRC's Regional Offices, and from utilities. Since all of the data concerning operation of the units are provided by the utility operators less than two weeks after the end of the month, necessary corrections to published information are shown on the ERRATA page. This report is divided into three sections: the first contains monthly highlights and statistics for commercial operating units, and errata from previously reported data; the second is a compilation of detailed information on each unit, provided by NRC Regional Offices, IE Headquarters and the Utilities; and the third section is an appendix for miscellaneous information such as spent fuel storage capability, reactor years of experience and non-power reactors in the United States
Banach, S
1987-01-01
This classic work by the late Stefan Banach has been translated into English so as to reach a yet wider audience. It contains the basics of the algebra of operators, concentrating on the study of linear operators, which corresponds to that of the linear forms a1x1 + a2x2 + ... + anxn of algebra.The book gathers results concerning linear operators defined in general spaces of a certain kind, principally in Banach spaces, examples of which are: the space of continuous functions, that of the pth-power-summable functions, Hilbert space, etc. The general theorems are interpreted in various mathematical areas, such as group theory, differential equations, integral equations, equations with infinitely many unknowns, functions of a real variable, summation methods and orthogonal series.A new fifty-page section (``Some Aspects of the Present Theory of Banach Spaces'''') complements this important monograph.
International Nuclear Information System (INIS)
1989-08-01
The US Nuclear Regulatory Commission's monthly LICENSED OPERATING REACTORS Status Summary Report provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management, from the Headquarters Staff of NRC's Office of Inspection and Enforcement, from NRC's Regional Offices, and from utilities. This report is divided into three sections: the first contains monthly highlights and statistics for commercial operating units, and errata from previously reported data; the second is a compilation of detailed information on each unit, provided by NRC Regional Offices, IE Headquarters and the utilities; and the third section is an appendix for miscellaneous information such as spent fuel storage capability, reactor years of experience and non-power reactors in the United States
International Nuclear Information System (INIS)
1990-01-01
The US Nuclear Regulatory Commission's monthly LICENSED OPERATING REACTORS Status Summary Report provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management, from the Headquarters Staff of NRC's Office of Inspection and Enforcement, from NRC's Regional Offices, and from utilities. This report is divided into three sections: the first contains monthly highlights and statistics for commercial operating units, and errata from previously reported data; the second is a compilation of detailed information on each unit, provided by NRC Regional Offices, IE Headquarters and the Utilities; and the third section is an appendix for miscellaneous information such as spent fuel storage capability, reactor years of experience and non-power reactors in the United States
International Nuclear Information System (INIS)
Hartfield, R.A.
1990-03-01
The US Nuclear Regulatory Commission's monthly Licensed Operating Reactors Status Summary Report provides data on the operation of nuclear units as timely and accurately as possible. This information is collected by the Office of Information Resources Management, from the Headquarters Staff of NRC's Office of Inspection and Enforcement, from NRC's Regional Offices, and from utilities. This report is divided into three sections: the first contains monthly highlights and statistics for commercial operating units, and errata from previously reported data; the second is a compilation of detailed information on each unit, provided by NRC Regional Offices, IE Headquarters and the Utilities; and the third section is an appendix for miscellaneous information such as spent fuel storage capability, reactor years of experience and non-power reactors in the United States
Operations management for construction
March, Chris
2009-01-01
Students studying construction management and related subjects need to have a broad understanding of the major aspects of controlling the building processes. Operations Management for Construction is one of three textbooks (Business Organisation, Operations Management and Finance Control) written to systematically cover the field. Focusing on construction sites and operations which are challenging to run, Chris March explores issues such as the setting up of the site, the deciding of the methodology of construction, and the sequence of work and resourcing. As changing and increasing regulations affect the way sites are managed, he also considers the issues and methods of successful administering, safety, quality and environment. Finally, the contractor's responsibility to the environment, including relationships with third parties, selection of materials, waste management and sustainability is discussed. Chris March has a wealth of practical experience in the construction industry, as well as considerable exp...
International Nuclear Information System (INIS)
Yuzhakov, A.Yu.
2010-01-01
The author reports on the application of full-scale simulators for training and maintaining proficiency of unit control room operators that is an essential element of Russian NPPs personnel education system. The existing simulators for the unit control room operating personnel are listed. The integrated approach to developing and maintaining the training hardware is described. The integrated approach is being implemented on the basis of observance of the existing requirements to training hardware, improvement of regulations, control from a single centre responsible for the provision of support to the activities, inclusion into the plans of simulators for development of skills for operating control over equipment and systems, as well as control from local boards [ru
The operation and maintenance manual
International Nuclear Information System (INIS)
Klein, W.; Krotil, H.; Stoll, A.
1975-01-01
The Operating Manual is one of many technical documents which the nuclear power plant operator needs for ensuring safe operation. For the operating staff, however, there is only one document, namely the Operating Manual. It contains, appropriately arranged, the necessary system and other diagrams, drawings, lists, licensing documents and similar material, which are necessary for understanding the design, for testing, for obtaining the operating licence and for the operation of individual systems and of the entire plant. (orig./RW) [de
International Nuclear Information System (INIS)
Schardt, John
2007-01-01
GNF's latest generation fuel product, GNF2, is designed to deliver improved nuclear efficiency, higher bundle and cycle energy capability, and more operational flexibility. But along with high performance, our customers face a growing need for absolute fuel reliability. This is driven by a general sense in the industry that LWR fuel reliability has plateaued. Too many plants are operating with fuel leakers, and the impact on plant operations and operator focus is unacceptable. The industry has responded by implementing an INPO-coordinated program aimed at achieving leaker-free reliability by 2010. One focus area of the program is the relationship between fuel performance (i.e., duty) and reliability. The industry recognizes that the right balance between performance and problem-free fuel reliability is critical. In the development of GNF2, GNF understood the requirement for a balanced solution and utilized a product development and introduction strategy that specifically addressed reliability: evolutionary design features supported by an extensive experience base; thoroughly tested components; and defense-in-depth mitigation of all identified failure mechanisms. The final proof test that the balance has been achieved is the application of the design, initially through lead use assemblies (LUAs), in a variety of plants that reflect the diversity of the BWR fleet. Regular detailed surveillance of these bundles provides the verification that the proper balance between performance and reliability has been achieved. GNF currently has GNF2 lead use assemblies operating in five plants. Included are plants that have implemented extended power up-rates, plants on one and two-year operating cycles, and plants with and without NobleChem TM and zinc injection. The leading plant has undergone three pool-side inspections outages to date. This paper reviews the actions taken to insure GNF2's reliability, and the lead use assembly surveillance data accumulated to date to validate
Alkaline battery operational methodology
Sholklapper, Tal; Gallaway, Joshua; Steingart, Daniel; Ingale, Nilesh; Nyce, Michael
2016-08-16
Methods of using specific operational charge and discharge parameters to extend the life of alkaline batteries are disclosed. The methods can be used with any commercial primary or secondary alkaline battery, as well as with newer alkaline battery designs, including batteries with flowing electrolyte. The methods include cycling batteries within a narrow operating voltage window, with minimum and maximum cut-off voltages that are set based on battery characteristics and environmental conditions. The narrow voltage window decreases available capacity but allows the batteries to be cycled for hundreds or thousands of times.
Waddell, Patrick G.; Davidson, Jacqueline A.
2002-02-01
The SOFIA Airborne Observatory will operate a 2.5 m aperture telescope with the goal of obtaining over 960 successful science hours per year at a nominal altitude of 12.5 km and covering a wavelength range from 0.3 mm to 1.6 mm. The observatory platform is comprised of a Boeing 747SP with numerous significant modifications. The ground and flight mission operations architectures and plans are tailored to keep the telescope emissivity low and achieve high observing efficiency.
Piping engineering and operation
International Nuclear Information System (INIS)
1993-01-01
The conference 'Piping Engineering and Operation' was organized by the Institution of Mechanical Engineers in November/December 1993 to follow on from similar successful events of 1985 and 1989, which were attended by representatives from all sectors of the piping industry. Development of engineering and operation of piping systems in all aspects, including non-metallic materials, are highlighted. The range of issues covered represents a balance between current practices and implementation of future international standards. Twenty papers are printed. Two, which are concerned with pressurized pipes or steam lines in the nuclear industry, are indexed separately. (Author)
Ball, Joseph A; Helton, JWilliam; Rodman, Leiba; Spitkovsky, Iiya
2010-01-01
This is the first volume of a collection of original and review articles on recent advances and new directions in a multifaceted and interconnected area of mathematics and its applications. It encompasses many topics in theoretical developments in operator theory and its diverse applications in applied mathematics, physics, engineering, and other disciplines. The purpose is to bring in one volume many important original results of cutting edge research as well as authoritative review of recent achievements, challenges, and future directions in the area of operator theory and its applications.
Energy Technology Data Exchange (ETDEWEB)
Smith, T.H.; Pelto, P.J.; Stevens, D.L.; Seybold, G.D.; Purcell, W.L.; Kimmel, L.V.
1976-01-01
A method is described for identification, preliminary evaluation, and screening of potential accident sequences leading to uncontrolled release of radioactive materials. Included is a procedure for estimating the risk sum of all identified sequences. In addition, portions of the procedures have been developed for detailed analysis of the dominant (highest risk) sequences so screened. This method was developed for the ERDA-sponsored risk analysis of systems for managing high-level waste, part of the Waste Fixation Program (WFP). The method begins with certain preliminary analyses. The facility and operation are described and analysis bounds are established. A type of fault tree construction, the ''to/through'' approach, was chosen for the WFP waste management system. The to/through fault tree approach offers advantages over others in several respects. The analysis is considered more complete because the system is treated as a whole. The screening process was successfully demonstrated on a conceptual waste management system for the Waste Fixation Program. Fault trees were constructed and evaluated for processing, handling, transporting, and storing high-level waste. Trees of up to 14,000,000 release sequences (BICS-Boolean-indicated cut sets) were screened and the top few hundred or thousand sequences preliminarily ranked. An estimate of the total risk represented in the fault tree was also obtained. (auth)
Seminar 1. Joint Military Operations. Application of the Operational Reserve
National Research Council Canada - National Science Library
Copp, A
1997-01-01
.... As a means of achieving decisive effect at the operational level of war, the operational reserve should be considered an operational function and should be addressed as both a planning element...
Operational Design for Peace Enforcement: Lessons for the Operational Staff
National Research Council Canada - National Science Library
Neumann, Michael
2004-01-01
U.S. involvement in Somalia serves as a useful case study of the unique challenges an operational staff may face when applying operational design to the planning and execution of a peace enforcement operation. U.S...
On commuting operator exponentials, II
Indian Academy of Sciences (India)
where N is an unbounded normal operator and M is a bounded normal operator in the. Hilbert space. Keywords. Self-adjoint and normal operator; commuting normal operator exponent- ials; Borel functional calculus. 1. Introduction. Let E be a complex Hilbert space and let B(E) be the algebra of bounded linear operators.
Scheduling in the operating theatre.
Rose, M. B.; Davies, D. C.
1984-01-01
The effect of scheduling on the use of operating theatre time has been studied. Scheduling involved determining the average length of common operations and fitting them into the calculated available operating time. The technique has been shown to reduce significantly the variation in length of operating sessions, and it ensures the best use of available operating time.
Monitoring of operating processes
International Nuclear Information System (INIS)
Barry, R.F.
1981-01-01
Apparatus is described for monitoring the processes of a nuclear reactor to detect off-normal operation of any process and for testing the monitoring apparatus. The processes are evaluated by response to their paramters, such as temperature, pressure, etc. The apparatus includes a pair of monitoring paths or signal processing units. Each unit includes facilities for receiving on a time-sharing basis, a status binary word made up of digits each indicating the status of a process, whether normal or off-normal, and test-signal binary words simulating the status binary words. The status words and test words are processed in succession during successive cycles. During each cycle, the two units receive the same status word and the same test word. The test words simulate the status words both when they indicate normal operation and when they indicate off-normal operation. Each signal-processing unit includes a pair of memories. Each memory receives a status word or a test word, as the case may be, and converts the received word into a converted status word or a converted test word. The memories of each monitoring unit operate into a non-coincidence which signals non-coincidence of the converted word out of one memory of a signal-processing unit not identical to the converted word of the other memory of the same unit
DEFF Research Database (Denmark)
Slepniov, Dmitrij; Wæhrens, Brian Vejrum; Gubi, Ebbe
2013-01-01
Companies are actively seeking competitive advantage through their choice of location and ownership of operations. The purpose of this chapter is to uncover hidden effects of this development and propose how companies can respond to them. The chapter draws on a case study of a Danish industrial e...... of analysis and involving temporal adaptations. In terms of managerial implications, the study provides managers with lessons for designing a robust system of globally dispersed operations.......Companies are actively seeking competitive advantage through their choice of location and ownership of operations. The purpose of this chapter is to uncover hidden effects of this development and propose how companies can respond to them. The chapter draws on a case study of a Danish industrial...... equipment firm and describes how its operations configuration has been changing over time. The chapter identifies the key determinants of this change and uncovers some of its hidden effects. The chapter closes with propositions for how to respond to these effects through the development of a distinct...
Rocco, David A.
1994-01-01
Redefining the approach and philosophy that operations management uses to define, develop, and implement space missions will be a central element in achieving high efficiency mission operations for the future. The goal of a cost effective space operations program cannot be realized if the attitudes and methodologies we currently employ to plan, develop, and manage space missions do not change. A management philosophy that is in synch with the environment in terms of budget, technology, and science objectives must be developed. Changing our basic perception of mission operations will require a shift in the way we view the mission. This requires a transition from current practices of viewing the mission as a unique end product, to a 'mission development concept' built on the visualization of the end-to-end mission. To achieve this change we must define realistic mission success criteria and develop pragmatic approaches to achieve our goals. Custom mission development for all but the largest and most unique programs is not practical in the current budget environment, and we simply do not have the resources to implement all of our planned science programs. We need to shift our management focus to allow us the opportunity make use of methodologies and approaches which are based on common building blocks that can be utilized in the space, ground, and mission unique segments of all missions.
Improved chain control operations.
2010-01-01
In California, field maintenance personnel use turntable signs to advise motorists of chain control conditions on rural : highways and freeways. To do this an operator has to park, exit the vehicle, turn the sign on the shoulder and then : walk acros...
Czech Academy of Sciences Publication Activity Database
Blanc, D.; Markl, Martin
2003-01-01
Roč. 245, č. 1 (2003), s. 1-29 ISSN 0025-5874 R&D Projects: GA AV ČR IAA1019203 Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905 Keywords : higher homotopy operation * W-construction * polyhedron Subject RIV: BA - General Mathematics Impact factor: 0.678, year: 2003
Simplifying Operational Design
2012-05-01
Terraine’s spider web metaphor reflects the complex, highly interactive operating environment that appropriately should be analyzed through a...describing it as, “not prescriptive or a checklist , design is based on critical thinking, conceptual planning, visualization, emergence of a hypothesis
Operator/contractor relationships
International Nuclear Information System (INIS)
Smith, J.R.; Kidwell, C.K.; Unger, V.E.; Fercho, E.; Helmer, C.M.
1992-01-01
In May 1988, Shell Western E and P Inc. (SWEPI) and partners Elf Aquitaine Petroleum and Conoco Inc. signed a letter of intent with Canadian Marine Drilling Ltd. (Canmar) for provision of exploratory drilling and marine services on leases in OCS Lease Sale 109 in the Chukchi Sea, Alaska. The 5450 blocks offered in the remote sale area west of Point Barrow ranged from 3 to 240 miles (5 to 380 km) offshore in water depths from 26 to 263 feet (8 to 80 m). The principal interest tracts were at least 75 miles (120 km) offshore and north of 70 degrees N latitude. The remoteness and total lack of any oilfield infrastructure required considerable planning and coordination between Operator and Contractor in order to carry out the three-year drilling program efficiently and safely in an environmentally harsh and, at the same time, sensitive area. SWEPI and Canmar developed a close working relationship from the start of the project through a number of participative approaches to the problems that had to be solved. This paper reports that these included strong reliance on operational planning meetings, post-season analyses, and an overall emphasis on the teamwork required of both parties to carry out the first-ever drilling program in the Chukchi Sea. This approach led to a very successful operation for both parties and emphasizes the positive benefits achievable when Operator and Contractor work as a team
Resilient Grid Operational Strategies
Energy Technology Data Exchange (ETDEWEB)
Pasqualini, Donatella [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-03-01
Extreme weather-related disturbances, such as hurricanes, are a leading cause of grid outages historically. Although physical asset hardening is perhaps the most common way to mitigate the impacts of severe weather, operational strategies may be deployed to limit the extent of societal and economic losses associated with weather-related physical damage.1 The purpose of this study is to examine bulk power-system operational strategies that can be deployed to mitigate the impact of severe weather disruptions caused by hurricanes, thereby increasing grid resilience to maintain continuity of critical infrastructure during extreme weather. To estimate the impacts of resilient grid operational strategies, Los Alamos National Laboratory (LANL) developed a framework for hurricane probabilistic risk analysis (PRA). The probabilistic nature of this framework allows us to estimate the probability distribution of likely impacts, as opposed to the worst-case impacts. The project scope does not include strategies that are not operations related, such as transmission system hardening (e.g., undergrounding, transmission tower reinforcement and substation flood protection) and solutions in the distribution network.
Electromagnetically Operated Counter
Goldberg, H D; Goldberg, M I
1951-12-18
An electromagnetically operated counter wherein signals to be counted are applied to cause stepwise rotation of a rotatable element which is connected to a suitable register. The mechanism involved consists of a rotatable armature having three spaced cores of magnetic material and a pair of diametrically opposed electromagnets with a suitable pulsing circuit to actuate the magnets.
Operation for gigantincisionalhernie
DEFF Research Database (Denmark)
Eriksson, Axelina; Krag, Christen; Jørgensen, Lars Nannestad
2014-01-01
level evidence. Mesh placement is possible onlay, inlay, sublay or intraperitoneal. These operations are most often performed as open procedures, or in combination with endoscopic techniques. These procedures should be centralized to few centers to improve quality and allow robust research....
McKim, Vicky L
2017-06-01
In the world of risk management, which encompasses the business continuity disciplines, many types of risk require evaluation. Financial risk is most often the primary focus, followed by product and market risks. Another critical area, which typically lacks a thorough review or may be overlooked, is operational risk. This category encompasses many risk exposure types including those around building structures and systems, environmental issues, nature, neighbours, clients, regulatory compliance, network, data security and so on. At times, insurance carriers will assess internal hazards, but seldom do these assessments include more than a cursory look at other types of operational risk. In heavily regulated environments, risk assessments are required but may not always include thorough assessments of operational exposures. Vulnerabilities may linger or go unnoticed, only to become the catalyst for a business disruption at a later time, some of which are so severe that business recovery becomes nearly impossible. Businesses may suffer loss of clients as the result of a prolonged disruption of services. Comprehensive operational risk assessments can assist in identifying such vulnerabilities, exposures and threats so that the risk can be minimised or removed. This paper lays out how an assessment of this type can be successfully conducted.
Energy Technology Data Exchange (ETDEWEB)
Jan Berkow; Larry Banta
2003-07-29
The Intelligent Potroom Operation project focuses on maximizing the performance of an aluminum smelter by innovating components for an intelligent manufacturing system. The Intelligent Potroom Advisor (IPA) monitors process data to identify reduction cells exhibiting behaviors that require immediate attention. It then advises operational personnel on those heuristic-based actions to bring the cell back to an optimal operating state in order to reduce the duration and frequency of substandard reduction cell performance referred to as ''Off-Peak Modes'' (OPMs). Techniques developed to identify cells exhibiting OPMs include the use of a finite element model-based cell state estimator for defining the cell's current operating state via advanced cell noise analyses. In addition, rule induction was also employed to identify statistically significant complex behaviors that occur prior to OPMs. The intelligent manufacturing system design, concepts and formalisms developed in this project w ere used as a basis for an intelligent manufacturing system design. Future research will incorporate an adaptive component to automate continuous process improvement, a technology platform with the potential to improve process performance in many of the other Industries of the Future applications as well.
Mullender, Sape J.
1987-01-01
In the past five years, distributed operating systems research has gone through a consolidation phase. On a large number of design issues there is now considerable consensus between different research groups. In this paper, an overview of recent research in distributed systems is given. In turn, the
2015-03-01
wine warfare NCC naval component commander NFC numbered fleet commander NM nautical mile NMP Navy mission planner NOP Navy...Planner (RASP) is another example of an operational planning tool. RASP focuses on fuel conservation as it optimizes schedules for CLF 5 ships. Brown
Operations and Modeling Analysis
Ebeling, Charles
2005-01-01
The Reliability and Maintainability Analysis Tool (RMAT) provides NASA the capability to estimate reliability and maintainability (R&M) parameters and operational support requirements for proposed space vehicles based upon relationships established from both aircraft and Shuttle R&M data. RMAT has matured both in its underlying database and in its level of sophistication in extrapolating this historical data to satisfy proposed mission requirements, maintenance concepts and policies, and type of vehicle (i.e. ranging from aircraft like to shuttle like). However, a companion analyses tool, the Logistics Cost Model (LCM) has not reached the same level of maturity as RMAT due, in large part, to nonexistent or outdated cost estimating relationships and underlying cost databases, and it's almost exclusive dependence on Shuttle operations and logistics cost input parameters. As a result, the full capability of the RMAT/LCM suite of analysis tools to take a conceptual vehicle and derive its operations and support requirements along with the resulting operating and support costs has not been realized.
Dam safety operating guidelines
International Nuclear Information System (INIS)
Elsayed, E.; Leung, T.; Kirkham, A.; Lum, D.
1990-01-01
As part of Ontario Hydro's dam structure assessment program, the hydraulic design review of several river systems has revealed that many existing dam sites, under current operating procedures, would not have sufficient discharge capacity to pass the Inflow Design Flood (IDF) without compromising the integrity of the associated structures. Typical mitigative measures usually considered in dealing with these dam sites include structural alterations, emergency action plans and/or special operating procedures designed for extreme floods. A pilot study was carried out for the Madawaska River system in eastern Ontario, which has seven Ontario Hydro dam sites in series, to develop and evaluate the effectiveness of the Dam Safety Operating Guidelines (DSOG). The DSOG consist of two components: the flood routing schedules and the minimum discharge schedules, the former of which would apply in the case of severe spring flood conditions when the maximum observed snowpack water content and the forecast rainfall depth exceed threshold values. The flood routing schedules would identify to the operator the optimal timing and/or extent of utilizing the discharge facilities at each dam site to minimize the potential for dam failures cased by overtopping anywhere in the system. It was found that the DSOG reduced the number of structures overtopped during probable maximum flood from thirteen to four, while the number of structures that could fail would be reduced from seven to two. 8 refs., 4 figs., 3 tabs
African Journals Online (AJOL)
Administrator
OPERATION ZITADELLE (KURSK),. 5-14 JULY 1943, A CASE STUDY. Col (Dr) James Jacobs. Resident Historian. South African War College. Introduction. In wartime military organisations function in a dangerous and complex environment. Doctrines are designed to ensure standardisation of thinking about military conflict ...
Invariant differential operators
Dobrev, Vladimir K
2016-01-01
With applications in quantum field theory, elementary particle physics and general relativity, this two-volume work studies invariance of differential operators under Lie algebras, quantum groups, superalgebras including infinite-dimensional cases, Schrödinger algebras, applications to holography. This first volume covers the general aspects of Lie algebras and group theory.
Space Operations Learning Center
Lui, Ben; Milner, Barbara; Binebrink, Dan; Kuok, Heng
2012-01-01
The Space Operations Learning Center (SOLC) is a tool that provides an online learning environment where students can learn science, technology, engineering, and mathematics (STEM) through a series of training modules. SOLC is also an effective media for NASA to showcase its contributions to the general public. SOLC is a Web-based environment with a learning platform for students to understand STEM through interactive modules in various engineering topics. SOLC is unique in its approach to develop learning materials to teach schoolaged students the basic concepts of space operations. SOLC utilizes the latest Web and software technologies to present this educational content in a fun and engaging way for all grade levels. SOLC uses animations, streaming video, cartoon characters, audio narration, interactive games and more to deliver educational concepts. The Web portal organizes all of these training modules in an easily accessible way for visitors worldwide. SOLC provides multiple training modules on various topics. At the time of this reporting, seven modules have been developed: Space Communication, Flight Dynamics, Information Processing, Mission Operations, Kids Zone 1, Kids Zone 2, and Save The Forest. For the first four modules, each contains three components: Flight Training, Flight License, and Fly It! Kids Zone 1 and 2 include a number of educational videos and games designed specifically for grades K-6. Save The Forest is a space operations mission with four simulations and activities to complete, optimized for new touch screen technology. The Kids Zone 1 module has recently been ported to Facebook to attract wider audience.
Operant Conditioning - Token Economy.
Montgomery, Jacqueline; McBurney, Raymond D.
Described is an Operant Conditioning-Token Economy Program, teaching patients to be responsible for their own behavior, to make choices, and to be motivated to change. The program was instigated with mentally ill patients in a state hospital and was later used with institutionalized mentally handicapped groups. After two years, only four of the…
Teachers and Operant Conditioning.
Frey, Sherman
A survey was conducted of 406 elementary, middle, and secondary school teachers to determine their understanding, acceptance, and use of the principle of operant conditioning. The treatment of data was by percent and chi square analysis primarily according to sex, experience, degree, and position. Subjects reported that a) they believed that the…
Unit 34, CCTP; Pitts, Teresa A.
1998-01-01
This unit describes types, example uses and implementation of different overlay operations. Using commands in ESRI’s Arc/Info, it summarizes necessary pre-overlay and overlay tasks in an example application in which locations for Gypsy Moth traps must be determined.
DSMS science operations concept
Connally, M. J.; Kuiper, T. B.
2001-01-01
The Deep Space Mission System (DSMS) Science Operations Concept describes the vision for enabling the use of the DSMS, particularly the Deep Space Network (DSN) for direct science observations in the areas of radio astronomy, planetary radar, radio science and VLBI.
Splunk operational intelligence cookbook
Diakun, Josh; Mock, Derek
2014-01-01
This book is intended for users of all levels who are looking to leverage the Splunk Enterprise platform as a valuable operational intelligence tool. The recipes provided in this book will appeal to individuals from all facets of a business - IT, Security, Product, Marketing, and many more!
Indian Academy of Sciences (India)
Linux Distributions. Linux per se refers only to the kernel of the operating system. A full fledged Unix system however requires a set of applications and support software that make the system user friendly. Hundreds of programmers around the world ,have contributed to bring the Linux system to its current state of robustness.
ATC operational error analysis.
1972-01-01
The primary causes of operational errors are discussed and the effects of these errors on an ATC system's performance are described. No attempt is made to specify possible error models for the spectrum of blunders that can occur although previous res...
Concept of Operations: Essence
Energy Technology Data Exchange (ETDEWEB)
Hutton, William J.
2014-04-01
This concept of operations is designed to give the reader a brief overview of the National Rural Electric Cooperative Association’s Essence project and a description of the Essence device design. The data collected by the device, how the data are used, and how the data are protected are also discussed in this document.
Basic Water Treatment Operation.
Ontario Ministry of the Environment, Toronto.
This manual was developed for use at workshops designed to introduce the fundamentals of water treatment plant operations. The course consists of lecture-discussions and hands-on activities. Each of the fourteen lessons in this document has clearly stated behavioral objectives to tell the trainee what he should know or do after completing that…
Operational Amplifer Integrator
van Tuijl, Adrianus Johannes Maria
2003-01-01
An integrator circuit comprises an operational amplifier which has a transistor stage (1) with an input terminal (4) and an output terminal (3), a feedback capacitor (2) connected between the input terminal (4) and the output terminal (3), and a resistor (5) connected to the input terminal (4), and
Underground mining operation supports
Energy Technology Data Exchange (ETDEWEB)
Khusid, M.B.; Kozel, A.M.
1980-12-10
Underground mining operation supports include the supporting layer surrounded by a cylindrical jacket of cemented rock. To decrease the loss of support material due to the decreasing rock pressure on the supporting layer, the cylindrical jacket of cemented rock has an uncemented layer inside, dividing it into 2 concentric cylindrical parts.
Almost periodic Schroedinger operators
International Nuclear Information System (INIS)
Bellissard, J.; Lima, R.
1984-01-01
These lectures are devoted to recent developments in the theory of almost-periodic Schroedinger Operators. We specially describe the algebraic point of view, with applications to gap-labelling theorems. Particular models are also presented which exhibit various spectral properties. (orig.)
Operational Area Environmental Evaluations
Energy Technology Data Exchange (ETDEWEB)
Bailey-White, Brenda Eileen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Nagy, Michael David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Wagner, Katrina Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Goodman, Thomas Richard [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Herring, Allen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Catechis, Christopher S. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Kinghorn, Aubrianna Nicole [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Johnson, Ellie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Barthel, Michael David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Casaus, Benito [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2017-08-01
The Operational Area Environmental Evaluation update provides a description of activities that have the potential to adversely affect natural and cultural resources, including soil, air, water, biological, ecological, and historical resources. The environmental sensitivity of an area is evaluated and summarized, which may facilitate informed management decisions as to where development may be prohibited, restricted, or subject to additional requirements.
Effectiveness of operation tools developed by KEKB operators
International Nuclear Information System (INIS)
Sugino, K.; Satoh, Y.; Kitabayashi, T.
2004-01-01
The main tasks of KEKB (High Energy Accelerator Research Organization B-physics) operators are beam tuning and injection, operation logging, monitoring of accelerator conditions and safety management. New beam tuning methods are frequently applied to KEKB in order to accomplish high luminosity. In such a situation, various operation tools have been developed by the operators to realize efficient operation. In this paper, we describe effectiveness of tools developed by the operators. (author)
International Nuclear Information System (INIS)
Nos, V.; Faig, J.; Plesa, P.; Delgado, J. L.
2000-01-01
The systematic approach to training is internationally accepted as the best method to achieve and maintain the qualification and competence of power plant personnel and to guarantee the quality of their training. Following the recommendations and guidelines of international organisations competent in the field, TECNATOM SA has developed projects based on the systematic approach to training for all Spanish nuclear power plants. One of the latest projects was the systematic approach to training developed for the operation personnel of ASCO Nuclear Power Plant. In this case, certain results of the Probabilistic Safety Analysis (PSA) which complement the systematic safety and reliability criteria of the systematic approach to training process have been incorporated in the traditional processes of work and task analysis and training plan design. This incorporation provides the training manager with additional criteria based not only on safety aspects obtained through the statistical treatment of considerations of skilled technical personnel (operators, operation chief supervisors, etc), but also on the independent criterion of the PSA. The inclusion of this approach basically affects all systematics in two of its stages: During the selection process of operating practices in SMR or SGI, the possible scenarios have been associated with all those situations where human actions which lead to an initiating event or human actions to mitigate an initiating event, may take place, as defined in the PSA. During the scenario development process, the instruments involved in the performance of human actions which originate or mitigate an event taking place have been identified. This pakes it possible to reconcile the scenario event sequence with the sequence considered in the PSA study, as the most likely to provoke a more serious accident. The incorporation of these PSA results contributes to the strengthening of safety aspects in training in an objective way, and confirms that
Cohering power of quantum operations
Energy Technology Data Exchange (ETDEWEB)
Bu, Kaifeng, E-mail: bkf@zju.edu.cn [School of Mathematical Sciences, Zhejiang University, Hangzhou 310027 (China); Kumar, Asutosh, E-mail: asukumar@hri.res.in [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India); Zhang, Lin, E-mail: linyz@zju.edu.cn [Institute of Mathematics, Hangzhou Dianzi University, Hangzhou 310018 (China); Wu, Junde, E-mail: wjd@zju.edu.cn [School of Mathematical Sciences, Zhejiang University, Hangzhou 310027 (China)
2017-05-18
Highlights: • Quantum coherence. • Cohering power: production of quantum coherence by quantum operations. • Study of cohering power and generalized cohering power, and their comparison for differentmeasures of quantum coherence. • Operational interpretation of cohering power. • Bound on cohering power of a generic quantum operation. - Abstract: Quantum coherence and entanglement, which play a crucial role in quantum information processing tasks, are usually fragile under decoherence. Therefore, the production of quantum coherence by quantum operations is important to preserve quantum correlations including entanglement. In this paper, we study cohering power–the ability of quantum operations to produce coherence. First, we provide an operational interpretation of cohering power. Then, we decompose a generic quantum operation into three basic operations, namely, unitary, appending and dismissal operations, and show that the cohering power of any quantum operation is upper bounded by the corresponding unitary operation. Furthermore, we compare cohering power and generalized cohering power of quantum operations for different measures of coherence.
Regulations for RA reactor operation
International Nuclear Information System (INIS)
1980-09-01
Regulations for RA reactor operation are written in accordance with the legal regulations defined by the Law about radiation protection and related legal acts, as well as technical standards according to the IAEA recommendations. The contents of this book include: fundamental data about the reactor; legal regulations for reactor operation; organizational scheme for reactor operation; general and detailed instructions for operation, behaviour in the reactor building, performing experiments; operating rules for operation under steady state and accidental conditions [sr
Density operators in quantum mechanics
International Nuclear Information System (INIS)
Burzynski, A.
1979-01-01
A brief discussion and resume of density operator formalism in the way it occurs in modern physics (in quantum optics, quantum statistical physics, quantum theory of radiation) is presented. Particularly we emphasize the projection operator method, application of spectral theorems and superoperators formalism in operator Hilbert spaces (Hilbert-Schmidt type). The paper includes an appendix on direct sums and direct products of spaces and operators, and problems of reducibility for operator class by using the projection operators. (author)
Weakly compact operators and interpolation
Maligranda, Lech
1992-01-01
The class of weakly compact operators is, as well as the class of compact operators, a fundamental operator ideal. They were investigated strongly in the last twenty years. In this survey, we have collected and ordered some of this (partly very new) knowledge. We have also included some comments, remarks and examples. The class of weakly compact operators is, as well as the class of compact operators, a fundamental operator ideal. They were investigated strongly in the last twenty years. I...
Multinational Operations: A Selected Bibliography
National Research Council Canada - National Science Library
2001-01-01
.... Compiled to support the curriculum's Multinational Operations AYO2 special theme, the main part of the bibliography focuses on the special challenges of multinational operations such as command...
International Nuclear Information System (INIS)
1973-01-01
The NOAA Fleet Operations Report 1973 was developed to provide a summary of project accomplishments during calendar year 1973. The report was prepared from season, cruise and special reports submitted by ships of the fleet. Centralized management of the NOAA Fleet was finalized by changing the operational control of the National Marine Fisheries Service (NMFS) Ships DAVID STARR JORDAN (FRS 44), TOWNSEND CROMWELL (FRS 43) and MURRE II (FRV 63) from NMFS to the National Ocean Survey on July 1, 1973. Throughout the year, ships routinely collected and transmitted weather data. Similarly, as NOAA participants in the Integrated Global Ocean Station System (IGOSS) service program, XBT observations were taken and either radioed or submitted in log form via mail. In addition, particulate and radionuclide samples were taken in cooperation with the Atomic Energy Commission, sediment samples were obtained for the Smithsonian Institution and observations were made of marine mammals