WorldWideScience

Sample records for boolean operators

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

  2. Boolean Operations with Prism Algebraic Patches

    Science.gov (United States)

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

    2009-01-01

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

  3. 3D Boolean operations in virtual surgical planning.

    Science.gov (United States)

    Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

    2017-10-01

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

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

    International Nuclear Information System (INIS)

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

    2015-01-01

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

  5. Boolean Operations, Joins, and the Extended Low Hierarchy

    OpenAIRE

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

    1999-01-01

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

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

    Science.gov (United States)

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

    2018-04-01

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

  7. Boolean integral calculus

    Science.gov (United States)

    Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne

    1988-01-01

    The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.

  8. Boolean algebra

    CERN Document Server

    Goodstein, R L

    2007-01-01

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

  9. Computational complexity of Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

    Korshunov, Aleksei D [Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)

    2012-02-28

    Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.

  10. Boolean reasoning the logic of boolean equations

    CERN Document Server

    Brown, Frank Markham

    2012-01-01

    A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.

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

  12. Boolean algebra essentials

    CERN Document Server

    Solomon, Alan D

    2012-01-01

    REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean

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

    Science.gov (United States)

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

    2018-05-01

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

  14. Monotone Boolean functions

    International Nuclear Information System (INIS)

    Korshunov, A D

    2003-01-01

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

  15. Interpolative Boolean Networks

    Directory of Open Access Journals (Sweden)

    Vladimir Dobrić

    2017-01-01

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

  16. Properties of Boolean orthoposets

    Science.gov (United States)

    Tkadlec, Josef

    1993-10-01

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

  17. Optical programmable Boolean logic unit.

    Science.gov (United States)

    Chattopadhyay, Tanay

    2011-11-10

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

  18. To Boolean or Not To Boolean.

    Science.gov (United States)

    Hildreth, Charles R.

    1983-01-01

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

  19. Algebraic partial Boolean algebras

    International Nuclear Information System (INIS)

    Smith, Derek

    2003-01-01

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

  20. Information encryption systems based on Boolean functions

    Directory of Open Access Journals (Sweden)

    Aureliu Zgureanu

    2011-02-01

    Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.

  1. Boolean Queries Optimization by Genetic Algorithms

    Czech Academy of Sciences Publication Activity Database

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

    2005-01-01

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

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

  3. Summing Boolean Algebras

    Institute of Scientific and Technical Information of China (English)

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

    2004-01-01

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

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

    Science.gov (United States)

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

    2017-09-19

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

  5. Cryptographic Boolean functions and applications

    CERN Document Server

    Cusick, Thomas W

    2009-01-01

    Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...

  6. Computing preimages of Boolean networks.

    Science.gov (United States)

    Klotz, Johannes; Bossert, Martin; Schober, Steffen

    2013-01-01

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

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

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

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

  10. Boolean gates on actin filaments

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

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

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

  14. Optical reversible programmable Boolean logic unit.

    Science.gov (United States)

    Chattopadhyay, Tanay

    2012-07-20

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

  15. GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS

    OpenAIRE

    Ho, Juei-Ling

    2009-01-01

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

  16. Rational Verification in Iterated Electric Boolean Games

    Directory of Open Access Journals (Sweden)

    Youssouf Oualhadj

    2016-07-01

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

  17. Synthesizing biomolecule-based Boolean logic gates.

    Science.gov (United States)

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

    2013-02-15

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

  18. Synthesizing Biomolecule-based Boolean Logic Gates

    Science.gov (United States)

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

    2012-01-01

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

  19. Boolean integral calculus for digital systems

    Science.gov (United States)

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

    1985-01-01

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

  20. On Boolean functions with generalized cryptographic properties

    NARCIS (Netherlands)

    Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.

    2004-01-01

    By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.

  1. Mining TCGA data using Boolean implications.

    Directory of Open Access Journals (Sweden)

    Subarna Sinha

    Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.

  2. Stability of Boolean multilevel networks.

    Science.gov (United States)

    Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

    2012-09-01

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

  3. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2016-01-01

    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

  4. Random networks of Boolean cellular automata

    Energy Technology Data Exchange (ETDEWEB)

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

    1990-01-01

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

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

  6. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms

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

  8. Image Filtering with Boolean and Statistical Operators.

    Science.gov (United States)

    1983-12-01

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

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

    OpenAIRE

    Pan, Chenyun; Naeemi, Azad

    2017-01-01

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

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

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

  12. Practical algorithms for linear boolean-width

    NARCIS (Netherlands)

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

    2015-01-01

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

  13. Practical algorithms for linear Boolean-width

    NARCIS (Netherlands)

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

    2015-01-01

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

  14. Classical Boolean logic gates with quantum systems

    International Nuclear Information System (INIS)

    Renaud, N; Joachim, C

    2011-01-01

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

  15. Totally optimal decision trees for Boolean functions

    KAUST Repository

    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.

  16. Boolean representations of simplicial complexes and matroids

    CERN Document Server

    Rhodes, John

    2015-01-01

    This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context.   Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...

  17. Optimal stabilization of Boolean networks through collective influence

    Science.gov (United States)

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

    2018-03-01

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

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

  19. Vector Boolean Functions: applications in symmetric cryptography

    OpenAIRE

    Álvarez Cubero, José Antonio

    2015-01-01

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

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

  1. Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

    NARCIS (Netherlands)

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

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

  2. Boolean orthoposets and two-valued states on them

    Science.gov (United States)

    Tkadlec, Josef

    1992-06-01

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

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

  4. Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

    Science.gov (United States)

    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.

  5. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.

  6. Message passing for quantified Boolean formulas

    International Nuclear Information System (INIS)

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

    2012-01-01

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

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

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

  9. A transition calculus for Boolean functions. [logic circuit analysis

    Science.gov (United States)

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

    1974-01-01

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

  10. Algebraic model checking for Boolean gene regulatory networks.

    Science.gov (United States)

    Tran, Quoc-Nam

    2011-01-01

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

  11. Nonlinear threshold Boolean automata networks and phase transitions

    OpenAIRE

    Demongeot, Jacques; Sené, Sylvain

    2010-01-01

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

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

  13. Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.

    Science.gov (United States)

    Dallidis, Stylianos E; Karafyllidis, Ioannis G

    2014-09-01

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

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

    Directory of Open Access Journals (Sweden)

    Jens Christian Claussen

    2017-06-01

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

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

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

  17. Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams

    DEFF Research Database (Denmark)

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

    1999-01-01

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

  18. Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

    Science.gov (United States)

    Zhang, Jianming; Sclaroff, Stan

    2016-05-01

    We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.

  19. Refinement monoids, equidecomposability types, and boolean inverse semigroups

    CERN Document Server

    Wehrung, Friedrich

    2017-01-01

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

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

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

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

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

  4. Confluence of an extension of combinatory logic by Boolean constants

    DEFF Research Database (Denmark)

    Czajka, Łukasz

    2017-01-01

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

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

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

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

  8. Boolean comparative analysis of qualitative data : a methodological note

    NARCIS (Netherlands)

    Romme, A.G.L.

    1995-01-01

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

  9. Parallel object-oriented term rewriting : the booleans

    NARCIS (Netherlands)

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

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

  10. A Construction of Boolean Functions with Good Cryptographic Properties

    Science.gov (United States)

    2014-01-01

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

  11. Boolean network representation of contagion dynamics during a financial crisis

    Science.gov (United States)

    Caetano, Marco Antonio Leonel; Yoneyama, Takashi

    2015-01-01

    This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.

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

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

  14. Boolean Models of Biological Processes Explain Cascade-Like Behavior.

    Science.gov (United States)

    Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen

    2016-01-29

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

  15. Controllability and observability of Boolean networks arising from biology

    Science.gov (United States)

    Li, Rui; Yang, Meng; Chu, Tianguang

    2015-02-01

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

  16. On the Computation of Comprehensive Boolean Gröbner Bases

    Science.gov (United States)

    Inoue, Shutaro

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

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

    International Nuclear Information System (INIS)

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

    2015-01-01

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

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

    Science.gov (United States)

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

    2015-08-28

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

  19. The value of less connected agents in Boolean networks

    Science.gov (United States)

    Epstein, Daniel; Bazzan, Ana L. C.

    2013-11-01

    In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality

  20. Bebop to the Boolean boogie an unconventional guide to electronics

    CERN Document Server

    Maxfield, Clive

    2003-01-01

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

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

  2. A boolean optimization method for reloading a nuclear reactor

    International Nuclear Information System (INIS)

    Misse Nseke, Theophile.

    1982-04-01

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

  3. Complexity classifications for different equivalence and audit problems for Boolean circuits

    OpenAIRE

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

    2010-01-01

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

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

    Science.gov (United States)

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

    2006-01-01

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

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

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

  7. Complex network analysis of state spaces for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

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

    2008-01-15

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

  8. Complex network analysis of state spaces for random Boolean networks

    International Nuclear Information System (INIS)

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

    2008-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Shah Imran

    2011-07-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Stalin Muñoz

    2018-03-01

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

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

  14. Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

    Science.gov (United States)

    Kupper, Z.; Hoffmann, H.

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

  15. Unlimited multistability and Boolean logic in microbial signalling

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

    International Nuclear Information System (INIS)

    Li, Fangfei; Lu, Xiwen

    2013-01-01

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

  17. Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes

    Institute of Scientific and Technical Information of China (English)

    Hao CHEN; Liang MA; Jianhua LI

    2011-01-01

    Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

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

    Science.gov (United States)

    Mori, Fumito; Mochizuki, Atsushi

    2017-07-14

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

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

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

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

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2013-01-01

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

  2. Boolean and advanced searching for EDGAR data on www.sec.gov

    Data.gov (United States)

    Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.

  3. Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

    Science.gov (United States)

    2015-01-01

    degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis

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

    KAUST Repository

    Chikalov, Igor

    2013-01-01

    In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.

  5. An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

    Science.gov (United States)

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

    2014-01-01

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

  6. Graphene-based non-Boolean logic circuits

    Science.gov (United States)

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

    2013-10-01

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

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

    Science.gov (United States)

    Jiang, Han; Li, Xue; Xu, Qiuliang

    2016-12-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-12-21

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

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

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

    Science.gov (United States)

    Gong, Xinwei

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

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

    Directory of Open Access Journals (Sweden)

    Wensheng Guo

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

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

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

    Science.gov (United States)

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

    2016-12-21

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

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

    Science.gov (United States)

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

    2013-06-01

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

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

    International Nuclear Information System (INIS)

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

    2017-01-01

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

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

  17. Improving the quantum cost of reversible Boolean functions using reorder algorithm

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

    2017-04-01

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Science.gov (United States)

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

    2017-11-25

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

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

    Science.gov (United States)

    Pinilla, Samuel; Poveda, Juan; Arguello, Henry

    2018-03-01

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

  2. The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students

    Science.gov (United States)

    Tomaszewski, Robert

    2016-01-01

    Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…

  3. Application of fuzzy logic to Boolean models for digital soil assessment

    NARCIS (Netherlands)

    Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.

    2011-01-01

    Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between

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

    NARCIS (Netherlands)

    Jenner, Ronald A.

    2002-01-01

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

  5. A new separation algorithm for the Boolean quadric and cut polytopes

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  6. Analysis and control of Boolean networks a semi-tensor product approach

    CERN Document Server

    Cheng, Daizhan; Li, Zhiqiang

    2010-01-01

    This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.

  7. Describing the What and Why of Students' Difficulties in Boolean Logic

    Science.gov (United States)

    Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig

    2012-01-01

    The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…

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

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

    Science.gov (United States)

    Fox, Edward A.; Winett, Sheila G.

    1990-01-01

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

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

    Science.gov (United States)

    Matoušek, Milan; Pták, Pavel

    2015-12-01

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

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

    International Nuclear Information System (INIS)

    Liu, M; Bassler, K E

    2011-01-01

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

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

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2001-01-01

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

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

    Science.gov (United States)

    Ensor, Pat

    1992-01-01

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

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

    Science.gov (United States)

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

    2013-01-01

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

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

    Science.gov (United States)

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

    2016-11-01

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

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

    NARCIS (Netherlands)

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

    2001-01-01

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

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

    Science.gov (United States)

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

    2014-06-26

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

  18. Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

    Science.gov (United States)

    Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

    2018-06-01

    Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.

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

    Directory of Open Access Journals (Sweden)

    Mahdieh Saadat Foomani

    2017-01-01

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

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

    OpenAIRE

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

    2000-01-01

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

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

    International Nuclear Information System (INIS)

    Schneeweiss, Winfrid G.

    2009-01-01

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

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

    Science.gov (United States)

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

    2017-01-01

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

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

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

    Science.gov (United States)

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

    2015-08-07

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

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

    OpenAIRE

    Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti

    2012-01-01

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

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

    Science.gov (United States)

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

    2016-09-23

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

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

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

    Directory of Open Access Journals (Sweden)

    A. A. Butov

    2014-01-01

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

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

  10. Detecting small attractors of large Boolean networks by function-reduction-based strategy.

    Science.gov (United States)

    Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin

    2016-04-01

    Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.

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

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

  13. PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE

    Directory of Open Access Journals (Sweden)

    Maria Angeles Gallego

    2014-11-01

    Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.

  14. Floating point only SIMD instruction set architecture including compare, select, Boolean, and alignment operations

    Science.gov (United States)

    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.

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

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

    Science.gov (United States)

    2017-09-01

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

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

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

    International Nuclear Information System (INIS)

    Zheng, Jinbin

    2014-01-01

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

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

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

    OpenAIRE

    Andrade, Jefferson O.; Kameyama, Yukiyoshi

    2012-01-01

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

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

    Science.gov (United States)

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

    2012-08-29

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

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

    Science.gov (United States)

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

    1990-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-10-06

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

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

    Science.gov (United States)

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

    2015-04-28

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

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

    International Nuclear Information System (INIS)

    Ramskill, Nicholas P; Wang, Mi

    2011-01-01

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

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

    Science.gov (United States)

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

    2009-08-01

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

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

    Science.gov (United States)

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

    2013-04-01

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

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

    Science.gov (United States)

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

    2009-08-01

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

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

    Science.gov (United States)

    Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

    2015-11-01

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

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

  11. Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

    Directory of Open Access Journals (Sweden)

    Yih-Lon Lin

    2013-01-01

    Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

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

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

    Science.gov (United States)

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

    2011-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-12-15

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

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

    Science.gov (United States)

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

    2015-10-01

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

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

    KAUST Repository

    Lima, Ricardo

    2016-06-16

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

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

    KAUST Repository

    Lima, Ricardo; Grossmann, Ignacio E.

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Chao Luo

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

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

    Science.gov (United States)

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

    1991-01-01

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

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

    Science.gov (United States)

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

    2017-08-02

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

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

    Science.gov (United States)

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

    2009-07-01

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

  2. 3D GIS spatial operation based on extended Euler operators

    Science.gov (United States)

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

    2008-10-01

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

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

    Czech Academy of Sciences Publication Activity Database

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

    2010-01-01

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

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

    Science.gov (United States)

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

    2013-03-01

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

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

    Science.gov (United States)

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

    2014-02-01

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

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

    Science.gov (United States)

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

    2017-12-19

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

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

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

    Science.gov (United States)

    Andrade, Jefferson O.; Kameyama, Yukiyoshi

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

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

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

    Science.gov (United States)

    Rafimanzelat, Mohammad Reza; Bahrami, Fariba

    2018-04-01

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

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

    Science.gov (United States)

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

    2011-02-01

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

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

    Directory of Open Access Journals (Sweden)

    Gonzalo A Ruz

    2014-01-01

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

  13. Boolean modelling reveals new regulatory connections between transcription factors orchestrating the development of the ventral spinal cord.

    KAUST Repository

    Lovrics, Anna

    2014-11-14

    We have assembled a network of cell-fate determining transcription factors that play a key role in the specification of the ventral neuronal subtypes of the spinal cord on the basis of published transcriptional interactions. Asynchronous Boolean modelling of the network was used to compare simulation results with reported experimental observations. Such comparison highlighted the need to include additional regulatory connections in order to obtain the fixed point attractors of the model associated with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where the transcription factors were overexpressed. Furthermore the network predicted the inhibition of Irx3 by Nkx2.2 and this prediction was tested experimentally. Our results provide evidence for the existence of an as yet undescribed inhibitory connection which could potentially have significance beyond the ventral spinal cord. The work presented in this paper demonstrates the strength of Boolean modelling for identifying gene regulatory networks.

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

    Science.gov (United States)

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

    2012-04-01

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

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

    Science.gov (United States)

    Szejka, Agnes; Drossel, Barbara

    2010-02-01

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

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

    Directory of Open Access Journals (Sweden)

    Mikko Niilo-Rämä

    2014-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Shohag Barman

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

  18. Asynchronous Operators of Sequential Logic Venjunction & Sequention

    CERN Document Server

    Vasyukevich, Vadim

    2011-01-01

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

  19. An operator calculus for surface and volume modeling

    Science.gov (United States)

    Gordon, W. J.

    1984-01-01

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

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

    International Nuclear Information System (INIS)

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

    2017-01-01

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

  1. Evaluating the Performance of Multiple Classifier Systems: A Matrix Algebra Representation of Boolean Fusion Rules

    National Research Council Canada - National Science Library

    Hill, Justin

    2003-01-01

    ...., a logical OR, AND, or a majority vote of the classifiers in the system). An established method for evaluating a classifier is measuring some aspect of its Receiver Operating Characteristic (ROC...

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

    Science.gov (United States)

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

    2010-10-01

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

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

    Institute of Scientific and Technical Information of China (English)

    祝峰; 何华灿

    2000-01-01

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

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

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

    Science.gov (United States)

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

    2015-09-01

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

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

    Science.gov (United States)

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

    2016-04-01

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

  7. "Chemical transformers" from nanoparticle ensembles operated with logic.

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    Caglar, Mehmet Umut; Pal, Ranadip

    2011-03-01

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

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

    Science.gov (United States)

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

    2011-12-22

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

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

    Science.gov (United States)

    Uezu, Tatsuya; Kiyokawa, Shuji

    2016-06-01

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

  11. Towards a model of surgeons' leadership in the operating room.

    Science.gov (United States)

    Henrickson Parker, Sarah; Yule, Steven; Flin, Rhona; McKinley, Aileen

    2011-07-01

    There is widespread recognition that leadership skills are essential for effective performance in the workplace, but the evidence detailing effective leadership behaviours for surgeons during operations is unclear. Boolean searches of four on-line databases and detailed hand search of relevant references were conducted. A four stage screening process was adopted stipulating that articles presented empirical data on surgeons' intraoperative leadership behaviours. Ten relevant articles were identified and organised by method of investigation into (i) observation, (ii) questionnaire and (iii) interview studies. This review summarises the limited literature on surgeons' intraoperative leadership, and proposes a preliminary theoretically based structure for intraoperative leadership behaviours. This structure comprises seven categories with corresponding leadership components and covers two overarching themes related to task- and team-focus. Selected leadership theories which may be applicable to the operating room environment are also discussed. Further research is required to determine effective intraoperative leadership behaviours for safe surgical practice.

  12. Nuclear spin states and quantum logical operations

    International Nuclear Information System (INIS)

    Orlova, T.A.; Rasulov, E.N.

    2006-01-01

    Full text: To build a really functional quantum computer, researchers need to develop logical controllers known as 'gates' to control the state of q-bits. In this work , equal quantum logical operations are examined with the emphasis on 1-, 2-, and 3-q-bit gates.1-q-bit quantum logical operations result in Boolean 'NOT'; the 'NOT' and '√NOT' operations are described from the classical and quantum perspective. For the 'NOT' operation to be performed, there must be a means to switch the state of q-bits from to and vice versa. For this purpose either a light or radio pulse of a certain frequency can be used. If the nucleus has the spin-down state, the spin will absorb a portion of energy from electromagnetic current and switch into the spin-up state, and the radio pulse will force it to switch into state. An operation thus described from purely classical perspective is clearly understood. However, operations not analogous to the classical type may also be performed. If the above mentioned radio pulses are only half the frequency required to cause a state switch in the nuclear spin, the nuclear spin will enter the quantum superposition state of the ground state (↓) and excited states (↑). A recurring radio pulse will then result in an operation equivalent to 'NOT', for which reason the described operation is called '√NOT'. Such an operation allows for the state of quantum superposition in quantum computing, which enables parallel processing of several numbers. The work also treats the principles of 2-q-bit logical operations of the controlled 'NOT' type (CNOT), 2-q-bit (SWAP), and the 3-q-bit 'TAFFOLI' gate. (author)

  13. Stochastic Pseudo-Boolean Optimization

    Science.gov (United States)

    2011-07-31

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

  14. Generalized Boolean Functions as Combiners

    Science.gov (United States)

    2017-06-01

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

  15. Wide operating window spin-torque majority gate towards large-scale integration of logic circuits

    Science.gov (United States)

    Vaysset, Adrien; Zografos, Odysseas; Manfrini, Mauricio; Mocuta, Dan; Radu, Iuliana P.

    2018-05-01

    Spin Torque Majority Gate (STMG) is a logic concept that inherits the non-volatility and the compact size of MRAM devices. In the original STMG design, the operating range was restricted to very small size and anisotropy, due to the exchange-driven character of domain expansion. Here, we propose an improved STMG concept where the domain wall is driven with current. Thus, input switching and domain wall propagation are decoupled, leading to higher energy efficiency and allowing greater technological optimization. To ensure majority operation, pinning sites are introduced. We observe through micromagnetic simulations that the new structure works for all input combinations, regardless of the initial state. Contrary to the original concept, the working condition is only given by threshold and depinning currents. Moreover, cascading is now possible over long distances and fan-out is demonstrated. Therefore, this improved STMG concept is ready to build complete Boolean circuits in absence of external magnetic fields.

  16. Effects of two-photon absorption on all optical logic operation based on quantum-dot semiconductor optical amplifiers

    Science.gov (United States)

    Zhang, Xiang; Dutta, Niloy K.

    2018-01-01

    We investigate all-optical logic operation in quantum-dot semiconductor optical amplifier (QD-SOA) based Mach-Zehnder interferometer considering the effects of two-photon absorption (TPA). TPA occurs during the propagation of sub-picosecond pulses in QD-SOA, which leads to a change in carrier recovery dynamics in quantum-dots. We utilize a rate equation model to take into account carrier refill through TPA and nonlinear dynamics including carrier heating and spectral hole burning in the QD-SOA. The simulation results show the TPA-induced pumping in the QD-SOA can reduce the pattern effect and increase the output quality of the all-optical logic operation. With TPA, this scheme is suitable for high-speed Boolean logic operation at 320 Gb/s.

  17. Spatial Operations

    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.

  18. Operational amplifiers

    CERN Document Server

    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

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

    Directory of Open Access Journals (Sweden)

    Murilo Rezende Melo

    2006-08-01

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

  20. Study on magnetic fluid optical fiber devices for optical logic operations by characteristics of superparamagnetic nanoparticles and magnetic fluids

    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.

  1. Operating systems

    CERN Document Server

    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

  2. Operational calculus

    CERN Document Server

    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

  3. Spacecraft operations

    CERN Document Server

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

  4. Business resilience system (BRS) driven through Boolean, fuzzy logics and cloud computation real and near real time analysis and decision making system

    CERN Document Server

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

  5. Environment dependent enhanced photoluminescence and Boolean logic gates like behavior of Bi2O3 and Ag:Bi2O3 nanostructures

    Science.gov (United States)

    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.

  6. Operator substitution

    NARCIS (Netherlands)

    Hautus, M.L.J.

    1994-01-01

    Substitution of an operator into an operator-valued map is defined and studied. A Bezout-type remainder theorem is used to derive a number of results. The tensor map is used to formulate solvability conditions for linear matrix equations. Some applications to system theory are given, in particular

  7. Operation amplifier

    NARCIS (Netherlands)

    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;

  8. Operation Amplifier

    NARCIS (Netherlands)

    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

  9. Operation Amplifier

    NARCIS (Netherlands)

    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

  10. Accelerator operations

    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

  11. Hanaro operation

    International Nuclear Information System (INIS)

    Lee, Ji Bok; Jeon, Byung Jin; Kwack, Byung Ho

    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

  12. Reactor operation

    CERN Document Server

    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

  13. Operator programs and operator processes

    NARCIS (Netherlands)

    Bergstra, J.A.; Walters, P.

    2003-01-01

    We define a notion of program which is not a computer program but an operator program: a detailed description of actions performed and decisions taken by a human operator (computer user) performing a task to achieve a goal in a simple setting consisting of that user, one or more computers and a

  14. Operator theory

    CERN Document Server

    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.

  15. Operation Starvation

    National Research Council Canada - National Science Library

    Mason, Gerald

    2002-01-01

    More than 1,250,000 tons of shipping was sunk or damaged in the last five months of World War II when Twenty-first Bomber Command executed an aerial mining campaign against Japan known as Operation STARVATION...

  16. Peace Operations

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

  17. Operator training

    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)

  18. Operative Links

    DEFF Research Database (Denmark)

    Wistoft, Karen; Højlund, Holger

    2012-01-01

    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......, health professionalism, and management strategies pose the foremost challenge. Operational links indicates cooperative levels that facilitate a creative and innovative effort across traditional professional boundaries. It is proposed that such links are supported by network structures, shared semantics...

  19. Applied Operations Research: Operator's Assistant

    Science.gov (United States)

    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.

  20. Operating experience

    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

  1. Operator companion

    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

  2. Operative arthroscopy.

    Science.gov (United States)

    Guhl, J F

    1979-01-01

    In a period of 20 months, over 200 patients (age ranged from high school students to middle-aged persons) with knee injuries were treated by operative arthroscopy. The majority of the injuries were incurred while the patients had been participating in athletic events, either competitive or recreational. Operative arthroscopy offers the advantage of shortened hospital stay, rapid rehabilitation, lack of disfiguring scar, and reduced costs. Patients are followed yearly after the first postoperative year. Improved long-term results from diagnostic and operative arthroscopy, as compared to conventional surgical procedures, are expected. The proof of those expectations will be determined in the next several years as this group of patients requiring partial meniscectomies or procedures for pathologic and degenerative conditions is reevaluated.

  3. Accelerator operations

    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

  4. Operating Systems

    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.

  5. Peace Operations

    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.

  6. Operational Circulars

    CERN Multimedia

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

  7. Operation Context

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

  8. Operational indicators

    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

  9. Site operations

    International Nuclear Information System (INIS)

    House, W.B.; Ebenhack, D.G.

    1989-01-01

    This chapter is a discussion of the management and operations practices used at the Barnwell Waste Management Facility in Barnwell, SC. The following topics are discussed: (1) Waste receiving and inspection, including manifest and certificates of compliance, radiological surveys, disposition of nonconforming items, and decontamination and disposition of secondary waste streams; (2) Waste disposal, including Title 10 CFR 61 requirements, disposal area evaluations, shipment offloading, container emplacement, and radiation protection; (3) Trench closure, including trench backfilling, trench capping, and permanent markers; (4) Site maintenance and stabilization, including trench maintenance, surface water management, and site closure activities; (5) Site monitoring programs, including operational monitoring, and environmental monitoring program; (6) Personnel training and qualifications, including basic training program, safety training program, special skills training, and physical qualifications; (7) Records management, including waste records, personnel training records, personnel dosimetry records, site monitoring records, trench qualification and construction records, and site drawings and stabilization records; (8) Site security; (9) Emergency response plans; and (10) Quality assurance

  10. Operators perspective

    International Nuclear Information System (INIS)

    Scragg, D.M.

    1991-01-01

    There are very few Energy from Municipal Waste processing plants in the U.K. Those which were built have usually been financed and operated by Local Authorities and are now in excess of 17 years old. The Environmental Protection Act and constraints on Public Sector spending have brought about fundamental changes in the approach taken to developing new schemes of this kind. The Public Sector and the Private Sector must work together. The investment in Mass Burning Incineration Schemes generating energy is high and the pressures to keep the waste disposal costs as low as possible mean that recovery of the investment needs to be spread over many years. For any Scheme to be successful and financially viable requires a long term commitment on the part of those involved. This paper sets out the key role which the Operating Contractor can play in this situation. (author)

  11. Operating Cigeo

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

  12. Operation Poorman

    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

  13. On boolean combinations forming piecewise testable languages

    Czech Academy of Sciences Publication Activity Database

    Masopust, Tomáš; Thomazo, M.

    2017-01-01

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

  14. Boolean integration. [applied to switching network synthesis

    Science.gov (United States)

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

    1976-01-01

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

  15. Pseudo Boolean Programming for Partially Ordered Genomes

    Science.gov (United States)

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

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

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

  17. In-situ, In-Memory Stateful Vector Logic Operations based on Voltage Controlled Magnetic Anisotropy.

    Science.gov (United States)

    Jaiswal, Akhilesh; Agrawal, Amogh; Roy, Kaushik

    2018-04-10

    Recently, the exponential increase in compute requirements demanded by emerging applications like artificial intelligence, Internet of things, etc. have rendered the state-of-art von-Neumann machines inefficient in terms of energy and throughput owing to the well-known von-Neumann bottleneck. A promising approach to mitigate the bottleneck is to do computations as close to the memory units as possible. One extreme possibility is to do in-situ Boolean logic computations by using stateful devices. Stateful devices are those that can act both as a compute engine and storage device, simultaneously. We propose such stateful, vector, in-memory operations using voltage controlled magnetic anisotropy (VCMA) effect in magnetic tunnel junctions (MTJ). Our proposal is based on the well known manufacturable 1-transistor - 1-MTJ bit-cell and does not require any modifications in the bit-cell circuit or the magnetic device. Instead, we leverage the very physics of the VCMA effect to enable stateful computations. Specifically, we exploit the voltage asymmetry of the VCMA effect to construct stateful IMP (implication) gate and use the precessional switching dynamics of the VCMA devices to propose a massively parallel NOT operation. Further, we show that other gates like AND, OR, NAND, NOR, NIMP (complement of implication) can be implemented using multi-cycle operations.

  18. Operator errors

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

  19. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Lung Operation After Your Operation Your Discharge and Recovery Complete Video After Your Operation Guidance for after ... Your Lung Operation Read Next Your Discharge and Recovery Back to Top Find A Surgeon Find A ...

  20. Operational Law Handbook,2007

    National Research Council Canada - National Science Library

    2007-01-01

    ... & SOFAs, legal assistance, combating terrorism, domestic operations, noncombatant evacuation operations, special operations, civil affairs, air, sea, and space law, detainee operations, reserve...

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

    International Nuclear Information System (INIS)

    Blanca, Ernest

    1974-10-01

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

  2. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... You Want to Be a Surgeon Resident Resources Teaching Resources Online Guide to Choosing a Surgical Residency ... After Your Operation Your Discharge and Recovery Complete Video After Your Operation Guidance for after the operation ...

  3. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Medical Student Core Curriculum ACS/ASE Medical Student Simulation-Based Surgical Skills Curriculum Cancer Education Cancer Education ... Surgeons Education Patients and Family Skills Programs Your Lung Operation Your Lung Operation DVD After Your Operation ...

  4. Your Lung Operation: After Your Operation

    Medline Plus

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

  5. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Liability Surgeons as Advocates Surgeons and Bundled Payment Models Surgeons as Institutional Employees Our Changing Health Care ... Lung Operation After Your Operation Your Discharge and Recovery Complete Video After Your Operation Guidance for after ...

  6. Your Lung Operation: After Your Operation

    Medline Plus

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

  7. Operator theory, operator algebras and applications

    CERN Document Server

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

  8. Intelligent layered nanoflare: ``lab-on-a-nanoparticle'' for multiple DNA logic gate operations and efficient intracellular delivery

    Science.gov (United States)

    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

  9. Relay chatter and operator response after a large earthquake: An improved PRA methodology with case studies

    International Nuclear Information System (INIS)

    Budnitz, R.J.; Lambert, H.E.; Hill, E.E.

    1987-08-01

    The purpose of this project has been to develop and demonstrate improvements in the PRA methodology used for analyzing earthquake-induced accidents at nuclear power reactors. Specifically, the project addresses methodological weaknesses in the PRA systems analysis used for studying post-earthquake relay chatter and for quantifying human response under high stress. An improved PRA methodology for relay-chatter analysis is developed, and its use is demonstrated through analysis of the Zion-1 and LaSalle-2 reactors as case studies. This demonstration analysis is intended to show that the methodology can be applied in actual cases, and the numerical values of core-damage frequency are not realistic. The analysis relies on SSMRP-based methodologies and data bases. For both Zion-1 and LaSalle-2, assuming that loss of offsite power (LOSP) occurs after a large earthquake and that there are no operator recovery actions, the analysis finds very many combinations (Boolean minimal cut sets) involving chatter of three or four relays and/or pressure switch contacts. The analysis finds that the number of min-cut-set combinations is so large that there is a very high likelihood (of the order of unity) that at least one combination will occur after earthquake-caused LOSP. This conclusion depends in detail on the fragility curves and response assumptions used for chatter. Core-damage frequencies are calculated, but they are probably pessimistic because assuming zero credit for operator recovery is pessimistic. The project has also developed an improved PRA methodology for quantifying operator error under high-stress conditions such as after a large earthquake. Single-operator and multiple-operator error rates are developed, and a case study involving an 8-step procedure (establishing feed-and-bleed in a PWR after an earthquake-initiated accident) is used to demonstrate the methodology

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

  11. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... to Participate Resources Webinars for Young Surgeons YFA E-News YFA Advocacy Essay Contest Resident and Associate ... ACS Leader International Exchange Scholar Program Resources RAS E-News Medical Students Operation Giving Back Operation Giving ...

  12. Your Lung Operation: After Your Operation

    Medline Plus

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

  13. Space station operations management

    Science.gov (United States)

    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.

  14. HFETR operation management

    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)

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

  16. Animal Feeding Operations

    Science.gov (United States)

    ... type=”submit” value=”Submit” /> Healthy Water Home Animal Feeding Operations Recommend on Facebook Tweet Share Compartir ... of Concentrated Animal Feeding Operations (CAFOs) What are Animal Feeding Operations (AFOs)? According to the United States ...

  17. The ethics of conducting a co-operative inquiry with vulnerable people.

    Science.gov (United States)

    Tee, Stephen R; Lathlean, Judith A

    2004-09-01

    Mental health services users have been calling for greater participation in clinical research. Participation in this context means research 'with' rather than 'on' groups of people. Conducting a co-operative inquiry involving the participation of vulnerable individuals as co-researchers, in particular those with a history of mental health problems, places an obligation on researchers to articulate and justify sound ethical procedures. The aim of this paper is to consider how the ethical issues encountered when conducting participative research with vulnerable people can be addressed in the implementation of a co-operative inquiry with users of mental health services. The study was based on personal reflection and a critical review of associated literature obtained from a database search using Boolean logic. The findings, presented under the headings of the four prima facie moral principles, suggest the need for researchers using participative approaches to demonstrate the humanistic attributes required for engaging and working with people over a period of time. These include building and maintaining trusting relationships, assessing competence to participate, managing interpersonal and group dynamics and making complex collaborative decisions about participants' continued participation in a study. When using a co-operative inquiry approach involving vulnerable individuals, researchers need to demonstrate clearly how a balance between autonomy and paternalism will be achieved, how risks will be anticipated and managed and how fairness will be maintained throughout all procedures. Researchers using participative approaches need to have developed a level of personal insight and self-awareness through access to supervision which focuses on sources of unintended manipulation and interpersonal dynamics that may arise at the inception of a study and throughout its course. Researchers and ethics committees have a shared responsibility to ensure that vulnerable people are

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

  19. Saxton Transportation Operations Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — The Saxton Transportation Operations Laboratory (Saxton Laboratory) is a state-of-the-art facility for conducting transportation operations research. The laboratory...

  20. Your Lung Operation: After Your Operation

    Medline Plus

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

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

  2. International co-operation

    International Nuclear Information System (INIS)

    1998-01-01

    In this part the are reviewed: Co-operation with IAEA; Participation of the Slovakia on the 41 st session of the General Conference; The comprehensive Nuclear-Test-Ban Treaty Organization; Co-operation with the Organization for Economic Co-operation and Development; co-operation with the European Commission; Fulfillment of obligations resulting from the international contracting documents

  3. Biomedical programs operations plans

    Science.gov (United States)

    Walbrecher, H. F.

    1974-01-01

    Operational guidelines for the space shuttle life sciences payloads are presented. An operational assessment of the medical experimental altitude test for Skylab, and Skylab life sciences documentation are discussed along with the operations posture and collection of space shuttle operational planning data.

  4. Composite operators in QCD

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

  5. The AECL operator companion

    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

  6. Elementary operators on self-adjoint operators

    Science.gov (United States)

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

  7. Operation planning device

    International Nuclear Information System (INIS)

    Watanabe, Takashi; Odakawa, Naoto; Erikuchi, Makoto; Okada, Masayuki; Koizumi, Atsuhiko.

    1996-01-01

    The device of the present invention provides a device suitable for monitoring a reactor core state and operation replanning in terms of reactor operation. Namely, (1) an operation result difference judging means judges that replanning is necessary when the operation results deviates from the operation planning, (2) an operation replanning rule data base storing means stores a deviation key which shows various kinds of states where the results deviate from the planning and a rule for replanning for returning to the operation planning on every deviating key, (3) an operation replanning means forms a new operation planning in accordance with the rule which is retrieved based on the deviation key, (4) an operation planning optimizing rule data base storing means evaluates the reformed planning and stores it on every evaluation item, (5) an operation planning optimization means correct the operation planning data so as to be optimized when the evaluation of the means (4) is less than a reference value, and (6) an operation planning display means edits adaptable operation planning data and the result of the evaluation and displays them. (I.S.)

  8. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... to Choosing a Surgical Residency Education Modules 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 ...

  9. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Congress Educational Program Events and Special Activities Resources Housing and Travel Exhibitors Media Information Clinical Congress 2017 ... Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills ...

  10. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... 25- and 50-Year Fellows Recognition Surgical History Group Icons in Surgery Archives Catalog Additional Resources Contact ... for after the operation including review of attached equipment and ways for you to actively participate to ...

  11. Your Lung Operation: After Your Operation

    Medline Plus

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

  12. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Surgeon Specific Registry Trauma Education Trauma Education Trauma Education Advanced Surgical Skills for Exposure in Trauma Advanced Trauma Life Support Advanced Trauma Operative Management Basic Endovascular Skills for Trauma Disaster Management and Emergency ...

  13. Your Lung Operation: After Your Operation

    Medline Plus

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

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

  15. Your Lung Operation: After Your Operation

    Medline Plus

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

  16. Your Lung Operation: After Your Operation

    Medline Plus

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

  17. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Disaster Management and Emergency Preparedness Rural Trauma Team Development Course Trauma Evaluation and Management Trauma CME The ... for after the operation including review of attached equipment and ways for you to actively participate to ...

  18. Your Lung Operation: After Your Operation

    Medline Plus

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

  19. Your Lung Operation: After Your Operation

    Medline Plus

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

  20. Your Lung Operation: After Your Operation

    Medline Plus

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

  1. Improving operating room safety

    Directory of Open Access Journals (Sweden)

    Garrett Jill

    2009-11-01

    Full Text Available Abstract Despite the introduction of the Universal Protocol, patient safety in surgery remains a daily challenge in the operating room. This present study describes one community health system's efforts to improve operating room safety through human factors training and ultimately the development of a surgical checklist. Using a combination of formal training, local studies documenting operating room safety issues and peer to peer mentoring we were able to substantially change the culture of our operating room. Our efforts have prepared us for successfully implementing a standardized checklist to improve operating room safety throughout our entire system. Based on these findings we recommend a multimodal approach to improving operating room safety.

  2. Computer algebra and operators

    Science.gov (United States)

    Fateman, Richard; Grossman, Robert

    1989-01-01

    The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.

  3. Operating System Security

    CERN Document Server

    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

  4. Operation training aid device

    International Nuclear Information System (INIS)

    Yoshimura, Sadanori.

    1994-01-01

    The device of the present invention evaluates the propriety of an operation which is conducted optionally by a trainee depending on the state of the plant, analyzes the cause of an operation error and aids the preparation of training policy and teaching materials based on the results of the evaluation and the analysis. Namely, an operation data collection device collects operation data for the plant operation conducted by the trainee and the state of the plant during the operation. Since an operation evaluation device evaluates the plant operation in a short period of time based on the evaluation criteria of an operation evaluation knowledge base, an operation error is never overlooked. Accordingly, uniform and highly reliable operation training at definite evaluation criteria can be obtained. In addition, an error-cause analyzing device and a training policy knowledge base analyze the cause of an error inherent to each of the trainee, and it is recorded systematically independently on every trainees. Since a training policy guide device retrieves and presents an operation error and a cause of the error, there can be prepared a training policy incorporating training with respect to the operation error that each of the trainee tends to commit. (I.S.)

  5. Safe operating envelope

    Energy Technology Data Exchange (ETDEWEB)

    Oliva, N [Ontario Hydro, Toronto, ON (Canada)

    1997-12-01

    Safe Operating Envelope is described representing: The outer bound of plant conditions within which day-to-day plant operation must be maintained in order to comply with regulatory requirements, associated safety design criteria and corporate nuclear safety goals. Figs.

  6. Major operations and activities

    Energy Technology Data Exchange (ETDEWEB)

    Black, D.G.

    1995-06-01

    This section of the 1994 Hanford Site Environmental Report summarizes the major operations and activities on the site. These operations and activities include site management, waste management, environmental restoration and corrective actions, and research and technology development.

  7. Autonomous Systems and Operations

    Data.gov (United States)

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

  8. Boiler operator's handbook

    CERN Document Server

    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.

  9. Joint Operation Planning

    National Research Council Canada - National Science Library

    2006-01-01

    .... It sets forth joint doctrine to govern the joint operation planning activities and performance of the Armed Forces of the United States in joint operations, and provides the joint doctrinal basis...

  10. Crew Transportation Operations Standards

    Science.gov (United States)

    Mango, Edward J.; Pearson, Don J. (Compiler)

    2013-01-01

    The Crew Transportation Operations Standards contains descriptions of ground and flight operations processes and specifications and the criteria which will be used to evaluate the acceptability of Commercial Providers' proposed processes and specifications.

  11. Safe operating envelope

    International Nuclear Information System (INIS)

    Oliva, N.

    1997-01-01

    Safe Operating Envelope is described representing: The outer bound of plant conditions within which day-to-day plant operation must be maintained in order to comply with regulatory requirements, associated safety design criteria and corporate nuclear safety goals. Figs

  12. Major operations and activities

    International Nuclear Information System (INIS)

    Black, D.G.

    1995-01-01

    This section of the 1994 Hanford Site Environmental Report summarizes the major operations and activities on the site. These operations and activities include site management, waste management, environmental restoration and corrective actions, and research and technology development

  13. Vessel Operator System

    Data.gov (United States)

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

  14. Ranking Operations Management conferences

    NARCIS (Netherlands)

    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

  15. Emergency operation determination system

    International Nuclear Information System (INIS)

    Miki, Tetsushi.

    1993-01-01

    The system of the present invention can determine an emergency operation coping with abnormal events occurring during nuclear plant operation without replying on an operator's judgement. That is, the system of the present invention comprises an intelligence base which divides and classifies the aims of the plant operation for the function, structure and operation manual and puts them into network. Degree of attainment for the extend of the status normality is determined on every aim of operation based on various kinds of measured data during plant operation. For a degree of attainment within a predetermined range, it is judged that an emergency operation is possible although this is in an abnormal state. Degree of emergency is determined by a fuzzy theory based on the degree of attainment, variation coefficient for the degree of attainment and the sensitivity to external disturbance as parameters. Priority for the degree of emergency on every operation aims is determined by comparison. Normality is successively checked for the determined operation aims. As a result, equipments as objects of abnormality suppressing operation are specified, and the operation amount of the equipments as objects are determined so that the measuring data are within a predetermined range. (I.S.)

  16. Mobile Operating Systems

    OpenAIRE

    Vipin Kamboj; Hitesh Gupta

    2012-01-01

    Mobile phones are used by every people in today’s life. We use mobile phones without knowing the different factors that a mobile used including its technology, operating system, CPU ,RAM etc. Many types of operating system are used by different mobile. Every operating system has their advantage

  17. Status of TRISTAN operation

    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)

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

  19. On the operator equivalents

    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

  20. Lageos assembly operation plan

    Science.gov (United States)

    Brueger, J.

    1975-01-01

    Guidelines and constraints procedures for LAGEOS assembly, operation, and design performance are given. Special attention was given to thermal, optical, and dynamic analysis and testing. The operation procedures illustrate the interrelation and sequence of tasks in a flow diagram. The diagram also includes quality assurance functions for verification of operation tasks.

  1. Operational Intelligence and Operational Design: Thinking about Operational Art

    Science.gov (United States)

    2011-06-01

    captured it best when he wrote, ―Operational intelligence is more or less the fusion of 45 Kent... Market Garden….‖34 Additionally, Drea concluded that the strong-minded General Douglas MacArthur‘s ―sense of destiny‖ shaped his strategic concepts...1960. Memorandum RM-4172-ISA, Santa Monica, CA: The RAND Corporation, September 1964. The Bible . New International Version. Hitchcock, Walter T., ed

  2. Operational symmetries basic operations in physics

    CERN Document Server

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

  3. Shuttle operations era planning for flight operations

    Science.gov (United States)

    Holt, J. D.; Beckman, D. A.

    1984-01-01

    The Space Transportation System (STS) provides routine access to space for a wide range of customers in which cargos vary from single payloads on dedicated flights to multiple payloads that share Shuttle resources. This paper describes the flight operations planning process from payload introduction through flight assignment to execution of the payload objectives and the changes that have been introduced to improve that process. Particular attention is given to the factors that influence the amount of preflight preparation necessary to satisfy customer requirements. The partnership between the STS operations team and the customer is described in terms of their functions and responsibilities in the development of a flight plan. A description of the Mission Control Center (MCC) and payload support capabilities completes the overview of Shuttle flight operations.

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

  5. Your Lung Operation: After Your Operation

    Medline Plus

    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

  6. Your Lung Operation: After Your Operation

    Medline Plus

    Full Text Available ... Use Patient Opioid Use Position Statements and Task Force Patient Education Initiatives Advocacy and Health Policy Updates Selected Research ... 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 ...

  7. Operations management system

    Science.gov (United States)

    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.

  8. Cask fleet operations study

    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

  9. Entanglement branching operator

    Science.gov (United States)

    Harada, Kenji

    2018-01-01

    We introduce an entanglement branching operator to split a composite entanglement flow in a tensor network which is a promising theoretical tool for many-body systems. We can optimize an entanglement branching operator by solving a minimization problem based on squeezing operators. The entanglement branching is a new useful operation to manipulate a tensor network. For example, finding a particular entanglement structure by an entanglement branching operator, we can improve a higher-order tensor renormalization group method to catch a proper renormalization flow in a tensor network space. This new method yields a new type of tensor network states. The second example is a many-body decomposition of a tensor by using an entanglement branching operator. We can use it for a perfect disentangling among tensors. Applying a many-body decomposition recursively, we conceptually derive projected entangled pair states from quantum states that satisfy the area law of entanglement entropy.

  10. Management of Port Operations

    OpenAIRE

    Gheorghe BASANU; Georgiana NUKINA

    2011-01-01

    The Management of port operation requires the proper and efficient use of port facility, equipment for cargo handling, berth facilities, waterways and roads. It also entails the use of effective communications system, storage facilities, and dockworkers. The whole activities mentioned above form the bulk of port operations. The aspiration of port operator is to get cargo through the gateway of ports as fast as possible on to other modes of transport (rail or road) with a minimal cost to them ...

  11. Purge ventilation operability

    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

  12. Operation Chromite: Amphibious Planning

    OpenAIRE

    2005-01-01

    tut present Tutorial Presentation Interactive Media Element This interactive tutorial covers the Inchon landing case study that provides several good examples of the types of decisions made during the amphibious planning process, and how they compare to the current matrix of the ten primary decisions for amphibious operation required today by joint doctrine. Operation Chromite is used as an example. 8808A Warfighting from the Sea: Amphibious Operations

  13. Network operating system

    Science.gov (United States)

    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.

  14. ISACC in Operations

    Science.gov (United States)

    2014-06-01

    19th floor of a Hotel to overlook the entire event. Page 12 of 17 Figure 6: The SPF Operations Centre overlooking the Event Lessons...have a cheap system to help them solve their immediate operational needs. b. Medium enterprises, that need to have quick customization of the...Optimize” tools to help them advance their current operations to a higher service satisfaction level seen by the public. 32. Common across all

  15. Strategic Psychological Operations management

    OpenAIRE

    Sokoloski, Joseph A.

    2005-01-01

    United States Military Psychological Operations are engaged in a type of mass marketing of ideas. To accomplish this The United States Army Civil Affairs and Psychological Operations Command (USACAPOC) employs active and reserve PSYOP units to conduct PSYOP campaigns. However the methodology used to manage these campaigns often hinders the effective employment of timely and effective Psychological Operations. PSYOP has a difficult job to accomplish but PSYOP does not have the proper managemen...

  16. Licensed operating reactors

    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

  17. Miscellaneous Industrial Mineral Operations

    Data.gov (United States)

    Department of Homeland Security — This map layer includes miscellaneous industrial minerals operations in the United States. The data represent commodities covered by the Minerals Information Team...

  18. Operational Law Handbook,2007

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

  19. Enhancing operational safety

    Energy Technology Data Exchange (ETDEWEB)

    Wiebe, J S

    1997-09-01

    The presentation briefly considers the following aspects concerning enhancing operational safety of NPP: licensed control room supervision, reactivity changes, personnel access to control room, simulator training.

  20. Operational safety reliability research

    International Nuclear Information System (INIS)

    Hall, R.E.; Boccio, J.L.

    1986-01-01

    Operating reactor events such as the TMI accident and the Salem automatic-trip failures raised the concern that during a plant's operating lifetime the reliability of systems could degrade from the design level that was considered in the licensing process. To address this concern, NRC is sponsoring the Operational Safety Reliability Research project. The objectives of this project are to identify the essential tasks of a reliability program and to evaluate the effectiveness and attributes of such a reliability program applicable to maintaining an acceptable level of safety during the operating lifetime at the plant

  1. Operational Modal Analysis Tutorial

    DEFF Research Database (Denmark)

    Brincker, Rune; Andersen, Palle

    of modal parameters of practical interest - including the mode shape scaling factor - with a high degree of accuracy. It is also argued that the operational technology offers the user a number of advantages over traditional modal testing. The operational modal technology allows the user to perform a modal......In this paper the basic principles in operational modal testing and analysis are presented and discussed. A brief review of the techniques for operational modal testing and identification is presented, and it is argued, that there is now a wide range of techniques for effective identification...

  2. Licensed operating reactors

    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

  3. International co-operation

    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

  4. Operator interface for vehicles

    Science.gov (United States)

    Bissontz, Jay E

    2015-03-10

    A control interface for drivetrain braking provided by a regenerative brake and a non-regenerative brake is implemented using a combination of switches and graphic interface elements. The control interface comprises a control system for allocating drivetrain braking effort between the regenerative brake and the non-regenerative brake, a first operator actuated control for enabling operation of the drivetrain braking, and a second operator actuated control for selecting a target braking effort for drivetrain braking. A graphic display displays to an operator the selected target braking effort and can be used to further display actual braking effort achieved by drivetrain braking.

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

  6. Gyroaveraging operations using adaptive matrix operators

    Science.gov (United States)

    Dominski, Julien; Ku, Seung-Hoe; Chang, Choong-Seock

    2018-05-01

    A new adaptive scheme to be used in particle-in-cell codes for carrying out gyroaveraging operations with matrices is presented. This new scheme uses an intermediate velocity grid whose resolution is adapted to the local thermal Larmor radius. The charge density is computed by projecting marker weights in a field-line following manner while preserving the adiabatic magnetic moment μ. These choices permit to improve the accuracy of the gyroaveraging operations performed with matrices even when strong spatial variation of temperature and magnetic field is present. Accuracy of the scheme in different geometries from simple 2D slab geometry to realistic 3D toroidal equilibrium has been studied. A successful implementation in the gyrokinetic code XGC is presented in the delta-f limit.

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

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

  9. Operator interface programs for KSTAR operation

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Sangil, E-mail: leesi@nfri.re.kr; Park, Mikyung, E-mail: mkpark@nfri.re.kr; Park, Jinseop, E-mail: linupark@nfri.re.kr; Na, Hoonkyun, E-mail: hkna@nfri.re.kr; Kwon, M., E-mail: kwonm@nfri.re.kr

    2013-11-15

    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.

  10. Crane and Excavator Operator.

    Science.gov (United States)

    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…

  11. Science Operations Management

    Science.gov (United States)

    Squibb, Gael F.

    1984-10-01

    The operation teams for the Infrared Astronomical Satellite (IRAS) included scientists from the IRAS International Science Team. The scientific decisions on an hour-to-hour basis, as well as the long-term strategic decisions, were made by science team members. The IRAS scientists were involved in the analysis of the instrument performance, the analysis of the quality of the data, the decision to reacquire data that was contaminated by radiation effects, the strategy for acquiring the survey data, and the process for using the telescope for additional observations, as well as the processing decisions required to ensure the publication of the final scientific products by end of flight operations plus one year. Early in the project, two science team members were selected to be responsible for the scientific operational decisions. One, located at the operations control center in England, was responsible for the scientific aspects of the satellite operations; the other, located at the scientific processing center in Pasadena, was responsible for the scientific aspects of the processing. These science team members were then responsible for approving the design and test of the tools to support their responsibilities and then, after launch, for using these tools in making their decisions. The ability of the project to generate the final science data products one year after the end of flight operations is due in a large measure to the active participation of the science team members in the operations. This paper presents a summary of the operational experiences gained from this scientific involvement.

  12. Health care operations management

    NARCIS (Netherlands)

    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

  13. Joint Newspaper Operating Agreements.

    Science.gov (United States)

    Parsons, Marie

    The number of competing daily newspapers in American cities has dwindled until only about 50 cities boast two papers. Of the newspapers in those cities, 23 now maintain separate editorial operations but have joint printing, advertising, and circulation departments. The concept of joint operation is 50 years old, dating from the Depression years…

  14. Special Operation. Module 20.

    Science.gov (United States)

    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…

  15. NCEP Central Operations

    Science.gov (United States)

    ) NCO Organizational Chart NOAA's Weather and Climate Operational Supercomputing System is known as Climate Climate Prediction Climate Archives Weather Safety Storm Ready NOAA Central Library Photo Library NCO's MISSION * Execute the NCEP operational model suite - Create climate, weather, ocean, space and

  16. Reliance Cell Operator

    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.

  17. Characteristics of operating pipelines

    Energy Technology Data Exchange (ETDEWEB)

    Gallyamov, A K; Armenskii, E A; Gimaev, R G; Mastobaev, B N; Shammazov, A M

    1977-04-01

    The interval in pressure changes according to operational data for the Kamennyi Log--Perm oil pipeline was determined with the aid of the pattern identification method. This has made it possible to determine pressure changes in the operational process. 2 references, 1 table.

  18. CANDU operating experience

    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

  19. Basic Sewage Treatment Operation.

    Science.gov (United States)

    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…

  20. Operating room manager game

    NARCIS (Netherlands)

    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

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

  2. operation zitadelle (kursk)

    African Journals Online (AJOL)

    Administrator

    placed in terms of the levels of war, according to contemporary doctrine. .... operations and for the administration of such operations for extended periods. ... view is supported by a recent publication by Vego, professor in Military History at .... with short-term and contingency planning in which the tasks that are executed are.

  3. Advanced Tele-operation

    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

  4. Operations Between Functions

    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......, and associative, must be one of 40 explicitly given types. In particular, this is the case for operations between pairs of arbitrary, or continuous, or differentiable functions. The term pointwise means that (f ∗g)(x) = F(f(x), g(x)), for all x ∈ A and some function F of two variables. Several results in the same...... spirit are obtained for operations between convex functions or between support functions. For example, it is shown that ordinary addition is the unique pointwise operation between convex functions satisfying the identity property, i.e., f ∗ 0 = 0 ∗ f = f, for all convex f, while other results classify Lp...

  5. Aircraft operations management manual

    Science.gov (United States)

    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.

  6. Sustainable Building Operation

    DEFF Research Database (Denmark)

    Jensen, Jesper Ole

    2009-01-01

    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......Energy-savings in the existing building stock have becomes a main goal in national and international policies. Often focus is on building-renovations, whereas the potential of sustainable building operation to a large extent has been neglected. Nevertheless, international research as well...... as practical experiences from Danish housing estates indicates that there are large potentials for energy savings by focusing on the operation of the buildings. We suggest that in order to achieve sustainability in the existing housing, renovation and operations should be seen as integrated parts...

  7. Noncommutative operational calculus

    Directory of Open Access Journals (Sweden)

    Henry E. Heatherly

    1999-12-01

    Full Text Available Oliver Heaviside's operational calculus was placed on a rigorous mathematical basis by Jan Mikusinski, who constructed an algebraic setting for the operational methods. In this paper, we generalize Mikusi'{n}ski's methods to solve linear ordinary differential equations in which the unknown is a matrix- or linear operator-valued function. Because these functions can be zero-divisors and do not necessarily commute, Mikusi'{n}ski's one-dimensional calculus cannot be used. The noncommuative operational calculus developed here,however, is used to solve a wide class of such equations. In addition, we provide new proofs of existence and uniqueness theorems for certain matrix- and operator valued Volterra integral and integro-differential equations. Several examples are given which demonstrate these new methods.

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

  9. Modern operating systems

    CERN Document Server

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

  10. Integrated formal operations plan

    Energy Technology Data Exchange (ETDEWEB)

    Cort, G.; Dearholt, W.; Donahue, S.; Frank, J.; Perkins, B.; Tyler, R.; Wrye, J.

    1994-01-05

    The concept of formal operations (that is, a collection of business practices to assure effective, accountable operations) has vexed the Laboratory for many years. To date most attempts at developing such programs have been based upon rigid, compliance-based interpretations of a veritable mountain of Department of Energy (DOE) orders, directives, notices, and standards. These DOE dictates seldom take the broad view but focus on highly specialized programs isolated from the overall context of formal operations. The result is a confusing array of specific, and often contradictory, requirements that produce a patchwork of overlapping niche programs. This unnecessary duplication wastes precious resources, dramatically increases the complexity of our work processes, and communicates a sense of confusion to our customers and regulators. Coupled with the artificial divisions that have historically existed among the Laboratory`s formal operations organizations (quality assurance, configuration management, records management, training, etc.), this approach has produced layers of increasingly vague and complex formal operations plans, each of which interprets its parent and adds additional requirements of its own. Organizational gridlock ensues whenever an activity attempts to implement these bureaucratic monstrosities. The integrated formal operations plan presented is to establish a set of requirements that must be met by an integrated formal operations program, assign responsibilities for implementation and operation of the program, and specify criteria against which the performance of the program will be measured. The accountable line manager specifies the items, processes, and information (the controlled elements) to which the formal operations program specified applies. The formal operations program is implemented using a graded approach based on the level of importance of the various controlled elements and the scope of the activities in which they are involved.

  11. Basic operator theory

    CERN Document Server

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

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

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

  14. Tevatron operational experiences

    International Nuclear Information System (INIS)

    Norris, B.L.; Theilacker, J.C.

    1989-02-01

    Fermilabs superconducting accelerator, the Tevatron has been operational for nearly six years. The history of its operation is presented. Several long shutdowns for superconducting dipole repairs are discussed. The dominant factor influencing the repair was conductor motion which fatigued the cable in the magnet ends. Borescoping and x-raying techniques were used to determine which magnet ends required repair. Detailed downtime logs were kept for each of the running periods. A discussion of the sources of downtime and a comparison for different operating modes is presented

  15. Computer system operation

    International Nuclear Information System (INIS)

    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.

    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

  16. CANDU operating experience

    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)

  17. Computer system operation

    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.

  18. Inter-operability

    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

  19. Operator spin foam models

    International Nuclear Information System (INIS)

    Bahr, Benjamin; Hellmann, Frank; Kaminski, Wojciech; Kisielowski, Marcin; Lewandowski, Jerzy

    2011-01-01

    The goal of this paper is to introduce a systematic approach to spin foams. We define operator spin foams, that is foams labelled by group representations and operators, as our main tool. A set of moves we define in the set of the operator spin foams (among other operations) allows us to split the faces and the edges of the foams. We assign to each operator spin foam a contracted operator, by using the contractions at the vertices and suitably adjusted face amplitudes. The emergence of the face amplitudes is the consequence of assuming the invariance of the contracted operator with respect to the moves. Next, we define spin foam models and consider the class of models assumed to be symmetric with respect to the moves we have introduced, and assuming their partition functions (state sums) are defined by the contracted operators. Briefly speaking, those operator spin foam models are invariant with respect to the cellular decomposition, and are sensitive only to the topology and colouring of the foam. Imposing an extra symmetry leads to a family we call natural operator spin foam models. This symmetry, combined with assumed invariance with respect to the edge splitting move, determines a complete characterization of a general natural model. It can be obtained by applying arbitrary (quantum) constraints on an arbitrary BF spin foam model. In particular, imposing suitable constraints on a spin(4) BF spin foam model is exactly the way we tend to view 4D quantum gravity, starting with the BC model and continuing with the Engle-Pereira-Rovelli-Livine (EPRL) or Freidel-Krasnov (FK) models. That makes our framework directly applicable to those models. Specifically, our operator spin foam framework can be translated into the language of spin foams and partition functions. Among our natural spin foam models there are the BF spin foam model, the BC model, and a model corresponding to the EPRL intertwiners. Our operator spin foam framework can also be used for more general spin

  20. Major Naval Operations

    Science.gov (United States)

    2008-09-01

    operation were to take Turkey out of the war, open a direct link with the Entente’s embattled ally in Russia, force the Germans to shift troops from the...ing craft, while four combat craft (two tor- pedo craft and two light patrol craft) were captured in Port of Adabia. 5. Hartmut Zehrer, ed., Der...mission as a whole is accomplished. At the operational level, the intent is an expression of the commander’s operational vision. It provides a link

  1. Operation statistics of KEKB

    International Nuclear Information System (INIS)

    Kawasumi, Takeshi; Funakoshi, Yoshihiro

    2008-01-01

    KEKB accelerator has been operated since December 1998. We achieved the design peak luminosity of 10.00/nb/s. The present record is 17.12/nb/s. Detailed data of the KEKB Operation is important to evaluate the KEKB performance and to suggest the direction of the performance enhancement. We have classified all KEKB machine time into the following seven categories (1) Physics Run (2) Machine Study (3) Machine Tuning (4) Beam Tuning (5) Trouble (6) Maintenance (7) Others, to estimate the accelerator availability. In this paper we report the operation statistics of the KEKB accelerator. (author)

  2. Operational proof of automation

    International Nuclear Information System (INIS)

    Jaerschky, R.; Schlicht, K.

    1977-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 equipment techniques is further improved and if it stands in a certain ratio with a definite efficiency. (orig.) [de

  3. Licensed operating reactors

    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

  4. Licensed operating reactors

    International Nuclear Information System (INIS)

    Hartfield, R.A.

    1994-03-01

    The Nuclear Regulatory Commissions 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, the year to date (in this case calendar year 1993) and cumulative data, usually for 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

  5. Nevada Operations overview

    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

  6. Licensed operating reactors

    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

  7. Crushed Stone Operations

    Data.gov (United States)

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

  8. Construction Minerals Operations

    Data.gov (United States)

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

  9. Agricultural Minerals Operations

    Data.gov (United States)

    Department of Homeland Security — This map layer includes agricultural minerals operations in the United States. The data represent commodities covered by the Minerals Information Team (MIT) of the...

  10. Sand and Gravel Operations

    Data.gov (United States)

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

  11. Operating plan FY 1998

    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.

  12. MITS machine operations

    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

  13. Operating experience feedback

    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)

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

  15. operation zitadelle (kursk)

    African Journals Online (AJOL)

    Administrator

    describe military strategy as a sub-component of a broader term, namely national or ... the allocation of the forces and resources required to achieve those objectives could be .... tactical assets, might be considered operational level actions.

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

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

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

  19. Operable Unit Boundaries

    Data.gov (United States)

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

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

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

  2. Payroll Operational Data Store

    Data.gov (United States)

    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.

  3. Operant Conditioning and Education.

    Science.gov (United States)

    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)

  4. Operating experience with snubbers

    International Nuclear Information System (INIS)

    Levin, H.; Cudlin, R.

    1978-06-01

    Recent operating experience with hydraulic and mechanical snubbers has indicated that there is a need to evaluate current practice in the industry associated with snubber qualification testing programs, design and analysis procedures, selection and specification criteria, and the preservice inspection and inservice surveillance programs. The report provides a summary of operational experiences that represent problems that are generic throughout the industry. Generic Task A-13 is part of the NRC Program for the Resolution of Generic Issues Related to Nuclear Power Plants described in NUREG-0410. The report is based upon a rather large amount of data that have become available in the past four years. These data have been evaluated by the Division of Operating Reactors to develop a data base for use in connection with several NRC activities including Category A, Technical Activity A-13 (Snubbers); the Standard Review Plan; future Regulatory Guides; ASME Code Provisions; and various technical specifications of operating nuclear power plants

  5. Modelling arithmetic operations

    Energy Technology Data Exchange (ETDEWEB)

    Shabanov-kushnarenk, Yu P

    1981-01-01

    The possibility of modelling finite alphabetic operators using formal intelligence theory, is explored, with the setting up of models of a 3-digit adder and a multidigit subtractor, as examples. 2 references.

  6. Nuclear material operations manual

    International Nuclear Information System (INIS)

    Tyler, R.P.; Gassman, L.D.

    1978-04-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 ''play-scripts'' in which the responsible organizations and necessary actions are clearly delineated in a chronological fashion from the initiation of a transaction to its completion

  7. Operations Acceptance Management

    OpenAIRE

    Suchá, Ivana

    2010-01-01

    This paper examines the process of Operations Acceptance Management, whose main task is to control Operations Acceptance Tests (OAT). In the first part the author focuses on the theoretical ground for the problem in the context of ITSM best practices framework ITIL. Benefits, process pitfalls and possibilities for automation are discussed in this part. The second part contains a case study of DHL IT Services (Prague), where a solution optimizing the overall workflow was implemented using simp...

  8. Treasury operations management

    OpenAIRE

    Laurențiu Dumitru ANDREI; Petre BREZEANU

    2014-01-01

    Amid the globalization and centralization of treasury operations, establishing the principles for their optimal management is the instrument by means of which economic stability, market dynamics and standards of living can be ensured. The directions of these principles, as well as their flexibility, depend on correctly identifying the objectives of the financial management planning of treasury operations, in compliance with European and international policies related to this area.

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

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

  11. Operational waste volume projection

    International Nuclear Information System (INIS)

    Koreski, G.M.; Strode, J.N.

    1995-06-01

    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 are current as of June 1995

  12. Operating system MINIX

    OpenAIRE

    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.

  13. Operational Waste Volume Projection

    International Nuclear Information System (INIS)

    STRODE, J.N.

    2000-01-01

    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

  14. Pulsed rf operation analysis

    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

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

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

  16. Operation of the accelerator

    International Nuclear Information System (INIS)

    GANIL Team

    1992-01-01

    The operation of the GANIL accelerator during 1991 and the first half of 1992 is reported. Results obtained with new beams, metallic beams and the first tests with the new injector system using an ECR source installed on a 100 kV platform are also given. Statistics of operation and beam characteristics are presented. The computer control system is also discussed. (K.A.) 7 refs.; 3 figs.; 8 tabs

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

  18. Microkernel operating systems

    OpenAIRE

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

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

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

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

  2. New operator's console recorder

    International Nuclear Information System (INIS)

    Anon.

    2009-01-01

    This article described a software module that automatically records images being shown on multiple HMI or SCADA operator's displays. Videos used for monitoring activities at industrial plants can be combined with the operator console videos and data from a process historian. This enables engineers, analysts or investigators to see what is occurring in the plant, what the operator is seeing on the HMI screen, and all relevant real-time data from an event. In the case of a leak at a pumping station, investigators could watch plant video taken at a remote site showing fuel oil creeping across the floor, real-time data being acquired from pumps, valves and the receiving tank while the leak is occurring. The video shows the operator's HMI screen as well as the alarm screen that signifies the leak detection. The Longwatch Operator's Console Recorder and Video Historian are used together to acquire data about actual plant plant management because they show everything that happens during an event. The Console Recorder automatically retrieves and replays operator displays by clicking on a time-based alarm or system message. Play back of video feed is a valuable tool for training and analysis purposes, and can help mitigate insurance and regulatory issues by eliminating uncertainty and conjecture. 1 fig.

  3. Repository operational criteria analysis

    International Nuclear Information System (INIS)

    Hageman, J.P.; Chowdhury, A.H.

    1992-08-01

    The objective of the ''Repository Operational Criteria (ROC) Feasibility Studies'' (or ROC task) was to conduct comprehensive and integrated analyses of repository design, construction, and operations criteria in 10 CFR Part 60 regulations, considering the interfaces and impacts of any potential changes to those regulations. The study addresses regulatory criteria related to the preclosure aspects of the geologic repository. The study task developed regulatory concepts or potential repository operational criteria (PROC) based on analysis of a repository's safety functions and other regulations for similar facilities. These regulatory concepts or PROC were used as a basis to assess the sufficiency and adequacy of the current criteria in 10 CFR Part 60. Where the regulatory concepts were same as current operational criteria, these criteria were referenced. The operations criteria referenced or the PROC developed are given in this report. Detailed analyses used to develop the regulatory concepts and any necessary PROC for those regulations that may require a minor change are also presented. The results of the ROC task showed a need for further analysis and possible major rule change related to the design bases of a geologic repository operations area, siting, and radiological emergency planning

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

  5. Mission operations technology

    Science.gov (United States)

    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.

  6. Operation guide device

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

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

  8. Thermal Operating Modes

    International Nuclear Information System (INIS)

    Bechtel SAIC Company

    2002-01-01

    Higher and lower temperature operating modes (e.g., above and below the boiling point of water) are alternative approaches to managing the heat produced by the radioactive decay of spent nuclear fuel. Current analyses indicate that a repository at the Yucca Mountain site is likely to comply with applicable safety standards regardless of the particular thermal operating mode. Both modes have potential advantages and disadvantages. With a higher temperature operating mode (HTOM), waste packages (WPs) can be placed closer together. This reduces the number of drifts, the required emplacement area, construction costs, and occupational risks to construction workers. In addition, the HTOM would minimize the amount of water that might contact the waste for hundreds of years after closure. On the other hand, higher temperatures introduce uncertainties in the understanding of the long-term performance of the repository because of uncertainties in the thermal effects on WP lifetime and the near-field environment around the drifts. A lower temperature operating mode (LTOM) has the potential to reduce uncertainties in long-term performance of the repository by limiting the effects of temperature on WP lifetime and on the near-field environment around the drifts. Depending on the combination of operating parameters, a LTOM could require construction of additional drifts, a larger emplacement area, increased construction costs, increased occupational risks to construction works, and a longer period of ventilation than a HTOM. The repository design for the potential Yucca Mountain site is flexible and can be constructed and operated in various operating modes to achieve specific technical objectives, accommodate future policy decisions, and use of new information. For example, the flexible design can be operated across a range of temperatures and can be tailored to achieve specific thermal requirements in the future. To accommodate future policy decisions, the repository can be

  9. Operational Dynamic Configuration Analysis

    Science.gov (United States)

    Lai, Chok Fung; Zelinski, Shannon

    2010-01-01

    Sectors may combine or split within areas of specialization in response to changing traffic patterns. This method of managing capacity and controller workload could be made more flexible by dynamically modifying sector boundaries. Much work has been done on methods for dynamically creating new sector boundaries [1-5]. Many assessments of dynamic configuration methods assume the current day baseline configuration remains fixed [6-7]. A challenging question is how to select a dynamic configuration baseline to assess potential benefits of proposed dynamic configuration concepts. Bloem used operational sector reconfigurations as a baseline [8]. The main difficulty is that operational reconfiguration data is noisy. Reconfigurations often occur frequently to accommodate staff training or breaks, or to complete a more complicated reconfiguration through a rapid sequence of simpler reconfigurations. Gupta quantified a few aspects of airspace boundary changes from this data [9]. Most of these metrics are unique to sector combining operations and not applicable to more flexible dynamic configuration concepts. To better understand what sort of reconfigurations are acceptable or beneficial, more configuration change metrics should be developed and their distribution in current practice should be computed. This paper proposes a method to select a simple sequence of configurations among operational configurations to serve as a dynamic configuration baseline for future dynamic configuration concept assessments. New configuration change metrics are applied to the operational data to establish current day thresholds for these metrics. These thresholds are then corroborated, refined, or dismissed based on airspace practitioner feedback. The dynamic configuration baseline selection method uses a k-means clustering algorithm to select the sequence of configurations and trigger times from a given day of operational sector combination data. The clustering algorithm selects a simplified

  10. Using fractional order method to generalize strengthening generating operator buffer operator and weakening buffer operator

    OpenAIRE

    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.

  11. Upgrade of reactor operation technology

    International Nuclear Information System (INIS)

    Itoh, Hideaki; Suzuki, Toshiaki; O-kawa, Toshikatsu

    2003-01-01

    To improve operational reliability and availability, the operation technology for a fast reactor was developed in the ''JOYO''. This report describes the upgrading of the simulator, plant operation management tools and fuel handling system for the MK-III core operation. The simulator was modified to the MK-III version to verify operation manuals, and to train operators in MK-III operation. The plant operation management tool was replaced on the operation experience to increase the reliability and efficiency of plant management works relating to plant operation and maintenance. To shorten the refueling period, the fuel handling system was upgraded to full automatic remote control. (author)

  12. Licensed operating reactors

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

  13. Operator representations of frames

    DEFF Research Database (Denmark)

    Christensen, Ole; Hasannasab, Marzieh

    2017-01-01

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

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

  15. ITER-FEAT operation

    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)

  16. Licensed operating reactors

    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

  17. Aging and operation results

    International Nuclear Information System (INIS)

    Chaussade, J.P.

    1984-01-01

    The correlation between the different accelerated aging methods and operation reality has to be done with solid and representative elements in matter of tests as well as in operating experience. In 1990 in France, the first unit will be 13 years operating, there will be 34 units of 900 MW PWR and 18 units of 1300 MW PWR in operation. The total of experience will be equivalent to 400 reactor-years. Only computerised means permit to collect all corresponding events, to manage them and to draw a lot of conclusions. One describes these computerised applications explaining the different events collected, data input and interrogating possibilities. The first application, called ''events file'', records all important events in nuclear plants. For each of these events, an event reporting format is set up as soon as first informations are known and then is put into the file. An updating is performed when the event is better known and analyzed. Interrogating programs allow no specialist to access easily to this data bank. So it is possible to collect events of the same nature, of the same equipments or of the same systems. The second application called S.R.D.F. (fiability data bank system) collects all maintenance operations on certain mechanical and electrical equipment. These two computerized applications complete on another in the way they allow to do fiability and availability studies for some equipments or for some elements of a nuclear plant [fr

  18. ITER-FEAT operation

    International Nuclear Information System (INIS)

    Shimomura, Y.; Huguet, M.; Mizoguchi, T.; Murakami, Y.; Polevoi, A.R.; Shimada, M.; Aymar, R.; Chuyanov, V.A.; 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 ten years of operation will be devoted primarily to physics issues at low neutron fluence and the following ten years of 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 and 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 a day but also in involving the worldwide fusion community and in promoting scientific competition among the ITER Parties. (author)

  19. Radioastron flight operations

    Science.gov (United States)

    Altunin, V. I.; Sukhanov, K. G.; Altunin, K. R.

    1993-01-01

    Radioastron is a space-based very-long-baseline interferometry (VLBI) mission to be operational in the mid-90's. The spacecraft and space radio telescope (SRT) will be designed, manufactured, and launched by the Russians. The United States is constructing a DSN subnet to be used in conjunction with a Russian subnet for Radioastron SRT science data acquisition, phase link, and spacecraft and science payload health monitoring. Command and control will be performed from a Russian tracking facility. In addition to the flight element, the network of ground radio telescopes which will be performing co-observations with the space telescope are essential to the mission. Observatories in 39 locations around the world are expected to participate in the mission. Some aspects of the mission that have helped shaped the flight operations concept are: separate radio channels will be provided for spacecraft operations and for phase link and science data acquisition; 80-90 percent of the spacecraft operational time will be spent in an autonomous mode; and, mission scheduling must take into account not only spacecraft and science payload constraints, but tracking station and ground observatory availability as well. This paper will describe the flight operations system design for translating the Radioastron science program into spacecraft executed events. Planning for in-orbit checkout and contingency response will also be discussed.

  20. Affine Equivalence and Constructions of Cryptographically Strong Boolean Functions

    Science.gov (United States)

    2013-09-01

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

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

  2. Discovery of Boolean metabolic networks: integer linear programming based approach.

    Science.gov (United States)

    Qiu, Yushan; Jiang, Hao; Ching, Wai-Ki; Cheng, Xiaoqing

    2018-04-11

    Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects. In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature. Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at " http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip ".

  3. Further Results on Constructions of Generalized Bent Boolean Functions

    Science.gov (United States)

    2016-03-01

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

  4. Reconfigurable Boolean logic using magnetic single-electron transistors

    Czech Academy of Sciences Publication Activity Database

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

    2015-01-01

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

  5. Marking for Structure using Boolean Feedback | Louw | Journal for ...

    African Journals Online (AJOL)

    This paper presents evidence that marking student texts with well considered checklists is more effective than marking by hand. An experiment conducted on first-year students illustrated that the checklists developed to mark introductions, conclusions and paragraphs yielded better revision results than handwritten ...

  6. On bent and semi-bent quadratic Boolean functions

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  7. Smart molecules at work--mimicking advanced logic operations.

    Science.gov (United States)

    Andréasson, Joakim; Pischel, Uwe

    2010-01-01

    Molecular logic is an interdisciplinary research field, which has captured worldwide interest. This tutorial review gives a brief introduction into molecular logic and Boolean algebra. This serves as the basis for a discussion of the state-of-the-art and future challenges in the field. Representative examples from the most recent literature including adders/subtractors, multiplexers/demultiplexers, encoders/decoders, and sequential logic devices (keypad locks) are highlighted. Other horizons, such as the utility of molecular logic in bio-related applications, are discussed as well.

  8. Licensed operating reactors

    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

  9. About APPLE II Operation

    International Nuclear Information System (INIS)

    Schmidt, T.; Zimoch, D.

    2007-01-01

    The operation of an APPLE II based undulator beamline with all its polarization states (linear horizontal and vertical, circular and elliptical, and continous variation of the linear vector) requires an effective description allowing an automated calculation of gap and shift parameter as function of energy and operation mode. The extension of the linear polarization range from 0 to 180 deg. requires 4 shiftable magnet arrrays, permitting use of the APU (adjustable phase undulator) concept. Studies for a pure fixed gap APPLE II for the SLS revealed surprising symmetries between circular and linear polarization modes allowing for simplified operation. A semi-analytical model covering all types of APPLE II and its implementation will be presented

  10. Licensed operating reactors

    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

  11. Simulators for NPP operators

    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

  12. Theory of linear operations

    CERN Document Server

    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.

  13. Operations management for construction

    CERN Document Server

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

  14. ORNL radioactive waste operations

    International Nuclear Information System (INIS)

    Sease, J.D.; King, E.M.; Coobs, J.H.; Row, T.H.

    1982-01-01

    Since its beginning in 1943, ORNL has generated large amounts of solid, liquid, and gaseous radioactive waste material as a by-product of the basic research and development work carried out at the laboratory. The waste system at ORNL has been continually modified and updated to keep pace with the changing release requirements for radioactive wastes. Major upgrading projects are currently in progress. The operating record of ORNL waste operation has been excellent over many years. Recent surveillance of radioactivity in the Oak Ridge environs indicates that atmospheric concentrations of radioactivity were not significantly different from other areas in East Tennesseee. Concentrations of radioactivity in the Clinch River and in fish collected from the river were less than 4% of the permissible concentration and intake guides for individuals in the offsite environment. While some radioactivity was released to the environment from plant operations, the concentrations in all of the media sampled were well below established standards

  15. Licensed operating reactors

    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

  16. International co-operation

    International Nuclear Information System (INIS)

    1997-01-01

    In 1996, Nuclear Regulatory Authority of the Slovak Republic (NRA SR) ensured the Slovak Republic (SR) obligations with relation to the international agreements and with the SR membership in the IAEA.International co-operation has been ensured on the basis of the bilateral international agreements. With the Ministry of Foreign Affairs co-operation, the SR fulfilled its financial obligations to this organization in due time and in the full scope. Representing Central and Eastern Europe interest in the Board of Governors, the SR participation in the highest executive in the highest executive authority was finished in 1996.The Board of Governors Vice-chairman position was executed by NRA SR Chairman. 5 national and 6 regional technical co-operation and assistance projects were realized in 1996. 12 organizations participated in these projects and accordingly 104 experts took part in training programmes, scientific visits or as the mission members abroad. Besides, Slovak experts participated at work of technical advisory and consultation groups with the significant assistance. In the framework of IAEA co-operation, the SR was visited by 11 expert missions formed by 28 experts from 19 countries including IAEA. Slovak organizations, namely institutes of the Academy of Sciences, Slovak research centres and universities participated in IAEA scientific and research activities through NRA SR. 15 scientific contracts in total were approved and realized and these contracts are utilized as supplementary financing of the own scientific and research projects. Other international co-operation and regional co-operation activities of the NRA SR in 1996 are reviewed

  17. GNF2 Operating Experience

    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

  18. SSCL Commissioning and Operations

    International Nuclear Information System (INIS)

    1992-01-01

    The SSC, with an energy of 20 TeV/Beam, requires a sequence of individual accelerators of increasing energy in the injector chain. These are the Linac, Low Energy Booster, Medium Energy Booster, and High Energy Booster. Each accelerator system must be completed in sequence in order to provide beam to the next higher energy accelerator. The collider itself is comprised of ten sectors, each of which in terms of superconducting magnet bending strength, is equivalent to two HEB injectors. The completion of all injectors and collider sectors is required before stored beams can circulate in preparation for colliding beam operation. Four experimental halls are planned for the detector systems. Each major detector will be assembled in one of the halls by a world-wide collaboration of scientists. In addition, above ground facilities provide shops and test facilities for accelerator technical systems, superconducting magnet and materials research and development, and for detector assembly and operations. The purpose of this report is to present a plan for the sequential commissioning and operation of these individual accelerators and other technical facilities of the SSC. A central objective of this plan is to describe the activities at the SSCL that are not included as part of the construction project TPC, even though they occur during the overall project construction time-frame. Examples of such activities include the operation of general laboratory facilities and services not specifically related to construction, the operating costs for the individual accelerators in the injector chain once these facilities have been commissioned, and the costs of SSCL physics research groups. The Department of Energy has provided the following decision with regard to these operations categories for the SSCL

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

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

  1. TRIGA reactor operating experience

    International Nuclear Information System (INIS)

    Anderson, T.V.

    1970-01-01

    The Oregon State TRIGA Reactor (OSTR) has been in operation 3 years. Last August it was upgraded from 250 kW to 1000 kW. This was accomplished with little difficulty. During the 3 years of operation no major problems have been experienced. Most of the problems have been minor in nature and easily corrected. They came from lazy susan (dry bearing), Westronics Recorder (dead spots in the range), The Reg Rod Magnet Lead-in Circuit (a new type lead-in wire that does not require the lead-in cord to coil during rod withdrawal hss been delivered, much better than the original) and other small corrections

  2. Topics in Operator Theory

    CERN Document Server

    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.

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

  4. Systemic Operational Design: Enhancing the Joint Operation Planning Process

    National Research Council Canada - National Science Library

    Delacruz, Victor J

    2007-01-01

    Operational level commanders and their staffs require relevant and current joint doctrine that articulates the critical function of operational design and its role in the Joint Operation Planning Process (JOPP...

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

  6. The operation and maintenance manual

    International Nuclear Information System (INIS)

    Stoll, A.; Krotil, H.; Klein, W.

    1976-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. The operating manual is an essential element in bringing man and machine in harmony. This is necessary for safe and, as far as possible, uninterrupted operation of the power plant. The operating manual is the only document containing binding instructions for plant operation. All the tasks of plant operation which are carried out by plant staff are described in the operating manual in a form which is as clear and comprehensible as possible. A considerable number of these tasks can only be carried out by man, namely: 1) tasks concerning operational organization, 2) all non-automated areas of plant operation. (orig./TK) [de

  7. Cyber Operations Virtual Environment

    Science.gov (United States)

    2010-09-01

    capability independent of the operator’s willingness to make target responses (See, Macmillan & Creelman , 1991; Parasuraman, Masalonis, & Hancock, 2000...Ma, K-L. (2004). Visualization for security. Computer Graphics, 38, 4-6. Macmillan, N. A., & Creelman , C. D. (1991). Detection theory: A user’s

  8. Mission operations management

    Science.gov (United States)

    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.

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

  10. Operations research and development

    African Journals Online (AJOL)

    The paper begins with a discussion of the concepts “operations research” .... have in common an emphasis on the “scientific” and quantitative aspects of .... It is important to ensure that the MCDA methodologies are sufficiently simple and .... 2006, is an excellent example of the application of OR techniques to a topic with.

  11. Operating US power reactors

    International Nuclear Information System (INIS)

    Silver, E.G.

    1988-01-01

    This update, which appears regularly in each issue of Nuclear Safety, surveys the operations of those power reactors in the US which have been issued operating licenses. Table 1 shows the number of such reactors and their net capacities as of September 30, 1987, the end of the three-month period covered in this report. Table 2 lists the unit capacity and forced outage rate for each licensed reactor for each of the three months (July, August, and September 1987) covered in this report and the cumulative values of these parameters since the beginning of commercial operation. In addition to the tabular data, this article discusses other significant occurrences and developments that affected licensed US power reactors during this reporting period. Status changes at Braidwood Unit 1, Nine Mile Point 2, and Beaver Valley 2 are discussed. Other occurrences discussed are: retraining of control-room operators at Peach Bottom; a request for 25% power for Shoreham, problems at Fermi 2 which delayed the request to go to 75% power; the results of a safety study of the N Reactor at Hanford; a proposed merger of Pacific Gas and Electric with Sacramento Municipal Utility District which would result in the decommissioning of Rancho Seco; the ordered shutdown of Oyster Creek; a minor radioactivity release caused by a steam generator tube rupture at North Anna 1; and 13 fines levied by the NRC on reactor licensees

  12. Cutback for grid operators

    International Nuclear Information System (INIS)

    Meulmeester, P.; De Laat, J.

    2006-01-01

    The Netherlands Competition Authority (NMa), in which the Office of Energy Regulation (DTe) is included plan to decrease the capital cost compensation (or weighted average cost of capital or WACC) for grid operators. In this article it is explained how the compensation is calculated, why this measure will be taken and what the effects of this cutback are [nl

  13. Snow-clearing operations

    CERN Multimedia

    EN Department

    2010-01-01

    To facilitate snow clearing operations, which commence at 4.30 in the morning, all drivers of CERN cars are kindly requested to park them together in groups. This will help us greatly assist us in our work. Thank-you for your help. Transport Group / EN-HE Tel. 72202

  14. Splunk operational intelligence cookbook

    CERN Document Server

    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!

  15. Global Operations Coevolution

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

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

  17. [Lateral epicondylitis: conservative - operative].

    Science.gov (United States)

    Altintas, Burak; Greiner, Stefan

    2016-10-01

    Lateral epicondylitis is a common disease of the common extensor origin at the lateral humerus. Despite its common self-limitation it can lead to chronic therapy-resistant pain with remarkable functional disability of the affected arm. Different conservative and operative treatment options of lateral epicondylitis are described and compared regarding benefits and risks. Additionally, recent surgical techniques and their complications are mentioned. Based on the current literature, it is shown which treatment option can be recommended. This review was based on the literature analysis in PubMed regarding "conservative and operative therapy of lateral epicondylitis" as well as the clinical experience of the authors. Conservative treatment is the primary choice for the treatment of lateral epicondylitis if concomitant pathologies such as instability among others can be excluded. It should include strengthening against resistance with eccentric stretching of the extensor group. In persistent cases, operative treatment is warranted. Resection of the pathologic tissue at the extensor origin with debridement and refixation of the healthy tendinous tissue yields good results. Most patients with lateral epicondylitis can be treated conservatively with success. Radiological evaluation should be performed in therapy-resistant cases. In the case of partial or complete rupture of the extensor origin, operative therapy is indicated.

  18. Operational risk assessment.

    Science.gov (United States)

    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.

  19. Distributed Operating Systems

    NARCIS (Netherlands)

    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

  20. Space Operations Learning Center

    Science.gov (United States)

    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.