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
Pseudo Boolean Programming for Partially Ordered Genomes
Angibaud, Sébastien; Fertin, Guillaume; Thévenin, Annelyse; Vialette, Stéphane
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Starting from a partial order between genes of a genome, one method to find a total order consists in optimizing a given measure between a linear extension of this partial order and a given total order of a close and well-known genome. However, for most common measures, the problem turns out to be NP-hard. In this paper, we propose a (0,1)-linear programming approach to compute a linear extension of one genome that maximizes the number of common intervals (resp. the number of adjacencies) between this linear extension and a given total order. Next, we propose an algorithm to find linear extensions of two partial orders that maximize the number of adjacencies.
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.
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
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.
GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS
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...
On Boolean functions with generalized cryptographic properties
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.
Defining the Role of Free Flaps in Partial Breast Reconstruction.
Smith, Mark L; Molina, Bianca J; Dayan, Erez; Jablonka, Eric M; Okwali, Michelle; Kim, Julie N; Dayan, Joseph H
2018-03-01
Free flaps have a well-established role in breast reconstruction after mastectomy; however, their role in partial breast reconstruction remains poorly defined. We reviewed our experience with partial breast reconstruction to better understand indications for free tissue transfer. A retrospective review was performed of all patients undergoing partial breast reconstruction at our center between February 2009 and October 2015. We evaluated the characteristics of patients who underwent volume displacement procedures versus volume replacement procedures and free versus pedicled flap reconstruction. There were 78 partial breast reconstructions, with 52 reductions/tissue rearrangements (displacement group) and 26 flaps (replacement group). Bra cup size and body mass index (BMI) were significantly smaller in the replacement group. Fifteen pedicled and 11 free flaps were performed. Most pedicled flaps (80.0%) were used for lateral or upper pole defects. Most free flaps (72.7%) were used for medial and inferior defects or when there was inadequate donor tissue for a pedicled flap. Complications included hematoma, cellulitis, and one aborted pedicled flap. Free and pedicled flaps are useful for partial breast reconstruction, particularly in breast cancer patients with small breasts undergoing breast-conserving treatment (BCT). Flap selection depends on defect size, location, and donor tissue availability. Medial defects are difficult to reconstruct using pedicled flaps due to arc of rotation and intervening breast tissue. Free tissue transfer can overcome these obstacles. Confirming negative margins before flap reconstruction ensures harvest of adequate volume and avoids later re-operation. Judicious use of free flaps for oncoplastic reconstruction expands the possibility for breast conservation. Thieme Medical Publishers 333 Seventh Avenue, New York, NY 10001, USA.
Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Free Boolean Topological Groups
Directory of Open Access Journals (Sweden)
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
Skew category algebras associated with partially defined dynamical systems
DEFF Research Database (Denmark)
Lundström, Patrik; Öinert, Per Johan
2012-01-01
We introduce partially defined dynamical systems defined on a topological space. To each such system we associate a functor s from a category G to Topop and show that it defines what we call a skew category algebra A ⋊σ G. We study the connection between topological freeness of s and, on the one...... hand, ideal properties of A ⋊σ G and, on the other hand, maximal commutativity of A in A ⋊σ G. In particular, we show that if G is a groupoid and for each e ∈ ob(G) the group of all morphisms e → e is countable and the topological space s(e) is Tychonoff and Baire. Then the following assertions...... are equivalent: (i) s is topologically free; (ii) A has the ideal intersection property, i.e. if I is a nonzero ideal of A ⋊σ G, then I ∩ A ≠ {0}; (iii) the ring A is a maximal abelian complex subalgebra of A ⋊σ G. Thereby, we generalize a result by Svensson, Silvestrov and de Jeu from the additive group...
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
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
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.
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.
Properties of Boolean orthoposets
Tkadlec, Josef
1993-10-01
A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.
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)
Nonlinear threshold Boolean automata networks and phase transitions
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...
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.
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.
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.
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
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...
Computing preimages of Boolean networks.
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.
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
Defining degree of aortic occlusion for partial-REBOA: A computed tomography study on large animals.
Reva, Viktor A; Matsumura, Yosuke; Samokhvalov, Igor M; Pochtarnik, Alexander A; Zheleznyak, Igor S; Mikhailovskaya, Ekaterina M; Morrison, Jonathan J
2018-04-20
Partial resuscitative endovascular balloon occlusion of the aorta (P-REBOA) is a modified REBOA technique designed to help ameliorate ischemia-reperfusion injury. The balloon is partially deflated, allowing a proportion of aortic flow distal to the balloon. The aim of this study is to use an ovine model of haemorrhagic shock to correlate the degree of occlusion to several hemodynamic indices. Six sheep weighing 35-46 kg underwent a controlled venous haemorrhage inside a CT scanner until the systolic arterial pressure (AP) dropped to fashion (proximal: r 2 = 0.85, p trend (r 2 = 0.90, p < 0.001). The relationship between percentage occlusion and IBP was sigmoid. MAP values became significantly different at 40-49% occlusion and more (p < 0.01). Furthermore, a drop in the distal pulse pressure from 7.0 (5.5-16.5) to 2.0 (1.5-5.0) mmHg was observed at 80% occlusion. All animals had femoral pulse pressure <5 mmHg at 80% of occlusion and more, which also coincided with the observed loss of pulsatility of the femoral wave-form. Serial CT angiography at an ovine model of haemorrhagic shock demonstrates a correlation between the femoral MAP, F/C pressure gradient and degree of zone I P-REBOA during the staged partial aortic occlusion. These parameters should be considered potential parameters to define the degree of P-REBOA during animal research and clinical practice. Copyright © 2018 Elsevier Ltd. All rights reserved.
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
Optical programmable Boolean logic unit.
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.
Boolean gates on actin filaments
International Nuclear Information System (INIS)
Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew
2016-01-01
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Boolean gates on actin filaments
Energy Technology Data Exchange (ETDEWEB)
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Reliable dynamics in Boolean and continuous networks
International Nuclear Information System (INIS)
Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P
2012-01-01
We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)
Quantum algorithms for testing Boolean functions
Directory of Open Access Journals (Sweden)
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
Optical reversible programmable Boolean logic unit.
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.
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.
Boolean integral calculus for digital systems
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.
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/.
Stability of Boolean multilevel networks.
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.
Energy Technology Data Exchange (ETDEWEB)
Bassuk, James; Lendvay, Thomas S.; Sweet, Robert; Han, Chang-Hee; Soygur, Tarkan; Cheng, Jan-Fang; Plaire, J. Chadwick; Charleston, Jay S.; Charleston, Lynne B.; Bagai, Shelly; Cochrane, Kimberly; Rubio, Eric; Bassuk, James A.; Fuchs, Elaine
2007-06-21
Diseases and conditions affecting the lower urinary tract are a leading cause of dysfunctional sexual health, incontinence, infection, and kidney failure. The growth, differentiation, and repair of the bladder's epithelial lining are regulated, in part, by fibroblast growth factor (FGF)-7 and -10 via a paracrine cascade originating in the mesenchyme (lamina propria) and targeting the receptor for FGF-7 and -10 within the transitional epithelium (urothelium). The FGF-7 gene is located at the 15q15-q21.1 locus on chromosome 15 and four exons generate a 3.852-kb mRNA. Five duplicated FGF-7 gene sequences that localized to chromosome 9 were predicted not to generate functional protein products, thus validating the use of FGF-7-null mice as an experimental model. Recombinant FGF-7 and -10 induced proliferation of human urothelial cells in vitro and transitional epithelium of wild-type and FGF-7-null mice in vivo.To determine the extent that induction of urothelial cell proliferation during the bladder response to injury is dependent on FGF-7, an animal model of partial bladder outlet obstruction was developed. Unbiased stereology was used to measure the percentage of proliferating urothelial cells between obstructed groups of wild-type and FGF-7-null mice. The stereological analysis indicated that a statistical significant difference did not exist between the two groups, suggesting that FGF-7 is not essential for urothelial cell proliferation in response to partial outlet obstruction. In contrast, a significant increase in FGF-10 expression was observed in the obstructed FGF-7-null group, indicating that the compensatory pathway that functions in this model results in urothelial repair.
Totally optimal decision trees for Boolean functions
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
Random networks of Boolean cellular automata
Energy Technology Data Exchange (ETDEWEB)
Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).
Random networks of Boolean cellular automata
International Nuclear Information System (INIS)
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms
Directory of Open Access Journals (Sweden)
Šćepanović Miodrag
2013-01-01
Full Text Available Bacground/Aim. Retentive force of removable partial denture (RPD directly depends on elastic force of stretched retentive clasp arms (RCAs. During deflection RCA must have even stress distribution. Safety factor is the concept which can be applied in estimating durability and functionality of RCAs. This study was based on analyzing properties of clasps designed by conventional clasp wax profiles and defining the optimal shapes of RCAs for stress distribution and safety factor aspects. Methods. Computer-aided-design (CAD models of RCAs with simulated properties of materials used for fabrication of RPD cobalt-chromium-molybdenum (CoCrMo alloy, commercially pure titanium (CPTi and polyacetale were analyzed. Results. The research showed that geometrics of Rapidflex profiles from the BIOS concept are defined for designing and modeling RCAs from CoCrMo alloys. I-Bar and Bonihard clasps made from CPTi might have the same design as Co- CrMo clasp only by safety factor aspect, but it is obvious that CPTi are much more flexible, so their shape must be more massive. Polyacetale clasps should not be fabricated by BIOS concept for CoCrMo alloy. A proof for that is the low value of safety factor. Conclusion. The BIOS concept should be used only for RCAs made of CoCrMo alloy and different wax profiles should be used for fabricating clasps of other investigated materials. The contribution of this study may be the improvement of present systems for defining the clasps shapes made from CoCrMo alloys. The more significant application is possibility of creating new concepts in defining shapes of RCA made from CPTi and polyacetale.
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.
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.
Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks
Gong, Xinwei
This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing
Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications
Pan, Chenyun; Naeemi, Azad
2017-01-01
The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...
A complexity theory based on Boolean algebra
DEFF Research Database (Denmark)
Skyum, Sven; Valiant, Leslie
1985-01-01
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...
Evolutionary Algorithms for Boolean Queries Optimization
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.
2006-01-01
Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics
Boolean Queries Optimization by Genetic Algorithms
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav
2005-01-01
Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research
Practical algorithms for linear boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Practical algorithms for linear Boolean-width
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
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.
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.
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Optimal stabilization of Boolean networks through collective influence
Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming
2018-03-01
Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.
Boolean 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.
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.
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
Vector Boolean Functions: applications in symmetric cryptography
Álvarez Cubero, José Antonio
2015-01-01
Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...
Boolean 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
The Boolean algebra and central Galois algebras
Directory of Open Access Journals (Sweden)
George Szeto
2001-01-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Boolean orthoposets and two-valued states on them
Tkadlec, Josef
1992-06-01
A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.
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
Algorithms over partially ordered sets
DEFF Research Database (Denmark)
Baer, Robert M.; Østerby, Ole
1969-01-01
in partially ordered sets, answer the combinatorial question of how many maximal chains might exist in a partially ordered set withn elements, and we give an algorithm for enumerating all maximal chains. We give (in § 3) algorithms which decide whether a partially ordered set is a (lower or upper) semi......-lattice, and whether a lattice has distributive, modular, and Boolean properties. Finally (in § 4) we give Algol realizations of the various algorithms....
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
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
Synthesizing biomolecule-based Boolean logic gates.
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.
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.
Synthesizing Biomolecule-based Boolean Logic Gates
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
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.
Boolean Operations with Prism Algebraic Patches
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
A transition calculus for Boolean functions. [logic circuit analysis
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.
Algebraic model checking for Boolean gene regulatory networks.
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.
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.
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...
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.
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....
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.
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.
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....
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
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
Free Boolean algebras over unions of two well orderings
Czech Academy of Sciences Publication Activity Database
Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw
2009-01-01
Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009
Boolean comparative analysis of qualitative data : a methodological note
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
Parallel object-oriented term rewriting : the booleans
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
A Construction of Boolean Functions with Good Cryptographic Properties
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
Wilcox, R A; Fauq, A; Kozikowski, A P; Nahorski, S R
1997-02-03
The novel synthetic analogues D-3-fluoro-myo-inositol 1,5-bisphosphate-4-phosphorothioate, [3F-Ins(1,5)P2-4PS], D-3-fluoro-myo-inositol 1,4-bisphosphate-5-phosphorothioate [3F-Ins(1,4)P2-5PS], and D-3-fluoro-myo-inositol 1-phosphate-4,5-bisphosphorothioate [3F-Ins(1)P-(4,5)PS2] were utilised to define the structure-activity relationships which could produce partial agonism at the Ca2+ mobilising myo-inositol 1,4,5-trisphosphate [Ins(1,4,5)P3] receptor. Based on prior structure-activity data we hypothesised that the minimal structural requirements for lns(1,4,5)P3 receptor partial agonism, were phosphorothioate substitution of the crucial vicinal 4,5-bisphosphate pair accompanied by another structural perturbation, such fluorination of 3-position of the myo-inositol ring. All the analogues fully displaced [3H]Ins(1,4,5)P3 from a single Ins(1,4,5)P3 binding site in pig cerebellar membranes [3F-Ins(1,5)P2-4PS (1C50 = 26 nM), 3F-Ins(1,4)P2-5PS (IC50 = 80 nM) and 3F-Ins(1)P-(4,5)PS2 (IC50 = 109 nM) cf. Ins(1,4,5)P3 (IC50 = 11 nM)]. In contrast, 3F-Ins(1,5)P2-4PS (IC50 = 424 nM) and 3F-Ins(1,4)P2-5PS (IC50 = 3579 nM) were weak full agonists at the Ca2+ mobilising Ins(1,4,5)P3 receptor of permeabilised SH-SY5Y neuroblastoma cells, being respectively 4- and 36-fold less potent than Ins(1,4,5)P3 (EC50 = 99 nM). While 3F-Ins(1)P-(4,5)PS2 (EC50 = 11345 nM) was a partial agonist releasing only 64.3 +/- 1.9% of the Ins(1,4,5)P3-sensitive intracellular Ca2+ pools. 3F-Ins(1)P-(4,5)PS2 was unique among the Ins(1,4,5)P3 receptor partial agonists so far identified in having a relatively high affinity for the Ins(1,4,5)P3 binding site, accompanied by a significant loss of intrinsic activity for Ca2+ mobilisation. This improved affinity was probably due to the retention of the 1-position phosphate, which enhances interaction with the Ins-(1,4,5)P3 receptor. 3F-Ins(1)P-(4,5)PS2 may be an important lead compound for the development of efficient Ins(1,4,5)P3 receptor antagonists.
On the number of different dynamics in Boolean networks with deterministic update schedules.
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.
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
Boolean Functions with a Simple Certificate for CNF Complexity
Czech Academy of Sciences Publication Activity Database
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Elements of Boolean-Valued Dempster-Shafer Theory
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2000-01-01
Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
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.
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
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
3D Boolean operations in virtual surgical planning.
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.
On the Computation of Comprehensive Boolean Gröbner Bases
Inoue, Shutaro
We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.
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.
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate
International Nuclear Information System (INIS)
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-01-01
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
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.
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
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
Complexity classifications for different equivalence and audit problems for Boolean circuits
BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
2010-01-01
We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.
BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool
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…
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.
Complex network analysis of state spaces for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)
2008-01-15
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.
Complex network analysis of state spaces for random Boolean networks
International Nuclear Information System (INIS)
Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya
2008-01-01
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two
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.
Adapted Boolean network models for extracellular matrix formation
Directory of Open Access Journals (Sweden)
Wollbold Johannes
2009-07-01
Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF
Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles
Directory of Open Access Journals (Sweden)
Shah Imran
2011-07-01
Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our
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)
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.
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
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...
Energy Technology Data Exchange (ETDEWEB)
Nguyen, Brandon T., E-mail: Brandon.Nguyen@act.gov.au [Department of Radiation Oncology, Peter MacCallum Cancer Centre, East Melbourne, Victoria (Australia); Canberra Hospital, Radiation Oncology Department, Garran, ACT (Australia); Deb, Siddhartha [Department of Anatomical Pathology, Peter MacCallum Cancer Centre, East Melbourne, Victoria (Australia); Victorian Cancer Biobank, Cancer Council of Victoria, Carlton, Victoria (Australia); Fox, Stephen [Department of Anatomical Pathology, Peter MacCallum Cancer Centre, East Melbourne, Victoria (Australia); Hill, Prudence [Department of Anatomical Pathology, St. Vincent' s Hospital Melbourne, Fitzroy, Victoria (Australia); Collins, Marnie [Centre for Biostatistics and Clinical Trials, Peter MacCallum Cancer Centre, East Melbourne, Victoria (Australia); Chua, Boon H. [Department of Radiation Oncology, Peter MacCallum Cancer Centre, East Melbourne, Victoria (Australia); University of Melbourne, Parkville, Victoria (Australia)
2012-12-01
Purpose: To determine an appropriate clinical target volume for partial breast radiation therapy (PBRT) based on the spatial distribution of residual invasive and in situ carcinoma after wide local excision (WLE) for early breast cancer or ductal carcinoma in situ (DCIS). Methods and Materials: We performed a prospective pathologic study of women potentially eligible for PBRT who had re-excision and/or completion mastectomy after WLE for early breast cancer or DCIS. A pathologic assessment protocol was used to determine the maximum radial extension (MRE) of residual carcinoma from the margin of the initial surgical cavity. Women were stratified by the closest initial radial margin width: negative (>1 mm), close (>0 mm and {<=}1 mm), or involved. Results: The study population was composed of 133 women with a median age of 59 years (range, 27-82 years) and the following stage groups: 0 (13.5%), I (40.6%), II (38.3%), and III (7.5%). The histologic subtypes of the primary tumor were invasive ductal carcinoma (74.4%), invasive lobular carcinoma (12.0%), and DCIS alone (13.5%). Residual carcinoma was present in the re-excision and completion mastectomy specimens in 55.4%, 14.3%, and 7.2% of women with an involved, close, and negative margin, respectively. In the 77 women with a noninvolved radial margin, the MRE of residual disease, if present, was {<=}10 mm in 97.4% (95% confidence interval 91.6-99.5) of cases. Larger MRE measurements were significantly associated with an involved margin (P<.001), tumor size >30 mm (P=.03), premenopausal status (P=.03), and negative progesterone receptor status (P=.05). Conclusions: A clinical target volume margin of 10 mm would encompass microscopic residual disease in >90% of women potentially eligible for PBRT after WLE with noninvolved resection margins.
International Nuclear Information System (INIS)
Nguyen, Brandon T.; Deb, Siddhartha; Fox, Stephen; Hill, Prudence; Collins, Marnie; Chua, Boon H.
2012-01-01
Purpose: To determine an appropriate clinical target volume for partial breast radiation therapy (PBRT) based on the spatial distribution of residual invasive and in situ carcinoma after wide local excision (WLE) for early breast cancer or ductal carcinoma in situ (DCIS). Methods and Materials: We performed a prospective pathologic study of women potentially eligible for PBRT who had re-excision and/or completion mastectomy after WLE for early breast cancer or DCIS. A pathologic assessment protocol was used to determine the maximum radial extension (MRE) of residual carcinoma from the margin of the initial surgical cavity. Women were stratified by the closest initial radial margin width: negative (>1 mm), close (>0 mm and ≤1 mm), or involved. Results: The study population was composed of 133 women with a median age of 59 years (range, 27-82 years) and the following stage groups: 0 (13.5%), I (40.6%), II (38.3%), and III (7.5%). The histologic subtypes of the primary tumor were invasive ductal carcinoma (74.4%), invasive lobular carcinoma (12.0%), and DCIS alone (13.5%). Residual carcinoma was present in the re-excision and completion mastectomy specimens in 55.4%, 14.3%, and 7.2% of women with an involved, close, and negative margin, respectively. In the 77 women with a noninvolved radial margin, the MRE of residual disease, if present, was ≤10 mm in 97.4% (95% confidence interval 91.6-99.5) of cases. Larger MRE measurements were significantly associated with an involved margin (P 30 mm (P=.03), premenopausal status (P=.03), and negative progesterone receptor status (P=.05). Conclusions: A clinical target volume margin of 10 mm would encompass microscopic residual disease in >90% of women potentially eligible for PBRT after WLE with noninvolved resection margins.
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.
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.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.
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.
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....
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
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
Boolean and advanced searching for EDGAR data on www.sec.gov
Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.
Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions
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
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
Graphene-based non-Boolean logic circuits
Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.
2013-10-01
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.
Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.
Dallidis, Stylianos E; Karafyllidis, Ioannis G
2014-09-01
To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.
Modeling integrated cellular machinery using hybrid Petri-Boolean networks.
Directory of Open Access Journals (Sweden)
Natalie Berestovsky
Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them
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.
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.
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
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.
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
Improving the quantum cost of reversible Boolean functions using reorder algorithm
Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf
2018-05-01
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.
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.
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.
The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students
Tomaszewski, Robert
2016-01-01
Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…
Application of fuzzy logic to Boolean models for digital soil assessment
Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.
2011-01-01
Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between
Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics
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
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...
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Describing the What and Why of Students' Difficulties in Boolean Logic
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
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
Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.
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…
Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type
Matoušek, Milan; Pták, Pavel
2015-12-01
Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.
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.
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
User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.
Ensor, Pat
1992-01-01
Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…
An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
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.
Exact sampling from conditional Boolean models with applications to maximum likelihood inference
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
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
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
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.
DEFF Research Database (Denmark)
Munk-Madsen, Andreas
2005-01-01
"Project" is a key concept in IS management. The word is frequently used in textbooks and standards. Yet we seldom find a precise definition of the concept. This paper discusses how to define the concept of a project. The proposed definition covers both heavily formalized projects and informally...... organized, agile projects. Based on the proposed definition popular existing definitions are discussed....
Smith, Suzanne M; Nedorost, Susan T
2010-01-01
The term "dermatitis" can be defined narrowly or broadly, clinically or histologically. A common and costly condition, dermatitis is underresourced compared to other chronic skin conditions. The lack of a collectively understood definition of dermatitis and its subcategories could be the primary barrier. To investigate how dermatologists define the term "dermatitis" and determine if a consensus on the definition of this term and other related terms exists. A seven-question survey of dermatologists nationwide was conducted. Of respondents (n = 122), half consider dermatitis to be any inflammation of the skin. Nearly half (47.5%) use the term interchangeably with "eczema." Virtually all (> 96%) endorse the subcategory "atopic" under the terms "dermatitis" and "eczema," but the subcategories "contact," "drug hypersensitivity," and "occupational" are more highly endorsed under the term "dermatitis" than under the term "eczema." Over half (55.7%) personally consider "dermatitis" to have a broad meaning, and even more (62.3%) believe that dermatologists as a whole define the term broadly. There is a lack of consensus among experts in defining dermatitis, eczema, and their related subcategories.
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...
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.
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.
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
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.
Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask
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.
Identification of control targets in Boolean molecular network models via computational algebra.
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.
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
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.
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
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
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.
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.
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.
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.
Hunt, Brian R; Ott, Edward
2015-09-01
In this paper, we propose, discuss, and illustrate a computationally feasible definition of chaos which can be applied very generally to situations that are commonly encountered, including attractors, repellers, and non-periodically forced systems. This definition is based on an entropy-like quantity, which we call "expansion entropy," and we define chaos as occurring when this quantity is positive. We relate and compare expansion entropy to the well-known concept of topological entropy to which it is equivalent under appropriate conditions. We also present example illustrations, discuss computational implementations, and point out issues arising from attempts at giving definitions of chaos that are not entropy-based.
Englander, Elizabeth; Donnerstein, Edward; Kowalski, Robin; Lin, Carolyn A; Parti, Katalin
2017-11-01
Is cyberbullying essentially the same as bullying, or is it a qualitatively different activity? The lack of a consensual, nuanced definition has limited the field's ability to examine these issues. Evidence suggests that being a perpetrator of one is related to being a perpetrator of the other; furthermore, strong relationships can also be noted between being a victim of either type of attack. It also seems that both types of social cruelty have a psychological impact, although the effects of being cyberbullied may be worse than those of being bullied in a traditional sense (evidence here is by no means definitive). A complicating factor is that the 3 characteristics that define bullying (intent, repetition, and power imbalance) do not always translate well into digital behaviors. Qualities specific to digital environments often render cyberbullying and bullying different in circumstances, motivations, and outcomes. To make significant progress in addressing cyberbullying, certain key research questions need to be addressed. These are as follows: How can we define, distinguish between, and understand the nature of cyberbullying and other forms of digital conflict and cruelty, including online harassment and sexual harassment? Once we have a functional taxonomy of the different types of digital cruelty, what are the short- and long-term effects of exposure to or participation in these social behaviors? What are the idiosyncratic characteristics of digital communication that users can be taught? Finally, how can we apply this information to develop and evaluate effective prevention programs? Copyright © 2017 by the American Academy of Pediatrics.
Tutorial on Online Partial Evaluation
Directory of Open Access Journals (Sweden)
William R. Cook
2011-09-01
Full Text Available This paper is a short tutorial introduction to online partial evaluation. We show how to write a simple online partial evaluator for a simple, pure, first-order, functional programming language. In particular, we show that the partial evaluator can be derived as a variation on a compositionally defined interpreter. We demonstrate the use of the resulting partial evaluator for program optimization in the context of model-driven development.
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
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian
2018-04-01
Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.
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
Construction of a fuzzy and all Boolean logic gates based on DNA
DEFF Research Database (Denmark)
M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse
2015-01-01
to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....
Variances as order parameter and complexity measure for random Boolean networks
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
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
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.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
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)
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
Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.
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
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.
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.
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.
International Nuclear Information System (INIS)
Ding, Yun; Li, Jianbin; Wang, Wei; Wang, Suzhen; Wang, Jinzhi; Ma, Zhifang; Shao, Qian; Xu, Min
2014-01-01
To explore the volume and localization of the internal gross target volume defined using the seroma and/or surgical clips based on the four-dimensional computed tomography (4DCT) during free-breathing. Fifteen breast cancer patients after breast-conserving surgery (BCS) were recruited for EB-PBI. On the ten sets CT images, the gross target volume formed by the clips, the seroma, both the clips and seroma delineated by one radiation oncologist and defined as GTVc, GTVs and GTVc + s, respectively. The ten GTVc, GTVs and GTVc + s on the ten sets CT images produced the IGTVc, IGTVs, IGTVc + s, respectively. The IGTV volume and the distance between the center of IGTVc, IGTVs, IGTVc + s were all recorded. Conformity index (CI), degree of inclusion (DI) were calculated for IGTV/IGTV, respectively. The volume of IGTVc + s were significantly larger than the IGTVc and IGTVs (p < 0.05). There was significant difference between the DIs of IGTVc vs IGTVc + s, the DIs of IGTVs vs IGTVc + s. There was significant difference among the CIs of IGTV/IGTV. The DIs and CIs of IGTV/IGTV were negatively correlated with their centroid distance (r < 0, p < 0.05). There were volume difference and spatial mismatch between the IGTVs delineated based on the surgical clips and seroma. The IGTV defined as the seroma and surgical clips provided the best overall representation of the ‘true’ moving GTV
Boolean logic analysis for flow regime recognition of gas–liquid horizontal flow
International Nuclear Information System (INIS)
Ramskill, Nicholas P; Wang, Mi
2011-01-01
In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime
Feedback topology and XOR-dynamics in Boolean networks with varying input structure
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.
Feedback topology and XOR-dynamics in Boolean networks with varying input structure.
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.
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
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.
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Directory of Open Access Journals (Sweden)
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
Directory of Open Access Journals (Sweden)
Yih-Lon Lin
2013-01-01
Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Partial Cancellation. Full Cancellation is desirable. But complexity requirements are enormous. 4000 tones, 100 Users billions of flops !!! Main Idea: Challenge: To determine which cross-talker to cancel on what “tone” for a given victim. Constraint: Total complexity is ...
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.
Fisher information at the edge of chaos in random Boolean networks.
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.
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.
The pseudo-Boolean optimization approach to form the N-version software structure
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.
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
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
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.
Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.
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.
Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.
Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu
2009-07-01
The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
International Nuclear Information System (INIS)
1978-11-01
This discussion paper considers the possibility of applying to the recycle of plutonium in thermal reactors a particular method of partial processing based on the PUREX process but named CIVEX to emphasise the differences. The CIVEX process is based primarily on the retention of short-lived fission products. The paper suggests: (1) the recycle of fission products with uranium and plutonium in thermal reactor fuel would be technically feasible; (2) it would, however, take ten years or more to develop the CIVEX process to the point where it could be launched on a commercial scale; (3) since the majority of spent fuel to be reprocessed this century will have been in storage for ten years or more, the recycling of short-lived fission products with the U-Pu would not provide an effective means of making refabrication fuel ''inaccessible'' because the radioactivity associated with the fission products would have decayed. There would therefore be no advantage in partial processing
Directory of Open Access Journals (Sweden)
М.М. Karimova
2017-05-01
Full Text Available A girl with partial gigantism (the increased I and II fingers of the left foot is being examined. This condition is a rare and unresolved problem, as the definite reason of its development is not determined. Wait-and-see strategy is recommended, as well as correcting operations after closing of growth zones, and forming of data pool for generalization and development of schemes of drug and radial therapeutic methods.
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
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.
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.
Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.
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.
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.
An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.
Jiang, Han; Li, Xue; Xu, Qiuliang
2016-12-01
The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
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
Attractor controllability of Boolean networks by flipping a subset of their nodes
Rafimanzelat, Mohammad Reza; Bahrami, Fariba
2018-04-01
The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.
Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.
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.
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
Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation
Pinilla, Samuel; Poveda, Juan; Arguello, Henry
2018-03-01
Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.
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
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.
Partial distance correlation with methods for dissimilarities
Székely, Gábor J.; Rizzo, Maria L.
2014-01-01
Distance covariance and distance correlation are scalar coefficients that characterize independence of random vectors in arbitrary dimension. Properties, extensions, and applications of distance correlation have been discussed in the recent literature, but the problem of defining the partial distance correlation has remained an open question of considerable interest. The problem of partial distance correlation is more complex than partial correlation partly because the squared distance covari...
Ying, Mingsheng; Yu, Nengkun; Feng, Yuan
2012-01-01
A remarkable difference between quantum and classical programs is that the control flow of the former can be either classical or quantum. One of the key issues in the theory of quantum programming languages is defining and understanding quantum control flow. A functional language with quantum control flow was defined by Altenkirch and Grattage [\\textit{Proc. LICS'05}, pp. 249-258]. This paper extends their work, and we introduce a general quantum control structure by defining three new quantu...
DEFF Research Database (Denmark)
Eichberg, Henning
2015-01-01
Can play be defined? There is reason to raise critical questions about the established academic demand that at phenomenon – also in humanist studies – should first of all be defined, i.e. de-lineated and by neat lines limited to a “little box” that can be handled. The following chapter develops....... Human beings can very well understand play – or whatever phenomenon in human life – without defining it....
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
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.
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.
Directory of Open Access Journals (Sweden)
Mikko Niilo-Rämä
2014-06-01
Full Text Available A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation of its variance is derived. The accuracies of the approximations are evaluated by means of simulation experiments. The novel method is compared to other methods and applied to real-world industrial data from nanocellulose crystalline.
Directory of Open Access Journals (Sweden)
Shohag Barman
Full Text Available Inferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.In this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.Taken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.
Defining Overweight and Obesity
... Micronutrient Malnutrition State and Local Programs Defining Adult Overweight and Obesity Recommend on Facebook Tweet Share Compartir ... weight for a given height is described as overweight or obese. Body Mass Index, or BMI, is ...
... of Alcohol Consumption Alcohol's Effects on the Body Alcohol Use Disorder Fetal Alcohol Exposure Support & Treatment Alcohol Policy Special ... Definition of Drinking at Low Risk for Developing Alcohol Use Disorder (AUD): For women, low-risk drinking is defined ...
DEFF Research Database (Denmark)
Juel, Henrik
2006-01-01
A discussion of various attemts at defining documentary film regarding form, content, truth, stile, genre or reception - and a propoposal of a positive list of essential, but non-exclusive characteristica of documentary film......A discussion of various attemts at defining documentary film regarding form, content, truth, stile, genre or reception - and a propoposal of a positive list of essential, but non-exclusive characteristica of documentary film...
The integration of expert-defined importance factors to enrich Bayesian Fault Tree Analysis
International Nuclear Information System (INIS)
Darwish, Molham; Almouahed, Shaban; Lamotte, Florent de
2017-01-01
This paper proposes an analysis of a hybrid Bayesian-Importance model for system designers to improve the quality of services related to Active Assisted Living Systems. The proposed model is based on two factors: failure probability measure of different service components and, an expert defined degree of importance that each component holds for the success of the corresponding service. The proposed approach advocates the integration of expert-defined importance factors to enrich the Bayesian Fault Tree Analysis (FTA) approach. The evaluation of the proposed approach is conducted using the Fault Tree Analysis formalism where the undesired state of a system is analyzed using Boolean logic mechanisms to combine a series of lower-level events.
Vranish, John M. (Inventor)
2010-01-01
A partial gear bearing including an upper half, comprising peak partial teeth, and a lower, or bottom, half, comprising valley partial teeth. The upper half also has an integrated roller section between each of the peak partial teeth with a radius equal to the gear pitch radius of the radially outwardly extending peak partial teeth. Conversely, the lower half has an integrated roller section between each of the valley half teeth with a radius also equal to the gear pitch radius of the peak partial teeth. The valley partial teeth extend radially inwardly from its roller section. The peak and valley partial teeth are exactly out of phase with each other, as are the roller sections of the upper and lower halves. Essentially, the end roller bearing of the typical gear bearing has been integrated into the normal gear tooth pattern.
Definably compact groups definable in real closed fields. I
Barriga, Eliana
2017-01-01
We study definably compact definably connected groups definable in a sufficiently saturated real closed field $R$. We introduce the notion of group-generic point for $\\bigvee$-definable groups and show the existence of group-generic points for definably compact groups definable in a sufficiently saturated o-minimal expansion of a real closed field. We use this notion along with some properties of generic sets to prove that for every definably compact definably connected group $G$ definable in...
Kantarci, T.
2012-01-01
The five essays in this dissertation address a range of topics in the micro-economic literature on partial retirement. The focus is on the labor market behavior of older age groups. The essays examine the economic and non-economic determinants of partial retirement behavior, the effect of partial
DEFF Research Database (Denmark)
Sicart (Vila), Miguel Angel
2008-01-01
This article defins game mechanics in relation to rules and challenges. Game mechanics are methods invoked by agents for interacting with the game world. I apply this definition to a comparative analysis of the games Rez, Every Extend Extra and Shadow of the Colossus that will show the relevance...... of a formal definition of game mechanics. Udgivelsesdato: Dec 2008...
Kuusisto, Antti
2013-01-01
In recent years, research into the mathematical foundations of modal logic has become increasingly popular. One of the main reasons for this is the fact that modal logic seems to adapt well to the requirements of a wide range of different fields of application. This paper is a summary of some of the author’s contributions to the understanding of modal definability theory.
Software Defined Cyberinfrastructure
Energy Technology Data Exchange (ETDEWEB)
Foster, Ian; Blaiszik, Ben; Chard, Kyle; Chard, Ryan
2017-07-17
Within and across thousands of science labs, researchers and students struggle to manage data produced in experiments, simulations, and analyses. Largely manual research data lifecycle management processes mean that much time is wasted, research results are often irreproducible, and data sharing and reuse remain rare. In response, we propose a new approach to data lifecycle management in which researchers are empowered to define the actions to be performed at individual storage systems when data are created or modified: actions such as analysis, transformation, copying, and publication. We term this approach software-defined cyberinfrastructure because users can implement powerful data management policies by deploying rules to local storage systems, much as software-defined networking allows users to configure networks by deploying rules to switches.We argue that this approach can enable a new class of responsive distributed storage infrastructure that will accelerate research innovation by allowing any researcher to associate data workflows with data sources, whether local or remote, for such purposes as data ingest, characterization, indexing, and sharing. We report on early experiments with this approach in the context of experimental science, in which a simple if-trigger-then-action (IFTA) notation is used to define rules.
Defining Abnormally Low Tenders
DEFF Research Database (Denmark)
Ølykke, Grith Skovgaard; Nyström, Johan
2017-01-01
The concept of an abnormally low tender is not defined in EU public procurement law. This article takes an interdisciplinary law and economics approach to examine a dataset consisting of Swedish and Danish judgments and verdicts concerning the concept of an abnormally low tender. The purpose...
Software Defined Coded Networking
DEFF Research Database (Denmark)
Di Paola, Carla; Roetter, Daniel Enrique Lucani; Palazzo, Sergio
2017-01-01
the quality of each link and even across neighbouring links and using simulations to show that an additional reduction of packet transmission in the order of 40% is possible. Second, to advocate for the use of network coding (NC) jointly with software defined networking (SDN) providing an implementation...
Shafer, S L; Stanski, D R
2008-01-01
In this chapter, drawn largely from the synthesis of material that we first presented in the sixth edition of Miller's Anesthesia, Chap 31 (Stanski and Shafer 2005; used by permission of the publisher), we have defined anesthetic depth as the probability of non-response to stimulation, calibrated against the strength of the stimulus, the difficulty of suppressing the response, and the drug-induced probability of non-responsiveness at defined effect site concentrations. This definition requires measurement of multiple different stimuli and responses at well-defined drug concentrations. There is no one stimulus and response measurement that will capture depth of anesthesia in a clinically or scientifically meaningful manner. The "clinical art" of anesthesia requires calibration of these observations of stimuli and responses (verbal responses, movement, tachycardia) against the dose and concentration of anesthetic drugs used to reduce the probability of response, constantly adjusting the administered dose to achieve the desired anesthetic depth. In our definition of "depth of anesthesia" we define the need for two components to create the anesthetic state: hypnosis created with drugs such as propofol or the inhalational anesthetics and analgesia created with the opioids or nitrous oxide. We demonstrate the scientific evidence that profound degrees of hypnosis in the absence of analgesia will not prevent the hemodynamic responses to profoundly noxious stimuli. Also, profound degrees of analgesia do not guarantee unconsciousness. However, the combination of hypnosis and analgesia suppresses hemodynamic response to noxious stimuli and guarantees unconsciousness.
Defining and classifying syncope
Thijs, Roland D.; Wieling, Wouter; Kaufmann, Horacio; van Dijk, Gert
2004-01-01
There is no widely adopted definition or classification of syncope and related disorders. This lack of uniformity harms patient care, research, and medical education. In this article, syncope is defined as a form of transient loss of consciousness (TLOC) due to cerebral hypoperfusion. Differences
Directory of Open Access Journals (Sweden)
Francine Blanchet-Sadri
2011-08-01
Full Text Available Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words. Given an infinite partial word w, the number of distinct full words over the alphabet that are compatible with factors of w of length n, called subwords of w, refers to a measure of complexity of infinite partial words so-called subword complexity. This measure is of particular interest because we can construct partial words with subword complexities not achievable by full words. In this paper, we consider the notion of recurrence over infinite partial words, that is, we study whether all of the finite subwords of a given infinite partial word appear infinitely often, and we establish connections between subword complexity and recurrence in this more general framework.
DEFF Research Database (Denmark)
Thaysen, Jens Damgaard
2015-01-01
This paper discusses how legal moralism should be defined. It is argued that legal moralism should be defined as the position that “For any X, it is always a pro tanto reason for justifiably imposing legal regulation on X that X is morally wrong (where “morally wrong” is not conceptually equivalent...... to “harmful”)”. Furthermore, a distinction between six types of legal moralism is made. The six types are grouped according to whether they are concerned with the enforcement of positive or critical morality, and whether they are concerned with criminalising, legally restricting, or refraining from legally...... protecting morally wrong behaviour. This is interesting because not all types of legal moralism are equally vulnerable to the different critiques of legal moralism that have been put forth. Indeed, I show that some interesting types of legal moralism have not been criticised at all....
DEFF Research Database (Denmark)
Eriksen, Safania Normann
2013-01-01
Despite evolving local food research, there is no consistent definition of “local food.” Various understandings are utilized, which have resulted in a diverse landscape of meaning. The main purpose of this paper is to examine how researchers within the local food systems literature define local...... food, and how these definitions can be used as a starting point to identify a new taxonomy of local food based on three domains of proximity....
On Undefined and Meaningless in Lambda Definability
de Vries, Fer-Jan
2016-01-01
We distinguish between undefined terms as used in lambda definability of partial recursive functions and meaningless terms as used in infinite lambda calculus for the infinitary terms models that generalise the Bohm model. While there are uncountable many known sets of meaningless terms, there are four known sets of undefined terms. Two of these four are sets of meaningless terms. In this paper we first present set of sufficient conditions for a set of lambda terms to se...
1998-06-01
In Wisconsin, physicians stopped performing abortions when a Federal District Court Judge refused to issue a temporary restraining order against the state's newly enacted "partial birth" abortion ban that was couched in such vague language it actually covered all abortions. While ostensibly attempting to ban late-term "intact dilation and extraction," the language of the law did not refer to that procedure or to late terms. Instead, it prohibited all abortions in which a physician "partially vaginally delivers a living child, causes the death of the partially delivered child with the intent to kill the child and then completes the delivery of the child." The law also defined "child" as "a human being from the time of fertilization" until birth. It is clear that this abortion ban is unconstitutional under Row v. Wade, and this unconstitutionality is compounded by the fact that the law allowed no exception to protect a woman's health, which is required by Roe for abortion bans after fetal viability. Wisconsin is only one of about 28 states that have enacted similar laws, and only two have restricted the ban to postviability abortions. Many of these laws have been struck down in court, and President Clinton has continued to veto the Federal partial-birth bill. The Wisconsin Judge acknowledged that opponents of the ban will likely prevail when the case is heard, but his action in denying the temporary injunction means that many women in Wisconsin will not receive timely medical care. The partial birth strategy is really only another anti-abortion strategy.
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.
Defined contribution health benefits.
Fronstin, P
2001-03-01
This Issue Brief discusses the emerging issue of "defined contribution" (DC) health benefits. The term "defined contribution" is used to describe a wide variety of approaches to the provision of health benefits, all of which have in common a shift in the responsibility for payment and selection of health care services from employers to employees. DC health benefits often are mentioned in the context of enabling employers to control their outlay for health benefits by avoiding increases in health care costs. DC health benefits may also shift responsibility for choosing a health plan and the associated risks of choosing a plan from employers to employees. There are three primary reasons why some employers currently are considering some sort of DC approach. First, they are once again looking for ways to keep their health care cost increases in line with overall inflation. Second, some employers are concerned that the public "backlash" against managed care will result in new legislation, regulations, and litigation that will further increase their health care costs if they do not distance themselves from health care decisions. Third, employers have modified not only most employee benefit plans, but labor market practices in general, by giving workers more choice, control, and flexibility. DC-type health benefits have existed as cafeteria plans since the 1980s. A cafeteria plan gives each employee the opportunity to determine the allocation of his or her total compensation (within employer-defined limits) among various employee benefits (primarily retirement or health). Most types of DC health benefits currently being discussed could be provided within the existing employment-based health insurance system, with or without the use of cafeteria plans. They could also allow employees to purchase health insurance directly from insurers, or they could drive new technologies and new forms of risk pooling through which health care services are provided and financed. DC health
Hecht, Eugene
2011-01-01
Though central to any pedagogical development of physics, the concept of mass is still not well understood. Properly defining mass has proven to be far more daunting than contemporary textbooks would have us believe. And yet today the origin of mass is one of the most aggressively pursued areas of research in all of physics. Much of the excitement surrounding the Large Hadron Collider at CERN is associated with discovering the mechanism responsible for the masses of the elementary particles. This paper will first briefly examine the leading definitions, pointing out their shortcomings. Then, utilizing relativity theory, it will propose—for consideration by the community of physicists—a conceptual definition of mass predicated on the more fundamental concept of energy, more fundamental in that everything that has mass has energy, yet not everything that has energy has mass.
Implementing Software Defined Radio
Grayver, Eugene
2013-01-01
Software Defined Radio makes wireless communications easier, more efficient, and more reliable. This book bridges the gap between academic research and practical implementation. When beginning a project, practicing engineers, technical managers, and graduate students can save countless hours by considering the concepts presented in these pages. The author covers the myriad options and trade-offs available when selecting an appropriate hardware architecture. As demonstrated here, the choice between hardware- and software-centric architecture can mean the difference between meeting an aggressive schedule and bogging down in endless design iterations. Because of the author’s experience overseeing dozens of failed and successful developments, he is able to present many real-life examples. Some of the key concepts covered are: Choosing the right architecture for the market – laboratory, military, or commercial Hardware platforms – FPGAs, GPPs, specialized and hybrid devices Standardization efforts to ens...
Directory of Open Access Journals (Sweden)
Dragan D. Mladenović
2012-04-01
Full Text Available Cyber conflicts represent a new kind of warfare that is technologically developing very rapidly. Such development results in more frequent and more intensive cyber attacks undertaken by states against adversary targets, with a wide range of diverse operations, from information operations to physical destruction of targets. Nevertheless, cyber warfare is waged through the application of the same means, techniques and methods as those used in cyber criminal, terrorism and intelligence activities. Moreover, it has a very specific nature that enables states to covertly initiate attacks against their adversaries. The starting point in defining doctrines, procedures and standards in the area of cyber warfare is determining its true nature. In this paper, a contribution to this effort was made through the analysis of the existing state doctrines and international practice in the area of cyber warfare towards the determination of its nationally acceptable definition.
Siefert, Janet L
2009-01-01
This chapter defines the agents that provide for the movement of genetic material which fuels the adaptive potential of life on our planet. The chapter has been structured to be broadly comprehensive, arbitrarily categorizing the mobilome into four classes: (1) transposons, (2) plasmids, (3) bacteriophage, and (4) self-splicing molecular parasites.Our increasing understanding of the mobilome is as dynamic as the mobilome itself. With continuing discovery, it is clear that nature has not confined these genomic agents of change to neat categories, but rather the classification categories overlap and intertwine. Massive sequencing efforts and their published analyses are continuing to refine our understanding of the extent of the mobilome. This chapter provides a framework to describe our current understanding of the mobilome and a foundation on which appreciation of its impact on genome evolution can be understood.
DEFF Research Database (Denmark)
Caba, Cosmin Marius
Network Service Providers (NSP) often choose to overprovision their networks instead of deploying proper Quality of Services (QoS) mechanisms that allow for traffic differentiation and predictable quality. This tendency of overprovisioning is not sustainable for the simple reason that network...... resources are limited. Hence, to counteract this trend, current QoS mechanisms must become simpler to deploy and operate, in order to motivate NSPs to employ QoS techniques instead of overprovisioning. Software Defined Networking (SDN) represents a paradigm shift in the way telecommunication and data...... generic perspective (e.g. service provisioning speed, resources availability). As a result, new mechanisms for providing QoS are proposed, solutions for SDN-specific QoS challenges are designed and tested, and new network management concepts are prototyped, all aiming to improve QoS for network services...
Lewis, Simon; Maslin, Mark
2016-04-01
Time is divided by geologists according to marked shifts in Earth's state. Recent global environmental changes suggest that Earth may have entered a new human-dominated geological epoch, the Anthropocene. Should the Anthropocene - the idea that human activity is a force acting upon the Earth system in ways that mean that Earth will be altered for millions of years - be defined as a geological time-unit at the level of an Epoch? Here we appraise the data to assess such claims, first in terms of changes to the Earth system, with particular focus on very long-lived impacts, as Epochs typically last millions of years. Can Earth really be said to be in transition from one state to another? Secondly, we then consider the formal criteria used to define geological time-units and move forward through time examining whether currently available evidence passes typical geological time-unit evidence thresholds. We suggest two time periods likely fit the criteria (1) the aftermath of the interlinking of the Old and New Worlds, which moved species across continents and ocean basins worldwide, a geologically unprecedented and permanent change, which is also the globally synchronous coolest part of the Little Ice Age (in Earth system terms), and the beginning of global trade and a new socio-economic "world system" (in historical terms), marked as a golden spike by a temporary drop in atmospheric CO2, centred on 1610 CE; and (2) the aftermath of the Second World War, when many global environmental changes accelerated and novel long-lived materials were increasingly manufactured, known as the Great Acceleration (in Earth system terms) and the beginning of the Cold War (in historical terms), marked as a golden spike by the peak in radionuclide fallout in 1964. We finish by noting that the Anthropocene debate is politically loaded, thus transparency in the presentation of evidence is essential if a formal definition of the Anthropocene is to avoid becoming a debate about bias. The
Gamble, Nathan K; Pruski, Michal
2018-07-01
Disorders of sexual differentiation lead to what is often referred to as an intersex state. This state has medical, as well as some legal, recognition. Nevertheless, the question remains whether intersex persons occupy a state in between maleness and femaleness or whether they are truly men or women. To answer this question, another important conundrum needs to be first solved: what defines sex? The answer seems rather simple to most people, yet when morphology does not coincide with haplotypes, and genetics might not correlate with physiology the issue becomes more complex. This paper tackles both issues by establishing where the essence of sex is located and by superimposing that framework onto the issue of the intersex. This is achieved through giving due consideration to the biology of sexual development, as well as through the use of a teleological framework of the meaning of sex. Using a range of examples, the paper establishes that sex cannot be pinpointed to one biological variable but is rather determined by how the totality of one's biology is oriented towards biological reproduction. A brief consideration is also given to the way this situation could be comprehended from a Christian understanding of sex and suffering.
Hyperbolic partial differential equations
Witten, Matthew
1986-01-01
Hyperbolic Partial Differential Equations III is a refereed journal issue that explores the applications, theory, and/or applied methods related to hyperbolic partial differential equations, or problems arising out of hyperbolic partial differential equations, in any area of research. This journal issue is interested in all types of articles in terms of review, mini-monograph, standard study, or short communication. Some studies presented in this journal include discretization of ideal fluid dynamics in the Eulerian representation; a Riemann problem in gas dynamics with bifurcation; periodic M
Successful removable partial dentures.
Lynch, Christopher D
2012-03-01
Removable partial dentures (RPDs) remain a mainstay of prosthodontic care for partially dentate patients. Appropriately designed, they can restore masticatory efficiency, improve aesthetics and speech, and help secure overall oral health. However, challenges remain in providing such treatments, including maintaining adequate plaque control, achieving adequate retention, and facilitating patient tolerance. The aim of this paper is to review the successful provision of RPDs. Removable partial dentures are a successful form of treatment for replacing missing teeth, and can be successfully provided with appropriate design and fabrication concepts in mind.
Beginning partial differential equations
O'Neil, Peter V
2011-01-01
A rigorous, yet accessible, introduction to partial differential equations-updated in a valuable new edition Beginning Partial Differential Equations, Second Edition provides a comprehensive introduction to partial differential equations (PDEs) with a special focus on the significance of characteristics, solutions by Fourier series, integrals and transforms, properties and physical interpretations of solutions, and a transition to the modern function space approach to PDEs. With its breadth of coverage, this new edition continues to present a broad introduction to the field, while also addres
Group-wise partial least square regression
Camacho, José; Saccenti, Edoardo
2018-01-01
This paper introduces the group-wise partial least squares (GPLS) regression. GPLS is a new sparse PLS technique where the sparsity structure is defined in terms of groups of correlated variables, similarly to what is done in the related group-wise principal component analysis. These groups are
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.
Moutou, F; Pastoret, P-P
2015-04-01
Defining an emerging disease is not straightforward, as there are several different types of disease emergence. For example, there can be a 'real' emergence of a brand new disease, such as the emergence of bovine spongiform encephalopathy in the 1980s, or a geographic emergence in an area not previously affected, such as the emergence of bluetongue in northern Europe in 2006. In addition, disease can emerge in species formerly not considered affected, e.g. the emergence of bovine tuberculosis in wildlife species since 2000 in France. There can also be an unexpected increase of disease incidence in a known area and a known species, or there may simply be an increase in our knowledge or awareness of a particular disease. What all these emerging diseases have in common is that human activity frequently has a role to play in their emergence. For example, bovine spongiform encephalopathy very probably emerged as a result of changes in the manufacturing of meat-and-bone meal, bluetongue was able to spread to cooler climes as a result of uncontrolled trade in animals, and a relaxation of screening and surveillance for bovine tuberculosis enabled the disease to re-emerge in areas that had been able to drastically reduce the number of cases. Globalisation and population growth will continue to affect the epidemiology of diseases in years to come and ecosystems will continue to evolve. Furthermore, new technologies such as metagenomics and high-throughput sequencing are identifying new microorganisms all the time. Change is the one constant, and diseases will continue to emerge, and we must consider the causes and different types of emergence as we deal with these diseases in the future.
Partial knee replacement - slideshow
... page: //medlineplus.gov/ency/presentations/100225.htm Partial knee replacement - series—Normal anatomy To use the sharing ... A.M. Editorial team. Related MedlinePlus Health Topics Knee Replacement A.D.A.M., Inc. is accredited ...
Beginning partial differential equations
O'Neil, Peter V
2014-01-01
A broad introduction to PDEs with an emphasis on specialized topics and applications occurring in a variety of fields Featuring a thoroughly revised presentation of topics, Beginning Partial Differential Equations, Third Edition provides a challenging, yet accessible,combination of techniques, applications, and introductory theory on the subjectof partial differential equations. The new edition offers nonstandard coverageon material including Burger's equation, the telegraph equation, damped wavemotion, and the use of characteristics to solve nonhomogeneous problems. The Third Edition is or
Definably compact groups definable in real closed fields.II
Barriga, Eliana
2017-01-01
We continue the analysis of definably compact groups definable in a real closed field $\\mathcal{R}$. In [3], we proved that for every definably compact definably connected semialgebraic group $G$ over $\\mathcal{R}$ there are a connected $R$-algebraic group $H$, a definable injective map $\\phi$ from a generic definable neighborhood of the identity of $G$ into the group $H\\left(R\\right)$ of $R$-points of $H$ such that $\\phi$ acts as a group homomorphism inside its domain. The above result and o...
An Imperative Type Hierarchy with Partial Products
DEFF Research Database (Denmark)
Schwartzbach, Michael Ignatieff; Schmidt, Erik Meineche
1989-01-01
notation for defining recursive types, that is superior to traditional type sums and products. We show how the ordering on types extends to an ordering on types with invariants. We allow the use of least upper bounds in type definitions and show how to compute upper bounds of invariants.......A type hierarchy for a programming language defines an ordering on the types such that any application for small types may be reused for all larger types. The imperative facet makes this non-trivial; the straight-forward definitions will yield an inconsistent system. We introduce a new type...... constructor, the partial product, and show how to define a consistent hierarchy in the context of fully recursive types. A simple polymorphism is derived by introducing a notion of placeholder types. By extending the partial product types to include structural invariants we obtain a particularly appropriate...
Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory
Energy Technology Data Exchange (ETDEWEB)
Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S., E-mail: miaoxs@mail.hust.edu.cn [Wuhan National Laboratory for Optoelectronics (WNLO), Huazhong University of Science and Technology (HUST), Wuhan 430074 (China); School of Optical and Electronic Information, Huazhong University of Science and Technology, Wuhan 430074 (China)
2013-12-21
Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices.
Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory
International Nuclear Information System (INIS)
Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S.
2013-01-01
Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices
Partial differential equations
Evans, Lawrence C
2010-01-01
This text gives a comprehensive survey of modern techniques in the theoretical study of partial differential equations (PDEs) with particular emphasis on nonlinear equations. The exposition is divided into three parts: representation formulas for solutions; theory for linear partial differential equations; and theory for nonlinear partial differential equations. Included are complete treatments of the method of characteristics; energy methods within Sobolev spaces; regularity for second-order elliptic, parabolic, and hyperbolic equations; maximum principles; the multidimensional calculus of variations; viscosity solutions of Hamilton-Jacobi equations; shock waves and entropy criteria for conservation laws; and, much more.The author summarizes the relevant mathematics required to understand current research in PDEs, especially nonlinear PDEs. While he has reworked and simplified much of the classical theory (particularly the method of characteristics), he primarily emphasizes the modern interplay between funct...
Comparing complete and partial classification for identifying customers at risk
Bloemer, J.M.M.; Brijs, T.; Swinnen, S.P.; Vanhoof, K.
2003-01-01
This paper evaluates complete versus partial classification for the problem of identifying customers at risk. We define customers at risk as customers reporting overall satisfaction, but these customers also possess characteristics that are strongly associated with dissatisfied customers. This
Optimization of partial search
International Nuclear Information System (INIS)
Korepin, Vladimir E
2005-01-01
A quantum Grover search algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster; this is partial search. A partial search algorithm was recently suggested by Grover and Radhakrishnan. Here we optimize it. Efficiency of the search algorithm is measured by the number of queries to the oracle. The author suggests a new version of the Grover-Radhakrishnan algorithm which uses a minimal number of such queries. The algorithm can run on the same hardware that is used for the usual Grover algorithm. (letter to the editor)
Auxiliary partial liver transplantation
C.B. Reuvers (Cornelis Bastiaan)
1986-01-01
textabstractIn this thesis studies on auxiliary partial liver transplantation in the dog and the pig are reported. The motive to perform this study was the fact that patients with acute hepatic failure or end-stage chronic liver disease are often considered to form too great a risk for successful
DEFF Research Database (Denmark)
Andersen, Marie Louise Max; Hougaard, Philip; Pörksen, Sven
2014-01-01
OBJECTIVE: To validate the partial remission (PR) definition based on insulin dose-adjusted HbA1c (IDAA1c). SUBJECTS AND METHODS: The IDAA1c was developed using data in 251 children from the European Hvidoere cohort. For validation, 129 children from a Danish cohort were followed from the onset...
Fundamental partial compositeness
DEFF Research Database (Denmark)
Sannino, Francesco; Strumia, Alessandro; Tesi, Andrea
2016-01-01
We construct renormalizable Standard Model extensions, valid up to the Planck scale, that give a composite Higgs from a new fundamental strong force acting on fermions and scalars. Yukawa interactions of these particles with Standard Model fermions realize the partial compositeness scenario. Unde...
Fernandez, R.; Deveaux, V.
2010-01-01
We provide a formal definition and study the basic properties of partially ordered chains (POC). These systems were proposed to model textures in image processing and to represent independence relations between random variables in statistics (in the later case they are known as Bayesian networks).
Partially Hidden Markov Models
DEFF Research Database (Denmark)
Forchhammer, Søren Otto; Rissanen, Jorma
1996-01-01
Partially Hidden Markov Models (PHMM) are introduced. They differ from the ordinary HMM's in that both the transition probabilities of the hidden states and the output probabilities are conditioned on past observations. As an illustration they are applied to black and white image compression where...
W. van der Hoek (Wiebe); J.O.M. Jaspars; E. Thijsse
1995-01-01
textabstractWe propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the
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.
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.
Partially composite Higgs models
DEFF Research Database (Denmark)
Alanne, Tommi; Buarque Franzosi, Diogo; Frandsen, Mads T.
2018-01-01
We study the phenomenology of partially composite-Higgs models where electroweak symmetry breaking is dynamically induced, and the Higgs is a mixture of a composite and an elementary state. The models considered have explicit realizations in terms of gauge-Yukawa theories with new strongly...... interacting fermions coupled to elementary scalars and allow for a very SM-like Higgs state. We study constraints on their parameter spaces from vacuum stability and perturbativity as well as from LHC results and find that requiring vacuum stability up to the compositeness scale already imposes relevant...... constraints. A small part of parameter space around the classically conformal limit is stable up to the Planck scale. This is however already strongly disfavored by LHC results. in different limits, the models realize both (partially) composite-Higgs and (bosonic) technicolor models and a dynamical extension...
Hennessy, M J; Binnie, C D
2000-01-01
To establish the incidence and symptoms of partial seizures in a cohort of patients investigated on account of known sensitivity to intermittent photic stimulation and/or precipitation of seizures by environmental visual stimuli such as television (TV) screens or computer monitors. We report 43 consecutive patients with epilepsy, who had exhibited a significant EEG photoparoxysmal response or who had seizures precipitated by environmental visual stimuli and underwent detailed assessment of their photosensitivity in the EEG laboratory, during which all were questioned concerning their ictal symptoms. All patients were considered on clinical grounds to have an idiopathic epilepsy syndrome. Twenty-eight (65%) patients reported visually precipitated attacks occurring initially with maintained consciousness, in some instances evolving to a period of confusion or to a secondarily generalized seizure. Visual symptoms were most commonly reported and included positive symptoms such as coloured circles or spots, but also blindness and subjective symptoms such as "eyes going funny." Other symptoms described included nonspecific cephalic sensations, deja-vu, auditory hallucinations, nausea, and vomiting. No patient reported any clear spontaneous partial seizures, and there were no grounds for supposing that any had partial epilepsy excepting the ictal phenomenology of some or all of the visually induced attacks. These findings provide clinical support for the physiological studies that indicate that the trigger mechanism for human photosensitivity involves binocularly innervated cells located in the visual cortex. Thus the visual cortex is the seat of the primary epileptogenic process, and the photically triggered discharges and seizures may be regarded as partial with secondary generalization.
Arthroscopic partial medial meniscectomy
Directory of Open Access Journals (Sweden)
Dašić Žarko
2011-01-01
Full Text Available Background/Aim. Meniscal injuries are common in professional or recreational sports as well as in daily activities. If meniscal lesions lead to physical impairment they usually require surgical treatment. Arthroscopic treatment of meniscal injuries is one of the most often performed orthopedic operative procedures. Methods. The study analyzed the results of arthroscopic partial medial meniscectomy in 213 patients in a 24-month period, from 2006, to 2008. Results. In our series of arthroscopically treated medial meniscus tears we noted 78 (36.62% vertical complete bucket handle lesions, 19 (8.92% vertical incomplete lesions, 18 (8.45% longitudinal tears, 35 (16.43% oblique tears, 18 (8.45% complex degenerative lesions, 17 (7.98% radial lesions and 28 (13.14% horisontal lesions. Mean preoperative International Knee Documentation Committee (IKDC score was 49.81%, 1 month after the arthroscopic partial medial meniscectomy the mean IKDC score was 84.08%, and 6 months after mean IKDC score was 90.36%. Six months after the procedure 197 (92.49% of patients had good or excellent subjective postoperative clinical outcomes, while 14 (6.57% patients subjectively did not notice a significant improvement after the intervention, and 2 (0.93% patients had no subjective improvement after the partial medial meniscectomy at all. Conclusion. Arthroscopic partial medial meniscetomy is minimally invasive diagnostic and therapeutic procedure and in well selected cases is a method of choice for treatment of medial meniscus injuries when repair techniques are not a viable option. It has small rate of complications, low morbidity and fast rehabilitation.
Hierarchical partial order ranking
International Nuclear Information System (INIS)
Carlsen, Lars
2008-01-01
Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritisation of polluted sites is given. - Hierarchical partial order ranking of polluted sites has been developed for prioritization based on a large number of parameters
Defining asthma in genetic studies
Koppelman, GH; Postma, DS; Meijer, G.
1999-01-01
Genetic studies have been hampered by the lack of a gold standard to diagnose asthma. The complex nature of asthma makes it more difficult to identify asthma genes. Therefore, approaches to define phenotypes, which have been successful in other genetically complex diseases, may be applied to define
2012-02-03
... Modifications to Minimum Present Value Requirements for Partial Annuity Distribution Options Under Defined... guidance relating to the minimum present value requirements applicable to certain defined benefit pension plans. These proposed regulations would change the regulations regarding the minimum present value...
Partially ordered algebraic systems
Fuchs, Laszlo
2011-01-01
Originally published in an important series of books on pure and applied mathematics, this monograph by a distinguished mathematician explores a high-level area in algebra. It constitutes the first systematic summary of research concerning partially ordered groups, semigroups, rings, and fields. The self-contained treatment features numerous problems, complete proofs, a detailed bibliography, and indexes. It presumes some knowledge of abstract algebra, providing necessary background and references where appropriate. This inexpensive edition of a hard-to-find systematic survey will fill a gap i
International Nuclear Information System (INIS)
Sprung, D.W.L.
1975-01-01
This paper is a brief review of those aspects of the effective interaction problem that can be grouped under the heading of infinite partial summations of the perturbation series. After a brief mention of the classic examples of infinite summations, the author turns to the effective interaction problem for two extra core particles. Their direct interaction is summed to produce the G matrix, while their indirect interaction through the core is summed in a variety of ways under the heading of core polarization. (orig./WL) [de
Chen, Herman Z. Q.; Kitaev, Sergey; Mütze, Torsten; Sun, Brian Y.
2016-01-01
A universal word for a finite alphabet $A$ and some integer $n\\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist for any $A$ and $n$. In this work we initiate the systematic study of universal partial words. These are words that in addition to the letters from $A$ may contain an arbitrary number of occurrences of a special `joker' symbol $\\Diamond\
Partial differential equations
Agranovich, M S
2002-01-01
Mark Vishik's Partial Differential Equations seminar held at Moscow State University was one of the world's leading seminars in PDEs for over 40 years. This book celebrates Vishik's eightieth birthday. It comprises new results and survey papers written by many renowned specialists who actively participated over the years in Vishik's seminars. Contributions include original developments and methods in PDEs and related fields, such as mathematical physics, tomography, and symplectic geometry. Papers discuss linear and nonlinear equations, particularly linear elliptic problems in angles and gener
Partial differential equations
Levine, Harold
1997-01-01
The subject matter, partial differential equations (PDEs), has a long history (dating from the 18th century) and an active contemporary phase. An early phase (with a separate focus on taut string vibrations and heat flow through solid bodies) stimulated developments of great importance for mathematical analysis, such as a wider concept of functions and integration and the existence of trigonometric or Fourier series representations. The direct relevance of PDEs to all manner of mathematical, physical and technical problems continues. This book presents a reasonably broad introductory account of the subject, with due regard for analytical detail, applications and historical matters.
Partial differential equations
Sloan, D; Süli, E
2001-01-01
/homepage/sac/cam/na2000/index.html7-Volume Set now available at special set price ! Over the second half of the 20th century the subject area loosely referred to as numerical analysis of partial differential equations (PDEs) has undergone unprecedented development. At its practical end, the vigorous growth and steady diversification of the field were stimulated by the demand for accurate and reliable tools for computational modelling in physical sciences and engineering, and by the rapid development of computer hardware and architecture. At the more theoretical end, the analytical insight in
Elliptic partial differential equations
Han, Qing
2011-01-01
Elliptic Partial Differential Equations by Qing Han and FangHua Lin is one of the best textbooks I know. It is the perfect introduction to PDE. In 150 pages or so it covers an amazing amount of wonderful and extraordinary useful material. I have used it as a textbook at both graduate and undergraduate levels which is possible since it only requires very little background material yet it covers an enormous amount of material. In my opinion it is a must read for all interested in analysis and geometry, and for all of my own PhD students it is indeed just that. I cannot say enough good things abo
DEFF Research Database (Denmark)
Darkner, Sune; Sporring, Jon
2011-01-01
Mutual Information (MI) and normalized mutual information (NMI) are popular choices as similarity measure for multimodal image registration. Presently, one of two approaches is often used for estimating these measures: The Parzen Window (PW) and the Generalized Partial Volume (GPV). Their theoret...... of view as well as w.r.t. computational complexity. Finally, we present algorithms for both approaches for NMI which is comparable in speed to Sum of Squared Differences (SSD), and we illustrate the differences between PW and GPV on a number of registration examples....
Unilateral removable partial dentures.
Goodall, W A; Greer, A C; Martin, N
2017-01-27
Removable partial dentures (RPDs) are widely used to replace missing teeth in order to restore both function and aesthetics for the partially dentate patient. Conventional RPD design is frequently bilateral and consists of a major connector that bridges both sides of the arch. Some patients cannot and will not tolerate such an extensive appliance. For these patients, bridgework may not be a predictable option and it is not always possible to provide implant-retained restorations. This article presents unilateral RPDs as a potential treatment modality for such patients and explores indications and contraindications for their use, including factors relating to patient history, clinical presentation and patient wishes. Through case examples, design, material and fabrication considerations will be discussed. While their use is not widespread, there are a number of patients who benefit from the provision of unilateral RPDs. They are a useful treatment to have in the clinician's armamentarium, but a highly-skilled dental team and a specific patient presentation is required in order for them to be a reasonable and predictable prosthetic option.
Linear algebraic theory of partial coherence: discrete fields and measures of partial coherence.
Ozaktas, Haldun M; Yüksel, Serdar; Kutay, M Alper
2002-08-01
A linear algebraic theory of partial coherence is presented that allows precise mathematical definitions of concepts such as coherence and incoherence. This not only provides new perspectives and insights but also allows us to employ the conceptual and algebraic tools of linear algebra in applications. We define several scalar measures of the degree of partial coherence of an optical field that are zero for full incoherence and unity for full coherence. The mathematical definitions are related to our physical understanding of the corresponding concepts by considering them in the context of Young's experiment.
Theoretical approaches to elections defining
Natalya V. Lebedeva
2011-01-01
Theoretical approaches to elections defining develop the nature, essence and content of elections, help to determine their place and a role as one of the major national law institutions in democratic system.
Theoretical approaches to elections defining
Directory of Open Access Journals (Sweden)
Natalya V. Lebedeva
2011-01-01
Full Text Available Theoretical approaches to elections defining develop the nature, essence and content of elections, help to determine their place and a role as one of the major national law institutions in democratic system.
Defining Modules, Modularity and Modularization
DEFF Research Database (Denmark)
Miller, Thomas Dedenroth; Pedersen, Per Erik Elgård
The paper describes the evolution of the concept of modularity in a historical perspective. The main reasons for modularity are: create variety, utilize similarities, and reduce complexity. The paper defines the terms: Module, modularity, and modularization.......The paper describes the evolution of the concept of modularity in a historical perspective. The main reasons for modularity are: create variety, utilize similarities, and reduce complexity. The paper defines the terms: Module, modularity, and modularization....
Type-Directed Partial Evaluation
DEFF Research Database (Denmark)
Danvy, Olivier
1998-01-01
Type-directed partial evaluation uses a normalization function to achieve partial evaluation. These lecture notes review its background, foundations, practice, and applications. Of specific interest is the modular technique of offline and online type-directed partial evaluation in Standard ML...
Type-Directed Partial Evaluation
DEFF Research Database (Denmark)
Danvy, Olivier
1998-01-01
Type-directed partial evaluation uses a normalization function to achieve partial evaluation. These lecture notes review its background, foundations, practice, and applications. Of specific interest is the modular technique of offline and online type-directed partial evaluation in Standard ML of ...
Applied partial differential equations
Logan, J David
2004-01-01
This primer on elementary partial differential equations presents the standard material usually covered in a one-semester, undergraduate course on boundary value problems and PDEs. What makes this book unique is that it is a brief treatment, yet it covers all the major ideas: the wave equation, the diffusion equation, the Laplace equation, and the advection equation on bounded and unbounded domains. Methods include eigenfunction expansions, integral transforms, and characteristics. Mathematical ideas are motivated from physical problems, and the exposition is presented in a concise style accessible to science and engineering students; emphasis is on motivation, concepts, methods, and interpretation, rather than formal theory. This second edition contains new and additional exercises, and it includes a new chapter on the applications of PDEs to biology: age structured models, pattern formation; epidemic wave fronts, and advection-diffusion processes. The student who reads through this book and solves many of t...
Paul, Clayton R
2010-01-01
"Inductance is an unprecedented text, thoroughly discussing "loop" inductance as well as the increasingly important "partial" inductance. These concepts and their proper calculation are crucial in designing modern high-speed digital systems. World-renowned leader in electromagnetics Clayton Paul provides the knowledge and tools necessary to understand and calculate inductance." "With the present and increasing emphasis on high-speed digital systems and high-frequency analog systems, it is imperative that system designers develop an intimate understanding of the concepts and methods in this book. Inductance is a much-needed textbook designed for senior and graduate-level engineering students, as well as a hands-on guide for working engineers and professionals engaged in the design of high-speed digital and high-frequency analog systems."--Jacket.
Fundamental partial compositeness
Sannino, Francesco
2016-11-07
We construct renormalizable Standard Model extensions, valid up to the Planck scale, that give a composite Higgs from a new fundamental strong force acting on fermions and scalars. Yukawa interactions of these particles with Standard Model fermions realize the partial compositeness scenario. Successful models exist because gauge quantum numbers of Standard Model fermions admit a minimal enough 'square root'. Furthermore, right-handed SM fermions have an SU(2)$_R$-like structure, yielding a custodially-protected composite Higgs. Baryon and lepton numbers arise accidentally. Standard Model fermions acquire mass at tree level, while the Higgs potential and flavor violations are generated by quantum corrections. We further discuss accidental symmetries and other dynamical features stemming from the new strongly interacting scalars. If the same phenomenology can be obtained from models without our elementary scalars, they would reappear as composite states.
Fundamental partial compositeness
International Nuclear Information System (INIS)
Sannino, Francesco; Strumia, Alessandro; Tesi, Andrea; Vigiani, Elena
2016-01-01
We construct renormalizable Standard Model extensions, valid up to the Planck scale, that give a composite Higgs from a new fundamental strong force acting on fermions and scalars. Yukawa interactions of these particles with Standard Model fermions realize the partial compositeness scenario. Under certain assumptions on the dynamics of the scalars, successful models exist because gauge quantum numbers of Standard Model fermions admit a minimal enough ‘square root’. Furthermore, right-handed SM fermions have an SU(2)_R-like structure, yielding a custodially-protected composite Higgs. Baryon and lepton numbers arise accidentally. Standard Model fermions acquire mass at tree level, while the Higgs potential and flavor violations are generated by quantum corrections. We further discuss accidental symmetries and other dynamical features stemming from the new strongly interacting scalars. If the same phenomenology can be obtained from models without our elementary scalars, they would reappear as composite states.
International Nuclear Information System (INIS)
Najjar, M.S.
1987-01-01
A process is described for the production of gaseous mixtures comprising H/sub 2/+CO by the partial oxidation of a fuel feedstock comprising a heavy liquid hydrocarbonaceous fuel having a nickel, iron, and vanadium-containing ash or petroleum coke having a nickel, iron, and vanadium-containing ash, or mixtures thereof. The feedstock includes a minimum of 0.5 wt. % of sulfur and the ash includes a minimum of 5.0 wt. % vanadium, a minimum of 0.5 ppm nickel, and a minimum of 0.5 ppm iron. The process comprises: (1) mixing together a copper-containing additive with the fuel feedstock; wherein the weight ratio of copper-containing additive to ash in the fuel feedstock is in the range of about 1.0-10.0, and there is at least 10 parts by weight of copper for each part by weight of vanadium; (2) reacting the mixture from (1) at a temperature in the range of 2200 0 F to 2900 0 F and a pressure in the range of about 5 to 250 atmospheres in a free-flow refactory lined partial oxidation reaction zone with a free-oxygen containing gas in the presence of a temperature moderator and in a reducing atmosphere to produce a hot raw effluent gas stream comprising H/sub 2/+CO and entrained molten slag; and where in the reaction zone and the copper-containing additive combines with at least a portion of the nickel and iron constituents and sulfur found in the feedstock to produce a liquid phase washing agent that collects and transports at least a portion of the vanadium-containing oxide laths and spinels and other ash components and refractory out of the reaction zone; and (3) separating nongaseous materials from the hot raw effluent gas stream
Partially ordered sets in complex networks
International Nuclear Information System (INIS)
Xuan Qi; Du Fang; Wu Tiejun
2010-01-01
In this paper, a partial-order relation is defined among vertices of a network to describe which vertex is more important than another on its contribution to the connectivity of the network. A maximum linearly ordered subset of vertices is defined as a chain and the chains sharing the same end-vertex are grouped as a family. Through combining the same vertices appearing in different chains, a directed chain graph is obtained. Based on these definitions, a series of new network measurements, such as chain length distribution, family diversity distribution, as well as the centrality of families, are proposed. By studying the partially ordered sets in three kinds of real-world networks, many interesting results are revealed. For instance, the similar approximately power-law chain length distribution may be attributed to a chain-based positive feedback mechanism, i.e. new vertices prefer to participate in longer chains, which can be inferred by combining the notable preferential attachment rule with a well-ordered recommendation manner. Moreover, the relatively large average incoming degree of the chain graphs may indicate an efficient substitution mechanism in these networks. Most of the partially ordered set-based properties cannot be explained by the current well-known scale-free network models; therefore, we are required to propose more appropriate network models in the future.
Defining Plagiarism: A Literature Review
Directory of Open Access Journals (Sweden)
Akbar Akbar
2018-02-01
Full Text Available Plagiarism has repeatedly occurred in Indonesia, resulting in focusing on such academic misbehavior as a “central issue” in Indonesian higher education. One of the issues of addressing plagiarism in higher education is that there is a confusion of defining plagiarism. It seems that Indonesian academics had different perception when defining plagiarism. This article aims at exploring the issue of plagiarism by helping define plagiarism to address confusion among Indonesian academics. This article applies literature review by firs finding relevant articles after identifying databases for literature searching. After the collection of required articles for review, the articles were synthesized before presenting the findings. This study has explored the definition of plagiarism in the context of higher education. This research found that plagiarism is defined in the relation of criminal acts. The huge numbers of discursive features used position plagiaristic acts as an illegal deed. This study also found that cultural backgrounds and exposure to plagiarism were influential in defining plagiarism.
Modular Software-Defined Radio
Directory of Open Access Journals (Sweden)
Rhiemeier Arnd-Ragnar
2005-01-01
Full Text Available In view of the technical and commercial boundary conditions for software-defined radio (SDR, it is suggestive to reconsider the concept anew from an unconventional point of view. The organizational principles of signal processing (rather than the signal processing algorithms themselves are the main focus of this work on modular software-defined radio. Modularity and flexibility are just two key characteristics of the SDR environment which extend smoothly into the modeling of hardware and software. In particular, the proposed model of signal processing software includes irregular, connected, directed, acyclic graphs with random node weights and random edges. Several approaches for mapping such software to a given hardware are discussed. Taking into account previous findings as well as new results from system simulations presented here, the paper finally concludes with the utility of pipelining as a general design guideline for modular software-defined radio.
Defining and Selecting Independent Directors
Directory of Open Access Journals (Sweden)
Eric Pichet
2017-10-01
Full Text Available Drawing from the Enlightened Shareholder Theory that the author first developed in 2011, this theoretical paper with practical and normative ambitions achieves a better definition of independent director, while improving the understanding of the roles he fulfils on boards of directors. The first part defines constructs like firms, Governance system and Corporate governance, offering a clear distinction between the latter two concepts before explaining the four main missions of a board. The second part defines the ideal independent director by outlining the objective qualities that are necessary and adding those subjective aspects that have turned this into a veritable profession. The third part defines the ideal process for selecting independent directors, based on nominating committees that should themselves be independent. It also includes ways of assessing directors who are currently in function, as well as modalities for renewing their mandates. The paper’s conclusion presents the Paradox of the Independent Director.
Defining and Classifying Interest Groups
DEFF Research Database (Denmark)
Baroni, Laura; Carroll, Brendan; Chalmers, Adam
2014-01-01
The interest group concept is defined in many different ways in the existing literature and a range of different classification schemes are employed. This complicates comparisons between different studies and their findings. One of the important tasks faced by interest group scholars engaged...... in large-N studies is therefore to define the concept of an interest group and to determine which classification scheme to use for different group types. After reviewing the existing literature, this article sets out to compare different approaches to defining and classifying interest groups with a sample...... in the organizational attributes of specific interest group types. As expected, our comparison of coding schemes reveals a closer link between group attributes and group type in narrower classification schemes based on group organizational characteristics than those based on a behavioral definition of lobbying....
Directory of Open Access Journals (Sweden)
Francesco Strati
2013-05-01
Full Text Available The present work is intended to be an introduction to the Superposition Theory of David Carfì. In particular I shall depict the meaning of his brand new theory, on the one hand in an informal fashion and on the other hand by giving a formal approach of the algebraic structure of the theory: the S-linear algebra. This kind of structure underpins the notion of S-spaces (or Carfì-spaces by defining both its properties and its nature. Thus I shall define the S-triple as the fundamental principle upon which the S-linear algebra is built up.
Experts' understanding of partial derivatives using the Partial Derivative Machine
Roundy, David; Dorko, Allison; Dray, Tevian; Manogue, Corinne A.; Weber, Eric
2014-01-01
Partial derivatives are used in a variety of different ways within physics. Most notably, thermodynamics uses partial derivatives in ways that students often find confusing. As part of a collaboration with mathematics faculty, we are at the beginning of a study of the teaching of partial derivatives, a goal of better aligning the teaching of multivariable calculus with the needs of students in STEM disciplines. As a part of this project, we have performed a pilot study of expert understanding...
Defining and Differentiating the Makerspace
Dousay, Tonia A.
2017-01-01
Many resources now punctuate the maker movement landscape. However, some schools and communities still struggle to understand this burgeoning movement. How do we define these spaces and differentiate them from previous labs and shops? Through a multidimensional framework, stakeholders should consider how the structure, access, staffing, and tools…
Indico CONFERENCE: Define the Programme
CERN. Geneva; Ferreira, Pedro
2017-01-01
In this tutorial you are going to learn how to define the programme of a conference in Indico. The program of your conference is divided in different “tracks”. Tracks represent the subject matter of the conference, such as “Online Computing”, “Offline Computing”, and so on.
Simple skew category algebras associated with minimal partially defined dynamical systems
DEFF Research Database (Denmark)
Nystedt, Patrik; Öinert, Per Johan
2013-01-01
In this article, we continue our study of category dynamical systems, that is functors s from a category G to Topop, and their corresponding skew category algebras. Suppose that the spaces s(e), for e∈ob(G), are compact Hausdorff. We show that if (i) the skew category algebra is simple, then (ii) G...
Braam, S.R.; Zeinstra, L.M.; Litjens, S.H.M.; Ward-van Oostwaard, D.; van den Brink, S.; van Laake, L.W.; Lebrin, F.; Kats, P.; Hochstenbach, R.; Passier, R.; Sonnenberg, A.; Mummery, C.L.
2008-01-01
Defined growth conditions are essential for many applications of human embryonic stem cells (hESC). Most defined media are presently used in combination with Matrigel, a partially defined extracellular matrix (ECM) extract from mouse sarcoma. Here, we defined ECM requirements of hESC by analyzing
Partial Actions and Power Sets
Directory of Open Access Journals (Sweden)
Jesús Ávila
2013-01-01
Full Text Available We consider a partial action (X,α with enveloping action (T,β. In this work we extend α to a partial action on the ring (P(X,Δ,∩ and find its enveloping action (E,β. Finally, we introduce the concept of partial action of finite type to investigate the relationship between (E,β and (P(T,β.
Nonlinear partial differential equations of second order
Dong, Guangchang
1991-01-01
This book addresses a class of equations central to many areas of mathematics and its applications. Although there is no routine way of solving nonlinear partial differential equations, effective approaches that apply to a wide variety of problems are available. This book addresses a general approach that consists of the following: Choose an appropriate function space, define a family of mappings, prove this family has a fixed point, and study various properties of the solution. The author emphasizes the derivation of various estimates, including a priori estimates. By focusing on a particular approach that has proven useful in solving a broad range of equations, this book makes a useful contribution to the literature.
Testing the generalized partial credit model
Glas, Cornelis A.W.
1996-01-01
The partial credit model (PCM) (G.N. Masters, 1982) can be viewed as a generalization of the Rasch model for dichotomous items to the case of polytomous items. In many cases, the PCM is too restrictive to fit the data. Several generalizations of the PCM have been proposed. In this paper, a generalization of the PCM (GPCM), a further generalization of the one-parameter logistic model, is discussed. The model is defined and the conditional maximum likelihood procedure for the method is describe...
Anatomic partial nephrectomy: technique evolution.
Azhar, Raed A; Metcalfe, Charles; Gill, Inderbir S
2015-03-01
Partial nephrectomy provides equivalent long-term oncologic and superior functional outcomes as radical nephrectomy for T1a renal masses. Herein, we review the various vascular clamping techniques employed during minimally invasive partial nephrectomy, describe the evolution of our partial nephrectomy technique and provide an update on contemporary thinking about the impact of ischemia on renal function. Recently, partial nephrectomy surgical technique has shifted away from main artery clamping and towards minimizing/eliminating global renal ischemia during partial nephrectomy. Supported by high-fidelity three-dimensional imaging, novel anatomic-based partial nephrectomy techniques have recently been developed, wherein partial nephrectomy can now be performed with segmental, minimal or zero global ischemia to the renal remnant. Sequential innovations have included early unclamping, segmental clamping, super-selective clamping and now culminating in anatomic zero-ischemia surgery. By eliminating 'under-the-gun' time pressure of ischemia for the surgeon, these techniques allow an unhurried, tightly contoured tumour excision with point-specific sutured haemostasis. Recent data indicate that zero-ischemia partial nephrectomy may provide better functional outcomes by minimizing/eliminating global ischemia and preserving greater vascularized kidney volume. Contemporary partial nephrectomy includes a spectrum of surgical techniques ranging from conventional-clamped to novel zero-ischemia approaches. Technique selection should be tailored to each individual case on the basis of tumour characteristics, surgical feasibility, surgeon experience, patient demographics and baseline renal function.
Partial order infinitary term rewriting
DEFF Research Database (Denmark)
Bahr, Patrick
2014-01-01
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with th...... to the metric setting -- orthogonal systems are both infinitarily confluent and infinitarily normalising in the partial order setting. The unique infinitary normal forms that the partial order model admits are Böhm trees....
AIDS defining disease: Disseminated cryptococcosis
Directory of Open Access Journals (Sweden)
Roshan Anupama
2006-01-01
Full Text Available Disseminated cryptococcosis is one of the acquired immune deficiency syndrome defining criteria and the most common cause of life threatening meningitis. Disseminated lesions in the skin manifest as papules or nodules that mimic molluscum contagiosum (MC. We report here a human immunodeficiency virus positive patient who presented with MC like lesions. Disseminated cryptococcosis was confirmed by India ink preparation and histopathology. The condition of the patient improved with amphotercin B.
How do people define moderation?
vanDellen, Michelle R; Isherwood, Jennifer C; Delose, Julie E
2016-06-01
Eating in moderation is considered to be sound and practical advice for weight maintenance or prevention of weight gain. However, the concept of moderation is ambiguous, and the effect of moderation messages on consumption has yet to be empirically examined. The present manuscript examines how people define moderate consumption. We expected that people would define moderate consumption in ways that justified their current or desired consumption rather than view moderation as an objective standard. In Studies 1 and 2, moderate consumption was perceived to involve greater quantities of an unhealthy food (chocolate chip cookies, gummy candies) than perceptions of how much one should consume. In Study 3, participants generally perceived themselves to eat in moderation and defined moderate consumption as greater than their personal consumption. Furthermore, definitions of moderate consumption were related to personal consumption behaviors. Results suggest that the endorsement of moderation messages allows for a wide range of interpretations of moderate consumption. Thus, we conclude that moderation messages are unlikely to be effective messages for helping people maintain or lose weight. Copyright © 2016 Elsevier Ltd. All rights reserved.
On Degenerate Partial Differential Equations
Chen, Gui-Qiang G.
2010-01-01
Some of recent developments, including recent results, ideas, techniques, and approaches, in the study of degenerate partial differential equations are surveyed and analyzed. Several examples of nonlinear degenerate, even mixed, partial differential equations, are presented, which arise naturally in some longstanding, fundamental problems in fluid mechanics and differential geometry. The solution to these fundamental problems greatly requires a deep understanding of nonlinear degenerate parti...
[Acrylic resin removable partial dentures
Baat, C. de; Witter, D.J.; Creugers, N.H.J.
2011-01-01
An acrylic resin removable partial denture is distinguished from other types of removable partial dentures by an all-acrylic resin base which is, in principle, solely supported by the edentulous regions of the tooth arch and in the maxilla also by the hard palate. When compared to the other types of
Partial Epilepsy with Auditory Features
Directory of Open Access Journals (Sweden)
J Gordon Millichap
2004-07-01
Full Text Available The clinical characteristics of 53 sporadic (S cases of idiopathic partial epilepsy with auditory features (IPEAF were analyzed and compared to previously reported familial (F cases of autosomal dominant partial epilepsy with auditory features (ADPEAF in a study at the University of Bologna, Italy.
Partial twisting for scalar mesons
International Nuclear Information System (INIS)
Agadjanov, Dimitri; Meißner, Ulf-G.; Rusetsky, Akaki
2014-01-01
The possibility of imposing partially twisted boundary conditions is investigated for the scalar sector of lattice QCD. According to the commonly shared belief, the presence of quark-antiquark annihilation diagrams in the intermediate state generally hinders the use of the partial twisting. Using effective field theory techniques in a finite volume, and studying the scalar sector of QCD with total isospin I=1, we however demonstrate that partial twisting can still be performed, despite the fact that annihilation diagrams are present. The reason for this are delicate cancellations, which emerge due to the graded symmetry in partially quenched QCD with valence, sea and ghost quarks. The modified Lüscher equation in case of partial twisting is given
Network Coded Software Defined Networking
DEFF Research Database (Denmark)
Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani
2015-01-01
Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...
Network Coded Software Defined Networking
DEFF Research Database (Denmark)
Hansen, Jonas; Roetter, Daniel Enrique Lucani; Krigslund, Jeppe
2015-01-01
Software defined networking has garnered large attention due to its potential to virtualize services in the Internet, introducing flexibility in the buffering, scheduling, processing, and routing of data in network routers. SDN breaks the deadlock that has kept Internet network protocols stagnant...... for decades, while applications and physical links have evolved. This article advocates for the use of SDN to bring about 5G network services by incorporating network coding (NC) functionalities. The latter constitutes a major leap forward compared to the state-of-the- art store and forward Internet paradigm...
(Re)Defining Salesperson Motivation
DEFF Research Database (Denmark)
Khusainova, Rushana; de Jong, Ad; Lee, Nick
2018-01-01
The construct of motivation is one of the central themes in selling and sales management research. Yet, to-date no review article exists that surveys the construct (both from an extrinsic and intrinsic motivation context), critically evaluates its current status, examines various key challenges...... apparent from the extant research, and suggests new research opportunities based on a thorough review of past work. The authors explore how motivation is defined, major theories underpinning motivation, how motivation has historically been measured, and key methodologies used over time. In addition......, attention is given to principal drivers and outcomes of salesperson motivation. A summarizing appendix of key articles in salesperson motivation is provided....
Defining Usability of PN Services
DEFF Research Database (Denmark)
Nicolajsen, Hanne Westh; Ahola, Titta; Fleury, Alexandre
In this deliverable usability and user experience are defined in relation to MAGNET Beyond technologies, and it is described how the main MAGNET Beyond concepts can be evaluated through the involvement of users. The concepts include the new "Activity based communication approach" for interacting...... with the MAGNET Beyond system, as well as the core concepts: Personal Network, Personal Network-Federation, Service Discovery, User Profile Management, Personal Network Management, Privacy and Security and Context Awareness. The overall plans for the final usability evaluation are documented based on the present...
Semantics and correctness proofs for programs with partial functions
International Nuclear Information System (INIS)
Yakhnis, A.; Yakhnis, V.
1996-01-01
This paper presents a portion of the work on specification, design, and implementation of safety-critical systems such as reactor control systems. A natural approach to this problem, once all the requirements are captured, would be to state the requirements formally and then either to prove (preferably via automated tools) that the system conforms to spec (program verification), or to try to simultaneously generate the system and a mathematical proof that the requirements are being met (program derivation). An obstacle to this is frequent presence of partially defined operations within the software and its specifications. Indeed, the usual proofs via first order logic presuppose everywhere defined operations. Recognizing this problem, David Gries, in ''The Science of Programming,'' 1981, introduced the concept of partial functions into the mainstream of program correctness and gave hints how his treatment of partial functions could be formalized. Still, however, existing theorem provers and software verifiers have difficulties in checking software with partial functions, because of absence of uniform first order treatment of partial functions within classical 2-valued logic. Several rigorous mechanisms that took partiality into account were introduced [Wirsing 1990, Breu 1991, VDM 1986, 1990, etc.]. However, they either did not discuss correctness proofs or departed from first order logic. To fill this gap, the authors provide a semantics for software correctness proofs with partial functions within classical 2-valued 1st order logic. They formalize the Gries treatment of partial functions and also cover computations of functions whose argument lists may be only partially available. An example is nuclear reactor control relying on sensors which may fail to deliver sense data. This approach is sufficiently general to cover correctness proofs in various implementation languages
Expressiveness and definability in circumscription
Directory of Open Access Journals (Sweden)
Francicleber Martins Ferreira
2011-06-01
Full Text Available We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P; Z-minimal models of a first-order sentence is Δ-elementary, then it is elementary. That is, whenever the circumscription of a first-order sentence is equivalent to a first-order theory, then it is equivalent to a finitely axiomatizable one. This means that classes of models of circumscribed theories are either elementary or not Δ-elementary. Finally, using the previous result, we prove that, whenever a relation Pi is defined in the class of P; Z-minimal models of a first-order sentence Φ and whenever such class of P; Z-minimal models is Δ-elementary, then there is an explicit definition ψ for Pi such that the class of P; Z-minimal models of Φ is the class of models of Φ ∧ ψ. In order words, the circumscription of P in Φ with Z varied can be replaced by Φ plus this explicit definition ψ for Pi.
Defining Quality in Undergraduate Education
Directory of Open Access Journals (Sweden)
Alison W. Bowers
2018-01-01
Full Text Available Objectives: This research brief explores the literature addressing quality in undergraduate education to identify what previous research has said about quality and to offer future directions for research on quality in undergraduate education. Method: We conducted a scoping review to provide a broad overview of existing research. Using targeted search terms in academic databases, we identified and reviewed relevant academic literature to develop emergent themes and implications for future research. Results: The exploratory review of the literature revealed a range of thoughtful discussions and empirical studies attempting to define quality in undergraduate education. Many publications highlighted the importance of including different stakeholder perspectives and presented some of the varying perceptions of quality among different stakeholders. Conclusions: While a number of researchers have explored and written about how to define quality in undergraduate education, there is not a general consensus regarding a definition of quality in undergraduate education. Past research offers a range of insights, models, and data to inform future research. Implication for Theory and/or Practice: We provide four recommendations for future research to contribute to a high quality undergraduate educational experience. We suggest more comprehensive systematic reviews of the literature as a next step.
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.
Directory of Open Access Journals (Sweden)
Pramita Suwal
2017-03-01
Full Text Available Aim: To compare the effects of cast partial denture with conventional all acrylic denture in respect to retention, stability, masticatory efficiency, comfort and periodontal health of abutments. Methods: 50 adult partially edentulous patient seeking for replacement of missing teeth having Kennedy class I and II arches with or without modification areas were selected for the study. Group-A was treated with cast partial denture and Group-B with acrylic partial denture. Data collected during follow-up visit of 3 months, 6 months, and 1 year by evaluating retention, stability, masticatory efficiency, comfort, periodontal health of abutment. Results: Chi-square test was applied to find out differences between the groups at 95% confidence interval where p = 0.05. One year comparison shows that cast partial denture maintained retention and stability better than acrylic partial denture (p< 0.05. The masticatory efficiency was significantly compromising from 3rd month to 1 year in all acrylic partial denture groups (p< 0.05. The comfort of patient with cast partial denture was maintained better during the observation period (p< 0.05. Periodontal health of abutment was gradually deteriorated in all acrylic denture group (p
Defining the "normal" postejaculate urinalysis.
Mehta, Akanksha; Jarow, Jonathan P; Maples, Pat; Sigman, Mark
2012-01-01
Although sperm have been shown to be present in the postejaculate urinalysis (PEU) of both fertile and infertile men, the number of sperm present in the PEU of the general population has never been well defined. The objective of this study was to describe the semen and PEU findings in both the general and infertile population, in order to develop a better appreciation for "normal." Infertile men (n = 77) and control subjects (n = 71) were prospectively recruited. Exclusion criteria included azoospermia and medications known to affect ejaculation. All men underwent a history, physical examination, semen analysis, and PEU. The urine was split into 2 containers: PEU1, the initial voided urine, and PEU2, the remaining voided urine. Parametric statistical methods were applied for data analysis to compare sperm concentrations in each sample of semen and urine between the 2 groups of men. Controls had higher average semen volume (3.3 ± 1.6 vs 2.0 ± 1.4 mL, P sperm concentrations (112 million vs 56.2 million, P = .011), compared with infertile men. The presence of sperm in urine was common in both groups, but more prevalent among infertile men (98.7% vs 88.7%, P = .012), in whom it comprised a greater proportion of the total sperm count (46% vs 24%, P = .022). The majority of sperm present in PEU were seen in PEU1 of both controls (69%) and infertile men (88%). An association was noted between severe oligospermia (sperm counts in PEU (sperm in the urine compared with control, there is a large degree of overlap between the 2 populations, making it difficult to identify a specific threshold to define a positive test. Interpretation of a PEU should be directed by whether the number of sperm in the urine could affect subsequent management.
Miniature EVA Software Defined Radio
Pozhidaev, Aleksey
2012-01-01
As NASA embarks upon developing the Next-Generation Extra Vehicular Activity (EVA) Radio for deep space exploration, the demands on EVA battery life will substantially increase. The number of modes and frequency bands required will continue to grow in order to enable efficient and complex multi-mode operations including communications, navigation, and tracking applications. Whether conducting astronaut excursions, communicating to soldiers, or first responders responding to emergency hazards, NASA has developed an innovative, affordable, miniaturized, power-efficient software defined radio that offers unprecedented power-efficient flexibility. This lightweight, programmable, S-band, multi-service, frequency- agile EVA software defined radio (SDR) supports data, telemetry, voice, and both standard and high-definition video. Features include a modular design, an easily scalable architecture, and the EVA SDR allows for both stationary and mobile battery powered handheld operations. Currently, the radio is equipped with an S-band RF section. However, its scalable architecture can accommodate multiple RF sections simultaneously to cover multiple frequency bands. The EVA SDR also supports multiple network protocols. It currently implements a Hybrid Mesh Network based on the 802.11s open standard protocol. The radio targets RF channel data rates up to 20 Mbps and can be equipped with a real-time operating system (RTOS) that can be switched off for power-aware applications. The EVA SDR's modular design permits implementation of the same hardware at all Network Nodes concept. This approach assures the portability of the same software into any radio in the system. It also brings several benefits to the entire system including reducing system maintenance, system complexity, and development cost.
Physics of partially ionized plasmas
Krishan, Vinod
2016-01-01
Plasma is one of the four fundamental states of matter; the other three being solid, liquid and gas. Several components, such as molecular clouds, diffuse interstellar gas, the solar atmosphere, the Earth's ionosphere and laboratory plasmas, including fusion plasmas, constitute the partially ionized plasmas. This book discusses different aspects of partially ionized plasmas including multi-fluid description, equilibrium and types of waves. The discussion goes on to cover the reionization phase of the universe, along with a brief description of high discharge plasmas, tokomak plasmas and laser plasmas. Various elastic and inelastic collisions amongst the three particle species are also presented. In addition, the author demonstrates the novelty of partially ionized plasmas using many examples; for instance, in partially ionized plasma the magnetic induction is subjected to the ambipolar diffusion and the Hall effect, as well as the usual resistive dissipation. Also included is an observation of kinematic dynam...
Partially massless fields during inflation
Baumann, Daniel; Goon, Garrett; Lee, Hayden; Pimentel, Guilherme L.
2018-04-01
The representation theory of de Sitter space allows for a category of partially massless particles which have no flat space analog, but could have existed during inflation. We study the couplings of these exotic particles to inflationary perturbations and determine the resulting signatures in cosmological correlators. When inflationary perturbations interact through the exchange of these fields, their correlation functions inherit scalings that cannot be mimicked by extra massive fields. We discuss in detail the squeezed limit of the tensor-scalar-scalar bispectrum, and show that certain partially massless fields can violate the tensor consistency relation of single-field inflation. We also consider the collapsed limit of the scalar trispectrum, and find that the exchange of partially massless fields enhances its magnitude, while giving no contribution to the scalar bispectrum. These characteristic signatures provide clean detection channels for partially massless fields during inflation.
Introduction to partial differential equations
Greenspan, Donald
2000-01-01
Designed for use in a one-semester course by seniors and beginning graduate students, this rigorous presentation explores practical methods of solving differential equations, plus the unifying theory underlying the mathematical superstructure. Topics include basic concepts, Fourier series, second-order partial differential equations, wave equation, potential equation, heat equation, approximate solution of partial differential equations, and more. Exercises appear at the ends of most chapters. 1961 edition.
[Acrylic resin removable partial dentures].
de Baat, C; Witter, D J; Creugers, N H J
2011-01-01
An acrylic resin removable partial denture is distinguished from other types of removable partial dentures by an all-acrylic resin base which is, in principle, solely supported by the edentulous regions of the tooth arch and in the maxilla also by the hard palate. When compared to the other types of removable partial dentures, the acrylic resin removable partial denture has 3 favourable aspects: the economic aspect, its aesthetic quality and the ease with which it can be extended and adjusted. Disadvantages are an increased risk of caries developing, gingivitis, periodontal disease, denture stomatitis, alveolar bone reduction, tooth migration, triggering of the gag reflex and damage to the acrylic resin base. Present-day indications are ofa temporary or palliative nature or are motivated by economic factors. Special varieties of the acrylic resin removable partial denture are the spoon denture, the flexible denture fabricated of non-rigid acrylic resin, and the two-piece sectional denture. Furthermore, acrylic resin removable partial dentures can be supplied with clasps or reinforced by fibers or metal wires.
The benefits of defining "snacks".
Hess, Julie M; Slavin, Joanne L
2018-04-18
Whether eating a "snack" is considered a beneficial or detrimental behavior is largely based on how "snack" is defined. The term "snack food" tends to connote energy-dense, nutrient-poor foods high in nutrients to limit (sugar, sodium, and/or saturated fat) like cakes, cookies, chips and other salty snacks, and sugar-sweetened beverages. Eating a "snack food" is often conflated with eating a "snack," however, leading to an overall perception of snacks as a dietary negative. Yet the term "snack" can also refer simply to an eating occasion outside of breakfast, lunch, or dinner. With this definition, the evidence to support health benefits or detriments to eating a "snack" remains unclear, in part because relatively few well-designed studies that specifically focus on the impact of eating frequency on health have been conducted. Despite these inconsistencies and research gaps, in much of the nutrition literature, "snacking" is still referred to as detrimental to health. As discussed in this review, however, there are multiple factors that influence the health impacts of snacking, including the definition of "snack" itself, the motivation to snack, body mass index of snack eaters, and the food selected as a snack. Without a definition of "snack" and a body of research using methodologically rigorous protocols, determining the health impact of eating a "snack" will continue to elude the nutrition research community and prevent the development of evidence-based policies about snacking that support public health. Copyright © 2018 Elsevier Inc. All rights reserved.
Defining safety goals. 2. Basic Consideration on Defining Safety Goals
International Nuclear Information System (INIS)
Hakata, T.
2001-01-01
cancer and severe hereditary effects are 10 x 10 -2 /Sv and 1.3 x10 -2 /Sv, respectively. The basic safety goals can be expressed by the complementary accumulative distribution function (CCDF) of dose versus frequencies of events: Pc(C > Cp) 5 (Cp/Co) -α . The aversion factor a is here expressed by the following arbitrary equation, which gives a polynomial curve of the order of m on a logarithmic plane: α = a+b(log(Cp/Co)) m , where: Pc = CCDF frequency for Cp (/yr), Cp = dose (mSv), Co = Cp for Pc =1, a, b, m = constants. Figure 1 shows a typical tolerable risk profile (risk limit curve), which is drawn so that all the points obtained in the previous discussions are above the curve (Co=1, a=1, b=0.0772, and m = 2). Safety criteria by ANS (Ref. 2) and SHE (Ref. 3) are shown in Fig. 1 for comparison. An aversion of a factor of 2 is resulted between 1 mSv and 1 Sv. No ALARA is included, which must be considered in defining specific safety goals. The frequency of a single class of events must be lower than the CCDF profile, and a curve lower by a factor of 10 is drawn in Fig. 1. The doses referenced in the current Japanese safety guidelines and site criteria are shown in Fig. 1. The referenced doses seem reasonable, considering the conservatism in the analysis of design-basis accidents. Specific safety goals for each sort of facility can be defined based on the basic safety goals, reflecting the characteristics of the facilities and considering ALARA. The indexes of engineering terms, such as CMF and LERF, are preferable for nuclear power plants, although interpretation from dose to the engineering terms is needed. Other indexes may be used (such as frequency of criticality accidents, etc.) for facilities except for power plants. The applicability of safety goals will thus be improved. Figure 2 shows the relative risk factors (1, 1%, and 0.1%) versus the severity of radiation effects. This might indicate the adequacy of the risk factors. The absolute risk limits, which
Defining Tobacco Regulatory Science Competencies.
Wipfli, Heather L; Berman, Micah; Hanson, Kacey; Kelder, Steven; Solis, Amy; Villanti, Andrea C; Ribeiro, Carla M P; Meissner, Helen I; Anderson, Roger
2017-02-01
In 2013, the National Institutes of Health and the Food and Drug Administration funded a network of 14 Tobacco Centers of Regulatory Science (TCORS) with a mission that included research and training. A cross-TCORS Panel was established to define tobacco regulatory science (TRS) competencies to help harmonize and guide their emerging educational programs. The purpose of this paper is to describe the Panel's work to develop core TRS domains and competencies. The Panel developed the list of domains and competencies using a semistructured Delphi method divided into four phases occurring between November 2013 and August 2015. The final proposed list included a total of 51 competencies across six core domains and 28 competencies across five specialized domains. There is a need for continued discussion to establish the utility of the proposed set of competencies for emerging TRS curricula and to identify the best strategies for incorporating these competencies into TRS training programs. Given the field's broad multidisciplinary nature, further experience is needed to refine the core domains that should be covered in TRS training programs versus knowledge obtained in more specialized programs. Regulatory science to inform the regulation of tobacco products is an emerging field. The paper provides an initial list of core and specialized domains and competencies to be used in developing curricula for new and emerging training programs aimed at preparing a new cohort of scientists to conduct critical TRS research. © The Author 2016. Published by Oxford University Press on behalf of the Society for Research on Nicotine and Tobacco. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
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.
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.
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.
Parachute technique for partial penectomy
Directory of Open Access Journals (Sweden)
Fernando Korkes
2010-04-01
Full Text Available PURPOSE: Penile carcinoma is a rare but mutilating malignancy. In this context, partial penectomy is the most commonly applied approach for best oncological results. We herein propose a simple modification of the classic technique of partial penectomy, for better cosmetic and functional results. TECHNIQUE: If partial penectomy is indicated, the present technique can bring additional benefits. Different from classical technique, the urethra is spatulated only ventrally. An inverted "V" skin flap with 0.5 cm of extension is sectioned ventrally. The suture is performed with vicryl 4-0 in a "parachute" fashion, beginning from the ventral portion of the urethra and the "V" flap, followed by the "V" flap angles and than by the dorsal portion of the penis. After completion of the suture, a Foley catheter and light dressing are placed for 24 hours. CONCLUSIONS: Several complex reconstructive techniques have been previously proposed, but normally require specific surgical abilities, adequate patient selection and staged procedures. We believe that these reconstructive techniques are very useful in some specific subsets of patients. However, the technique herein proposed is a simple alternative that can be applied to all men after a partial penectomy, and takes the same amount of time as that in the classic technique. In conclusion, the "parachute" technique for penile reconstruction after partial amputation not only improves the appearance of the penis, but also maintains an adequate function.
Optimal partial-arcs in VMAT treatment planning
International Nuclear Information System (INIS)
Wala, Jeremiah; Salari, Ehsan; Chen Wei; Craft, David
2012-01-01
We present a method for improving the delivery efficiency of VMAT by extending the recently published VMAT treatment planning algorithm vmerge to automatically generate optimal partial-arc plans. A high-quality initial plan is created by solving a convex multicriteria optimization problem using 180 equi-spaced beams. This initial plan is used to form a set of dose constraints, and a set of partial-arc plans is created by searching the space of all possible partial-arc plans that satisfy these constraints. For each partial-arc, an iterative fluence map merging and sequencing algorithm (vmerge) is used to improve the delivery efficiency. Merging continues as long as the dose quality is maintained above a user-defined threshold. The final plan is selected as the partial-arc with the lowest treatment time. The complete algorithm is called pmerge. Partial-arc plans are created using pmerge for a lung, liver and prostate case, with final treatment times of 127, 245 and 147 s. Treatment times using full arcs with vmerge are 211, 357 and 178 s. The mean doses to the critical structures for the vmerge and pmerge plans are kept within 5% of those in the initial plan, and the target volume covered by the prescription isodose is maintained above 98% for the pmerge and vmerge plans. Additionally, we find that the angular distribution of fluence in the initial plans is predictive of the start and end angles of the optimal partial-arc. We conclude that VMAT delivery efficiency can be improved by employing partial-arcs without compromising dose quality, and that partial-arcs are most applicable to cases with non-centralized targets. (paper)
Partial Transposition on Bipartite System
International Nuclear Information System (INIS)
Xi-Jun, Ren; Yong-Jian, Han; Yu-Chun, Wu; Guang-Can, Guo
2008-01-01
Many properties of partial transposition are unclear as yet. Here we carefully consider the number of the negative eigenvalues of ρ T (ρ's partial transposition) when ρ is a two-partite state. There is strong evidence to show that the number of negative eigenvalues of ρ T is N(N − 1)/2 at most when ρ is a state in Hilbert space C N C N . For the special case, the 2 × 2 system, we use this result to give a partial proof of the conjecture |ρ T | T ≥ 0. We find that this conjecture is strongly connected with the entanglement of the state corresponding to the negative eigenvalue of ρ T or the negative entropy of ρ
International Nuclear Information System (INIS)
Maeda, Munehiro; Yoshiya, Kazuhiko; Suzuki, Eiji
1989-01-01
According to the direction and the thickness of the imaging slice in tomography, the border between the tissues becomes unclear (partial volume effect). In the present MRI experiment, we examined border area between fat and water components using phantom in order to investigate the partial volume effect in MRI. In spin echo sequences, the intensity of the border area showed a linear relationship with composition of fat and water. Whereas, in inversion recovery and field echo sequences, we found the parameters to produce an extremely low intensity area at the border region between fat and water. This low intensity area was explained by cancellation of NMR signals from fat and water due to the difference in the direction of magnetic vectors. Clinically, partial volume effect can cause of mis-evaluation of walls, small nodules, tumor capsules and the tumor invasion in the use of inversion recovery and field echo sequences. (author)
Partially composite Goldstone Higgs boson
DEFF Research Database (Denmark)
Alanne, Tommi; Franzosi, Diogo Buarque; Frandsen, Mads T.
2017-01-01
We consider a model of dynamical electroweak symmetry breaking with a partially composite Goldstone Higgs boson. The model is based on a strongly interacting fermionic sector coupled to a fundamental scalar sector via Yukawa interactions. The SU(4)×SU(4) global symmetry of these two sectors...... is broken to a single SU(4) via Yukawa interactions. Electroweak symmetry breaking is dynamically induced by condensation due to the strong interactions in the new fermionic sector which further breaks the global symmetry SU(4)→Sp(4). The Higgs boson arises as a partially composite state which is an exact...... Goldstone boson in the limit where SM interactions are turned off. Terms breaking the SU(4) global symmetry explicitly generate a mass for the Goldstone Higgs boson. The model realizes in different limits both (partially) composite Higgs and (bosonic) technicolor models, thereby providing a convenient...
Landsliding in partially saturated materials
Godt, J.W.; Baum, R.L.; Lu, N.
2009-01-01
[1] Rainfall-induced landslides are pervasive in hillslope environments around the world and among the most costly and deadly natural hazards. However, capturing their occurrence with scientific instrumentation in a natural setting is extremely rare. The prevailing thinking on landslide initiation, particularly for those landslides that occur under intense precipitation, is that the failure surface is saturated and has positive pore-water pressures acting on it. Most analytic methods used for landslide hazard assessment are based on the above perception and assume that the failure surface is located beneath a water table. By monitoring the pore water and soil suction response to rainfall, we observed shallow landslide occurrence under partially saturated conditions for the first time in a natural setting. We show that the partially saturated shallow landslide at this site is predictable using measured soil suction and water content and a novel unified effective stress concept for partially saturated earth materials. Copyright 2009 by the American Geophysical Union.
Partial structures in molten AgBr
Energy Technology Data Exchange (ETDEWEB)
Ueno, Hiroki [Department of Condensed Matter Chemistry and Physics, Faculty of Sciences, Kyushu University, 4-2-1 Ropponmatsu, Chuo-ku, Fukuoka 810-8560 (Japan)], E-mail: ueno@gemini.rc.kyushu-u.ac.jp; Tahara, Shuta [Faculty of Pharmacy, Niigata University of Pharmacy and Applied Life Science, Higashijima, Akiha-ku, Niigata 956-8603 (Japan); Kawakita, Yukinobu [Department of Physics, Faculty of Sciences, Kyushu University, 4-2-1 Ropponmatsu, Chuo-ku, Fukuoka 810-8560 (Japan); Kohara, Shinji [Research and Utilization Division, Japan Synchrotron Radiation Research Institute (JASRI, SPring-8), 1-1-1 Koto, Sayo-cho, Sayo-gun, Hyogo 679-5198 (Japan); Takeda, Shin' ichi [Department of Physics, Faculty of Sciences, Kyushu University, 4-2-1 Ropponmatsu, Chuo-ku, Fukuoka 810-8560 (Japan)
2009-02-21
The structure of molten AgBr has been studied by means of neutron and X-ray diffractions with the aid of structural modeling. It is confirmed that the Ag-Ag correlation has a small but well-defined first peak in the partial pair distribution function whose tail penetrates into the Ag-Br nearest neighbor distribution. This feature on the Ag-Ag correlation is intermediate between that of molten AgCl (non-superionic melt) and that of molten AgI (superionic melt). The analysis of Br-Ag-Br bond angle reveals that molten AgBr preserves a rocksalt type local ordering in the solid phase, suggesting that molten AgBr is clarified as non-superionic melt like molten AgCl.
Basic linear partial differential equations
Treves, Francois
1975-01-01
Focusing on the archetypes of linear partial differential equations, this text for upper-level undergraduates and graduate students features most of the basic classical results. The methods, however, are decidedly nontraditional: in practically every instance, they tend toward a high level of abstraction. This approach recalls classical material to contemporary analysts in a language they can understand, as well as exploiting the field's wealth of examples as an introduction to modern theories.The four-part treatment covers the basic examples of linear partial differential equations and their
Elements of partial differential equations
Sneddon, Ian Naismith
1957-01-01
Geared toward students of applied rather than pure mathematics, this volume introduces elements of partial differential equations. Its focus is primarily upon finding solutions to particular equations rather than general theory.Topics include ordinary differential equations in more than two variables, partial differential equations of the first and second orders, Laplace's equation, the wave equation, and the diffusion equation. A helpful Appendix offers information on systems of surfaces, and solutions to the odd-numbered problems appear at the end of the book. Readers pursuing independent st
Partial Molar Volumes of Aqua Ions from First Principles.
Wiktor, Julia; Bruneval, Fabien; Pasquarello, Alfredo
2017-08-08
Partial molar volumes of ions in water solution are calculated through pressures obtained from ab initio molecular dynamics simulations. The correct definition of pressure in charged systems subject to periodic boundary conditions requires access to the variation of the electrostatic potential upon a change of volume. We develop a scheme for calculating such a variation in liquid systems by setting up an interface between regions of different density. This also allows us to determine the absolute deformation potentials for the band edges of liquid water. With the properly defined pressures, we obtain partial molar volumes of a series of aqua ions in very good agreement with experimental values.
Partial logics with two kinds of negation as a foundation for knowledge-based reasoning
H. Herre; J.O.M. Jaspars; G. Wagner
1995-01-01
textabstractWe show how to use model classes of partial logic to define semantics of general knowledge-based reasoning. Its essential benefit is that partial logics allow us to distinguish two sorts of negative information: the absence of information and the explicit rejection or falsification of
International Nuclear Information System (INIS)
Chatterjee, Aritra; Bhattacharya, Baidurya; Agrawal, Gunjan; Mondal, Apurba
2011-01-01
Partial safety factors (PSFs) used in reliability-based design are intended to account for uncertainties in load, material and mathematical modeling while ensuring that the target reliability is satisfied for the relevant class of structural components in the given load combination and limit state. This paper describes the methodology in detail for developing a set of optimal reliability-based PSFs for the design of rectangular partially prestressed concrete sections subjected to biaxial flexure. The mechanical formulation of the flexural limit state is based on the principle behind prestressed concrete design recommended by IS 1343 and SP16 and failure is defined as tensile cracking of concrete extending beyond the depth of cover. The applied moments are combined according to Wood's criteria. The optimization of the PSFs is based on reliability indices obtained from first order reliability analysis of the structural components; Monte Carlo simulations are performed in each run to determine the capacity statistics and dependence between capacity and applied loads (effected through the axial loads influencing moment capacity corresponding to cracking). Numerical examples involving flexural design of partially prestressed concrete shell elements in nuclear power plant containments under accidental pressure load combination are provided. (author)
Timed Testing under Partial Observability
DEFF Research Database (Denmark)
David, Alexandre; Larsen, Kim Guldstrand; Li, Shuhao
2009-01-01
observability of SUT using a set of predicates over the TGA state space, and specify the test purposes in Computation Tree Logic (CTL) formulas. A recently developed partially observable timed game solver is used to generate winning strategies, which are used as test cases. We propose a conformance testing...
Variable Selection via Partial Correlation.
Li, Runze; Liu, Jingyuan; Lou, Lejia
2017-07-01
Partial correlation based variable selection method was proposed for normal linear regression models by Bühlmann, Kalisch and Maathuis (2010) as a comparable alternative method to regularization methods for variable selection. This paper addresses two important issues related to partial correlation based variable selection method: (a) whether this method is sensitive to normality assumption, and (b) whether this method is valid when the dimension of predictor increases in an exponential rate of the sample size. To address issue (a), we systematically study this method for elliptical linear regression models. Our finding indicates that the original proposal may lead to inferior performance when the marginal kurtosis of predictor is not close to that of normal distribution. Our simulation results further confirm this finding. To ensure the superior performance of partial correlation based variable selection procedure, we propose a thresholded partial correlation (TPC) approach to select significant variables in linear regression models. We establish the selection consistency of the TPC in the presence of ultrahigh dimensional predictors. Since the TPC procedure includes the original proposal as a special case, our theoretical results address the issue (b) directly. As a by-product, the sure screening property of the first step of TPC was obtained. The numerical examples also illustrate that the TPC is competitively comparable to the commonly-used regularization methods for variable selection.
Adaptive Partially Hidden Markov Models
DEFF Research Database (Denmark)
Forchhammer, Søren Otto; Rasmussen, Tage
1996-01-01
Partially Hidden Markov Models (PHMM) have recently been introduced. The transition and emission probabilities are conditioned on the past. In this report, the PHMM is extended with a multiple token version. The different versions of the PHMM are applied to bi-level image coding....
Partially molten magma ocean model
International Nuclear Information System (INIS)
Shirley, D.N.
1983-01-01
The properties of the lunar crust and upper mantle can be explained if the outer 300-400 km of the moon was initially only partially molten rather than fully molten. The top of the partially molten region contained about 20% melt and decreased to 0% at 300-400 km depth. Nuclei of anorthositic crust formed over localized bodies of magma segregated from the partial melt, then grew peripherally until they coverd the moon. Throughout most of its growth period the anorthosite crust floated on a layer of magma a few km thick. The thickness of this layer is regulated by the opposing forces of loss of material by fractional crystallization and addition of magma from the partial melt below. Concentrations of Sr, Eu, and Sm in pristine ferroan anorthosites are found to be consistent with this model, as are trends for the ferroan anorthosites and Mg-rich suites on a diagram of An in plagioclase vs. mg in mafics. Clustering of Eu, Sr, and mg values found among pristine ferroan anorthosites are predicted by this model
[Posterior ceramic bonded partial restorations].
Mainjot, Amélie; Vanheusden, Alain
2006-01-01
Posterior ceramic bonded partial restorations are conservative and esthetic approaches for compromised teeth. Overlays constitute a less invasive alternative for tooth tissues than crown preparations. With inlays and onlays they are also indicated in case of full arch or quadrant rehabilitations including several teeth. This article screens indications and realization of this type of restorations.
Implementing circularity using partial evaluation
DEFF Research Database (Denmark)
Lawall, Julia Laetitia
2001-01-01
of an imperative C-like language, by extending the language with a new construct, persistent variables. We show that an extension of partial evaluation can eliminate persistent variables, producing a staged C program. This approach has been implemented in the Tempo specializer for C programs, and has proven useful...
Visually defining and querying consistent multi-granular clinical temporal abstractions.
Combi, Carlo; Oliboni, Barbara
2012-02-01
The main goal of this work is to propose a framework for the visual specification and query of consistent multi-granular clinical temporal abstractions. We focus on the issue of querying patient clinical information by visually defining and composing temporal abstractions, i.e., high level patterns derived from several time-stamped raw data. In particular, we focus on the visual specification of consistent temporal abstractions with different granularities and on the visual composition of different temporal abstractions for querying clinical databases. Temporal abstractions on clinical data provide a concise and high-level description of temporal raw data, and a suitable way to support decision making. Granularities define partitions on the time line and allow one to represent time and, thus, temporal clinical information at different levels of detail, according to the requirements coming from the represented clinical domain. The visual representation of temporal information has been considered since several years in clinical domains. Proposed visualization techniques must be easy and quick to understand, and could benefit from visual metaphors that do not lead to ambiguous interpretations. Recently, physical metaphors such as strips, springs, weights, and wires have been proposed and evaluated on clinical users for the specification of temporal clinical abstractions. Visual approaches to boolean queries have been considered in the last years and confirmed that the visual support to the specification of complex boolean queries is both an important and difficult research topic. We propose and describe a visual language for the definition of temporal abstractions based on a set of intuitive metaphors (striped wall, plastered wall, brick wall), allowing the clinician to use different granularities. A new algorithm, underlying the visual language, allows the physician to specify only consistent abstractions, i.e., abstractions not containing contradictory conditions on
Partial solvation parameters and LSER molecular descriptors
International Nuclear Information System (INIS)
Panayiotou, Costas
2012-01-01
Graphical abstract: The one-to-one correspondence of LSER molecular descriptors and partial solvation parameters (PSPs) for propionic acid. Highlights: ► Quantum-mechanics based development of a new QSPR predictive method. ► One-to-one correspondence of partial solvation parameters and LSER molecular descriptors. ► Development of alternative routes for the determination of partial solvation parameters and solubility parameters. ► Expansion and enhancement of solubility parameter approach. - Abstract: The partial solvation parameters (PSP) have been defined recently, on the basis of the insight derived from modern quantum chemical calculations, in an effort to overcome some of the inherent restrictions of the original definition of solubility parameter and expand its range of applications. The present work continues along these lines and introduces two new solvation parameters, the van der Waals and the polarity/refractivity ones, which may replace both of the former dispersion and polar PSPs. Thus, one may use either the former scheme of PSPs (dispersion, polar, acidic, and basic) or, equivalently, the new scheme (van der Waals, polarity/refractivity, acidic, basic). The new definitions are made in a simple and straightforward manner and, thus, the strength and appeal of the widely accepted concept of solubility parameter is preserved. The inter-relations of the various PSPs are critically discussed and their values are tabulated for a variety of common substances. The advantage of the new scheme of PSPs is the bridge that makes with the corresponding Abraham’s LSER descriptors. With this bridge, one may exchange information between PSPs, LSER experimental scales, and quantum mechanics calculations such as via the COSMO-RS theory. The proposed scheme is a predictive one and it is applicable to, both, homo-solvated and hetero-solvated compounds. The new scheme is tested for the calculation of activity coefficients at infinite dilution, for octanol
The strategic value of partial vertical integration
Fiocco, Raffaele
2014-01-01
We investigate the strategic incentives for partial vertical integration, namely, partial ownership agreements between manufacturers and retailers, when retailers privately know their costs and engage in differentiated good price competition. The partial misalignment between the profit objectives within a partially integrated manufacturer-retailer hierarchy entails a higher retail price than under full integration. This `information vertical effect' translates into an opposite ...
32 CFR 751.13 - Partial payments.
2010-07-01
... voucher and all other information related to the partial payment shall be placed in the claim file. Action... 32 National Defense 5 2010-07-01 2010-07-01 false Partial payments. 751.13 Section 751.13 National... Claims Against the United States § 751.13 Partial payments. (a) Partial payments when hardship exists...
A Methodology to Define Flood Resilience
Tourbier, J.
2012-04-01
Flood resilience has become an internationally used term with an ever-increasing number of entries on the Internet. The SMARTeST Project is looking at approaches to flood resilience through case studies at cities in various countries, including Washington D.C. in the United States. In light of U.S. experiences a methodology is being proposed by the author that is intended to meet ecologic, spatial, structural, social, disaster relief and flood risk aspects. It concludes that: "Flood resilience combines (1) spatial, (2) structural, (3) social, and (4) risk management levels of flood preparedness." Flood resilience should incorporate all four levels, but not necessarily with equal emphasis. Stakeholders can assign priorities within different flood resilience levels and the considerations they contain, dividing 100% emphasis into four levels. This evaluation would be applied to planned and completed projects, considering existing conditions, goals and concepts. We have long known that the "road to market" for the implementation of flood resilience is linked to capacity building of stakeholders. It is a multidisciplinary enterprise, involving the integration of all the above aspects into the decision-making process. Traditional flood management has largely been influenced by what in the UK has been called "Silo Thinking", involving constituent organizations that are responsible for different elements, and are interested only in their defined part of the system. This barrier to innovation also has been called the "entrapment effect". Flood resilience is being defined as (1) SPATIAL FLOOD RESILIENCE implying the management of land by floodplain zoning, urban greening and management to reduce storm runoff through depression storage and by practicing Sustainable Urban Drainage (SUD's), Best Management Practices (BMP's, or Low Impact Development (LID). Ecologic processes and cultural elements are included. (2) STRUCTURAL FLOOD RESILIENCE referring to permanent flood defense
Indico CONFERENCE: Define the Call for Abstracts
CERN. Geneva; Ferreira, Pedro
2017-01-01
In this tutorial, you will learn how to define and open a call for abstracts. When defining a call for abstracts, you will be able to define settings related to the type of questions asked during a review of an abstract, select the users who will review the abstracts, decide when to open the call for abstracts, and more.
On defining semantics of extended attribute grammars
DEFF Research Database (Denmark)
Madsen, Ole Lehrmann
1980-01-01
Knuth has introduced attribute grammars (AGs) as a tool to define the semanitcs of context-free languages. The use of AGs in connection with programming language definitions has mostly been to define the context-sensitive syntax of the language and to define a translation in code for a hypothetic...
Languages for Software-Defined Networks
2013-02-01
switches, firewalls, and middleboxes) with closed and proprietary configuration inter- faces. Software - Defined Networks ( SDN ) are poised to change...how- ever, have seen growing interest in software - defined networks ( SDNs ), in which a logically-centralized controller manages the packet-processing...switches, firewalls, and middleboxes) with closed and proprietary configuration interfaces. Software - Defined Networks ( SDN ) are poised to change this
Removable partial dentures: clinical concepts.
Bohnenkamp, David M
2014-01-01
This article provides a review of the traditional clinical concepts for the design and fabrication of removable partial dentures (RPDs). Although classic theories and rules for RPD designs have been presented and should be followed, excellent clinical care for partially edentulous patients may also be achieved with computer-aided design/computer-aided manufacturing technology and unique blended designs. These nontraditional RPD designs and fabrication methods provide for improved fit, function, and esthetics by using computer-aided design software, composite resin for contours and morphology of abutment teeth, metal support structures for long edentulous spans and collapsed occlusal vertical dimensions, and flexible, nylon thermoplastic material for metal-supported clasp assemblies. Copyright © 2014 Elsevier Inc. All rights reserved.
Partial scram incident in FBTR
International Nuclear Information System (INIS)
Usha, S.; Pillai, C.P.; Muralikrishna, G.
1989-01-01
Evaluation of a partial scram incident occurred at the Fast Breeder Test Reactor at Kalpakkam was carried out. Based on the observations of the experiments it was ascertained that the nonpersistant order was due to superimposed noise component on the channel that was close to the threshold and had resulted in intermittent supply to electro-magnetic (EM) coils. Owing to a larger discharge time and a smaller charge time, the EM coils got progressively discharged. It was confirmed that during the incident, partial scram took place since the charging and discharging patterns of the EM coils are dissimilar and EM coils of rods A, E and F had discharged faster than others for noise component of a particular duty cycle. However, nonlatching of scram order was because of the fact that noise pulse duration was less than latching time. (author)
The marketing of partial hospitalization.
Millsap, P; Brown, E; Kiser, L; Pruitt, D
1987-09-01
Health-care professionals are currently operating in the context of a rapidly changing health-care delivery system, including the move away from inpatient services to outpatient services in order to control costs. Those who practice in partial-hospital settings are in a position to offer effective, cost-efficient services; however, there continue to be obstacles which hinder appropriate utilization of the modality. The development and use of a well-designed marketing plan is one strategy for removing these obstacles. This paper presents a brief overview of the marketing process, ideas for developing a marketing plan, and several examples of specific marketing strategies as well as ways to monitor their effectiveness. Partial-hospital providers must take an active role in answering the calls for alternative sources of psychiatric care. A comprehensive, education-oriented marketing approach will increase the public's awareness of such alternatives and enable programs to survive in a competitive environment.
Introduction to partial differential equations
Borthwick, David
2016-01-01
This modern take on partial differential equations does not require knowledge beyond vector calculus and linear algebra. The author focuses on the most important classical partial differential equations, including conservation equations and their characteristics, the wave equation, the heat equation, function spaces, and Fourier series, drawing on tools from analysis only as they arise.Within each section the author creates a narrative that answers the five questions: (1) What is the scientific problem we are trying to understand? (2) How do we model that with PDE? (3) What techniques can we use to analyze the PDE? (4) How do those techniques apply to this equation? (5) What information or insight did we obtain by developing and analyzing the PDE? The text stresses the interplay between modeling and mathematical analysis, providing a thorough source of problems and an inspiration for the development of methods.
Dynamics of partial differential equations
Wayne, C Eugene
2015-01-01
This book contains two review articles on the dynamics of partial differential equations that deal with closely related topics but can be read independently. Wayne reviews recent results on the global dynamics of the two-dimensional Navier-Stokes equations. This system exhibits stable vortex solutions: the topic of Wayne's contribution is how solutions that start from arbitrary initial conditions evolve towards stable vortices. Weinstein considers the dynamics of localized states in nonlinear Schrodinger and Gross-Pitaevskii equations that describe many optical and quantum systems. In this contribution, Weinstein reviews recent bifurcations results of solitary waves, their linear and nonlinear stability properties, and results about radiation damping where waves lose energy through radiation. The articles, written independently, are combined into one volume to showcase the tools of dynamical systems theory at work in explaining qualitative phenomena associated with two classes of partial differential equ...
Partial Cooperative Equilibria: Existence and Characterization
Directory of Open Access Journals (Sweden)
Amandine Ghintran
2010-09-01
Full Text Available We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.
Partial dependency parsing for Irish
Uí Dhonnchadha, Elaine; van Genabith, Josef
2010-01-01
In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unrestricted Irish text. Chunking is performed using a regular-expression grammar which operates on the dependency tagged sentences. As this is the first implementation of a parser for unrestricted Irish text (to our knowledge), there were no guidelines or precedents available. Therefore deciding what constitutes a syntac...
Matching games with partial information
Laureti, Paolo; Zhang, Yi-Cheng
2003-06-01
We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual “satisfactions”. Then we explore the role of partial information and bounded rationality in a generalized Marriage Problem, comparing the benefits obtained by self-searching and by a matchmaker. Finally we propose a modified matching game intended to mimic the way consumers’ information makes firms to enhance the quality of their products in a competitive market.
Stochastic Pseudo-Boolean Optimization
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
Generalized Boolean Functions as Combiners
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
Synchronizing Strategies under Partial Observability
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Laursen, Simon; Srba, Jiri
2014-01-01
Embedded devices usually share only partial information about their current configurations as the communication bandwidth can be restricted. Despite this, we may wish to bring a failed device into a given predetermined configuration. This problem, also known as resetting or synchronizing words, has...... been intensively studied for systems that do not provide any information about their configurations. In order to capture more general scenarios, we extend the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset...
Partial differential equations an introduction
Colton, David
2004-01-01
Intended for a college senior or first-year graduate-level course in partial differential equations, this text offers students in mathematics, engineering, and the applied sciences a solid foundation for advanced studies in mathematics. Classical topics presented in a modern context include coverage of integral equations and basic scattering theory. This complete and accessible treatment includes a variety of examples of inverse problems arising from improperly posed applications. Exercises at the ends of chapters, many with answers, offer a clear progression in developing an understanding of
Laparoscopic Partial Hepatectomy: Animal Experiments
Directory of Open Access Journals (Sweden)
Haruhiro Inoue
1995-01-01
Full Text Available As a first step in firmly establishing laparoscopic hepatectomy, we introduce a porcine model of laparoscopic partial hepatectomy. This procedure has been successfully performed under the normal-pressure or low-pressure pneumoperitoneum condition supported by the full-thickness abdominal wall lifting technique. An ultrasonic dissector combined with electrocautery, newly developed by Olympus Optical Corporation (Japan was effectively utilized in facilitating safe and smooth incisions into the liver parenchyma. Although indications for this procedure seem to be limited only to peripheral lesions and not to central lesions, clinical application of this method may be useful for some patients in the near future.
Defining the Symmetry of the Universal Semi-Regular Autonomous Asynchronous Systems
Directory of Open Access Journals (Sweden)
Serban E. Vlad
2012-02-01
Full Text Available The regular autonomous asynchronous systems are the non-deterministic Boolean dynamical systems and universality means the greatest in the sense of the inclusion. The paper gives four definitions of symmetry of these systems in a slightly more general framework, called semi-regularity, and also many examples.
Complex partial seizures: cerebellar metabolism
Energy Technology Data Exchange (ETDEWEB)
Theodore, W.H.; Fishbein, D.; Deitz, M.; Baldwin, P.
1987-07-01
We used positron emission tomography (PET) with (/sup 18/F)2-deoxyglucose to study cerebellar glucose metabolism (LCMRglu) and the effect of phenytoin (PHT) in 42 patients with complex partial seizures (CPS), and 12 normal controls. Mean +/- SD patient LCMRglu was 6.9 +/- 1.8 mg glucose/100 g/min (left = right), significantly lower than control values of 8.5 +/- 1.8 (left, p less than 0.006), and 8.3 +/- 1.6 (right, p less than 0.02). Only four patients had cerebellar atrophy on CT/MRI; cerebellar LCMRglu in these was 5.5 +/- 1.5 (p = 0.054 vs. total patient sample). Patients with unilateral temporal hypometabolism or EEG foci did not have lateralized cerebellar hypometabolism. Patients receiving phenytoin (PHT) at the time of scan and patients with less than 5 years total PHT exposure had lower LCMRglu, but the differences were not significant. There were weak inverse correlations between PHT level and cerebellar LCMRglu in patients receiving PHT (r = -0.36; 0.05 less than p less than 0.1), as well as between length of illness and LCMRglu (r = -0.22; 0.05 less than p less than 0.1). Patients with complex partial seizures have cerebellar hypometabolism that is bilateral and due only in part to the effect of PHT.
Defining ‘sensitive’ health status: a systematic approach using health code terminologies.
Directory of Open Access Journals (Sweden)
Andy Boyd
2017-04-01
We have demonstrated a systematic and partially interoperable approach to defining ‘sensitive’ health information. However, any such exercise is likely to include decisions which will be open to interpretation and open to change over time. As such, the application of this technique should be embedded within an appropriate governance framework which can accommodate misclassification while minimising potential patient harm.
Arafa, Khalid A O
2018-01-01
To assess the level of evidence that supports the quality of fit for removable partial denture (RPD) fabricated by computer-aided designing/computer aided manufacturing (CAD/CAM) and rapid prototyping (RP) technology. Methods: An electronic search was performed in Google Scholar, PubMed, and Cochrane library search engines, using Boolean operators. All articles published in English and published in the period from 1950 until April 2017 were eligible to be included in this review. The total number of articles contained the search terms in any part of the article (including titles, abstracts, or article texts) were screened, which resulted in 214 articles. After exclusion of irrelevant and duplicated articles, 12 papers were included in this systematic review. Results: All the included studies were case reports, except one study, which was a case series that recruited 10 study participants. The visual and tactile examination in the cast or clinically in the patient's mouth was the most-used method for assessment of the fit of RPDs. From all included studies, only one has assessed the internal fit between RPDs and oral tissues using silicone registration material. The vast majority of included studies found that the fit of RPDs ranged from satisfactory to excellent fit. Conclusion: Despite the lack of clinical trials that provide strong evidence, the available evidence supported the claim of good fit of RPDs fabricated by new technologies using CAD/CAM.
[Removable partial dentures. Oral functions and types].
Creugers, N H J; de Baat, C
2009-11-01
A removable partial denture enables the restoration or improvement of 4 oral functions: aesthetics, mandibular stability, mastication, and speech. However, wearing a removable partial denture should not cause oral comfort to deteriorate. There are 3 types of removable partial dentures: acrylic tissue-supported dentures, dentures with cast metal frameworks en dentures with cast metal frameworks and (semi)precision attachments. Interrupted tooth arches,free-ending tooth arches, and a combination of interrupted as well as free-ending tooth arches can be restored using these dentures. Well-known disadvantages of removable partial dentures are problematic oral hygiene, negative influence on the remaining dentition and limited oral comfort. Due to the advanced possibilities of fixed tooth- or implant-supported partial dentures, whether or not free-ending, or tooth- as well as implant-supported partial dentures, the indication of removable partial dentures is restricted. Nevertheless, for the time being the demand for removable partial dentures is expected to continue.
Abstract methods in partial differential equations
Carroll, Robert W
2012-01-01
Detailed, self-contained treatment examines modern abstract methods in partial differential equations, especially abstract evolution equations. Suitable for graduate students with some previous exposure to classical partial differential equations. 1969 edition.
Male patients with partial androgen insensitivity syndrome
DEFF Research Database (Denmark)
Hellmann, Philip; Christiansen, Peter; Johannsen, Trine Holm
2012-01-01
To describe the natural history of phenotype, growth and gonadal function in patients with partial androgen insensitivity syndrome.......To describe the natural history of phenotype, growth and gonadal function in patients with partial androgen insensitivity syndrome....
PARALLEL SOLUTION METHODS OF PARTIAL DIFFERENTIAL EQUATIONS
Directory of Open Access Journals (Sweden)
Korhan KARABULUT
1998-03-01
Full Text Available Partial differential equations arise in almost all fields of science and engineering. Computer time spent in solving partial differential equations is much more than that of in any other problem class. For this reason, partial differential equations are suitable to be solved on parallel computers that offer great computation power. In this study, parallel solution to partial differential equations with Jacobi, Gauss-Siedel, SOR (Succesive OverRelaxation and SSOR (Symmetric SOR algorithms is studied.
22 CFR 92.36 - Authentication defined.
2010-04-01
... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Authentication defined. 92.36 Section 92.36... Notarial Acts § 92.36 Authentication defined. An authentication is a certification of the genuineness of... recognized in another jurisdiction. Documents which may require authentication include legal instruments...
A definability theorem for first order logic
Butz, C.; Moerdijk, I.
1997-01-01
In this paper we will present a definability theorem for first order logic This theorem is very easy to state and its proof only uses elementary tools To explain the theorem let us first observe that if M is a model of a theory T in a language L then clearly any definable subset S M ie a subset S
Dilution Confusion: Conventions for Defining a Dilution
Fishel, Laurence A.
2010-01-01
Two conventions for preparing dilutions are used in clinical laboratories. The first convention defines an "a:b" dilution as "a" volumes of solution A plus "b" volumes of solution B. The second convention defines an "a:b" dilution as "a" volumes of solution A diluted into a final volume of "b". Use of the incorrect dilution convention could affect…
Defining Hardwood Veneer Log Quality Attributes
Jan Wiedenbeck; Michael Wiemann; Delton Alderman; John Baumgras; William Luppold
2004-01-01
This publication provides a broad spectrum of information on the hardwood veneer industry in North America. Veneer manufacturers and their customers impose guidelines in specifying wood quality attributes that are very discriminating but poorly defined (e.g., exceptional color, texture, and/or figure characteristics). To better understand and begin to define the most...
[Removable partial dentures. Oral functions and types
Creugers, N.H.J.; Baat, C. de
2009-01-01
A removable partial denture enables the restoration or improvement of 4 oral functions: aesthetics, mandibular stability, mastication, and speech. However, wearing a removable partial denture should not cause oral comfort to deteriorate. There are 3 types of removable partial dentures: acrylic
[Conventional retaining of removable partial dentures
Keltjens, H.M.A.M.; Witter, D.J.; Creugers, N.H.J.
2009-01-01
Mechanical and biological criteria have to be met in retaining the metal frame of a removable partial denture. Additionally, a removable partial denture is part of the occlusal interface by the clasps and the denture teeth. With respect to mechanical aspects, all rigid parts of the removable partial
Precipitation in partially stabilized zirconia
International Nuclear Information System (INIS)
Bansal, G.K.
1975-01-01
Transmission electron microscopy was used to study the substructure of partially stabilized ZrO 2 (PSZ) samples, i.e., 2-phase systems containing both cubic and monoclinic modifications of zirconia, after various heat treatments. Monoclinic ZrO 2 exists as (1) isolated grains within the polycrystalline aggregate (a grain- boundary phase) and (2) small plate-like particles within cubic grains. These intragranular precipitates are believed to contribute to the useful properties of PSZ via a form of precipitation hardening. These precipitates initially form as tetragonal ZrO 2 , with a habit plane parallel to the brace 100 brace matrix planes. The orientation relations between the tetragonal precipitates and the cubic matrix are brace 100 brace/sub matrix/ 2 parallel brace 100 brace /sub precipitate/ or (001)/sub precipitate/ and broken bracket 100 broken bracket/sub matrix/ 2 parallel broken bracket 100 broken bracket/sub precipitate/ or [001]/sub precipitate/. (U.S.)
Partially coherent isodiffracting pulsed beams
Koivurova, Matias; Ding, Chaoliang; Turunen, Jari; Pan, Liuzhan
2018-02-01
We investigate a class of isodiffracting pulsed beams, which are superpositions of transverse modes supported by spherical-mirror laser resonators. By employing modal weights that, for stationary light, produce a Gaussian Schell-model beam, we extend this standard model to pulsed beams. We first construct the two-frequency cross-spectral density function that characterizes the spatial coherence in the space-frequency domain. By assuming a power-exponential spectral profile, we then employ the generalized Wiener-Khintchine theorem for nonstationary light to derive the two-time mutual coherence function that describes the space-time coherence of the ensuing beams. The isodiffracting nature of the laser resonator modes permits all (paraxial-domain) calculations at any propagation distance to be performed analytically. Significant spatiotemporal coupling is revealed in subcycle, single-cycle, and few-cycle domains, where the partial spatial coherence also leads to reduced temporal coherence even though full spectral coherence is assumed.
Bilayer graphene quantum dot defined by topgates
Energy Technology Data Exchange (ETDEWEB)
Müller, André; Kaestner, Bernd; Hohls, Frank; Weimann, Thomas; Pierz, Klaus; Schumacher, Hans W., E-mail: hans.w.schumacher@ptb.de [Physikalisch-Technische Bundesanstalt, Bundesallee 100, 38116 Braunschweig (Germany)
2014-06-21
We investigate the application of nanoscale topgates on exfoliated bilayer graphene to define quantum dot devices. At temperatures below 500 mK, the conductance underneath the grounded gates is suppressed, which we attribute to nearest neighbour hopping and strain-induced piezoelectric fields. The gate-layout can thus be used to define resistive regions by tuning into the corresponding temperature range. We use this method to define a quantum dot structure in bilayer graphene showing Coulomb blockade oscillations consistent with the gate layout.
Partial dynamical systems, fell bundles and applications
Exel, Ruy
2017-01-01
Partial dynamical systems, originally developed as a tool to study algebras of operators in Hilbert spaces, has recently become an important branch of algebra. Its most powerful results allow for understanding structural properties of algebras, both in the purely algebraic and in the C*-contexts, in terms of the dynamical properties of certain systems which are often hiding behind algebraic structures. The first indication that the study of an algebra using partial dynamical systems may be helpful is the presence of a grading. While the usual theory of graded algebras often requires gradings to be saturated, the theory of partial dynamical systems is especially well suited to treat nonsaturated graded algebras which are in fact the source of the notion of "partiality". One of the main results of the book states that every graded algebra satisfying suitable conditions may be reconstructed from a partial dynamical system via a process called the partial crossed product. Running in parallel with partial dynamica...
Application-Defined Decentralized Access Control
Xu, Yuanzhong; Dunn, Alan M.; Hofmann, Owen S.; Lee, Michael Z.; Mehdi, Syed Akbar; Witchel, Emmett
2014-01-01
DCAC is a practical OS-level access control system that supports application-defined principals. It allows normal users to perform administrative operations within their privilege, enabling isolation and privilege separation for applications. It does not require centralized policy specification or management, giving applications freedom to manage their principals while the policies are still enforced by the OS. DCAC uses hierarchically-named attributes as a generic framework for user-defined policies such as groups defined by normal users. For both local and networked file systems, its execution time overhead is between 0%–9% on file system microbenchmarks, and under 1% on applications. This paper shows the design and implementation of DCAC, as well as several real-world use cases, including sandboxing applications, enforcing server applications’ security policies, supporting NFS, and authenticating user-defined sub-principals in SSH, all with minimal code changes. PMID:25426493
Software Defined Multiband EVA Radio, Phase I
National Aeronautics and Space Administration — The objective of this research is to propose a reliable, lightweight, programmable, multi-band, multi-mode, miniaturized frequency-agile EVA software defined radio...
Reconfigurable, Cognitive Software Defined Radio, Phase II
National Aeronautics and Space Administration — IAI is actively developing Software Defined Radio platforms that can adaptively switch between different modes of operation by modifying both transmit waveforms and...
Software Defined Multiband EVA Radio, Phase II
National Aeronautics and Space Administration — The objective of Phase 2 is to build a reliable, lightweight, programmable, multi-mode, miniaturized EVA Software Defined Radio (SDR) that supports data telemetry,...
Reconfigurable, Cognitive Software Defined Radio, Phase I
National Aeronautics and Space Administration — Intelligent Automation Inc, (IAI) is currently developing a software defined radio (SDR) platform that can adaptively switch between different modes of operation for...
Optimum Criteria for Developing Defined Structures
Directory of Open Access Journals (Sweden)
Ion IVAN
2008-01-01
Full Text Available Basic aspects concerning distributed applications are presented: definition, particularities and importance. For distributed applications linear, arborescent, graph structures are defined with different versions and aggregation methods. Distributed applications have associated structures which through their characteristics influence the costs of the stages in the development cycle and the exploitation costs transferred to each user. The complexity of the defined structures is analyzed. The minimum and maximum criteria are enumerated for optimizing distributed application structures.
Compatible Spatial Discretizations for Partial Differential Equations
Energy Technology Data Exchange (ETDEWEB)
Arnold, Douglas, N, ed.
2004-11-25
From May 11--15, 2004, the Institute for Mathematics and its Applications held a hot topics workshop on Compatible Spatial Discretizations for Partial Differential Equations. The numerical solution of partial differential equations (PDE) is a fundamental task in science and engineering. The goal of the workshop was to bring together a spectrum of scientists at the forefront of the research in the numerical solution of PDEs to discuss compatible spatial discretizations. We define compatible spatial discretizations as those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. A wide variety of discretization methods applied across a wide range of scientific and engineering applications have been designed to or found to inherit or mimic intrinsic spatial structure and reproduce fundamental properties of the solution of the continuous PDE model at the finite dimensional level. A profusion of such methods and concepts relevant to understanding them have been developed and explored: mixed finite element methods, mimetic finite differences, support operator methods, control volume methods, discrete differential forms, Whitney forms, conservative differencing, discrete Hodge operators, discrete Helmholtz decomposition, finite integration techniques, staggered grid and dual grid methods, etc. This workshop seeks to foster communication among the diverse groups of researchers designing, applying, and studying such methods as well as researchers involved in practical solution of large scale problems that may benefit from advancements in such discretizations; to help elucidate the relations between the different methods and concepts; and to generally advance our understanding in the area of compatible spatial discretization methods for PDE. Particular points of emphasis included: + Identification of intrinsic properties of PDE models that are critical for the fidelity of numerical
Scala vestibuli cochlear implantation in patients with partially ossified cochleas.
Berrettini, Stefano; Forli, Francesca; Neri, Emanuele; Segnini, Giovanni; Franceschini, Stefano Sellari
2002-11-01
Partial cochlear obstruction is a relatively common finding in candidates for cochlear implants and frequently involves the inferior segment of the scala tympani in the basal turn of the cochlea. In such patients, the scala vestibuli is often patent and offers an alternative site for implantation. The current report describes two patients with such partial obstruction of the inferior segment of the basal cochlear turn, caused in one case by systemic vasculitis (Takayasu's disease) and in the other by obliterative otosclerosis. A scala vestibuli implantation allowed for complete insertion of the electrode array. No problems were encountered during the surgical procedures and the good post-operative hearing and communicative outcomes achieved were similar to those reported in patients without cochlear ossification. The importance of accurate pre-operative radiological study of the inner ear is underscored, to disclose the presence and define the features of the cochlear ossification and ultimately to properly plan the surgical approach.
The partially alternating ternary sum in an associative dialgebra
International Nuclear Information System (INIS)
Bremner, Murray R; Sanchez-Ortega, Juana
2010-01-01
The alternating ternary sum in an associative algebra, abc - acb - bac + bca + cab - cba, gives rise to the partially alternating ternary sum in an associative dialgebra with products dashv and vdash by making the argument a the center of each term. We use computer algebra to determine the polynomial identities in degree ≤9 satisfied by this new trilinear operation. In degrees 3 and 5, these identities define a new variety of partially alternating ternary algebras. We show that there is a 49-dimensional space of multilinear identities in degree 7, and we find equivalent nonlinear identities. We use the representation theory of the symmetric group to show that there are no new identities in degree 9.
Deficient motion-defined and texture-defined figure-ground segregation in amblyopic children.
Wang, Jane; Ho, Cindy S; Giaschi, Deborah E
2007-01-01
Motion-defined form deficits in the fellow eye and the amblyopic eye of children with amblyopia implicate possible direction-selective motion processing or static figure-ground segregation deficits. Deficient motion-defined form perception in the fellow eye of amblyopic children may not be fully accounted for by a general motion processing deficit. This study investigates the contribution of figure-ground segregation deficits to the motion-defined form perception deficits in amblyopia. Performances of 6 amblyopic children (5 anisometropic, 1 anisostrabismic) and 32 control children with normal vision were assessed on motion-defined form, texture-defined form, and global motion tasks. Performance on motion-defined and texture-defined form tasks was significantly worse in amblyopic children than in control children. Performance on global motion tasks was not significantly different between the 2 groups. Faulty figure-ground segregation mechanisms are likely responsible for the observed motion-defined form perception deficits in amblyopia.
The canonical partial metric and the uniform convexity on normed spaces
Directory of Open Access Journals (Sweden)
S. Oltra
2005-10-01
Full Text Available In this paper we introduce the notion of canonical partial metric associated to a norm to study geometric properties of normed spaces. In particular, we characterize strict convexity and uniform convexity of normed spaces in terms of the canonical partial metric defined by its norm. We prove that these geometric properties can be considered, in this sense, as topological properties that appear when we compare the natural metric topology of the space with the non translation invariant topology induced by the canonical partial metric in the normed space.
Partial differential equations of mathematical physics
Sobolev, S L
1964-01-01
Partial Differential Equations of Mathematical Physics emphasizes the study of second-order partial differential equations of mathematical physics, which is deemed as the foundation of investigations into waves, heat conduction, hydrodynamics, and other physical problems. The book discusses in detail a wide spectrum of topics related to partial differential equations, such as the theories of sets and of Lebesgue integration, integral equations, Green's function, and the proof of the Fourier method. Theoretical physicists, experimental physicists, mathematicians engaged in pure and applied math
[Removable partial dentures. Oral functions and types
Creugers, N.H.J.; Baat, C. de
2009-01-01
A removable partial denture enables the restoration or improvement of 4 oral functions: aesthetics, mandibular stability, mastication, and speech. However, wearing a removable partial denture should not cause oral comfort to deteriorate. There are 3 types of removable partial dentures: acrylic tissue-supported dentures, dentures with cast metal frameworks en dentures with cast metal frameworks and (semi)precision attachments. Interrupted tooth arches,free-ending tooth arches, and a combinatio...
Partial vaginismus : definition, symptoms and treatment
Engman, Maria
2007-01-01
Vaginismus is a sexual pain disorder, where spasm of musculature of the outer third of the vagina interferes with intercourse. Vaginismus exists in two forms: total vaginismus, where intercourse is impossible, and the more seldom described partial vaginismus, in which intercourse is possible but painful. The aim of the thesis was to develop a useful definition of partial vaginismus for both clinical and scientific purposes; to describe the prevalence of partial vaginismus among women with sup...
Partial Evaluation of the Euclidian Algorithm
DEFF Research Database (Denmark)
Danvy, Olivier; Goldberg, Mayer
1997-01-01
-like behavior. Each of them presents a challenge for partial evaluation. The Euclidian algorithm is one of them, and in this article, we make it amenable to partial evaluation. We observe that the number of iterations in the Euclidian algorithm is bounded by a number that can be computed given either of the two...... arguments. We thus rephrase this algorithm using bounded recursion. The resulting program is better suited for automatic unfolding and thus for partial evaluation. Its specialization is efficient....
Vogelaar, Ingrid P; Ligtenberg, Marjolijn J L; van der Post, Rachel S; de Voer, Richarda M; Kets, C Marleen; Jansen, Trees J G; Jacobs, Liesbeth; Schreibelt, Gerty; de Vries, I Jolanda M; Netea, Mihai G; Hoogerbrugge, Nicoline
2016-04-01
Gastric cancer is caused by both genetic and environmental factors. A woman who suffered from recurrent candidiasis throughout her life developed diffuse-type gastric cancer at the age of 23 years. Using whole-exome sequencing we identified a germline homozygous missense variant in MYD88. Immunological assays on peripheral blood mononuclear cells revealed an impaired immune response upon stimulation with Candida albicans, characterized by a defective production of the cytokine interleukin-17. Our data suggest that a genetic defect in MYD88 results in an impaired immune response and may increase gastric cancer risk.
Vogelaar, Ingrid P.; Ligtenberg, Marjolijn J L; van der Post, Rachel S.; de Voer, Richarda M.; Kets, C. Marleen; Jansen, Trees J G; Jacobs, Liesbeth; Schreibelt, Gerty; de Vries, I. Jolanda M; Netea, Mihai G.; Hoogerbrugge, Nicoline; Lubinski, Jan; Jakubowska, Anna; Teodorczyk, Urszula; Schackert, Hans K.; Aalfs, Cora M.; Gómez García, Encarna B.; Ranzani, Guglielmina N.; Molinaro, Valeria; van Hest, Liselotte P.; Hes, Frederik J.; Holinski-Feder, Elke; Genuardi, Maurizio; Ausems, Margreet G E M; Sijmons, Rolf H.; Wagner, Anja; van der Kolk, Lizet E.; Pinheiro, Hugo; Oliveira, Carla; Bjørnevoll, Inga; Høberg Vetti, Hildegunn; Van Krieken, J. Han J M
2016-01-01
Gastric cancer is caused by both genetic and environmental factors. A woman who suffered from recurrent candidiasis throughout her life developed diffuse-type gastric cancer at the age of 23 years. Using whole-exome sequencing we identified a germline homozygous missense variant in MYD88.
International Nuclear Information System (INIS)
Teschendorff, Andrew E; Gomez, Sergio; Arenas, Alex; El-Ashry, Dorraya; Schmidt, Marcus; Gehrmann, Mathias; Caldas, Carlos
2010-01-01
Elucidating the activation pattern of molecular pathways across a given tumour type is a key challenge necessary for understanding the heterogeneity in clinical response and for developing novel more effective therapies. Gene expression signatures of molecular pathway activation derived from perturbation experiments in model systems as well as structural models of molecular interactions ('model signatures') constitute an important resource for estimating corresponding activation levels in tumours. However, relatively few strategies for estimating pathway activity from such model signatures exist and only few studies have used activation patterns of pathways to refine molecular classifications of cancer. Here we propose a novel network-based method for estimating pathway activation in tumours from model signatures. We find that although the pathway networks inferred from cancer expression data are highly consistent with the prior information contained in the model signatures, that they also exhibit a highly modular structure and that estimation of pathway activity is dependent on this modular structure. We apply our methodology to a panel of 438 estrogen receptor negative (ER-) and 785 estrogen receptor positive (ER+) breast cancers to infer activation patterns of important cancer related molecular pathways. We show that in ER negative basal and HER2+ breast cancer, gene expression modules reflecting T-cell helper-1 (Th1) and T-cell helper-2 (Th2) mediated immune responses play antagonistic roles as major risk factors for distant metastasis. Using Boolean interaction Cox-regression models to identify non-linear pathway combinations associated with clinical outcome, we show that simultaneous high activation of Th1 and low activation of a TGF-beta pathway module defines a subtype of particularly good prognosis and that this classification provides a better prognostic model than those based on the individual pathways. In ER+ breast cancer, we find that
Hanford defined waste model limitations and improvements
International Nuclear Information System (INIS)
HARMSEN, R.W.
1999-01-01
Recommendation 93-5 Implementation Plan, Milestone 5,6.3.1.i requires issuance of this report which addresses ''updates to the tank contents model''. This report summarizes the review of the Hanford Defined Waste, Revision 4, model limitations and provides conclusions and recommendations for potential updates to the model
Parallel Education and Defining the Fourth Sector.
Chessell, Diana
1996-01-01
Parallel to the primary, secondary, postsecondary, and adult/community education sectors is education not associated with formal programs--learning in arts and cultural sites. The emergence of cultural and educational tourism is an opportunity for adult/community education to define itself by extending lifelong learning opportunities into parallel…
Bruxism defined and graded: an international consensus
Lobbezoo, F.; Ahlberg, J.; Glaros, A.G.; Kato, T.; Koyano, K.; Lavigne, G.J.; de Leeuw, R.; Manfredini, D.; Svensson, P.; Winocur, E.
2013-01-01
To date, there is no consensus about the definition and diagnostic grading of bruxism. A written consensus discussion was held among an international group of bruxism experts as to formulate a definition of bruxism and to suggest a grading system for its operationalisation. The expert group defined
2010-01-01
... Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing..., TESTING, AND STANDARDS Cotton Fiber and Processing Tests Definitions § 28.950 Terms defined. As used... Agricultural Marketing Service of the U.S. Department of Agriculture. (c) Administrator. The Administrator of...
47 CFR 54.401 - Lifeline defined.
2010-10-01
... SERVICE Universal Service Support for Low-Income Consumers § 54.401 Lifeline defined. (a) As used in this subpart, Lifeline means a retail local service offering: (1) That is available only to qualifying low-income consumers; (2) For which qualifying low-income consumers pay reduced charges as a result of...
How Should Energy Be Defined throughout Schooling?
Bächtold, Manuel
2018-01-01
The question of how to teach energy has been renewed by recent studies focusing on the learning and teaching progressions for this concept. In this context, one question has been, for the most part, overlooked: how should energy be defined throughout schooling? This paper addresses this question in three steps. We first identify and discuss two…
Big data and software defined networks
Taheri, Javid
2018-01-01
Big Data Analytics and Software Defined Networking (SDN) are helping to drive the management of data usage of the extraordinary increase of computer processing power provided by Cloud Data Centres (CDCs). This new book investigates areas where Big-Data and SDN can help each other in delivering more efficient services.
Delta Semantics Defined By Petri Nets
DEFF Research Database (Denmark)
Jensen, Kurt; Kyng, Morten; Madsen, Ole Lehrmann
and the possibility of using predicates to specify state changes. In this paper a formal semantics for Delta is defined and analysed using Petri nets. Petri nets was chosen because the ideas behind Petri nets and Delta concide on several points. A number of proposals for changes in Delta, which resulted from...
Towards a Southern African English Defining Vocabulary
African Journals Online (AJOL)
user
of parameters, such as avoiding synonyms and antonyms, to determine which words are necessary to write definitions in a concise and simple way. It has been found that existing defining vocabularies lack certain words that would make definitions more accessible to southern African learners, and therefore there is a need ...
Spaces defined by the Paley function
Energy Technology Data Exchange (ETDEWEB)
Astashkin, S V [Samara State University, Samara (Russian Federation); Semenov, E M [Voronezh State University, Faculty of Mathematics, Voronezh (Russian Federation)
2013-07-31
The paper is concerned with Haar and Rademacher series in symmetric spaces, and also with the properties of spaces defined by the Paley function. In particular, the symmetric hull of the space of functions with uniformly bounded Paley function is found. Bibliography: 27 titles.
Pointwise extensions of GSOS-defined operations
Hansen, H.H.; Klin, B.
2011-01-01
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such
Pointwise Extensions of GSOS-Defined Operations
H.H. Hansen (Helle); B. Klin
2011-01-01
textabstractFinal coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor $\\FSig$ over a behaviour functor $F$). Such distributive laws correspond to abstract specification
Defining Virtual Reality: Dimensions Determining Telepresence.
Steuer, Jonathan
1992-01-01
Defines virtual reality as a particular type of experience (in terms of "presence" and "telepresence") rather than as a collection of hardware. Maintains that media technologies can be classified and studied in terms of vividness and interactivity, two attributes on which virtual reality ranks very high. (SR)
A self-defining hierarchical data system
Bailey, J.
1992-01-01
The Self-Defining Data System (SDS) is a system which allows the creation of self-defining hierarchical data structures in a form which allows the data to be moved between different machine architectures. Because the structures are self-defining they can be used for communication between independent modules in a distributed system. Unlike disk-based hierarchical data systems such as Starlink's HDS, SDS works entirely in memory and is very fast. Data structures are created and manipulated as internal dynamic structures in memory managed by SDS itself. A structure may then be exported into a caller supplied memory buffer in a defined external format. This structure can be written as a file or sent as a message to another machine. It remains static in structure until it is reimported into SDS. SDS is written in portable C and has been run on a number of different machine architectures. Structures are portable between machines with SDS looking after conversion of byte order, floating point format, and alignment. A Fortran callable version is also available for some machines.
Partial discharges and bulk dielectric field enhancement
DEFF Research Database (Denmark)
McAllister, Iain Wilson; Johansson, Torben
2000-01-01
A consequence of partial discharge activity within a gaseous void is the production of a field enhancement in the solid dielectric in the proximity of the void. This situation arises due to the charge created by the partial discharges accumulating at the void wall. The influence of the spatial...
Laparoscopic partial nephrectomy for endophytic hilar tumors
DEFF Research Database (Denmark)
Di Pierro, G B; Tartaglia, N; Aresu, L
2014-01-01
To analyze feasibility and outcomes of laparoscopic partial nephrectomy (LPN) for endophytic hilar tumors in low-intermediate (ASA I-II) risk patients.......To analyze feasibility and outcomes of laparoscopic partial nephrectomy (LPN) for endophytic hilar tumors in low-intermediate (ASA I-II) risk patients....
Removable partial overdentures for the irradiated patient
International Nuclear Information System (INIS)
Rosenberg, S.W.
1990-01-01
Patients who have received radiotherapy to the head and neck area must avoid dental extractions and seek simplicity in treatment and home care follow-up. For partially edentulous patients, removable partial overdenture therapy can fulfill these goals while maintaining the high level of function and aesthetics desired by patients.11 references
Coordinating choice in partial cooperative equilibrium
Mallozzi, L.; Tijs, S.H.
2009-01-01
In this paper we consider symmetric aggregative games and investigate partial cooperation between a portion of the players that sign a cooperative agreement and the rest of the players. Existence results of partial cooperative equilibria are obtained when the players who do not sign the agreement
Memoization in Type-Directed Partial Evaluation
DEFF Research Database (Denmark)
Balat, Vincent; Danvy, Olivier
2002-01-01
the functions and type-directed partial evaluation provides a convenient setting to obtain the normal form of their composition. However, off-the-shelf type-directed partial evaluation turns out to yield gigantic normal forms. We identify that this gigantism is due to redundancies, and that these redundancies...
Mathematical Modelling of Intraretinal Oxygen Partial Pressure ...
African Journals Online (AJOL)
Purpose: The aim of our present work is to develop a simple steady state model for intraretinal oxygen partial pressure distribution and to investigate the effect of various model parameters on the partial pressure distribution under adapted conditions of light and darkness.. Method: A simple eight-layered mathematical model ...
Zero ischemia laparoscopic partial thulium laser nephrectomy.
LENUS (Irish Health Repository)
Thomas, Arun Z
2013-11-01
Laser technology presents a promising alternative to achieve tumor excision and renal hemostasis with or without hilar occlusion, yet its use in partial nephrectomy has not been significantly evaluated. We prospectively evaluated the thulium:yttrium-aluminum-garnet laser in laparoscopic partial nephrectomy (LPN) in our institution over a 1-year period.
Esthetic Rehabilitation with a Cast Partial Denture
Directory of Open Access Journals (Sweden)
Suraksha Shrestha
2017-01-01
Full Text Available Removable partial denture is a treatment option where fixed prosthesis is not indicated. Due to its esthetic problems in the anterior region various modifications have been designed for its fabrication. This article describes an esthetic alternative using a round rest distal depression clasp for maxillary anterior teeth abutment while restoring the missing teeth with a cast partial denture.
Heat deposition on the partial limiter
International Nuclear Information System (INIS)
Itoh, Kimitaka; Itoh, Sanae-I; Nagasaki, Kazunobu.
1990-01-01
The effect of the partial limiter in the outermost magnetic surface of toroidal plasmas is studied. The power deposition on the partial limiter and its effect on the temperature profile are analysed. Interpretation in terms of the perpendicular heat conductivity is also discussed. (author)
Partial purification and biochemical characterization of acid ...
African Journals Online (AJOL)
Mung bean (Vigna radiata) is one of the important crops of the North Eastern Region of India. In the present study, acid phosphatase enzyme was isolated and partially purified from germinated local mung bean seeds. The sequential partial purification process was performed using ammonium sulphate precipitation method.
Partial Safety Factors for Rubble Mound Breakwaters
DEFF Research Database (Denmark)
Sørensen, John Dalsgaard; Burcharth, H. F.; Christiani, E.
1995-01-01
On the basis of the failure modes formulated in the various subtasks calibration of partial safety factors are described in this paper. The partial safety factors can be used to design breakwaters under quite different design conditions, namely probabilities of failure from 0.01 to 0.4, design...... lifetimes from 20 to 100 years and different qualities of wave data. A code of practice where safety is taken into account using partial safety factors is called a level I code. The partial safety factors are calibrated using First Order Reliability Methods (FORM, see Madsen et al. [1]) where...... in section 3. First Order Reliability Methods are described in section 4, and in section 5 it is shown how partial safety factors can be introduced and calibrated. The format of a code for design and analysis of rubble mound breakwaters is discussed in section 6. The mathematical formulation of the limit...
Development of Partial Discharging Simulation Test Equipment
Kai, Xue; Genghua, Liu; Yan, Jia; Ziqi, Chai; Jian, Lu
2017-12-01
In the case of partial discharge training for recruits who lack of on-site work experience, the risk of physical shock and damage of the test equipment may be due to the limited skill level and improper operation by new recruits. Partial discharge simulation tester is the use of simulation technology to achieve partial discharge test process simulation, relatively true reproduction of the local discharge process and results, so that the operator in the classroom will be able to get familiar with and understand the use of the test process and equipment.The teacher sets up the instrument to display different partial discharge waveforms so that the trainees can analyze the test results of different partial discharge types.
Solving Partial Differential Equations Using a New Differential Evolution Algorithm
Directory of Open Access Journals (Sweden)
Natee Panagant
2014-01-01
Full Text Available This paper proposes an alternative meshless approach to solve partial differential equations (PDEs. With a global approximate function being defined, a partial differential equation problem is converted into an optimisation problem with equality constraints from PDE boundary conditions. An evolutionary algorithm (EA is employed to search for the optimum solution. For this approach, the most difficult task is the low convergence rate of EA which consequently results in poor PDE solution approximation. However, its attractiveness remains due to the nature of a soft computing technique in EA. The algorithm can be used to tackle almost any kind of optimisation problem with simple evolutionary operation, which means it is mathematically simpler to use. A new efficient differential evolution (DE is presented and used to solve a number of the partial differential equations. The results obtained are illustrated and compared with exact solutions. It is shown that the proposed method has a potential to be a future meshless tool provided that the search performance of EA is greatly enhanced.
Defining Tiger Parenting in Chinese Americans.
Kim, Su Yeong
2013-09-01
"Tiger" parenting, as described by Amy Chua [2011], has instigated scholarly discourse on this phenomenon and its possible effects on families. Our eight-year longitudinal study, published in the Asian American Journal of Psychology [Kim, Wang, Orozco-Lapray, Shen, & Murtuza, 2013b], demonstrates that tiger parenting is not a common parenting profile in a sample of 444 Chinese American families. Tiger parenting also does not relate to superior academic performance in children. In fact, the best developmental outcomes were found among children of supportive parents. We examine the complexities around defining tiger parenting by reviewing classical literature on parenting styles and scholarship on Asian American parenting, along with Amy Chua's own description of her parenting method, to develop, define, and categorize variability in parenting in a sample of Chinese American families. We also provide evidence that supportive parenting is important for the optimal development of Chinese American adolescents.
Defining enthesitis in spondyloarthritis by ultrasound
DEFF Research Database (Denmark)
Terslev, Lene; Naredo, E; Iagnocco, A
2014-01-01
Objective: To standardize ultrasound (US) in enthesitis. Methods: An Initial Delphi exercise was undertaken to define US detected enthesitis and its core components. These definitions were subsequently tested on static images taken from Spondyloarthritis (SpA) patients in order to evaluate...... elementary component. On static images the intra-observer reliability showed a high degree of variability for the detection of elementary lesions with kappa coefficients ranging from 0.14 - 1. The inter-observer kappa value was variable with the lowest kappa for enthesophytes (0.24) and the best for Doppler...... activity at the enthesis (0.63). Conclusion: This is the first consensus based definition of US enthesitis and its elementary components and the first step performed to ensure a higher degree of homogeneity and comparability of results between studies and in daily clinical work. Defining Enthesitis...
Control of System with Defined Risk Level
Directory of Open Access Journals (Sweden)
Pavol Tomasov
2002-01-01
Full Text Available In the following paper the basic requirements for system control with defined risk level is presented. The paper should be an introduction to describe of theoretical apparatus, which was created during some years of research work in the Department of information and safety systems in this area. It a modification or creation of new parts of Information theory, System theory, and Control theory means. This parts are necessary for the analysis and synthesis tasks in the systems where dominant attribute of control is defined risk level. The basic problem is the creation of protect mechanism again the threats from inside and from controlled system environs. For each risk reduction mechanism is needed some redundancy which should be into control algorithm to put by exactly determined way.
FINANCIAL ACCOUNTING QUALITY AND ITS DEFINING CHARACTERISTICS
Directory of Open Access Journals (Sweden)
Andra M. ACHIM
2014-11-01
Full Text Available The importance ofhigh-quality financial statements is highlighted by the main standard-setting institutions activating in the field of accounting and reporting. These have issued Conceptual Frameworks which state and describe the qualitative characteristics of accounting information. In this qualitative study, the research methodology consists of reviewing the literature related to the definition of accounting quality and striving for understanding how it can be explained. The main objective of the study is to identify the characteristics information should possess in order to be of high quality. These characteristics also contribute to the way of defining financial accounting quality. The main conclusions that arise from this research are represented by the facts that indeed financial accounting quality cannot be uniquely defined and that financial information is of good quality when it enhances the characteristics incorporated in the conceptual frameworks issued by both International Accounting Standards Board and Financial Accounting Standards Board.
Exploring self-defining memories in schizophrenia.
Raffard, Stéphane; D'Argembeau, Arnaud; Lardi, Claudia; Bayard, Sophie; Boulenger, Jean-Philippe; Van Der Linden, Martial
2009-01-01
Previous studies have shown that patients with schizophrenia are impaired in recalling specific events from their personal past. However, the relationship between autobiographical memory impairments and disturbance of the sense of identity in schizophrenia has not been investigated in detail. In this study the authors investigated schizophrenic patients' ability to recall self-defining memories; that is, memories that play an important role in building and maintaining the self-concept. Results showed that patients recalled as many specific self-defining memories as healthy participants. However, patients with schizophrenia exhibited an abnormal reminiscence bump and reported different types of thematic content (i.e., they recalled less memories about past achievements and more memories regarding hospitalisation and stigmatisation of illness). Furthermore, the findings suggest that impairments in extracting meaning from personal memories could represent a core disturbance of autobiographical memory in patients with schizophrenia.
Partially Observed Mixtures of IRT Models: An Extension of the Generalized Partial-Credit Model
Von Davier, Matthias; Yamamoto, Kentaro
2004-01-01
The generalized partial-credit model (GPCM) is used frequently in educational testing and in large-scale assessments for analyzing polytomous data. Special cases of the generalized partial-credit model are the partial-credit model--or Rasch model for ordinal data--and the two parameter logistic (2PL) model. This article extends the GPCM to the…
Improving network management with Software Defined Networking
International Nuclear Information System (INIS)
Dzhunev, Pavel
2013-01-01
Software-defined networking (SDN) is developed as an alternative to closed networks in centers for data processing by providing a means to separate the control layer data layer switches, and routers. SDN introduces new possibilities for network management and configuration methods. In this article, we identify problems with the current state-of-the-art network configuration and management mechanisms and introduce mechanisms to improve various aspects of network management
Stateless multicast switching in software defined networks
Reed, Martin J.; Al-Naday, Mays; Thomos, Nikolaos; Trossen, Dirk; Petropoulos, George; Spirou, Spiros
2016-01-01
Multicast data delivery can significantly reduce traffic in operators' networks, but has been limited in deployment due to concerns such as the scalability of state management. This paper shows how multicast can be implemented in contemporary software defined networking (SDN) switches, with less state than existing unicast switching strategies, by utilising a Bloom Filter (BF) based switching technique. Furthermore, the proposed mechanism uses only proactive rule insertion, and thus, is not l...
Defining and Distinguishing Traditional and Religious Terrorism
Gregg, Heather S.
2014-01-01
The article of record may be found at: http://dx.doi.org/10.1080/23296151.2016.1239978 thus offering few if any policy options for counterterrorism measures. This assumption about religious terrorism stems from two challenges in the literature: disproportionate attention to apocalyptic terrorism, and a lack of distinction between religious terrorism and its secular counterpart. This article, therefore, aims to do four things: define and differentiate religiously motivated terrorism from tr...
Defining Trust Using Expected Utility Theory
Arai, Kazuhiro
2009-01-01
Trust has been discussed in many social sciences including economics, psychology, and sociology. However, there is no widely accepted definition of trust. Inparticular, there is no definition that can be used for economic analysis. This paper regards trust as expectation and defines it using expected utility theory together with concepts such as betrayal premium. In doing so, it rejects the widely accepted black-and-white view that (un) trustworthy people are always (un)trustworthy. This pape...
Esteves, José; Pastor Collado, Juan Antonio; Casanovas Garcia, Josep
2002-01-01
This technical research report proposes the usage of a statistical approach named Partial Least squares (PLS) to define the relationships between critical success factors for ERP implementation projects. In previous research work, we developed a unified model of critical success factors for ERP implementation projects. Some researchers have evidenced the relationships between these critical success factors, however no one has defined in a form...
How Should Energy Be Defined Throughout Schooling?
Bächtold, Manuel
2017-02-01
The question of how to teach energy has been renewed by recent studies focusing on the learning and teaching progressions for this concept. In this context, one question has been, for the most part, overlooked: how should energy be defined throughout schooling? This paper addresses this question in three steps. We first identify and discuss two main approaches in physics concerning the definition of energy, one claiming there is no satisfactory definition and taking conservation as a fundamental property, and the other based on Rankine's definition of energy as the capacity of a system to produce changes. We then present a study concerning how energy is actually defined throughout schooling in the case of France by analyzing national programs, physics textbooks, and the answers of teachers to a questionnaire. This study brings to light a consistency problem in the way energy is defined across school years: in primary school, an adapted version of Rankine's definition is introduced and conservation is ignored; in high school, conservation is introduced and Rankine's definition is ignored. Finally, we address this consistency problem by discussing possible teaching progressions. We argue in favor of the use of Rankine's definition throughout schooling: at primary school, it is a possible substitute to students' erroneous conceptions; at secondary school, it might help students become aware of the unifying role of energy and thereby overcome the compartmentalization problem.
Defining functional distances over Gene Ontology
Directory of Open Access Journals (Sweden)
del Pozo Angela
2008-01-01
Full Text Available Abstract Background A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-structured ontologies exist regarding the activity of proteins (i.e. 'gene ontology' -GO-. However, functional metrics can overcome the problems in the comparing and evaluating functional assignments and predictions. As a reference of proximity, previous approaches to compare GO terms considered linkage in terms of ontology weighted by a probability distribution that balances the non-uniform 'richness' of different parts of the Direct Acyclic Graph. Here, we have followed a different approach to quantify functional similarities between GO terms. Results We propose a new method to derive 'functional distances' between GO terms that is based on the simultaneous occurrence of terms in the same set of Interpro entries, instead of relying on the structure of the GO. The coincidence of GO terms reveals natural biological links between the GO functions and defines a distance model Df which fulfils the properties of a Metric Space. The distances obtained in this way can be represented as a hierarchical 'Functional Tree'. Conclusion The method proposed provides a new definition of distance that enables the similarity between GO terms to be quantified. Additionally, the 'Functional Tree' defines groups with biological meaning enhancing its utility for protein function comparison and prediction. Finally, this approach could be for function-based protein searches in databases, and for analysing the gene clusters produced by DNA array experiments.
A New Class of Analytic Functions Defined by Using Salagean Operator
Directory of Open Access Journals (Sweden)
R. M. El-Ashwah
2013-01-01
Full Text Available We derive some results for a new class of analytic functions defined by using Salagean operator. We give some properties of functions in this class and obtain numerous sharp results including for example, coefficient estimates, distortion theorem, radii of star-likeness, convexity, close-to-convexity, extreme points, integral means inequalities, and partial sums of functions belonging to this class. Finally, we give an application involving certain fractional calculus operators that are also considered.
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...
Is nonoperative management of partial distal biceps tears really successful?
Bauer, Tyler M; Wong, Justin C; Lazarus, Mark D
2018-04-01
The current treatment of partial distal biceps tears is a period of nonoperative management, followed by surgery, if symptoms persist. Little is known about the success rate and outcomes of nonoperative management of this illness. We identified 132 patients with partial distal biceps tears through an International Classification of Diseases, Ninth Revision code query of our institution's database. Patient records were reviewed to abstract demographic information and confirm partial tears of the distal biceps tendon based on clinical examination findings and confirmatory magnetic resonance imaging (MRI). Seventy-four patients completed an outcome survey. In our study, 55.7% of the contacted patients who tried a nonoperative course (34 of 61 patients) ultimately underwent surgery, and 13 patients underwent immediate surgery. High-need patients, as defined by occupation, were more likely to report that they recovered ideally if they underwent surgery, as compared with those who did not undergo surgery (odds ratio, 11.58; P = .0138). For low-need patients, the same analysis was not statistically significant (P = .139). There was no difference in satisfaction scores between patients who tried a nonoperative course before surgery and those who underwent immediate surgery (P = .854). An MRI-diagnosed tear of greater than 50% was a predictor of needing surgery (odds ratio, 3.0; P = .006). This study has identified clinically relevant information for the treatment of partial distal biceps tears, including the following: the failure rate of nonoperative treatment, the establishment of MRI percent tear as a predictor of failing nonoperative management, the benefit of surgery for the high-need occupational group, and the finding that nonoperative management does not negatively affect outcome if subsequent surgery is necessary. Copyright © 2018 Journal of Shoulder and Elbow Surgery Board of Trustees. Published by Elsevier Inc. All rights reserved.
Defining Nitrogen Kinetics for Air Break in Prebreath
Conkin, Johnny
2010-01-01
Actual tissue nitrogen (N2) kinetics are complex; the uptake and elimination is often approximated with a single half-time compartment in statistical descriptions of denitrogenation [prebreathe(PB)] protocols. Air breaks during PB complicate N2 kinetics. A comparison of symmetrical versus asymmetrical N2 kinetics was performed using the time to onset of hypobaric decompression sickness (DCS) as a surrogate for actual venous N2 tension. METHODS: Published results of 12 tests involving 179 hypobaric exposures in altitude chambers after PB, with and without airbreaks, provide the complex protocols from which to model N2 kinetics. DCS survival time for combined control and airbreaks were described with an accelerated log logistic model where N2 uptake and elimination before, during, and after the airbreak was computed with a simple exponential function or a function that changed half-time depending on ambient N2 partial pressure. P1N2-P2 = (Delta)P defined decompression dose for each altitude exposure, where P2 was the test altitude and P1N2 was computed N2 pressure at the beginning of the altitude exposure. RESULTS: The log likelihood (LL) without decompression dose (null model) was -155.6, and improved (best-fit) to -97.2 when dose was defined with a 240 min half-time for both N2 elimination and uptake during the PB. The description of DCS survival time was less precise with asymmetrical N2 kinetics, for example, LL was -98.9 with 240 min half-time elimination and 120 min half-time uptake. CONCLUSION: The statistical regression described survival time mechanistically linked to symmetrical N2 kinetics during PBs that also included airbreaks. The results are data-specific, and additional data may change the conclusion. The regression is useful to compute additional PB time to compensate for an airbreak in PB within the narrow range of tested conditions.
Defining Nitrogen Kinetics for Air Break in Prebreathe
Conkin, Johnny
2009-01-01
Actual tissue nitrogen (N2) kinetics are complex; the uptake and elimination is often approximated with a single half-time compartment in statistical descriptions of denitrogenation [prebreathe (PB)] protocols. Air breaks during PB complicate N2 kinetics. A comparison of symmetrical versus asymmetrical N2 kinetics was performed using the time to onset of hypobaric decompression sickness (DCS) as a surrogate for actual venous N2 tension. Published results of 12 tests involving 179 hypobaric exposures in altitude chambers after PB, with and without air breaks, provide the complex protocols from which to model N2 kinetics. DCS survival time for combined control and air breaks were described with an accelerated log logistic model where N2 uptake and elimination before, during, and after the air break was computed with a simple exponential function or a function that changed half-time depending on ambient N2 partial pressure. P1N2-P2 = delta P defined DCS dose for each altitude exposure, where P2 was the test altitude and P1N2 was computed N2 pressure at the beginning of the altitude exposure. The log likelihood (LL) without DCS dose (null model) was -155.6, and improved (best-fit) to -97.2 when dose was defined with a 240 min half-time for both N2 elimination and uptake during the PB. The description of DCS survival time was less precise with asymmetrical N2 kinetics, for example, LL was -98.9 with 240 min half-time elimination and 120 min half-time uptake. The statistical regression described survival time mechanistically linked to symmetrical N2 kinetics during PBs that also included air breaks. The results are data-specific, and additional data may change the conclusion. The regression is useful to compute additional PB time to compensate for an air break in PB within the narrow range of tested conditions.
Partial transposition on bi-partite system
Han, Y. -J.; Ren, X. J.; Wu, Y. C.; Guo, G. -C.
2006-01-01
Many of the properties of the partial transposition are not clear so far. Here the number of the negative eigenvalues of K(T)(the partial transposition of K) is considered carefully when K is a two-partite state. There are strong evidences to show that the number of negative eigenvalues of K(T) is N(N-1)/2 at most when K is a state in Hilbert space N*N. For the special case, 2*2 system(two qubits), we use this result to give a partial proof of the conjecture sqrt(K(T))(T)>=0. We find that thi...
Numerical Analysis of Partial Differential Equations
Lui, S H
2011-01-01
A balanced guide to the essential techniques for solving elliptic partial differential equations Numerical Analysis of Partial Differential Equations provides a comprehensive, self-contained treatment of the quantitative methods used to solve elliptic partial differential equations (PDEs), with a focus on the efficiency as well as the error of the presented methods. The author utilizes coverage of theoretical PDEs, along with the nu merical solution of linear systems and various examples and exercises, to supply readers with an introduction to the essential concepts in the numerical analysis
Partial differential equations for scientists and engineers
Farlow, Stanley J
1993-01-01
Most physical phenomena, whether in the domain of fluid dynamics, electricity, magnetism, mechanics, optics, or heat flow, can be described in general by partial differential equations. Indeed, such equations are crucial to mathematical physics. Although simplifications can be made that reduce these equations to ordinary differential equations, nevertheless the complete description of physical systems resides in the general area of partial differential equations.This highly useful text shows the reader how to formulate a partial differential equation from the physical problem (constructing th
Partial Deconvolution with Inaccurate Blur Kernel.
Ren, Dongwei; Zuo, Wangmeng; Zhang, David; Xu, Jun; Zhang, Lei
2017-10-17
Most non-blind deconvolution methods are developed under the error-free kernel assumption, and are not robust to inaccurate blur kernel. Unfortunately, despite the great progress in blind deconvolution, estimation error remains inevitable during blur kernel estimation. Consequently, severe artifacts such as ringing effects and distortions are likely to be introduced in the non-blind deconvolution stage. In this paper, we tackle this issue by suggesting: (i) a partial map in the Fourier domain for modeling kernel estimation error, and (ii) a partial deconvolution model for robust deblurring with inaccurate blur kernel. The partial map is constructed by detecting the reliable Fourier entries of estimated blur kernel. And partial deconvolution is applied to wavelet-based and learning-based models to suppress the adverse effect of kernel estimation error. Furthermore, an E-M algorithm is developed for estimating the partial map and recovering the latent sharp image alternatively. Experimental results show that our partial deconvolution model is effective in relieving artifacts caused by inaccurate blur kernel, and can achieve favorable deblurring quality on synthetic and real blurry images.Most non-blind deconvolution methods are developed under the error-free kernel assumption, and are not robust to inaccurate blur kernel. Unfortunately, despite the great progress in blind deconvolution, estimation error remains inevitable during blur kernel estimation. Consequently, severe artifacts such as ringing effects and distortions are likely to be introduced in the non-blind deconvolution stage. In this paper, we tackle this issue by suggesting: (i) a partial map in the Fourier domain for modeling kernel estimation error, and (ii) a partial deconvolution model for robust deblurring with inaccurate blur kernel. The partial map is constructed by detecting the reliable Fourier entries of estimated blur kernel. And partial deconvolution is applied to wavelet-based and learning
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)
2012-01-01
htmlabstractWe study a new geometric graph parameter egd(G), defined as the smallest integer r ≥ 1 for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of G, can be completed to a matrix in the convex hull
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.
M. Eisenberg-Nagy (Marianna); M. Laurent (Monique); A. Varvitsiotis (Antonios)
2012-01-01
textabstractWe study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\\ge 1$ for which any partial symmetric matrix which is completable to a correlation matrix and whose entries are specified at the positions of the edges of $G$, can be completed to a matrix in the convex
2012-03-09
... DEPARTMENT OF THE TREASURY Internal Revenue Service 26 CFR Part 1 [REG-110980-10] RIN 1545-BJ55 Modifications to Minimum Present Value Requirements for Partial Annuity Distribution Options Under Defined... FR 5454), providing guidance relating to the minimum present value requirements applicable to certain...
Breast milk and energy intake in exclusively, predominantly, and partially breast-fed infants
Haisma, H; Coward, WA; Albernaz, E; Visser, GH; Wells, JCK; Wright, A; Victoria, CG; Victora, C.G.
2003-01-01
Objective: To investigate the extent to which breast milk is replaced by intake of other liquids or foods, and to estimate energy intake of infants defined as exclusively (EBF), predominantly (PBF) and partially breast-fed (PartBF). Design: Cross-sectional. Setting: Community-based study in urban
Partial sums of lagged cross-products of AR residuals and a test for white noise
de Gooijer, J.G.
2008-01-01
Partial sums of lagged cross-products of AR residuals are defined. By studying the sample paths of these statistics, changes in residual dependence can be detected that might be missed by statistics using only the total sum of cross-products. Also, a test statistic for white noise is proposed. It is
Partial Volume Effects correction in emission tomography
International Nuclear Information System (INIS)
Le Pogam, Adrien
2010-01-01
Partial Volume Effects (PVE) designates the blur commonly found in nuclear medicine images and this PhD work is dedicated to their correction with the objectives of qualitative and quantitative improvement of such images. PVE arise from the limited spatial resolution of functional imaging with either Positron Emission Tomography (PET) or Single Photon Emission Computed Tomography (SPECT). They can be defined as a signal loss in tissues of size similar to the Full Width at Half Maximum (FWHM) of the PSF of the imaging device. In addition, PVE induce activity cross contamination between adjacent structures with different tracer uptakes. This can lead to under or over estimation of the real activity of such analyzed regions. Various methodologies currently exist to compensate or even correct for PVE and they may be classified depending on their place in the processing chain: either before, during or after the image reconstruction process, as well as their dependency on co-registered anatomical images with higher spatial resolution, for instance Computed Tomography (CT) or Magnetic Resonance Imaging (MRI). The voxel-based and post-reconstruction approach was chosen for this work to avoid regions of interest definition and dependency on proprietary reconstruction developed by each manufacturer, in order to improve the PVE correction. Two different contributions were carried out in this work: the first one is based on a multi-resolution methodology in the wavelet domain using the higher resolution details of a co-registered anatomical image associated to the functional dataset to correct. The second one is the improvement of iterative deconvolution based methodologies by using tools such as directional wavelets and curvelets extensions. These various developed approaches were applied and validated using synthetic, simulated and clinical images, for instance with neurology and oncology applications in mind. Finally, as currently available PET/CT scanners incorporate more
Effective action for stochastic partial differential equations
International Nuclear Information System (INIS)
Hochberg, David; Molina-Paris, Carmen; Perez-Mercader, Juan; Visser, Matt
1999-01-01
Stochastic partial differential equations (SPDEs) are the basic tool for modeling systems where noise is important. SPDEs are used for models of turbulence, pattern formation, and the structural development of the universe itself. It is reasonably well known that certain SPDEs can be manipulated to be equivalent to (nonquantum) field theories that nevertheless exhibit deep and important relationships with quantum field theory. In this paper we systematically extend these ideas: We set up a functional integral formalism and demonstrate how to extract all the one-loop physics for an arbitrary SPDE subject to arbitrary Gaussian noise. It is extremely important to realize that Gaussian noise does not imply that the field variables undergo Gaussian fluctuations, and that these nonquantum field theories are fully interacting. The limitation to one loop is not as serious as might be supposed: Experience with quantum field theories (QFTs) has taught us that one-loop physics is often quite adequate to give a good description of the salient issues. The limitation to one loop does, however, offer marked technical advantages: Because at one loop almost any field theory can be rendered finite using zeta function technology, we can sidestep the complications inherent in the Martin-Siggia-Rose formalism (the SPDE analog of the Becchi-Rouet-Stora-Tyutin formalism used in QFT) and instead focus attention on a minimalist approach that uses only the physical fields (this ''direct approach'' is the SPDE analog of canonical quantization using physical fields). After setting up the general formalism for the characteristic functional (partition function), we show how to define the effective action to all loops, and then focus on the one-loop effective action and its specialization to constant fields: the effective potential. The physical interpretation of the effective action and effective potential for SPDEs is addressed and we show that key features carry over from QFT to the case of
Effective action for stochastic partial differential equations
Energy Technology Data Exchange (ETDEWEB)
Hochberg, David [Laboratorio de Astrofisica Espacial y Fisica Fundamental, Apartado 50727, 28080 Madrid, (Spain); Centro de Astrobiologia, INTA, Carratera Ajalvir, Km. 4, 28850 Torrejon, Madrid, (Spain); Molina-Paris, Carmen [Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States); Perez-Mercader, Juan [Laboratorio de Astrofisica Espacial y Fisica Fundamental, Apartado 50727, 28080 Madrid, (Spain); Visser, Matt [Physics Department, Washington University, Saint Louis, Missouri 63130-4899 (United States)
1999-12-01
Stochastic partial differential equations (SPDEs) are the basic tool for modeling systems where noise is important. SPDEs are used for models of turbulence, pattern formation, and the structural development of the universe itself. It is reasonably well known that certain SPDEs can be manipulated to be equivalent to (nonquantum) field theories that nevertheless exhibit deep and important relationships with quantum field theory. In this paper we systematically extend these ideas: We set up a functional integral formalism and demonstrate how to extract all the one-loop physics for an arbitrary SPDE subject to arbitrary Gaussian noise. It is extremely important to realize that Gaussian noise does not imply that the field variables undergo Gaussian fluctuations, and that these nonquantum field theories are fully interacting. The limitation to one loop is not as serious as might be supposed: Experience with quantum field theories (QFTs) has taught us that one-loop physics is often quite adequate to give a good description of the salient issues. The limitation to one loop does, however, offer marked technical advantages: Because at one loop almost any field theory can be rendered finite using zeta function technology, we can sidestep the complications inherent in the Martin-Siggia-Rose formalism (the SPDE analog of the Becchi-Rouet-Stora-Tyutin formalism used in QFT) and instead focus attention on a minimalist approach that uses only the physical fields (this ''direct approach'' is the SPDE analog of canonical quantization using physical fields). After setting up the general formalism for the characteristic functional (partition function), we show how to define the effective action to all loops, and then focus on the one-loop effective action and its specialization to constant fields: the effective potential. The physical interpretation of the effective action and effective potential for SPDEs is addressed and we show that key features carry over from
Defining Multiple Chronic Conditions for Quality Measurement.
Drye, Elizabeth E; Altaf, Faseeha K; Lipska, Kasia J; Spatz, Erica S; Montague, Julia A; Bao, Haikun; Parzynski, Craig S; Ross, Joseph S; Bernheim, Susannah M; Krumholz, Harlan M; Lin, Zhenqiu
2018-02-01
Patients with multiple chronic conditions (MCCs) are a critical but undefined group for quality measurement. We present a generally applicable systematic approach to defining an MCC cohort of Medicare fee-for-service beneficiaries that we developed for a national quality measure, risk-standardized rates of unplanned admissions for Accountable Care Organizations. To define the MCC cohort we: (1) identified potential chronic conditions; (2) set criteria for cohort conditions based on MCC framework and measure concept; (3) applied the criteria informed by empirical analysis, experts, and the public; (4) described "broader" and "narrower" cohorts; and (5) selected final cohort with stakeholder input. Subjects were patients with chronic conditions. Participants included 21.8 million Medicare fee-for-service beneficiaries in 2012 aged 65 years and above with ≥1 of 27 Medicare Chronic Condition Warehouse condition(s). In total, 10 chronic conditions were identified based on our criteria; 8 of these 10 were associated with notably increased admission risk when co-occurring. A broader cohort (2+ of the 8 conditions) included 4.9 million beneficiaries (23% of total cohort) with an admission rate of 70 per 100 person-years. It captured 53% of total admissions. The narrower cohort (3+ conditions) had 2.2 million beneficiaries (10%) with 100 admissions per 100 person-years and captured 32% of admissions. Most stakeholders viewed the broader cohort as best aligned with the measure concept. By systematically narrowing chronic conditions to those most relevant to the outcome and incorporating stakeholder input, we defined an MCC admission measure cohort supported by stakeholders. This approach can be used as a model for other MCC outcome measures.
How do pediatric anesthesiologists define intraoperative hypotension?
Nafiu, Olubukola O; Voepel-Lewis, Terri; Morris, Michelle; Chimbira, Wilson T; Malviya, Shobha; Reynolds, Paul I; Tremper, Kevin K
2009-11-01
Although blood pressure (BP) monitoring is a recommended standard of care by the ASA, and pediatric anesthesiologists routinely monitor the BP of their patients and when appropriate treat deviations from 'normal', there is no robust definition of hypotension in any of the pediatric anesthesia texts or journals. Consequently, what constitutes hypotension in pediatric anesthesia is currently unknown. We designed a questionnaire-based survey of pediatric anesthesiologists to determine the BP ranges and thresholds used to define intraoperative hypotension (IOH). Members of the Society of Pediatric Anesthesia (SPA) and the Association of Paediatric Anaesthetists (APA) of Great Britain and Ireland were contacted through e-mail to participate in this survey. We asked a few demographic questions and five questions about specific definitions of hypotension for different age groups of patients undergoing inguinal herniorraphy, a common pediatric surgical procedure. The overall response rate was 56% (483/860), of which 76% were SPA members. Majority of the respondents (72%) work in academic institutions, while 8.9% work in institutions with fewer than 1000 annual pediatric surgical caseload. About 76% of respondents indicated that a 20-30% reduction in baseline systolic blood pressure (SBP) indicates significant hypotension in children under anesthesia. Most responders (86.7%) indicated that they use mean arterial pressure or SBP (72%) to define IOH. The mean SBP values for hypotension quoted by SPA members was about 5-7% lower across all pediatric age groups compared to values quoted by APA members (P = 0.001 for all age groups). There is great variability in the BP parameters used and the threshold used for defining and treating IOH among pediatric anesthesiologists. The majority of respondents considered a 20-30% reduction from baseline in SBP as indicative of significant hypotension. Lack of a consensus definition for a common clinical condition like IOH could have
Defining recovery in adult bulimia nervosa.
Yu, Jessica; Agras, W Stewart; Bryson, Susan
2013-01-01
To examine how different definitions of recovery lead to varying rates of recovery, maintenance of recovery, and relapse in bulimia nervosa (BN), end-of-treatment (EOT) and follow-up data were obtained from 96 adults with BN. Combining behavioral, physical, and psychological criteria led to recovery rates between 15.5% and 34.4% at EOT, though relapse was approximately 50%. Combining these criteria and requiring abstinence from binge eating and purging when defining recovery may lead to lower recovery rates than those found in previous studies; however, a strength of this definition is that individuals who meet this criteria have no remaining disordered behaviors or symptoms.
Defining Marriage: Classification, Interpretation, and Definitional Disputes
Directory of Open Access Journals (Sweden)
Fabrizio Macagno
2016-09-01
Full Text Available The classification of a state of affairs under a legal category can be considered as a kind of con- densed decision that can be made explicit, analyzed, and assessed us- ing argumentation schemes. In this paper, the controversial conflict of opinions concerning the nature of “marriage” in Obergefell v. Hodges is analyzed pointing out the dialecti- cal strategies used for addressing the interpretive doubts. The dispute about the same-sex couples’ right to marry hides a much deeper disa- greement not only about what mar- riage is, but more importantly about the dialectical rules for defining it.
Software defined networks a comprehensive approach
Goransson, Paul
2014-01-01
Software Defined Networks discusses the historical networking environment that gave rise to SDN, as well as the latest advances in SDN technology. The book gives you the state of the art knowledge needed for successful deployment of an SDN, including: How to explain to the non-technical business decision makers in your organization the potential benefits, as well as the risks, in shifting parts of a network to the SDN modelHow to make intelligent decisions about when to integrate SDN technologies in a networkHow to decide if your organization should be developing its own SDN applications or
Software Defined Radio: Basic Principles and Applications
Directory of Open Access Journals (Sweden)
José Raúl Machado-Fernández
2014-12-01
Full Text Available The author makes a review of the SDR (Software Defined Radio technology, including hardware schemes and application fields. A low performance device is presented and several tests are executed with it using free software. With the acquired experience, SDR employment opportunities are identified for low-cost solutions that can solve significant problems. In addition, a list of the most important frameworks related to the technology developed in the last years is offered, recommending the use of three of them.
Defining the Strategy of Nuclear Activity
International Nuclear Information System (INIS)
Racana, R.
2006-01-01
This article presents nuclear activity as defined within the field of the nuclear industry, which is studied from its capacity to generate electric power to its application in industry and medicine as well as a source for weapons of mass destruction. These fields of analysis introduce some problems that the nuclear activity itself must know how to confront employing action strategies aimed at becoming an activity to be kept in mind when making use of the benefits that its peaceful use contributes to human life. (Author)
Animal bioavailability of defined xenobiotic lignin metabolites
International Nuclear Information System (INIS)
Sandermann, H. Jr.; Arjmand, M.; Gennity, I.; Winkler, R.; Struble, C.B.; Aschbacher, P.W.
1990-01-01
Lignin has been recognized as a major component of bound pesticide residues in plants and is thought to be undigestible in animals. Two defined ring-U- 14 C-labeled chloroaniline/lignin metabolites have now been fed to rats, where a release of ∼66% of the bound xenobiotic occurred in the form of simple chloroaniline derivatives. The observed high degree of bioavailability indicates that bound pesticidal residues may possess ecotoxicological significance. In parallel studies, the white-rot fungus Phanerochaete chrysosporium was more efficient, and a soil system was much less efficient, in the degradation of the [ring-U- 14 C]chloroaniline/lignin metabolites
DEFINING THE CHEMICAL SPACE OF PUBLIC GENOMIC ...
The current project aims to chemically index the genomics content of public genomic databases to make these data accessible in relation to other publicly available, chemically-indexed toxicological information. By defining the chemical space of public genomic data, it is possible to identify classes of chemicals on which to develop methodologies for the integration of chemogenomic data into predictive toxicology. The chemical space of public genomic data will be presented as well as the methodologies and tools developed to identify this chemical space.
Healthcare Engineering Defined: A White Paper.
Chyu, Ming-Chien; Austin, Tony; Calisir, Fethi; Chanjaplammootil, Samuel; Davis, Mark J; Favela, Jesus; Gan, Heng; Gefen, Amit; Haddas, Ram; Hahn-Goldberg, Shoshana; Hornero, Roberto; Huang, Yu-Li; Jensen, Øystein; Jiang, Zhongwei; Katsanis, J S; Lee, Jeong-A; Lewis, Gladius; Lovell, Nigel H; Luebbers, Heinz-Theo; Morales, George G; Matis, Timothy; Matthews, Judith T; Mazur, Lukasz; Ng, Eddie Yin-Kwee; Oommen, K J; Ormand, Kevin; Rohde, Tarald; Sánchez-Morillo, Daniel; Sanz-Calcedo, Justo García; Sawan, Mohamad; Shen, Chwan-Li; Shieh, Jiann-Shing; Su, Chao-Ton; Sun, Lilly; Sun, Mingui; Sun, Yi; Tewolde, Senay N; Williams, Eric A; Yan, Chongjun; Zhang, Jiajie; Zhang, Yuan-Ting
2015-01-01
Engineering has been playing an important role in serving and advancing healthcare. The term "Healthcare Engineering" has been used by professional societies, universities, scientific authors, and the healthcare industry for decades. However, the definition of "Healthcare Engineering" remains ambiguous. The purpose of this position paper is to present a definition of Healthcare Engineering as an academic discipline, an area of research, a field of specialty, and a profession. Healthcare Engineering is defined in terms of what it is, who performs it, where it is performed, and how it is performed, including its purpose, scope, topics, synergy, education/training, contributions, and prospects.
Software defined networking applications in distributed datacenters
Qi, Heng
2016-01-01
This SpringerBrief provides essential insights on the SDN application designing and deployment in distributed datacenters. In this book, three key problems are discussed: SDN application designing, SDN deployment and SDN management. This book demonstrates how to design the SDN-based request allocation application in distributed datacenters. It also presents solutions for SDN controller placement to deploy SDN in distributed datacenters. Finally, an SDN management system is proposed to guarantee the performance of datacenter networks which are covered and controlled by many heterogeneous controllers. Researchers and practitioners alike will find this book a valuable resource for further study on Software Defined Networking. .
Defining Starch Binding by Glucan Phosphatases
DEFF Research Database (Denmark)
Auger, Kyle; Raththagala, Madushi; Wilkens, Casper
2015-01-01
Starch is a vital energy molecule in plants that has a wide variety of uses in industry, such as feedstock for biomaterial processing and biofuel production. Plants employ a three enzyme cyclic process utilizing kinases, amylases, and phosphatases to degrade starch in a diurnal manner. Starch...... is comprised of the branched glucan amylopectin and the more linear glucan amylose. Our lab has determined the first structures of these glucan phosphatases and we have defined their enzymatic action. Despite this progress, we lacked a means to quickly and efficiently quantify starch binding to glucan...
Healthcare Engineering Defined: A White Paper
Directory of Open Access Journals (Sweden)
Ming-Chien Chyu
2015-01-01
Full Text Available Engineering has been playing an important role in serving and advancing healthcare. The term “Healthcare Engineering” has been used by professional societies, universities, scientific authors, and the healthcare industry for decades. However, the definition of “Healthcare Engineering” remains ambiguous. The purpose of this position paper is to present a definition of Healthcare Engineering as an academic discipline, an area of research, a field of specialty, and a profession. Healthcare Engineering is defined in terms of what it is, who performs it, where it is performed, and how it is performed, including its purpose, scope, topics, synergy, education/training, contributions, and prospects.
Software-defined reconfigurable microwave photonics processor.
Pérez, Daniel; Gasulla, Ivana; Capmany, José
2015-06-01
We propose, for the first time to our knowledge, a software-defined reconfigurable microwave photonics signal processor architecture that can be integrated on a chip and is capable of performing all the main functionalities by suitable programming of its control signals. The basic configuration is presented and a thorough end-to-end design model derived that accounts for the performance of the overall processor taking into consideration the impact and interdependencies of both its photonic and RF parts. We demonstrate the model versatility by applying it to several relevant application examples.
Fingerprinting Software Defined Networks and Controllers
2015-03-01
rps requests per second RTT Round-Trip Time SDN Software Defined Networking SOM Self-Organizing Map STP Spanning Tree Protocol TRW-CB Threshold Random...Protocol ( STP ) updates), in which case the frame will be “punted” from the forwarding lookup process and processed by the route processor [9]. The act of...environment 20 to accomplish the needs of B4. In addition to Google, the SDN market is expected to grow beyond $35 billion by April 2018 [31]. The rate
DEFF Research Database (Denmark)
Thorlund, Jonas Bloch; Englund, Martin; Christensen, Robin
2017-01-01
OBJECTIVES: To compare patient reported outcomes from before surgery to 52 weeks after surgery between individuals undergoing arthroscopic partial meniscectomy for traumatic meniscal tears and those for degenerative meniscal tears. DESIGN: Comparative prospective cohort study. SETTING: Four public......-55, and undergoing arthroscopic partial meniscectomy for a traumatic or degenerative meniscal tear (defined by a combination of age and symptom onset). INTERVENTIONS: Both participant groups underwent arthroscopic partial meniscectomy for a meniscal tear, with operating surgeons recording relevant information......% women) with a traumatic or degenerative meniscal tear (n=141, mean age 38.7 years (standard deviation 10.9); n=256, 46.6 years (6.4); respectively) were included in the main analysis. At 52 weeks after arthroscopic partial meniscectomy, 55 (14%) patients were lost to follow-up. Statistically...