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

To Boolean or Not To Boolean.

Science.gov (United States)

Hildreth, Charles R.

1983-01-01

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

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

OpenAIRE

Pan, Chenyun; Naeemi, Azad

2017-01-01

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

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)

Boolean algebra

CERN Document Server

Goodstein, R L

2007-01-01

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

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

Science.gov (United States)

Gong, Xinwei

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

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.

Optimal stabilization of Boolean networks through collective influence

Science.gov (United States)

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

2018-03-01

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

Boolean orthoposets and two-valued states on them

Science.gov (United States)

Tkadlec, Josef

1992-06-01

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

Boolean integral calculus for digital systems

Science.gov (United States)

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

1985-01-01

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

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

Directory of Open Access Journals (Sweden)

Wensheng Guo

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

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.

Computing preimages of Boolean networks.

Science.gov (United States)

Klotz, Johannes; Bossert, Martin; Schober, Steffen

2013-01-01

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

Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.

Science.gov (United States)

Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj

2016-01-01

The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.

On the Computation of Comprehensive Boolean Gröbner Bases

Science.gov (United States)

Inoue, Shutaro

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

Pseudo Boolean Programming for Partially Ordered Genomes

Science.gov (United States)

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

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

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

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)

Algebraic model checking for Boolean gene regulatory networks.

Science.gov (United States)

Tran, Quoc-Nam

2011-01-01

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

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

Science.gov (United States)

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

2014-01-01

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

Optical reversible programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2012-07-20

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

Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

Directory of Open Access Journals (Sweden)

Gijs Kant

2012-10-01

Full Text Available Parameterised Boolean Equation Systems (PBESs are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then solving the game. Practical game solvers exist, but the instantiation step is the bottleneck. We enhance the instantiation in two steps. First, we transform the PBES to a Parameterised Parity Game (PPG, a PBES with each equation either conjunctive or disjunctive. Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph. To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies between parts of the state vector and transition groups. Benchmarks on some large case studies, show that the method speeds up the instantiation significantly and decreases memory usage drastically.

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

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.

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

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.

Optical programmable Boolean logic unit.

Science.gov (United States)

Chattopadhyay, Tanay

2011-11-10

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

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.

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.

Science.gov (United States)

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

2015-08-28

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

Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

NARCIS (Netherlands)

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

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

Summing Boolean Algebras

Institute of Scientific and Technical Information of China (English)

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

2004-01-01

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

Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

Science.gov (United States)

Zhang, Jianming; Sclaroff, Stan

2016-05-01

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

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.

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

Complexity classifications for different equivalence and audit problems for Boolean circuits

OpenAIRE

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

2010-01-01

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

3D Boolean operations in virtual surgical planning.

Science.gov (United States)

Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun

2017-10-01

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

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)

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

Science.gov (United States)

Mori, Fumito; Mochizuki, Atsushi

2017-07-14

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

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.

Representing Boolean Functions by Decision Trees

KAUST Repository

Chikalov, Igor

2011-01-01

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

Controllability and observability of Boolean networks arising from biology

Science.gov (United States)

Li, Rui; Yang, Meng; Chu, Tianguang

2015-02-01

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

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.

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.

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.

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.

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

Practical algorithms for linear boolean-width

NARCIS (Netherlands)

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

2015-01-01

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

Practical algorithms for linear Boolean-width

NARCIS (Netherlands)

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

2015-01-01

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

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

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

Science.gov (United States)

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

2013-04-01

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

Totally optimal decision trees for Boolean functions

KAUST Repository

Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2016-01-01

We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters

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

Science.gov (United States)

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

2006-01-01

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

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

Science.gov (United States)

Xie, Zhengwei; Qiu, Daowen; Cai, Guangya

2018-06-01

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

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

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.

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

Parallel object-oriented term rewriting : the booleans

NARCIS (Netherlands)

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

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

Boolean representations of simplicial complexes and matroids

CERN Document Server

Rhodes, John

2015-01-01

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

Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions

Science.gov (United States)

2015-01-01

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

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.

Totally optimal decision trees for Boolean functions

KAUST Repository

Chikalov, Igor

2016-07-28

We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.

Boolean Models of Biological Processes Explain Cascade-Like Behavior.

Science.gov (United States)

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

2016-01-29

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

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

Improving the quantum cost of reversible Boolean functions using reorder algorithm

Science.gov (United States)

Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf

2018-05-01

This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.

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.

Defining the Role of Free Flaps in Partial Breast Reconstruction.

Science.gov (United States)

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.

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

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

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

Science.gov (United States)

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

2013-01-01

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

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

A transition calculus for Boolean functions. [logic circuit analysis

Science.gov (United States)

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

1974-01-01

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

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

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

KAUST Repository

Chikalov, Igor

2013-01-01

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

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

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

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

International Nuclear Information System (INIS)

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

2017-01-01

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

Boolean comparative analysis of qualitative data : a methodological note

NARCIS (Netherlands)

Romme, A.G.L.

1995-01-01

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

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.

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

Boolean network representation of contagion dynamics during a financial crisis

Science.gov (United States)

Caetano, Marco Antonio Leonel; Yoneyama, Takashi

2015-01-01

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

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.

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.

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

Science.gov (United States)

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

2017-04-01

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

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.

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

Science.gov (United States)

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

2016-09-23

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

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

Data.gov (United States)

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

The value of less connected agents in Boolean networks

Science.gov (United States)

Epstein, Daniel; Bazzan, Ana L. C.

2013-11-01

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

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

A Construction of Boolean Functions with Good Cryptographic Properties

Science.gov (United States)

2014-01-01

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

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

Science.gov (United States)

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

2014-06-26

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

Boolean Factor Analysis by Attractor Neural Network

Czech Academy of Sciences Publication Activity Database

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

2007-01-01

Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007

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

Directory of Open Access Journals (Sweden)

Jens Christian Claussen

2017-06-01

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

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

Science.gov (United States)

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

2013-06-01

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

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

Science.gov (United States)

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

2016-11-01

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

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

Directory of Open Access Journals (Sweden)

Yih-Lon Lin

2013-01-01

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

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.

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

CERN Document Server

Cheng, Daizhan; Li, Zhiqiang

2010-01-01

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

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

OpenAIRE

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

2000-01-01

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

Boolean Operations with Prism Algebraic Patches

Science.gov (United States)

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

2009-01-01

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

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.

Vector Boolean Functions: applications in symmetric cryptography

OpenAIRE

Álvarez Cubero, José Antonio

2015-01-01

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

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�

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

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

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

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.

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.

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

Science.gov (United States)

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

2012-01-01

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

Application of fuzzy logic to Boolean models for digital soil assessment

NARCIS (Netherlands)

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

2011-01-01

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

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

Science.gov (United States)

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

1991-01-01

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

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.

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

Science.gov (United States)

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

2012-08-29

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

Stability of Boolean multilevel networks.

Science.gov (United States)

Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir

2012-09-01

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

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

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

Science.gov (United States)

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

2017-01-01

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

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

KAUST Repository

Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

2013-01-01

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

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

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

NARCIS (Netherlands)

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

2001-01-01

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

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

NARCIS (Netherlands)

Jenner, Ronald A.

2002-01-01

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

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

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

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2001-01-01

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

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

Science.gov (United States)

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

2013-03-01

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

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

Science.gov (United States)

Ensor, Pat

1992-01-01

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

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

Science.gov (United States)

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

2015-04-28

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

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

Science.gov (United States)

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

2012-04-01

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

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

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

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

Science.gov (United States)

Matoušek, Milan; Pták, Pavel

2015-12-01

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

Synthesizing biomolecule-based Boolean logic gates.

Science.gov (United States)

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

2013-02-15

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

Synthesizing Biomolecule-based Boolean Logic Gates

Science.gov (United States)

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

2012-01-01

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

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

Importance analysis based on logical differential calculus and Binary Decision Diagram

International Nuclear Information System (INIS)

Zaitseva, Elena; Levashenko, Vitaly; Kostolny, Jozef

2015-01-01

System availability evaluation, sensitivity analysis, Importance Measures, and optimal design are important issues that have become research topics for reliability engineering. There are different mathematical approaches to the development of these topics. The structure function based approach is one of them. Structure function enables one to analyse a system of any complexity. But computational complexity of structure function based methods is time consuming for large-scale networks. We propose to use two mathematical approaches for decision to this problem for system importance analysis. The first of them is Direct Partial Boolean Derivative. New equations for calculating the Importance Measures are developed in terms of these derivatives. The second is Binary Decision Diagram (BDD), that supports efficient manipulation of Boolean algebra. Two algorithms for calculating Direct Partial Boolean Derivative based on BDD of structure function are proposed in this paper. The experimental results show the efficiency of new algorithms for calculating Direct Partial Boolean Derivative and Importance Measures. - Highlights: • New approach for calculation of Importance Measures is proposed. • Direct Partial Boolean Derivatives are used for calculation of Importance Measures. • New equations for Importance Measures are obtained. • New algorithm to calculate Direct Partial Boolean Derivatives by BDD is developed

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

Science.gov (United States)

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

2009-08-01

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

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

Science.gov (United States)

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

2009-08-01

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

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

Science.gov (United States)

Fox, Edward A.; Winett, Sheila G.

1990-01-01

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

Representing Boolean Functions by Decision Trees

KAUST Repository

Chikalov, Igor

2011-01-01

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

Graphene-based non-Boolean logic circuits

Science.gov (United States)

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

2013-10-01

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

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

Science.gov (United States)

Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk

2015-11-01

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

Bebop to the Boolean boogie an unconventional guide to electronics

CERN Document Server

Maxfield, Clive

2003-01-01

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

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.

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

Science.gov (United States)

Tomaszewski, Robert

2016-01-01

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

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

Science.gov (United States)

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

2014-02-01

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

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.

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

OpenAIRE

Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti

2012-01-01

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

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

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

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

Defining degree of aortic occlusion for partial-REBOA: A computed tomography study on large animals.

Science.gov (United States)

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.

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

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

OpenAIRE

Andrade, Jefferson O.; Kameyama, Yukiyoshi

2012-01-01

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

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.

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

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.

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

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

Science.gov (United States)

2017-09-01

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

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

Science.gov (United States)

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

2015-08-07

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

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

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

Science.gov (United States)

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

2017-08-02

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

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

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

KAUST Repository

Lovrics, Anna

2014-11-14

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

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

Science.gov (United States)

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

1990-01-01

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

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

Science.gov (United States)

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

2011-01-01

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

Logical Attractors: a Boolean Approach to the Dynamics of Psychosis

Science.gov (United States)

Kupper, Z.; Hoffmann, H.

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

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

Czech Academy of Sciences Publication Activity Database

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

2010-01-01

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

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

Science.gov (United States)

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

2018-04-01

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

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.

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.

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

Science.gov (United States)

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

2015-10-01

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

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.

Generalized EMV-Effect Algebras

Science.gov (United States)

Borzooei, R. A.; Dvurečenskij, A.; Sharafi, A. H.

2018-04-01

Recently in Dvurečenskij and Zahiri (2017), new algebraic structures, called EMV-algebras which generalize both MV-algebras and generalized Boolean algebras, were introduced. We present equivalent conditions for EMV-algebras. In addition, we define a partial algebraic structure, called a generalized EMV-effect algebra, which is close to generalized MV-effect algebras. Finally, we show that every generalized EMV-effect algebra is either an MV-effect algebra or can be embedded into an MV-effect algebra as a maximal ideal.

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

Directory of Open Access Journals (Sweden)

Shohag Barman

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

Finite element analysis in defining the optimal shape and safety factor of retentive clasp arms of removable partial denture

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.

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

Directory of Open Access Journals (Sweden)

Chao Luo

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

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.

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)

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

Science.gov (United States)

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

2009-07-01

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

Partial distance correlation with methods for dissimilarities

OpenAIRE

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

Linear algebraic theory of partial coherence: discrete fields and measures of partial coherence.

Science.gov (United States)

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.

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

Science.gov (United States)

Andrade, Jefferson O.; Kameyama, Yukiyoshi

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

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

Science.gov (United States)

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

2016-12-21

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

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

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.

Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.

Science.gov (United States)

Dallidis, Stylianos E; Karafyllidis, Ioannis G

2014-09-01

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

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

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

KAUST Repository

Lima, Ricardo

2016-06-16

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

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

KAUST Repository

Lima, Ricardo; Grossmann, Ignacio E.

2016-01-01

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

The Compositional Rule of Inference and Zadeh’s Extension Principle for Non-normal Fuzzy Sets

NARCIS (Netherlands)

van den Broek, P.M.; Noppen, J.A.R.; Castillo, Oscar

2007-01-01

Defining the standard Boolean operations on fuzzy Booleans with the compositional rule of inference (CRI) or Zadeh's extension principle gives counter-intuitive results. We introduce and motivate a slight adaptation of the CRI, which only effects the results for non-normal fuzzy sets. It is shown

Visually defining and querying consistent multi-granular clinical temporal abstractions.

Science.gov (United States)

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

State-Dependent Implication and Equivalence in Quantum Logic

Directory of Open Access Journals (Sweden)

Fedor Herbut

2012-01-01

Full Text Available Ideal occurrence of an event (projector leads to the known change of a state (density operator into (the Lüders state. It is shown that two events and give the same Lüders state if and only if the equivalence relation is valid. This relation determines equivalence classes. The set of them and each class, are studied in detail. It is proved that the range projector of the Lüders state can be evaluated as , where denotes the greatest lower bound, and is the null projector of . State-dependent implication extends absolute implication (which, in turn, determines the entire structure of quantum logic. and are investigated in a closely related way to mutual benefit. Inherent in the preorder is the state-dependent equivalence , defining equivalence classes in a given Boolean subalgebra. The quotient set, in which the classes are the elements, has itself a partially ordered structure, and so has each class. In a complete Boolean subalgebra, both structures are complete lattices. Physical meanings are discussed.

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

Directory of Open Access Journals (Sweden)

Mahdieh Saadat Foomani

2017-01-01

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

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.

Defining the minimal structural requirements for partial agonism at the type I myo-inositol 1,4,5-trisphosphate receptor.

Science.gov (United States)

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.

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

Science.gov (United States)

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

2017-12-19

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

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

Science.gov (United States)

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

2015-09-01

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

Group-wise partial least square regression

NARCIS (Netherlands)

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

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

Disparity between ultrasound and clinical findings in psoriatic arthritis.

Science.gov (United States)

Husic, Rusmir; Gretler, Judith; Felber, Anja; Graninger, Winfried B; Duftner, Christina; Hermann, Josef; Dejaco, Christian

2014-08-01

To investigate the association between psoriatic arthritis (PsA)-specific clinical composite scores and ultrasound-verified pathology as well as comparison of clinical and ultrasound definitions of remission. We performed a prospective study on 70 consecutive PsA patients. Clinical assessments included components of Disease Activity Index for Psoriatic Arthritis (DAPSA) and the Composite Psoriatic Disease Activity Index (CPDAI). Minimal disease activity (MDA) and the following remission criteria were applied: CPDAI joint, entheses and dactylitis domains (CPDAI-JED)=0, DAPSA≤3.3, Boolean's remission definition and physician-judged remission (rem-phys). B-mode and power Doppler (PD-) ultrasound findings were semiquantitatively scored at 68 joints (evaluating synovia, peritendinous tissue, tendons and bony changes) and 14 entheses. Ultrasound remission and minimal ultrasound disease activity (MUDA) were defined as PD-score=0 and PD-score ≤1, respectively, at joints, peritendinous tissue, tendons and entheses. DAPSA but not CPDAI correlated with B-mode and PD-synovitis. Ultrasound signs of enthesitis, dactylitis, tenosynovitis and perisynovitis were not linked with clinical composites. Clinical remission or MDA was observed in 15.7% to 47.1% of PsA patients. Ultrasound remission and MUDA were present in 4.3% and 20.0% of patients, respectively. Joint and tendon-related PD-scores were higher in patients with active versus inactive disease according to CPDAI-JED, DAPSA, Boolean's and rem-phys, whereas no difference was observed regarding enthesitis and perisynovitis. DAPSA≤3.3 (OR 3.9, p=0.049) and Boolean's definition (OR 4.6, p=0.03) were more useful to predict MUDA than other remission criteria. PsA-specific composite scores partially reflect ultrasound findings. DAPSA and Boolean's remission definitions better identify MUDA patients than other clinical criteria. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted

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.

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

Science.gov (United States)

Jiang, Han; Li, Xue; Xu, Qiuliang

2016-12-01

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

The partial-birth stratagem.

Science.gov (United States)

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.

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

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)

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.

Recombinant vitronectin is a functionally defined substrate that supports human embryonic stem cell self-renewal via alphavbeta5 integrin.

NARCIS (Netherlands)

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 logics with two kinds of negation as a foundation for knowledge-based reasoning

NARCIS (Netherlands)

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

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

Science.gov (United States)

Rafimanzelat, Mohammad Reza; Bahrami, Fariba

2018-04-01

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

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

Science.gov (United States)

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

2011-02-01

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

On Undefined and Meaningless in Lambda Definability

OpenAIRE

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

77 FR 5454 - Modifications to Minimum Present Value Requirements for Partial Annuity Distribution Options...

Science.gov (United States)

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

The partial-reinforcement extinction effect and the contingent-sampling hypothesis.

Science.gov (United States)

Hochman, Guy; Erev, Ido

2013-12-01

The partial-reinforcement extinction effect (PREE) implies that learning under partial reinforcements is more robust than learning under full reinforcements. While the advantages of partial reinforcements have been well-documented in laboratory studies, field research has failed to support this prediction. In the present study, we aimed to clarify this pattern. Experiment 1 showed that partial reinforcements increase the tendency to select the promoted option during extinction; however, this effect is much smaller than the negative effect of partial reinforcements on the tendency to select the promoted option during the training phase. Experiment 2 demonstrated that the overall effect of partial reinforcements varies inversely with the attractiveness of the alternative to the promoted behavior: The overall effect is negative when the alternative is relatively attractive, and positive when the alternative is relatively unattractive. These results can be captured with a contingent-sampling model assuming that people select options that provided the best payoff in similar past experiences. The best fit was obtained under the assumption that similarity is defined by the sequence of the last four outcomes.

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

Connections among quantum logics

International Nuclear Information System (INIS)

Lock, P.F.; Hardegree, G.M.

1985-01-01

In this paper, a theory of quantum logics is proposed which is general enough to enable us to reexamine a previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which are incorporated are divided into two groups which we call ''quantum propositional logics'' and ''quantum event logics''. The work of Kochen and Specker (partial Boolean algebras) is included and so is that of Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics, In this part of the paper, an axiom system for quantum propositional logics is developed and the above structures in the context of this system examined. (author)

Comparing complete and partial classification for identifying customers at risk

NARCIS (Netherlands)

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

Development of partial safety factors for the design of partially prestressed rectangular sections in biaxial flexure

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)

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

Science.gov (United States)

Szejka, Agnes; Drossel, Barbara

2010-02-01

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

No-cloning theorem on quantum logics

International Nuclear Information System (INIS)

Miyadera, Takayuki; Imai, Hideki

2009-01-01

This paper discusses the no-cloning theorem in a logicoalgebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result, indicating a relation between the cloning on effect algebras and hidden variables.

A Proposal for User-defined Reductions in OpenMP

Energy Technology Data Exchange (ETDEWEB)

Duran, A; Ferrer, R; Klemm, M; de Supinski, B R; Ayguade, E

2010-03-22

Reductions are commonly used in parallel programs to produce a global result from partial results computed in parallel. Currently, OpenMP only supports reductions for primitive data types and a limited set of base language operators. This is a significant limitation for those applications that employ user-defined data types (e. g., objects). Implementing manual reduction algorithms makes software development more complex and error-prone. Additionally, an OpenMP runtime system cannot optimize a manual reduction algorithm in ways typically applied to reductions on primitive types. In this paper, we propose new mechanisms to allow the use of most pre-existing binary functions on user-defined data types as User-Defined Reduction (UDR) operators. Our measurements show that our UDR prototype implementation provides consistently good performance across a range of thread counts without increasing general runtime overheads.

Testing the generalized partial credit model

OpenAIRE

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

Compensatory Paracrine Mechanisms That Define The Urothelial Response to Injury in Partial Bladder Outlet Obstruction

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.

Partial Molar Volumes of Aqua Ions from First Principles.

Science.gov (United States)

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.

On algorithmic equivalence of instruction sequences for computing bit string functions

NARCIS (Netherlands)

Bergstra, J.A.; Middelburg, C.A.

2015-01-01

Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

On algorithmic equivalence of instruction sequences for computing bit string functions

NARCIS (Netherlands)

Bergstra, J.A.; Middelburg, C.A.

2014-01-01

Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We

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

Directory of Open Access Journals (Sweden)

Mikko Niilo-Rämä

2014-06-01

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

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.

On a hierarchy of Booleanfunctions hard to compute in constant depth

Directory of Open Access Journals (Sweden)

Anna Bernasconi

2001-12-01

Full Text Available Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation. This work represents a step in this direction: we define a combinatorial property that makes Boolean functions `` hard '' to compute in constant depth and show how the harmonic analysis on the hypercube can be applied to derive new lower bounds on the size complexity of previously unclassified Boolean functions.

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

Science.gov (United States)

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

2010-10-01

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

Cast Partial Denture versus Acrylic Partial Denture for Replacement of Missing Teeth in Partially Edentulous Patients

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

Parabolic versus spherical partial cross sections for photoionization excitation of He near threshold

International Nuclear Information System (INIS)

Bouri, C.; Selles, P.; Malegat, L.; Kwato Njock, M. G.

2006-01-01

Spherical and parabolic partial cross sections and asymmetry parameters, defined in the ejected electron frame, are presented for photoionization excitation of the helium atom at 0.1 eV above its double ionization threshold. A quantitative law giving the dominant spherical partial wave l dom for each excitation level n is obtained. The parabolic partial cross sections are shown to satisfy the same approximate selection rules as the related Rydberg series of doubly excited states (K,T) n A . The analysis of radial and angular correlations reveals the close relationship between double excitation, ionization excitation, and double ionization. Opposite to a widespread belief, the observed value of the asymmetry parameter is shown to result from the interplay of radial correlations and symmetry constraints, irrespective of angular correlations. Finally, the measurement of parabolic partial cross sections is proposed as a challenge to experimentalists

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.

Quantum communication for satellite-to-ground networks with partially entangled states

International Nuclear Information System (INIS)

Chen Na; Quan Dong-Xiao; Pei Chang-Xing; Yang-Hong

2015-01-01

To realize practical wide-area quantum communication, a satellite-to-ground network with partially entangled states is developed in this paper. For efficiency and security reasons, the existing method of quantum communication in distributed wireless quantum networks with partially entangled states cannot be applied directly to the proposed quantum network. Based on this point, an efficient and secure quantum communication scheme with partially entangled states is presented. In our scheme, the source node performs teleportation only after an end-to-end entangled state has been established by entanglement swapping with partially entangled states. Thus, the security of quantum communication is guaranteed. The destination node recovers the transmitted quantum bit with the help of an auxiliary quantum bit and specially defined unitary matrices. Detailed calculations and simulation analyses show that the probability of successfully transferring a quantum bit in the presented scheme is high. In addition, the auxiliary quantum bit provides a heralded mechanism for successful communication. Based on the critical components that are presented in this article an efficient, secure, and practical wide-area quantum communication can be achieved. (paper)

Patient reported outcomes in patients undergoing arthroscopic partial meniscectomy for traumatic or degenerative meniscal tears

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

On evolving deformation microstructures in non-convex partially damaged solids

KAUST Repository

Gurses, Ercan

2011-06-01

The paper outlines a relaxation method based on a particular isotropic microstructure evolution and applies it to the model problem of rate independent, partially damaged solids. The method uses an incremental variational formulation for standard dissipative materials. In an incremental setting at finite time steps, the formulation defines a quasi-hyperelastic stress potential. The existence of this potential allows a typical incremental boundary value problem of damage mechanics to be expressed in terms of a principle of minimum incremental work. Mathematical existence theorems of minimizers then induce a definition of the material stability in terms of the sequential weak lower semicontinuity of the incremental functional. As a consequence, the incremental material stability of standard dissipative solids may be defined in terms of weak convexity notions of the stress potential. Furthermore, the variational setting opens up the possibility to analyze the development of deformation microstructures in the post-critical range of unstable inelastic materials based on energy relaxation methods. In partially damaged solids, accumulated damage may yield non-convex stress potentials which indicate instability and formation of fine-scale microstructures. These microstructures can be resolved by use of relaxation techniques associated with the construction of convex hulls. We propose a particular relaxation method for partially damaged solids and investigate it in one- and multi-dimensional settings. To this end, we introduce a new isotropic microstructure which provides a simple approximation of the multi-dimensional rank-one convex hull. The development of those isotropic microstructures is investigated for homogeneous and inhomogeneous numerical simulations. © 2011 Elsevier Ltd. All rights reserved.

Recurrent Partial Words

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.

Coherent systems with multistate components

International Nuclear Information System (INIS)

Caldarola, L.

1980-01-01

The basic rules of the Boolean algebra with restrictions on variables are briefly recalled. This special type of Boolean algebra allows one to handle fault trees of systems made of multistate (two or more than two states) components. Coherent systems are defined in the case of multistate components. This definition is consistent with that originally suggested by Barlow in the case of binary (two states) components. The basic properties of coherence are described and discussed. Coherent Boolean functions are also defined. It is shown that these functions are irredundant, that is they have only one base which is at the same time complete and irredundant. However, irredundant functions are not necessarily coherent. Finally a simplified algorithm for the calculation of the base of a coherent function is described. In the case that the function is not coherent, the algorithm can be used to reduce the size of the normal disjunctive form of the function. This in turn eases the application of the Nelson algorithm to calculate the complete base of the function. The simplified algorithm has been built in the computer program MUSTAFA-1. In a sample case the use of this algorithm caused a reduction of the CPU time by a factor of about 20. (orig.)

Definably compact groups definable in real closed fields. I

OpenAIRE

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

Bibliographic Instruction in the 21st Century.

Science.gov (United States)

Poirier, Gayle

2000-01-01

Discusses bibliographic instruction in libraries. Topics include a history of bibliographic instruction; the Internet and electronic searching; librarians' use of technology; defining information needs; locating and accessing information, including classification systems and Boolean searching; evaluating information; using and communication…

Breast milk and energy intake in exclusively, predominantly, and partially breast-fed infants

NARCIS (Netherlands)

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

On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.

NARCIS (Netherlands)

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

On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices.

NARCIS (Netherlands)

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

Developing a software for removable partial denture design: Part II: Introduction of RPD graph software

Directory of Open Access Journals (Sweden)

Nejatidanesh F

2007-06-01

Full Text Available Background and Aim: Designing removable partial dentures is one of the most important phases of prosthetic treatments. Computer can be used to facilitate and increase accuracy of removable partial denture design. The aim of this study was to develop a software for removable partial denture design.Materials and Methods: A questionnaire (discussed in part I and major textbooks, were used to determine the design rules.  The software (RPD Graph was developed using Visual C++ and Maryam program. The RPD Graph can determine the classification of partial edentulous arch. With defining the missing teeth and providing data about prognosis and conditions of abutment teeth, the removable partial design will be developed by RPD Graph. This software is a knowledge-based system which has specific characteristics. It can be used as an educational tool for teaching RPD design and as a clinical tool for supporting clinician's decision. In addition it can be developed to more complete softwares.

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.

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.

Softlithographic partial integration of surface-active nanoparticles in a PDMS matrix for microfluidic biodevices

Energy Technology Data Exchange (ETDEWEB)

Demming, Stefanie; Buettgenbach, Stephanus [Institute for Microtechnology (IMT), Technische Universitaet Braunschweig, Alte Salzdahlumer Strasse 203, 38124 Braunschweig (Germany); Hahn, Anne; Barcikowski, Stephan [Nanotechnology Department, Laser Zentrum Hannover e.V. (LZH), Hollerithallee 8, 30419 Hannover (Germany); Edlich, Astrid; Franco-Lara, Ezequiel; Krull, Rainer [Institute of Biochemical Engineering (IBVT), Technische Universitaet Braunschweig, Gaussstrasse 17, 38106 Braunschweig (Germany)

2010-04-15

The mergence of microfluidics and nanocomposite materials and their in situ structuring leads to a higher integration level within microsystems technology. Nanoparticles (Cu and Ag) produced via laser radiation were suspended in Poly(dimethylsiloxane) to permanently modify surface material. A microstructuring process was implemented which allows the incorporation of these nanomaterials globally or partially at defined locations within a microbioreactor (MBR) for the determination of their antiseptic and toxic effects on the growth of biomass. Partially structured PDMS with nanoparticle-PDMS composite. (Abstract Copyright [2010], Wiley Periodicals, Inc.)

77 FR 14321 - Modifications to Minimum Present Value Requirements for Partial Annuity Distribution Options...

Science.gov (United States)

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

Partial covariance based functional connectivity computation using Ledoit-Wolf covariance regularization.

Science.gov (United States)

Brier, Matthew R; Mitra, Anish; McCarthy, John E; Ances, Beau M; Snyder, Abraham Z

2015-11-01

Functional connectivity refers to shared signals among brain regions and is typically assessed in a task free state. Functional connectivity commonly is quantified between signal pairs using Pearson correlation. However, resting-state fMRI is a multivariate process exhibiting a complicated covariance structure. Partial covariance assesses the unique variance shared between two brain regions excluding any widely shared variance, hence is appropriate for the analysis of multivariate fMRI datasets. However, calculation of partial covariance requires inversion of the covariance matrix, which, in most functional connectivity studies, is not invertible owing to rank deficiency. Here we apply Ledoit-Wolf shrinkage (L2 regularization) to invert the high dimensional BOLD covariance matrix. We investigate the network organization and brain-state dependence of partial covariance-based functional connectivity. Although RSNs are conventionally defined in terms of shared variance, removal of widely shared variance, surprisingly, improved the separation of RSNs in a spring embedded graphical model. This result suggests that pair-wise unique shared variance plays a heretofore unrecognized role in RSN covariance organization. In addition, application of partial correlation to fMRI data acquired in the eyes open vs. eyes closed states revealed focal changes in uniquely shared variance between the thalamus and visual cortices. This result suggests that partial correlation of resting state BOLD time series reflect functional processes in addition to structural connectivity. Copyright © 2015 Elsevier Inc. All rights reserved.

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.

Partial tooth gear bearings

Science.gov (United States)

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.

Assessment of the fit of removable partial denture fabricated by computer-aided designing/computer aided manufacturing technology.

Science.gov (United States)

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.

A well-defined silica-supported aluminium alkyl through an unprecedented, consecutive two-step protonolysis–alkyl transfer mechanism

KAUST Repository

Pelletier, Jé ré mie; Espinas, Jeff; Vu, Nghiem; Norsic, Sé bastien; Baudouin, Anne; Delevoye, Laurent; Tré bosc, Julien; Le Roux, Erwan; Santini, Catherine; Basset, Jean-Marie; Gauvin, Ré gis M.; Taoufik, Mostafa

2011-01-01

Impregnation of [(AliBu3)(Et2O)] on partially dehydroxylated SBA-15 affords a mesoporous material bearing the well-defined single site surface aluminium species [(≡SiO)2Al(iBu)(Et 2O)]. © The Royal Society of Chemistry.

Reduction of multipartite qubit density matrixes to bipartite qubit density matrixes and criteria of partial separability of multipartite qubit density matrixes

OpenAIRE

Zhong, Zai-Zhe

2004-01-01

The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.

Using the partial least squares (PLS) method to establish critical success factor interdependence in ERP implementation projects

OpenAIRE

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

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

Institute of Scientific and Technical Information of China (English)

祝峰; 何华灿

2000-01-01

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

Definably compact groups definable in real closed fields.II

OpenAIRE

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

Human Health Countermeasures - Partial-Gravity Analogs Workshop

Science.gov (United States)

Barr, Yael; Clement, Gilles; Norsk, Peter

2016-01-01

The experimental conditions that were deemed the most interesting by the HHC Element lead scientists are those permitting studies of the long-term effects of exposure to (a) chronic rotation when supine or in head down tilt (ground-based); and (b) long-radius centrifugation (space based). It is interesting to note that chronic ground based slow rotation room studies have not been performed since the 1960's, when the USA and USSR were investigating the potential use of AG for long-duration space missions. On the other hand, the other partial gravity analogs, i.e., parabolic flight, HUT, suspension, and short-radius centrifugation, have been regularly used in the last three decades (see review in Clément et al. 2015). Based on the workshop evaluations and the scores by the HHC scientific disciplines indicated in tables 3 and 4, simulation of partial G between 0 and 1 should be prioritized as follows: Priority 1. Chronic space-based partial-G analogs: a. Chronic space-based long-radius centrifugation. The ideal scenario would be chronic long-radius centrifugation of cells, animals and humans in a translational research approach - ideally beyond low earth orbit under deep space environmental effects and at various rotations - to obtain different G-effects. In this scenario, all physiological systems could be evaluated and the relationship between physiological response and G level established. This would be the most integrative way of defining, for the first time ever, G-thresholds for each physiological system. b. Chronic space-based centrifugation of animals. Chronic centrifugation of rodents at various G levels in space would allow for determination of AG thresholds of protection for each physiological system. In this case, all physiological systems will be of interest. Intermittent centrifugation will be of secondary interest. c. Chronic space-based centrifugation of cell cultures (RWV). Bioreactor studies of cells and cell cultures of various tissues at various G

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

Science.gov (United States)

Pinilla, Samuel; Poveda, Juan; Arguello, Henry

2018-03-01

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

On the complete and partial integrability of non-Hamiltonian systems

Science.gov (United States)

Bountis, T. C.; Ramani, A.; Grammaticos, B.; Dorizzi, B.

1984-11-01

The methods of singularity analysis are applied to several third order non-Hamiltonian systems of physical significance including the Lotka-Volterra equations, the three-wave interaction and the Rikitake dynamo model. Complete integrability is defined and new completely integrable systems are discovered by means of the Painlevé property. In all these cases we obtain integrals, which reduce the equations either to a final quadrature or to an irreducible second order ordinary differential equation (ODE) solved by Painlevé transcendents. Relaxing the Painlevé property we find many partially integrable cases whose movable singularities are poles at leading order, with In( t- t0) terms entering at higher orders. In an Nth order, generalized Rössler model a precise relation is established between the partial fulfillment of the Painlevé conditions and the existence of N - 2 integrals of the motion.

Neuronal Activity in the Subthalamic Cerebrovasodilator Area under Partial-Gravity Conditions in Rats

Directory of Open Access Journals (Sweden)

Zeredo L Zeredo

2014-03-01

Full Text Available The reduced-gravity environment in space is known to cause an upward shift in body fluids and thus require cardiovascular adaptations in astronauts. In this study, we recorded in rats the neuronal activity in the subthalamic cerebrovasodilator area (SVA, a key area that controls cerebral blood flow (CBF, in response to partial gravity. “Partial gravity” is the term that defines the reduced-gravity levels between 1 g (the unit gravity acceleration on Earth and 0 g (complete weightlessness in space. Neuronal activity was recorded telemetrically through chronically implanted microelectrodes in freely moving rats. Graded levels of partial gravity from 0.4 g to 0.01 g were generated by customized parabolic-flight maneuvers. Electrophysiological signals in each partial-gravity phase were compared to those of the preceding 1 g level-flight. As a result, SVA neuronal activity was significantly inhibited by the partial-gravity levels of 0.15 g and lower, but not by 0.2 g and higher. Gravity levels between 0.2–0.15 g could represent a critical threshold for the inhibition of neurons in the rat SVA. The lunar gravity (0.16 g might thus trigger neurogenic mechanisms of CBF control. This is the first study to examine brain electrophysiology with partial gravity as an experimental parameter.

Experts' understanding of partial derivatives using the Partial Derivative Machine

OpenAIRE

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

Classes of feedforward neural networks and their circuit complexity

NARCIS (Netherlands)

Shawe-Taylor, John S.; Anthony, Martin H.G.; Kern, Walter

1992-01-01

This paper aims to place neural networks in the context of boolean circuit complexity. We define appropriate classes of feedforward neural networks with specified fan-in, accuracy of computation and depth and using techniques of communication complexity proceed to show that the classes fit into a

How to Circumvent Church Numerals

DEFF Research Database (Denmark)

Goldberg, Mayer; Torgersen, Mads

2002-01-01

In this work we consider a standard numeral system in the lambda-calculus, and the elementary arithmetic and Boolean functions and predicates defined on this numeral system, and show how to construct terms that "circumvent" or "defeat" these functions: The equality predicate is satisfied when com...

Nonlinear partial differential equations of second order

CERN Document Server

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.

Development of a computerized procedure system on the basis of formalized action and check

International Nuclear Information System (INIS)

Jung, Y. S.; Shin, Y. C.; Jung, K. H.; Sung, C. H.

1999-01-01

A computerized procedure system was developed on the basis of formalized action and check. The actions and checks are rendered into two dimensional flowchart with foldable, dynamic, and interactive functions. The action and check are evaluated by computer automatically, and can be overridden by operator if necessary. Detail of each action and check is described in the logic tree with several boolean instruction set and n out m of mathematical operator. Computer supports operators to execute the boolean instruction providing relevant process parameters and control devices. In spite of all these computer support, its inner logic is simple and transparent to operators to keep them in the control loop. The boolean instruction can have 3 states. And n out m operator is defined on the 3 states. The definition minimizes not only number of context switching in procedure execution, but also enables evaluation of the action and check. The process parameters are presented in both text label and graphical symbol to improve readability. Moreover, new mechanism to access any part of a procedure is devised while keeping the main stream of procedure execution

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

Partial sums of lagged cross-products of AR residuals and a test for white noise

NARCIS (Netherlands)

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

Compatriot partiality and cosmopolitan justice: Can we justify compatriot partiality within the cosmopolitan framework?

Directory of Open Access Journals (Sweden)

Rachelle Bascara

2016-10-01

Full Text Available This paper shows an alternative way in which compatriot partiality could be justified within the framework of global distributive justice. Philosophers who argue that compatriot partiality is similar to racial partiality capture something correct about compatriot partiality. However, the analogy should not lead us to comprehensively reject compatriot partiality. We can justify compatriot partiality on the same grounds that liberation movements and affirmative action have been justified. Hence, given cosmopolitan demands of justice, special consideration for the economic well-being of your nation as a whole is justified if and only if the country it identifies is an oppressed developing nation in an unjust global order.This justification is incomplete. We also need to say why Person A, qua national of Country A, is justified in helping her compatriots in Country A over similarly or slightly more oppressed non-compatriots in Country B. I argue that Person A’s partiality towards her compatriots admits further vindication because it is part of an oppressed group’s project of self-emancipation, which is preferable to paternalistic emancipation.Finally, I identify three benefits in my justification for compatriot partiality. First, I do not offer a blanket justification for all forms of compatriot partiality. Partiality between members of oppressed groups is only a temporary effective measure designed to level an unlevel playing field. Second, because history attests that sovereign republics could arise as a collective response to colonial oppression, justifying compatriot partiality on the grounds that I have identified is conducive to the development of sovereignty and even democracy in poor countries, thereby avoiding problems of infringement that many humanitarian poverty alleviation efforts encounter. Finally, my justification for compatriot partiality complies with the implicit cosmopolitan commitment to the realizability of global justice

Discontinuous Galerkin finite element methods for hyperbolic nonconservative partial differential equations

International Nuclear Information System (INIS)

Rhebergen, S.; Bokhove, O.; Vegt, J.J.W. van der

2008-01-01

We present space- and space-time discontinuous Galerkin finite element (DGFEM) formulations for systems containing nonconservative products, such as occur in dispersed multiphase flow equations. The main criterium we pose on the weak formulation is that if the system of nonconservative partial differential equations can be transformed into conservative form, then the formulation must reduce to that for conservative systems. Standard DGFEM formulations cannot be applied to nonconservative systems of partial differential equations. We therefore introduce the theory of weak solutions for nonconservative products into the DGFEM formulation leading to the new question how to define the path connecting left and right states across a discontinuity. The effect of different paths on the numerical solution is investigated and found to be small. We also introduce a new numerical flux that is able to deal with nonconservative products. Our scheme is applied to two different systems of partial differential equations. First, we consider the shallow water equations, where topography leads to nonconservative products, in which the known, possibly discontinuous, topography is formally taken as an unknown in the system. Second, we consider a simplification of a depth-averaged two-phase flow model which contains more intrinsic nonconservative products

Essays on partial retirement

NARCIS (Netherlands)

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

Analytic proof of partial conservation of seniority in j=9/2 shells

International Nuclear Information System (INIS)

Chong Qi; Xu, Z.X.; Liotta, R.J.

2012-01-01

A partial conservation of the seniority quantum number in j=9/2 shells has been found recently in a numerical application. In this paper an analytic proof for this problem is derived as an extension of the work [L. Zamick, P. Van Isacker, Phys. Rev. C 78 (2008) 044327]. We analyze the properties of the non-diagonal interaction matrix elements with the help of the one-particle and two-particle coefficients of fractional parentage (cfp's). It is found that all non-diagonal (and the relevant diagonal) matrix elements can be re-expressed in simple ways and are proportional to certain one-particle cfp's. This remarkable occurrence of partial dynamic symmetry is the consequence of the peculiar property of the j=9/2 shell, where all v=3 and 5 states are uniquely defined.

Scala vestibuli cochlear implantation in patients with partially ossified cochleas.

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Murilo Rezende Melo

2006-08-01

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

Minimality of invariant laminations for partially hyperbolic attractors

International Nuclear Information System (INIS)

Nobili, Felipe

2015-01-01

Let f : M → M be a C 1 -diffeomorphism over a compact boundaryless Riemannian manifold M, and Λ a compact f-invariant subset of M admitting a partially hyperbolic spliting T f Λ = E s  ⊕ E c  ⊕ E u over the tangent bundle T f Λ. It's known from the Hirsch–Pugh–Shub theory that Λ admits two invariant laminations associated to the extremal bundles E s and E u . These laminations are families of dynamically defined immersed submanifolds of the M tangent, respectively, to the bundles E s and E u at every point in Λ. In this work, we prove that at least one of the invariant laminations of a transitive partially hyperbolic attractor with a one-dimensional center bundle is minimal: the orbit of every leaf intersects Λ densely. This result extends those in Bonatti et al (2002 J. Inst. Math. Jussieu 1 513–41) and Hertz et al (2007 Fields Institute Communications vol 51 (Providence, RI: American Mathematical Society) pp 103–9) about minimal foliations for robustly transitive diffeomorphisms. (paper)

Anatomic partial nephrectomy: technique evolution.

Science.gov (United States)

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.

Better recovery of kidney function in patients with de novo chronic kidney disease after partial nephrectomy compared with those with pre-existing chronic kidney disease.

Science.gov (United States)

Takagi, Toshio; Kondo, Tsunenori; Iizuka, Junpei; Omae, Kenji; Kobayashi, Hirohito; Hashimoto, Yasunobu; Yoshida, Kazuhiko; Tanabe, Kazunari

2014-06-01

We compared kidney functional recovery between patients with pre-existing chronic kidney disease, those with de novo chronic kidney disease and those with normal kidney function, after partial nephrectomy. A total of 311 patients who underwent partial nephrectomy at Tokyo Women's Medical University Hospital, Tokyo, Japan, between January 2004 and July 2011 with sufficient kidney functional data participated in the study. Patients with pre-existing chronic kidney disease (group1: 78 patients) were defined as those with estimated glomerular filtration rate under 60 mL/min/m(2) before partial nephrectomy. Patients with de novo chronic kidney disease (group 2: 49) were defined as those with estimated glomerular filtration rate over 60 mL/min/m(2) before surgery and who developed estimated glomerular filtration rate under 60 mL/min/m(2) 3 months after partial nephrectomy. Normal patients (group 3: 184) were defined as those with estimated glomerular filtration rate over 60 mL/min/m(2) both before and after partial nephrectomy. Group 1 was associated with older age and higher comorbidity, including hypertension and diabetes mellitus, compared with other groups. R.E.N.A.L. score was not significantly different between the groups. Although the percent change of estimated glomerular filtration rate between the preoperative period and 3 months after partial nephrectomy in group 2 was significantly decreased compared with that in other groups (group 1: -6.8%, group 2: -18%, group 3: -7.3%), the renal functional recovery between 3 and 12 months after partial nephrectomy in group 2 was better than that in other groups (group 1: -0.5%, group 2: 5.6%, group 3: -0.4%). Patients with de novo chronic kidney disease had better kidney functional recovery than the other two groups, which might suggest that they were surgically assaulted and developed chronic kidney disease in the early postoperative period, and were essentially different from those with pre-existing chronic kidney

New definition for the partial remission period in children and adolescents with type 1 diabetes

DEFF Research Database (Denmark)

Mortensen, Henrik B; Hougaard, Philip; Swift, Peter

2009-01-01

OBJECTIVE To find a simple definition of partial remission in type 1 diabetes that reflects both residual beta-cell function and efficacy of insulin treatment. RESEARCH DESIGN AND METHODS A total of 275 patients aged ..., stimulated C-peptide during a challenge was used as a measure of residual beta-cell function. RESULTS By multiple regression analysis, a negative association between stimulated C-peptide and A1C (regression coefficient -0.21, P ... the definition of an insulin dose-adjusted A1C (IDAA1C) as A1C (percent) + [4 x insulin dose (units per kilogram per 24 h)]. A calculated IDAA1C 300 pmol/l was used to define partial remission. The IDAA1C

A Multidimensional Partial Credit Model with Associated Item and Test Statistics: An Application to Mixed-Format Tests

Science.gov (United States)

Yao, Lihua; Schwarz, Richard D.

2006-01-01

Multidimensional item response theory (IRT) models have been proposed for better understanding the dimensional structure of data or to define diagnostic profiles of student learning. A compensatory multidimensional two-parameter partial credit model (M-2PPC) for constructed-response items is presented that is a generalization of those proposed to…

Partially Observed Mixtures of IRT Models: An Extension of the Generalized Partial-Credit Model

Science.gov (United States)

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…

Partial lesions of the intratemporal segment of the facial nerve: graft versus partial reconstruction.

Science.gov (United States)

Bento, Ricardo F; Salomone, Raquel; Brito, Rubens; Tsuji, Robinson K; Hausen, Mariana

2008-09-01

In cases of partial lesions of the intratemporal segment of the facial nerve, should the surgeon perform an intraoperative partial reconstruction, or partially remove the injured segment and place a graft? We present results from partial lesion reconstruction on the intratemporal segment of the facial nerve. A retrospective study on 42 patients who presented partial lesions on the intratemporal segment of the facial nerve was performed between 1988 and 2005. The patients were divided into 3 groups based on the procedure used: interposition of the partial graft on the injured area of the nerve (group 1; 12 patients); keeping the preserved part and performing tubulization (group 2; 8 patients); and dividing the parts of the injured nerve (proximal and distal) and placing a total graft of the sural nerve (group 3; 22 patients). Fracture of the temporal bone was the most frequent cause of the lesion in all groups, followed by iatrogenic causes (p lesion of the facial nerve is still questionable. Among these 42 patients, the best results were those from the total graft of the facial nerve.

Berlin: Sustainability and Tour Guides in a Partial Dark Tourism Destination

OpenAIRE

Asaf Leshem

2013-01-01

When guiding in Berlin about the Holocaust or about the Cold War, tour guides often hear the phrase: “I didn’t come here for that, but I want to see that as well...” Many of Berlin’s 10 Million visitors per year claim to have an attraction towards both the morbid and the lighter side of the city. Following from that popular sentiment it is argued that Berlin can be defined as a Partial Dark Tourism Destination. As such, it is further argued that Berlin is prone to an increase of socio-econom...

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

Quantitative assessment of caffeine partial clearances in man.

Science.gov (United States)

Lelo, A; Miners, J O; Robson, R A; Birkett, D J

1986-01-01

Five subjects who participated in an earlier study (Lelo et al., 1986b) of the comparative pharmacokinetics of caffeine (CA) and its primary monodemethylated metabolites paraxanthine (PX), theobromine (TB) and theophylline (TP) were administered CA to steady-state. Using areas under the plasma concentration-time curves for each of the dimethylxanthines derived from CA in the steady-state study and individual plasma clearances of PX, TB and TP determined in the previous study, the fractional conversion of CA to PX, TB and TP and the individual partial clearances of CA have been defined. The mean (+/- s.d.) fractional conversion of CA to PX, TB and TP was 79.6 +/- 21.0%, 10.8 +/- 2.4% and 3.7 +/- 1.3%, respectively. When only demethylation pathways are considered PX, TB and TP accounted for 83.9 +/- 5.4%, 12.1 +/- 4.1% and 4.0 +/- 1.4%, respectively of the CA demethylations. The mean partial clearance of CA to PX was approximately 8-fold and 23-fold greater than those to TB and TP respectively. These data confirm earlier reports that PX is the major metabolite of CA in humans but suggest that PX formation is quantitatively more important than previously believed. PMID:3756066

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

Beginning partial differential equations

CERN Document Server

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

Partial meniscectomy is associated with increased risk of incident radiographic osteoarthritis and worsening cartilage damage in the following year

Energy Technology Data Exchange (ETDEWEB)

Roemer, Frank W. [Boston University School of Medicine, Quantitative Imaging Center, Department of Radiology, Boston, MA (United States); University of Erlangen-Nuremberg, Department of Radiology, Erlangen (Germany); Kwoh, C.K. [University of Arizona Arthritis Center and University of Arizona College of Medicine, Tucson, AZ (United States); Hannon, Michael J.; Grago, Jason [University of Pittsburgh School of Medicine, Division of Rheumatology and Clinical Immunology, Pittsburgh, PA (United States); Hunter, David J. [University of Sydney, Department of Rheumatology, Royal North Shore Hospital and Kolling Institute, St Leonards (Australia); Eckstein, Felix [Paracelsus Medical University, Institute of Anatomy, Salzburg (Austria); Boudreau, Robert M. [University of Pittsburgh Graduate School of Public Health, Department of Epidemiology, Pittsburgh, PA (United States); Englund, Martin [Lund University, Clinical Epidemiology Unit, Orthopaedics, Department of Clinical Sciences Lund, Lund (Sweden); Guermazi, Ali [Boston University School of Medicine, Quantitative Imaging Center, Department of Radiology, Boston, MA (United States)

2017-01-15

To assess whether partial meniscectomy is associated with increased risk of radiographic osteoarthritis (ROA) and worsening cartilage damage in the following year. We studied 355 knees from the Osteoarthritis Initiative that developed ROA (Kellgren-Lawrence grade ≥ 2), which were matched with control knees. The MR images were assessed using the semi-quantitative MOAKS system. Conditional logistic regression was applied to estimate risk of incident ROA. Logistic regression was used to assess the risk of worsening cartilage damage in knees with partial meniscectomy that developed ROA. In the group with incident ROA, 4.4 % underwent partial meniscectomy during the year prior to the case-defining visit, compared with none of the knees that did not develop ROA. All (n = 31) knees that had partial meniscectomy and 58.9 % (n = 165) of the knees with prevalent meniscal damage developed ROA (OR = 2.51, 95 % CI [1.73, 3.64]). In knees that developed ROA, partial meniscectomy was associated with an increased risk of worsening cartilage damage (OR = 4.51, 95 % CI [1.53, 13.33]). The probability of having had partial meniscectomy was higher in knees that developed ROA. When looking only at knees that developed ROA, partial meniscectomy was associated with greater risk of worsening cartilage damage. (orig.)

Hyperbolic partial differential equations

CERN Document Server

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

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

International Nuclear Information System (INIS)

Blanca, Ernest

1974-10-01

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

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

Partial differential equations

CERN Document Server

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

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.

Deficient motion-defined and texture-defined figure-ground segregation in amblyopic children.

Science.gov (United States)

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.

Successful removable partial dentures.

Science.gov (United States)

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.

Combustion stratification study of partially premixed combustion using Fourier transform analysis of OH* chemiluminescence images

KAUST Repository

Izadi Najafabadi, Mohammad

2017-11-06

A relatively high level of stratification (qualitatively: lack of homogeneity) is one of the main advantages of partially premixed combustion over the homogeneous charge compression ignition concept. Stratification can smooth the heat release rate and improve the controllability of combustion. In order to compare stratification levels of different partially premixed combustion strategies or other combustion concepts, an objective and meaningful definition of “stratification level” is required. Such a definition is currently lacking; qualitative/quantitative definitions in the literature cannot properly distinguish various levels of stratification. The main purpose of this study is to objectively define combustion stratification (not to be confused with fuel stratification) based on high-speed OH* chemiluminescence imaging, which is assumed to provide spatial information regarding heat release. Stratification essentially being equivalent to spatial structure, we base our definition on two-dimensional Fourier transforms of photographs of OH* chemiluminescence. A light-duty optical diesel engine has been used to perform the OH* bandpass imaging on. Four experimental points are evaluated, with injection timings in the homogeneous regime as well as in the stratified partially premixed combustion regime. Two-dimensional Fourier transforms translate these chemiluminescence images into a range of spatial frequencies. The frequency information is used to define combustion stratification, using a novel normalization procedure. The results indicate that this new definition, based on Fourier analysis of OH* bandpass images, overcomes the drawbacks of previous definitions used in the literature and is a promising method to compare the level of combustion stratification between different experiments.

32 CFR 751.13 - Partial payments.

Science.gov (United States)

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

[Acrylic resin removable partial dentures].

Science.gov (United States)

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.

Is nonoperative management of partial distal biceps tears really successful?

Science.gov (United States)

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.

Vector parametrization, partial angular momenta and unusual commutation relations in physics

International Nuclear Information System (INIS)

Gatti, Fabien; Nauts, Andre

2003-01-01

When studying an N-particle system by means of N-1 vectors i.e., by means of a vector parametrization, one unavoidably comes across several angular momenta: not only the total angular momentum of the system but also the various partial angular momenta corresponding to the motion of the various vectors. All these momenta can, in addition, be referred to a variety of reference frames. The use of vector parametrizations and partial angular momenta in physics greatly simplifies the classical as well as quantum expressions of the kinetic energy. The present paper is devoted to a detailed and rigorous study of the partial angular momenta and the various commutation relations they satisfy, in particular the unusual commutation relations whose origin is traced back to the very structure of the coordinate changes used to define the Body-Fixed (BF) frames. The direct quantization of the classical expressions of the kinetic energy obtained in the context of various vector parametrizations is also given in detail. It turns out to be an efficient extension of well-known quantization procedures to the case where supernumerary quasi-momenta are used. As an illustration, the case of a four-particle system is treated in detail for a particular choice of the BF frames. Finally, the analogies between the classical and quantum approaches are emphasized

Supersymmetric many-body systems from partial symmetries — integrability, localization and scrambling

Energy Technology Data Exchange (ETDEWEB)

Padmanabhan, Pramod [Fields, Gravity & Strings, CTPU, Institute for Basic Science,Daejeon 34037 (Korea, Republic of); Rey, Soo-Jong [Fields, Gravity & Strings, CTPU, Institute for Basic Science,Daejeon 34037 (Korea, Republic of); School of Physics and Astronomy & Center for Theoretical Physics, Seoul National University,Seoul 06544 (Korea, Republic of); Department of Basic Sciences, University of Science and Technology, Daejeon 34113 (Korea, Republic of); Teixeira, Daniel; Trancanelli, Diego [Institute of Physics, University of São Paulo, 05314-970 São Paulo (Brazil)

2017-05-25

Partial symmetries are described by generalized group structures known as symmetric inverse semigroups. We use the algebras arising from these structures to realize supersymmetry in (0+1) dimensions and to build many-body quantum systems on a chain. This construction consists in associating appropriate supercharges to chain sites, in analogy to what is done in spin chains. For simple enough choices of supercharges, we show that the resulting states have a finite non-zero Witten index, which is invariant under perturbations, therefore defining supersymmetric phases of matter protected by the index. The Hamiltonians we obtain are integrable and display a spectrum containing both product and entangled states. By introducing disorder and studying the out-of-time-ordered correlators (OTOC), we find that these systems are in the many-body localized phase and do not thermalize. Finally, we reformulate a theorem relating the growth of the second Rényi entropy to the OTOC on a thermal state in terms of partial symmetries.

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

"Dermatitis" defined.

Science.gov (United States)

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.

Structural studies of formic acid using partial form-factor analysis

International Nuclear Information System (INIS)

Swan, G.; Dore, J.C.; Bellissent-Funel, M.C.

1993-01-01

Neutron diffraction measurements have been made of liquid formic acid using H/D isotopic substitution. Data are recorded for samples of DCOOD, HCOOD and a (H/D)COOD mixture (α D =0.36). A first-order difference method is used to determine the intra-molecular contribution through the introduction of a partial form-factor analysis technique incorporating a hydrogen-bond term. The method improves the sensitivity of the parameters defining the molecular geometry and avoids some of the ambiguities arising from terms involving spatial overlap of inter- and intra-molecular features. The possible application to other systems is briefly reviewed. (authors). 8 figs., 2 tabs., 8 refs

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

Science.gov (United States)

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

2016-04-01

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

Real world efficiency of retrofit partial-flow diesel particulate filters for trucks

International Nuclear Information System (INIS)

Van Asch, R.; Verbeek, R.; Ligterink, N.; Kadijk, G.

2009-11-01

In 2006 the Dutch Ministry of Housing, Spatial Planning and the Environment (VROM) introduced an incentive scheme for retrofitting diesel particulate filters on Euro II and Euro III trucks. This scheme involves both partial flow and full flow diesel particulate filters (also called semi-open or open respectively wall-flow or closed filters). In the period 2007 till January 2009 about 15,000 partial flow filters and 8,000 full flow diesel particulate filters were installed. The minimum filtration efficiency requirement for the partial flow diesel particulate filters is 50% during the type approval test. In 2008 an engine dynamometer test programme was conducted to measure the filtration efficiency of retrofit open particulates filters of heavy trucks. This led to somewhat disappointing results with average filtration efficiencies in the range of 5-20% during city and national motorway driving conditions up to 20-40% during long distance motorway driving. This result leads to two main questions: (1) Is this result also representative for medium heavy trucks used for delivery, and (2) do similar efficiencies show up also in tests on entire vehicles, tested under conditions as close as possible to their real world usage profile. To this end, an additional measurement programme was defined, which is reported here. The objective of the study reported here is to determine the real world filtration efficiency of retrofit partial flow particulate filters for a number of trucks under different driving conditions such as city and motorway driving. The emphasis should be on medium heavy trucks typically used for national delivery.

Does Conceptual Understanding of Limit Partially Lead Students to Misconceptions?

Science.gov (United States)

Mulyono, B.; Hapizah

2017-09-01

This article talks about the result of preliminary research of my dissertation, which will investigate student’s retention of conceptual understanding. In my preliminary research, I surveyed 73 students of mathematics education program by giving some questions to test their retention of conceptual understanding of limits. Based on the results of analyzing of students’ answers I conclude that most of the students have problems with their retention of conceptual understanding and they also have misconception of limits. The first misconception I identified is that students always used the substitution method to determine a limit of a function at a point, but they did not check whether the function is continue or not at the point. It means that they only use the substitution theorem partially, because they do not consider that the substitution theorem \\mathop{{lim}}\\limits\\text{x\\to \\text{c}}f(x)=f(c) works only if f(x) is defined at χ = c. The other misconception identified is that some students always think there must be available of variables χ in a function to determine the limit of the function. I conjecture that conceptual understanding of limit partially leads students to misconceptions.

Quantum transport through MoS2 constrictions defined by photodoping

Science.gov (United States)

Epping, Alexander; Banszerus, Luca; Güttinger, Johannes; Krückeberg, Luisa; Watanabe, Kenji; Taniguchi, Takashi; Hassler, Fabian; Beschoten, Bernd; Stampfer, Christoph

2018-05-01

We present a device scheme to explore mesoscopic transport through molybdenum disulfide (MoS2) constrictions using photodoping. The devices are based on van-der-Waals heterostructures where few-layer MoS2 flakes are partially encapsulated by hexagonal boron nitride (hBN) and covered by a few-layer graphene flake to fabricate electrical contacts. Since the as-fabricated devices are insulating at low temperatures, we use photo-induced remote doping in the hBN substrate to create free charge carriers in the MoS2 layer. On top of the device, we place additional metal structures, which define the shape of the constriction and act as shadow masks during photodoping of the underlying MoS2/hBN heterostructure. Low temperature two- and four-terminal transport measurements show evidence of quantum confinement effects.

Mnesors for automatic control

OpenAIRE

Champenois, Gilles

2009-01-01

Mnesors are defined as elements of a semimodule over the min-plus integers. This two-sorted structure is able to merge graduation properties of vectors and idempotent properties of boolean numbers, which makes it appropriate for hybrid systems. We apply it to the control of an inverted pendulum and design a full logical controller, that is, without the usual algebra of real numbers.

Growth modeling of Cryptomeria japonica by partial trunk analysis

Directory of Open Access Journals (Sweden)

Vinícius Morais Coutinho

2017-06-01

Full Text Available This study aimed to evaluate the growth pattern of Cryptomeria japonica increment (L. F. D. Don. and to describe the probability distribution in stands stablished at the municipality of Rio Negro, Paraná State. Twenty trees were sampled in a 34 years-old stand, with 3 m x 2 m spacing. Wood disks were taken from each tree at 1.3 m above the ground (DBH to perform partial stem analysis. Diameter growth series without bark were used to generate the average cumulative growth curves for DBH (cm, mean annual increment (MAI and current annual increment (CAI. From the increment data, the frequency distribution was evaluated by means of probability density functions (pdfs. The mean annual increment for DBH was 0.78 cm year-1 and the age of intersection of CAI and MAI curves was between the 7th and 8th years. It was found that near 43% of the species increments are concentrated bellow 0.5 cm. The results are useful to define appropriate management strategies for the species for sites similar to the studying regions, defining for example ages of silvicultural intervention, such as thinning.

Partial Deconvolution with Inaccurate Blur Kernel.

Science.gov (United States)

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

Pyramidal resistor networks for electrical impedance tomography with partial boundary measurements

International Nuclear Information System (INIS)

Borcea, L; Mamonov, A V; Druskin, V; Vasquez, F Guevara

2010-01-01

We introduce an inversion algorithm for electrical impedance tomography (EIT) with partial boundary measurements in two dimensions. It gives stable and fast reconstructions using sparse parameterizations of the unknown conductivity on optimal grids that are computed as part of the inversion. We follow the approach in Borcea et al (2008 Inverse Problems 24 035013) and Vasquez (2006 PhD thesis Rice University, Houston, TX, USA) that connects inverse discrete problems for resistor networks to continuum EIT problems, using optimal grids. The algorithm in Borcea et al (2008 Inverse Problems 24 035013) and Vasquez (2006 PhD Thesis Rice University, Houston, TX, USA) is based on circular resistor networks, and solves the EIT problem with full boundary measurements. It is extended in Borcea et al (2010 Inverse Problems 26 045010) to EIT with partial boundary measurements, using extremal quasi-conformal mappings that transform the problem to one with full boundary measurements. Here we introduce a different class of optimal grids, based on resistor networks with pyramidal topology, that is better suited for the partial measurements setup. We prove the unique solvability of the discrete inverse problem for these networks and develop an algorithm for finding them from the measurements of the Dirichlet to Neumann map. Then, we show how to use the networks to define the optimal grids and to approximate the unknown conductivity. We assess the performance of our approach with numerical simulations and compare the results with those in Borcea et al (2010)

Circular resistor networks for electrical impedance tomography with partial boundary measurements

International Nuclear Information System (INIS)

Borcea, L; Mamonov, A V; Druskin, V

2010-01-01

We introduce an algorithm for the numerical solution of electrical impedance tomography (EIT) in two dimensions, with partial boundary measurements. The algorithm is an extension of the one in Borcea et al (2008 Inverse Problems 24 035013 (31pp)) and Vasquez (2006 PhD Thesis Rice University, Houston, TX, USA) for EIT with full boundary measurements. It is based on resistor networks that arise in finite volume discretizations of the elliptic partial differential equation for the potential on so-called optimal grids that are computed as part of the problem. The grids are adaptively refined near the boundary, where we measure and expect better resolution of the images. They can be used very efficiently in inversion, by defining a reconstruction mapping that is an approximate inverse of the forward map, and acts therefore as a preconditioner in any iterative scheme that solves the inverse problem via optimization. The main result in this paper is the construction of optimal grids for EIT with partial measurements by extremal quasiconformal (Teichmüller) transformations of the optimal grids for EIT with full boundary measurements. We present the algorithm for computing the reconstruction mapping on such grids, and we illustrate its performance with numerical simulations. The results show an interesting trade-off between the resolution of the reconstruction in the domain of the solution and distortions due to artificial anisotropy induced by the distribution of the measurement points on the accessible boundary

A Microbeam Resonator with Partial Electrodes for Logic and Memory Elements

KAUST Repository

Hafiz, Md Abdullah Al

2017-11-10

We demonstrate logic and memory elements based on an in-plane clamped-clamped microbeam resonator. The micro-resonator is electrostatically actuated through a drive electrode and the motional signal is capacitively sensed at a sense electrode, while the resonance characteristics are modulated by DC voltage pulses provided at two separate partial electrodes, independent of the drive/sense electrodes. For the logic applications, we use two separate electrodes to provide DC voltages defined as the logic inputs. The high (low) motional signal at on-resonance (off-resonance) state is defined as the logic output state “1” (“0”). For the memory operation, two stable vibrational states, high and low, within the hysteretic regime are defined as the memory states, “1” and “0”, respectively. We take advantage of the split electrode configuration to provide positive and negative DC voltage pulses selectively to set/reset the memory states (“1”/“0”) without affecting the driving and sensing terminals. Excluding the energy cost for supporting electronics, these devices consume energy in 10’s of picojoules per logic/memory operations. Furthermore, the devices are fabricated using silicon on insulator (SOI) wafers, have the potential for on-chip integration, and operate at moderate pressure (~1 Torr) and room temperature.

A Microbeam Resonator with Partial Electrodes for Logic and Memory Elements

KAUST Repository

Hafiz, Md Abdullah Al; Ilyas, Saad; Ahmed, Sally; Younis, Mohammad I.; Fariborzi, Hossein

2017-01-01

We demonstrate logic and memory elements based on an in-plane clamped-clamped microbeam resonator. The micro-resonator is electrostatically actuated through a drive electrode and the motional signal is capacitively sensed at a sense electrode, while the resonance characteristics are modulated by DC voltage pulses provided at two separate partial electrodes, independent of the drive/sense electrodes. For the logic applications, we use two separate electrodes to provide DC voltages defined as the logic inputs. The high (low) motional signal at on-resonance (off-resonance) state is defined as the logic output state “1” (“0”). For the memory operation, two stable vibrational states, high and low, within the hysteretic regime are defined as the memory states, “1” and “0”, respectively. We take advantage of the split electrode configuration to provide positive and negative DC voltage pulses selectively to set/reset the memory states (“1”/“0”) without affecting the driving and sensing terminals. Excluding the energy cost for supporting electronics, these devices consume energy in 10’s of picojoules per logic/memory operations. Furthermore, the devices are fabricated using silicon on insulator (SOI) wafers, have the potential for on-chip integration, and operate at moderate pressure (~1 Torr) and room temperature.

[Removable partial dentures. Oral functions and types].

Science.gov (United States)

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.

[Conventional retaining of removable partial dentures

NARCIS (Netherlands)

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

Photogenic partial seizures.

Science.gov (United States)

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.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks.

Directory of Open Access Journals (Sweden)

Teeraphan Laomettachit

Full Text Available To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a "standard component" modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with "standard components" can capture in quantitative detail many essential properties of cell cycle control in budding yeast.

Technical Note: Deformable image registration on partially matched images for radiotherapy applications

International Nuclear Information System (INIS)

Yang Deshan; Goddu, S. Murty; Lu Wei; Pechenaya, Olga L.; Wu Yu; Deasy, Joseph O.; El Naqa, Issam; Low, Daniel A.

2010-01-01

In radiation therapy applications, deformable image registrations (DIRs) are often carried out between two images that only partially match. Image mismatching could present as superior-inferior coverage differences, field-of-view (FOV) cutoffs, or motion crossing the image boundaries. In this study, the authors propose a method to improve the existing DIR algorithms so that DIR can be carried out in such situations. The basic idea is to extend the image volumes and define the extension voxels (outside the FOV or outside the original image volume) as NaN (not-a-number) values that are transparent to all floating-point computations in the DIR algorithms. Registrations are then carried out with one additional rule that NaN voxels can match any voxels. In this way, the matched sections of the images are registered properly, and the mismatched sections of the images are registered to NaN voxels. This method makes it possible to perform DIR on partially matched images that otherwise are difficult to register. It may also improve DIR accuracy, especially near or in the mismatched image regions.

Partially massless fields during inflation

Science.gov (United States)

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.

The strategic value of partial vertical integration

OpenAIRE

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

Partial dynamical systems, fell bundles and applications

CERN Document Server

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

Physics of partially ionized plasmas

CERN Document Server

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

MRI in diagnosing partial thickness tears of the rotator cuff

International Nuclear Information System (INIS)

Ogawa, Takeshi

2000-01-01

In this study 270 patients who had been treated for 10 years and had suspected rupture of the tendon and complete or partial thickness tears of the rotator cuff were diagnosed. Among these patients, MRI images in 50 cases were investigated to establish the diagnostic criteria for partial thickness tears of the rotator cuff. The rupture sites included the bursal surface in 15 shoulders, the articular surface in 30 shoulders, complicated cases of both surfaces in five shoulders with no intrasubstance. As for the imaging method, T2-weighted images were employed and the oblique coronary section, which is parallel to the scapula, was used as a imaging plane. From the results of the variation of the MRI signal intensity in the tendon, it was found that the signal intensity increased to 80% in the rupture of the bursal surface and 93.3% in the rupture of the articular surface. As for sites where the signals in the tendon increased, these were found at the bursal side in 83.3% of rupture at the bursal surface, and at the articular side in 100% of rupture at the articular surface. From these findings, the MRI-diagnostic criteria of partial thickness tears of the rotator cuff was defined as those cases which show a localized increase in signal intensity on the oblique coronary surface of T2 weighted images, but not in whole layers of the tendon. A high diagnostic rate with these criteria could be obtained with a sensitivity of 82.0%, specificity 90.9%, accuracy 84.7%, and positive predictive value 95.3%. (author)

Effect of Extracorporeal Shock Wave Treatment on Deep Partial-Thickness Burn Injury in Rats: A Pilot Study

Directory of Open Access Journals (Sweden)

Gabriel Djedovic

2014-01-01

Full Text Available Extracorporeal shock wave therapy (ESWT enhances tissue vascularization and neoangiogenesis. Recent animal studies showed improved soft tissue regeneration using ESWT. In most cases, deep partial-thickness burns require skin grafting; the outcome is often unsatisfactory in function and aesthetic appearance. The aim of this study was to demonstrate the effect of ESWT on skin regeneration after deep partial-thickness burns. Under general anesthesia, two standardized deep partial-thickness burns were induced on the back of 30 male Wistar rats. Immediately after the burn, ESWT was given to rats of group 1 (N=15, but not to group 2 (N=15. On days 5, 10, and 15, five rats of each group were analyzed. Reepithelialization rate was defined, perfusion units were measured, and histological analysis was performed. Digital photography was used for visual documentation. A wound score system was used. ESWT enhanced the percentage of wound closure in group 1 as compared to group 2 (P<0.05. The reepithelialization rate was improved significantly on day 15 (P<0.05. The wound score showed a significant increase in the ESWT group. ESWT improves skin regeneration of deep partial-thickness burns in rats. It may be a suitable and cost effective treatment alternative in this type of burn wounds in the future.

Evaluation of total and partial structure factors, self-diffusion coefficients, and compressibilities of the cadmium-gallium melt

International Nuclear Information System (INIS)

Gopala Rao, R.V.; Das, R.

1988-01-01

The three partial structure factors S/sub 11/(K), S/sub 22/(K), and S/sub 12/(K) defined by Ashcroft and Langreth are computed with a square-well potential as a perturbation over a hard-sphere potential for different atomic fractions or concentrations of cadmium for Cd-Ga melt at 296 0 C. Also, the number-number, concentration-concentration, and the cross-term number-concentration structure factors due to Bhatia-Thornton have been calculated for the seven concentrations of Cd-Ga melt at that temperature. From these partial structure factors total structure factors are computed and are compared with the experimental results. The total structure factors so computed are found to be in excellent agreement with the measured values except in the long-wavelength limit of S(0). Using the partial structure factors in the long-wavelength limit the isothermal compressibilities have been calculated. From these partial structure factors and by using the linear-trajectory approximation of Helfand, the self-diffusion coefficients D/sub i/'s have also been calculated for various atomic fractions of Cd for Cd-Ga alloy at 296 0 C. From these D/sub i/'s, an estimate of the mutual diffusion coefficients has been made to a good approximation

Proinsulin, GLP-1, and glucagon are associated with partial remission in children and adolescents with newly diagnosed type 1 diabetes

DEFF Research Database (Denmark)

Kaas, A.; Andersen, M. L. M.; Fredheim, Siri

2012-01-01

.002) were significantly lower in remitters than in non-remitters at 6 and 12 months. Proinsulin associated positively with GLP-1 at 1 month (p = 0.004) and negatively at 6 (p = 0.002) and 12 months (p = 0.0002). Conclusions: In type 1 diabetes, patients in partial remission have higher levels of proinsulin......1C), glucagon-like peptide-1 (GLP-1), glucagon, and remission status the first year after diagnosis of type 1 diabetes. Methods: Juvenile patients (n = 275) were followed 1, 6, and 12 months after diagnosis. At each visit, partial remission was defined as IDAA1C = 9%. The patients had a liquid meal...

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.

Model test on partial expansion in stratified subsidence during foundation pit dewatering

Science.gov (United States)

Wang, Jianxiu; Deng, Yansheng; Ma, Ruiqiang; Liu, Xiaotian; Guo, Qingfeng; Liu, Shaoli; Shao, Yule; Wu, Linbo; Zhou, Jie; Yang, Tianliang; Wang, Hanmei; Huang, Xinlei

2018-02-01

Partial expansion was observed in stratified subsidence during foundation pit dewatering. However, the phenomenon was suspected to be an error because the compression of layers is known to occur when subsidence occurs. A slice of the subsidence cone induced by drawdown was selected as the prototype. Model tests were performed to investigate the phenomenon. The underlying confined aquifer was generated as a movable rigid plate with a hinge at one end. The overlying layers were simulated with remolded materials collected from a construction site. Model tests performed under the conceptual model indicated that partial expansion occurred in stratified settlements under coordination deformation and consolidation conditions. During foundation pit dewatering, rapid drawdown resulted in rapid subsidence in the dewatered confined aquifer. The rapidly subsiding confined aquifer top was the bottom deformation boundary of the overlying layers. Non-coordination deformation was observed at the top and bottom of the subsiding overlying layers. The subsidence of overlying layers was larger at the bottom than at the top. The layers expanded and became thicker. The phenomenon was verified using numerical simulation method based on finite difference method. Compared with numerical simulation results, the boundary effect of the physical tests was obvious in the observation point close to the movable endpoint. The tensile stress of the overlying soil layers induced by the underlying settlement of dewatered confined aquifer contributed to the expansion phenomenon. The partial expansion of overlying soil layers was defined as inversed rebound. The inversed rebound was induced by inversed coordination deformation. Compression was induced by the consolidation in the overlying soil layers because of drainage. Partial expansion occurred when the expansion exceeded the compression. Considering the inversed rebound, traditional layer-wise summation method for calculating subsidence should be

Combining MRI with PET for partial volume correction improves image-derived input functions in mice

Energy Technology Data Exchange (ETDEWEB)

Evans, Eleanor; Buonincontri, Guido [Wolfson Brain Imaging Centre, University of Cambridge, Cambridge (United Kingdom); Izquierdo, David [Athinoula A Martinos Centre, Harvard University, Cambridge, MA (United States); Methner, Carmen [Department of Medicine, University of Cambridge, Cambridge (United Kingdom); Hawkes, Rob C [Wolfson Brain Imaging Centre, University of Cambridge, Cambridge (United Kingdom); Ansorge, Richard E [Department of Physics, University of Cambridge, Cambridge (United Kingdom); Kreig, Thomas [Department of Medicine, University of Cambridge, Cambridge (United Kingdom); Carpenter, T Adrian [Wolfson Brain Imaging Centre, University of Cambridge, Cambridge (United Kingdom); Sawiak, Stephen J [Wolfson Brain Imaging Centre, University of Cambridge, Cambridge (United Kingdom); Behavioural and Clinical Neurosciences Institute, University of Cambridge, Cambridge (United Kingdom)

2014-07-29

Kinetic modelling in PET requires the arterial input function (AIF), defined as the time-activity curve (TAC) in plasma. This measure is challenging to obtain in mice due to low blood volumes, resulting in a reliance on image-based methods for AIF derivation. We present a comparison of PET- and MR-based region-of-interest (ROI) analysis to obtain image-derived AIFs from the left ventricle (LV) of a mouse model. ROI-based partial volume correction (PVC) was performed to improve quantification.

Combining MRI with PET for partial volume correction improves image-derived input functions in mice

International Nuclear Information System (INIS)

Evans, Eleanor; Buonincontri, Guido; Izquierdo, David; Methner, Carmen; Hawkes, Rob C; Ansorge, Richard E; Kreig, Thomas; Carpenter, T Adrian; Sawiak, Stephen J

2014-01-01

Kinetic modelling in PET requires the arterial input function (AIF), defined as the time-activity curve (TAC) in plasma. This measure is challenging to obtain in mice due to low blood volumes, resulting in a reliance on image-based methods for AIF derivation. We present a comparison of PET- and MR-based region-of-interest (ROI) analysis to obtain image-derived AIFs from the left ventricle (LV) of a mouse model. ROI-based partial volume correction (PVC) was performed to improve quantification.

[Removable partial dentures. Oral functions and types

NARCIS (Netherlands)

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

Beginning partial differential equations

CERN Document Server

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

Seniority-conserving forces and USp(2j+1) partial dynamical symmetry

International Nuclear Information System (INIS)

Rosensteel, G.; Rowe, D.J.

2003-01-01

A quasispin tensor decomposition of the two-nucleon interaction determines the most general seniority-conserving rotationally invariant two-body interaction in a j shell. Such interactions define solvable and partially solvable shell model Hamiltonians for which the unitary symplectic algebra USp(2j+1) provides a complete set of quantum numbers for a subset of states. The matrix elements of seniority-conserving interactions are deduced from the matrix elements of USp(2j+1) operators. A new and powerful numerical technique is presented for computing irreps of the USp(2j+1) algebra. Applications are reported for the low-energy spectra of N=50 and N=126 isotones. The effects of including seniority nonconserving interactions are investigated

Dominating clasp of the financial sector revealed by partial correlation analysis of the stock market.

Science.gov (United States)

Kenett, Dror Y; Tumminello, Michele; Madi, Asaf; Gur-Gershgoren, Gitit; Mantegna, Rosario N; Ben-Jacob, Eshel

2010-12-20

What are the dominant stocks which drive the correlations present among stocks traded in a stock market? Can a correlation analysis provide an answer to this question? In the past, correlation based networks have been proposed as a tool to uncover the underlying backbone of the market. Correlation based networks represent the stocks and their relationships, which are then investigated using different network theory methodologies. Here we introduce a new concept to tackle the above question--the partial correlation network. Partial correlation is a measure of how the correlation between two variables, e.g., stock returns, is affected by a third variable. By using it we define a proxy of stock influence, which is then used to construct partial correlation networks. The empirical part of this study is performed on a specific financial system, namely the set of 300 highly capitalized stocks traded at the New York Stock Exchange, in the time period 2001-2003. By constructing the partial correlation network, unlike the case of standard correlation based networks, we find that stocks belonging to the financial sector and, in particular, to the investment services sub-sector, are the most influential stocks affecting the correlation profile of the system. Using a moving window analysis, we find that the strong influence of the financial stocks is conserved across time for the investigated trading period. Our findings shed a new light on the underlying mechanisms and driving forces controlling the correlation profile observed in a financial market.

[Acrylic resin removable partial dentures

NARCIS (Netherlands)

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

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.

Measurement of Online Student Engagement: Utilization of Continuous Online Student Behavior Indicators as Items in a Partial Credit Rasch Model

Science.gov (United States)

Anderson, Elizabeth

2017-01-01

Student engagement has been shown to be essential to the development of research-based best practices for K-12 education. It has been defined and measured in numerous ways. The purpose of this research study was to develop a measure of online student engagement for grades 3 through 8 using a partial credit Rasch model and validate the measure…

Partial processing

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

The effect of deformation mode on the sensitisation of partially martensitic stainless steels

International Nuclear Information System (INIS)

Briant, C.L.

1981-01-01

The metallurgical process by which austenitic stainless steels become susceptible to corrosion is defined as sensitisation. It is now well established that if the austenite is partially transformed to martensite by deformation, the kinetics of sensitisation will be accelerated. In this paper the effects of martensite induced by various deformation modes on sensitisation are examined. It will be shown that in all cases the martensite accelerates sensitisation which in turn leads to rapid corrosion. This effect is independent of the way the martensite is induced. The results also show that this effect is observed over a wide range of martensite content. (author)

Development of Partial Discharging Simulation Test Equipment

Science.gov (United States)

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.

PARTIAL TRISOMY 4p AND PARTIAL MONOSOMY 13q: CASE REPORT AND A LITERATURE REVIEW.

Science.gov (United States)

Puvabanditsin, S; Herrera-Garcia, G; Gengel, N; Hussein, K; February, M; Mayne, J; Mehta, R

2016-01-01

We report on a term first born dichorionic-diamniotic twin with deletion of the distal long arm of chromosome 13, partial trisomy of the short arm of chromosome 4, intrauterine growth retardation, and multiple anomalies including microcephaly, colpocephaly, absent corpus callosum, bulbous tip of the nose, large and low set ears, macroglossia, thin upper lip, double outlet right ventricle, atria/ventricular septal defect, cleft mitral valve, pulmonary stenosis, single umbilical artery, multicystic dysplastic left kidney, sacral dimple, anterior displacement of anus, simian creases, abnormal thumb (congenital clasped thumb), overlapping toes, and congenital hypothyroidism. This is the first report of a patient with partial trisomy 4p and partial monosomy 13q.

Toxicity and cosmetic outcome of three-dimensional conformal radiotherapy for accelerated partial breast irradiation

International Nuclear Information System (INIS)

Gatti, M.; Bresciani, S.; Ponzone, R.; Panaia, R.; Salatino, A.; Stasi, M.; Gabriele, P.

2011-01-01

Full text of publication follows: Purpose.- To analyse the incidence and severity of acute and late normal tissue toxicity and cosmetic outcome using three - dimensional conformal radiotherapy to deliver accelerated partial breast irradiation. Patients and Methods.- 70 patients with stage I disease were treated with three-dimensional conformal radiotherapy for accelerated partial breast irradiation, in an approved protocol. The prescribed dose was 34 Gy in all patients delivered in 10 fractions over 5 consecutive days. On all CT scans gross tumor volume (GTV ) was defined around surgical clips. A 1.5 cm margin was added in order to account for clinical target volume (CTV) . A margin of 1 cm was added to CTI to define the planning target volume (PTV). The dose-volume constraints were followed in accordance with the specifications as dictated in the NSABP/RTOG protocol. After treatment, patients underwent a clinical and cosmetic evaluation every 3 months. Late toxicity was evaluated according to the RTOG grading schema. The cosmetic assessment was performed by the physicians using the controlateral untreated breast as the reference (Harvard scale). Results.- Median patient age was 66 years (range 51-80). Median follow-up was 15 months (range 6-46). Tumor size was 2 cm in 4(6%). The mean value of the ratio between the PTV and the whole ipsilateral breast volume was 38 % and the median percentage whole breast volume that received 95 % of prescribed dose was 34% (range 16%-55%). The rate of G1 and G2 acute skin toxicity was 28% and 2% respectively and the late toxicity was 17% (G1). G2 or greater toxicities were not observed. The most pronounced G1 late toxicity was subcutaneous fibrosis, developed in 3 patients. The cosmetic outcome was excellent in 83% and good in 17%. Conclusion.- Accelerated partial breast irradiation using three-dimensional conformal radiotherapy is technically feasible with very low acute and late toxicity. Long-term results are needed to assess

Partial Cancellation

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

Robot-assisted partial nephrectomy in contemporary practice

Directory of Open Access Journals (Sweden)

Youssef S. Tanagho

2013-01-01

Full Text Available Laparoscopic renal surgery is associated with reduced blood loss, shorter hospital stay, enhanced cosmesis, and more rapid convalescence relative to open renal surgery. Laparoscopic partial nephrectomy is a minimally invasive, nephron-sparing alternative to laparoscopic radical nephrectomy for the management of small renal masses. While offering similar oncological outcomes to laparoscopic radical nephrectomy, the technical challenges and prolonged learning curve associated with laparoscopic partial nephrectomy limit its wider dissemination. Robot-assisted partial nephrectomy, although still an evolving procedure with no long-term data, has emerged as a viable alternative to laparoscopic partial nephrectomy, with favorable preliminary outcomes. This article provides an overview of the role of robot-assisted partial nephrectomy in the management of renal cell carcinoma. The clinical indications and principles of surgical technique for this procedure are discussed. The oncological, renal functional, and perioperative outcomes of robot-assisted partial nephrectomy are also evaluated, as are complication rates.

Partial molar volumes and partial molar adiabatic compressibilities of a short chain perfluorosurfactant: Sodium heptafluorobutyrate in aqueous solutions at different temperatures

Energy Technology Data Exchange (ETDEWEB)

Blanco, Elena [Group of Biophysics and Interfaces, Department of Applied Physics, Faculty of Physics, University of Santiago de Compostela, E-15782 Santiago de Compostela (Spain); Ruso, Juan M. [Group of Biophysics and Interfaces, Department of Applied Physics, Faculty of Physics, University of Santiago de Compostela, E-15782 Santiago de Compostela (Spain)]. E-mail: faruso@usc.es; Prieto, Gerardo [Group of Biophysics and Interfaces, Department of Applied Physics, Faculty of Physics, University of Santiago de Compostela, E-15782 Santiago de Compostela (Spain); Sarmiento, Felix [Group of Biophysics and Interfaces, Department of Applied Physics, Faculty of Physics, University of Santiago de Compostela, E-15782 Santiago de Compostela (Spain)

2005-12-15

Density and ultrasound measurements of sodium heptafluorobutyrate in aqueous solutions at T = (283.15, 288.15, 293.15, 298.15, 303.15, 308.15, 313.15, 318.15, and 323.15) K have been obtained. From these results partial molar volumes and isentropic partial molar adiabatic compressibilities were calculated. Deviations from the Debye-Hueckel limiting law provide evidence for limited association at lower concentrations. The change of the partial molar volume and isentropic partial molar adiabatic compressibility upon aggregation was calculated. Variations of the change of partial molar volumes and isentropic partial molar adiabatic compressibility upon aggregation are discussed in terms of temperature.

Partial molar volumes and partial molar adiabatic compressibilities of a short chain perfluorosurfactant: Sodium heptafluorobutyrate in aqueous solutions at different temperatures

International Nuclear Information System (INIS)

Blanco, Elena; Ruso, Juan M.; Prieto, Gerardo; Sarmiento, Felix

2005-01-01

Density and ultrasound measurements of sodium heptafluorobutyrate in aqueous solutions at T = (283.15, 288.15, 293.15, 298.15, 303.15, 308.15, 313.15, 318.15, and 323.15) K have been obtained. From these results partial molar volumes and isentropic partial molar adiabatic compressibilities were calculated. Deviations from the Debye-Hueckel limiting law provide evidence for limited association at lower concentrations. The change of the partial molar volume and isentropic partial molar adiabatic compressibility upon aggregation was calculated. Variations of the change of partial molar volumes and isentropic partial molar adiabatic compressibility upon aggregation are discussed in terms of temperature

Partial vaginismus : definition, symptoms and treatment

OpenAIRE

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

Abstract methods in partial differential equations

CERN Document Server

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.

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

Conductivity Evolution of Fracture Proppant in Partial Monolayers and Multilayers

Science.gov (United States)

Fan, M.; Han, Y.; McClure, J. E.; Chen, C.

2017-12-01

Proppant is a granular material, typically sand, coated sand, or man-made ceramic materials, which is widely used in hydraulic fracturing to keep the induced fractures open. Optimization of proppant placement in a hydraulic fracture, as well as its role on the fracture's conductivity, is vital for effective and economical production of petroleum hydrocarbons. In this research, a numerical modeling approach, combining Discrete Element Method (DEM) with lattice Boltzmann (LB) method, was adopted to advance the understanding of fracture conductivity as function of proppant concentration under various effective stresses. DEM was used to simulate effective stress increase and the resultant proppant particle compaction and rearrangement during the process of reservoir depletion due to hydrocarbon extraction. DEM-simulated pore structure was extracted and imported into the LB simulator as boundary conditions to calculate the time-dependent permeability of the proppant pack. We first validated the DEM-LB coupling workflow; the simulated proppant pack permeabilities as functions of effective stress were in good agreement with laboratory measurements. Next, several proppant packs were generated with various proppant concentrations, ranging from partial-monolayer to multilayer structures. Proppant concentration is defined as proppant mass per unit fracture face area. Fracture conductivity as function of proppant concentration was measured in LB simulations. It was found that a partial-monolayer proppant pack with large-diameter particles was optimal in maintaining sufficient conductivity while lowering production costs. Three proppant packs with the same average diameter but different diameter distributions were generated. Specifically, we used the coefficient of variation (COV) of diameter, defined as the ratio of standard deviation of diameter to mean diameter, to characterize the heterogeneity in particle size. We obtained proppant pack porosity, permeability, and fracture

Can play be defined?

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

Partial differential equations of mathematical physics

CERN Document Server

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

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

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.

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.

Defining Documentary Film

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

Partial rectangular metric spaces and fixed point theorems.

Science.gov (United States)

Shukla, Satish

2014-01-01

The purpose of this paper is to introduce the concept of partial rectangular metric spaces as a generalization of rectangular metric and partial metric spaces. Some properties of partial rectangular metric spaces and some fixed point results for quasitype contraction in partial rectangular metric spaces are proved. Some examples are given to illustrate the observed results.

Flood Frequency Analysis For Partial Duration Series In Ganjiang River Basin

Science.gov (United States)

zhangli, Sun; xiufang, Zhu; yaozhong, Pan

2016-04-01

Accurate estimation of flood frequency is key to effective, nationwide flood damage abatement programs. The partial duration series (PDS) method is widely used in hydrologic studies because it considers all events above a certain threshold level as compared to the annual maximum series (AMS) method, which considers only the annual maximum value. However, the PDS has a drawback in that it is difficult to define the thresholds and maintain an independent and identical distribution of the partial duration time series; this drawback is discussed in this paper. The Ganjiang River is the seventh largest tributary of the Yangtze River, the longest river in China. The Ganjiang River covers a drainage area of 81,258 km2 at the Wanzhou hydrologic station as the basin outlet. In this work, 56 years of daily flow data (1954-2009) from the Wanzhou station were used to analyze flood frequency, and the Pearson-III model was employed as the hydrologic probability distribution. Generally, three tasks were accomplished: (1) the threshold of PDS by percentile rank of daily runoff was obtained; (2) trend analysis of the flow series was conducted using PDS; and (3) flood frequency analysis was conducted for partial duration flow series. The results showed a slight upward trend of the annual runoff in the Ganjiang River basin. The maximum flow with a 0.01 exceedance probability (corresponding to a 100-year flood peak under stationary conditions) was 20,000 m3/s, while that with a 0.1 exceedance probability was 15,000 m3/s. These results will serve as a guide to hydrological engineering planning, design, and management for policymakers and decision makers associated with hydrology.

Exact Partial Information Decompositions for Gaussian Systems Based on Dependency Constraints

Directory of Open Access Journals (Sweden)

Jim W. Kay

2018-03-01

Full Text Available The Partial Information Decomposition, introduced by Williams P. L. et al. (2010, provides a theoretical framework to characterize and quantify the structure of multivariate information sharing. A new method ( I dep has recently been proposed by James R. G. et al. (2017 for computing a two-predictor partial information decomposition over discrete spaces. A lattice of maximum entropy probability models is constructed based on marginal dependency constraints, and the unique information that a particular predictor has about the target is defined as the minimum increase in joint predictor-target mutual information when that particular predictor-target marginal dependency is constrained. Here, we apply the I dep approach to Gaussian systems, for which the marginally constrained maximum entropy models are Gaussian graphical models. Closed form solutions for the I dep PID are derived for both univariate and multivariate Gaussian systems. Numerical and graphical illustrations are provided, together with practical and theoretical comparisons of the I dep PID with the minimum mutual information partial information decomposition ( I mmi , which was discussed by Barrett A. B. (2015. The results obtained using I dep appear to be more intuitive than those given with other methods, such as I mmi , in which the redundant and unique information components are constrained to depend only on the predictor-target marginal distributions. In particular, it is proved that the I mmi method generally produces larger estimates of redundancy and synergy than does the I dep method. In discussion of the practical examples, the PIDs are complemented by the use of tests of deviance for the comparison of Gaussian graphical models.

Through-flow analysis of steam turbines operating under partial admission

International Nuclear Information System (INIS)

Delabriere, H.; Werthe, J.M.

1993-05-01

In order to produce electric energy with improved efficiency, Electricite de France has to check the performances of equipment proposed by manufacturers. In the specific field of steam turbines, one of the main tools of analysis is the quasi 3D through flow computer code CAPTUR, which enables the calculation of all the aerothermodynamic parameters in a steam turbine. The last development that has been performed on CAPTUR is the extension to a calculation of a flow within a turbine operating under partial admission. For such turbines, it is now possible to calculate an internal flow field, and determine the efficiency, in a much more accurate way than with previous methods, which consist in an arbitrary efficiency correction on an averaged 1D flow calculation. From the aerodynamic point of view, partial admission involves specific losses in the first stage, then expansion and turbulent mixing just downstream of the first stage. Losses in the first stage are of very different types: windage, pumping and expansion at the ends of an admission sector. Their values have been estimated, with help of experimental results, and then expressed as a slow down coefficient applied to the relative velocity at the blade outlet. As for the flow downstream the first stage, a computational analysis has been made with specific 2D and 3D codes. It has led to define the numerical treatment established in the CAPTUR code. Some problems had to be solved to make compatible a quasi 3D formulation, making an average in the azimutal direction and using a streamline curvature method, with an absolute 3D phenomenon. Certain limitations of the working conditions were first adopted, but a generalization is on hand. The calculation of a nuclear HP steam turbine operating under partial admission has been performed. Calculation results are in good accordance with tests results, especially as regards the expansion line along the stages. The code CAPTUR will be particularly useful for the calculation

Meta-analysis of the risk of gastric stump cancer: detection of high risk patient subsets for stomach cancer after remote partial gastrectomy for benign conditions

NARCIS (Netherlands)

Tersmette, A. C.; Offerhaus, G. J.; Tersmette, K. W.; Giardiello, F. M.; Moore, G. W.; Tytgat, G. N.; Vandenbroucke, J. P.

1990-01-01

Controversy about gastric cancer risk after partial gastrectomy exists, especially in the United States. Therefore, we performed a meta-analysis to determine overall relative risk and weighted mean relative risk for subsets of postgastrectomy patients, define possible high risk patients suitable for

Numerical Analysis of Partial Differential Equations

CERN Document Server

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

Characterization, scaling, and partial representation of diffuse and discrete input junctions to CA3 hippocampus.

Science.gov (United States)

Ascarrunz, F G; Kisley, M A; Flach, K A; Hamilton, R W; MacGregor, R J

1995-07-01

This paper applies a general mathematical system for characterizing and scaling functional connectivity and information flow across the diffuse (EC) and discrete (DG) input junctions to the CA3 hippocampus. Both gross connectivity and coordinated multiunit informational firing patterns are quantitatively characterized in terms of 32 defining parameters interrelated by 17 equations, and then scaled down according to rules for uniformly proportional scaling and for partial representation. The diffuse EC-CA3 junction is shown to be uniformly scalable with realistic representation of both essential spatiotemporal cooperativity and coordinated firing patterns down to populations of a few hundred neurons. Scaling of the discrete DG-CA3 junction can be effected with a two-step process, which necessarily deviates from uniform proportionality but nonetheless produces a valuable and readily interpretable reduced model, also utilizing a few hundred neurons in the receiving population. Partial representation produces a reduced model of only a portion of the full network where each model neuron corresponds directly to a biological neuron. The mathematical analysis illustrated here shows that although omissions and distortions are inescapable in such an application, satisfactorily complete and accurate models the size of pattern modules are possible. Finally, the mathematical characterization of these junctions generates a theory which sees the DG as a definer of the fine structure of embedded traces in the hippocampus and entire coordinated patterns of sequences of 14-cell links in CA3 as triggered by the firing of sequences of individual neurons in DG.

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 ρ

Defining Quantum Control Flow

OpenAIRE

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

Characteristics of a Circular Logic and Its Treatment

International Nuclear Information System (INIS)

Lim, Ho-Gon; Han, Sang-Hoon; Yang, Joon Eon

2007-01-01

A circular logic or a logical loop is defined as the infinite circulation of supporting relations due to their mutual dependencies among the systems in the Fault Tree Analysis (FTA). While many methods to break the circular logic have been developed and used in the fault tree quantification codes, the general solution for a circular logic and its breaking methods are not generally known as yet. This paper presents an analytic solution for circular logics in which the systems are linearly interrelated with each other. Then, a general treatment of circular logics is discussed. To formulate the analytic solution, the relations among systems in the fault tree structure are described by the Boolean equations. The solution is, then, obtained from the successive substitutions of the Boolean equations, which is equivalent to the attaching processes of interrelated system's fault tree to a given fault tree. The solution for three interrelated systems and their independent fault tree structures are given as an example

Pre-quantum mechanics. Introduction to models with hidden variables

International Nuclear Information System (INIS)

Grea, J.

1976-01-01

Within the context of formalism of hidden variable type, the author considers the models used to describe mechanical systems before the introduction of the quantum model. An account is given of the characteristics of the theoretical models and their relationships with experimental methodology. The models of analytical, pre-ergodic, stochastic and thermodynamic mechanics are studied in succession. At each stage the physical hypothesis is enunciated by postulate corresponding to the type of description of the reality of the model. Starting from this postulate, the physical propositions which are meaningful for the model under consideration are defined and their logical structure is indicated. It is then found that on passing from one level of description to another, one can obtain successively Boolean lattices embedded in lattices of continuous geometric type, which are themselves embedded in Boolean lattices. It is therefore possible to envisage a more detailed description than that given by the quantum lattice and to construct it by analogy. (Auth.)

In vitro investigation of marginal accuracy of implant-supported screw-retained partial dentures.

Science.gov (United States)

Koke, U; Wolf, A; Lenz, P; Gilde, H

2004-05-01

Mismatch occurring during the fabrication of implant-supported dentures may induce stress to the peri-implant bone. The purpose of this study was to investigate the influence of two different alloys and the fabrication method on the marginal accuracy of cast partial dentures. Two laboratory implants were bonded into an aluminium block so that the distance between their longitudinal axes was 21 mm. Frameworks designed for screw-retained partial dentures were cast either with pure titanium (rematitan) or with a CoCr-alloy (remanium CD). Two groups of 10 frameworks were cast in a single piece. The first group was made of pure titanium, and the second group of a CoCr-alloy (remanium CD). A third group of 10 was cast in two pieces and then laser-welded onto a soldering model. This latter group was also made of the CoCr-alloy. All the frameworks were screwed to the original model with defined torque. Using light microscopy, marginal accuracy was determined by measuring vertical gaps at eight defined points around each implant. Titanium frameworks cast in a single piece demonstrated mean vertical gaps of 40 microm (s.d. = 11 microm) compared with 72 microm (s.d. = 40 microm) for CoCr-frameworks. These differences were not significant (U-test, P = 0.124) because of a considerable variation of the values for CoCr-frameworks (minimum: 8 microm and maximum: 216 microm). However, frameworks cast in two pieces and mated with a laser showed significantly better accuracy in comparison with the other experimental groups (mean: 17 microm +/- 6; P laser welding. Manufacturing the framework pieces separately and then welding them together provides the best marginal fit.

On quasistability of a vector combinatorial problem with \\Sigma-MINMAX and \\Sigma-MINMIN partial criteria

Directory of Open Access Journals (Sweden)

Vladimir A. Emelichev

2004-06-01

Full Text Available We consider one type of stability (quasistability of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem with non-linear partial criteria is in focus. Two necessary and sufficient conditions for stability of this problem are proved. Mathematics Subject Classification: 2000, 90C10, 90C05, 90C29, 90C31

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

On Degenerate Partial Differential Equations

OpenAIRE

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

Introduction to partial differential equations

CERN Document Server

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.

The Electron Temperature of a Partially Ionized Gas in an Electric Field

Energy Technology Data Exchange (ETDEWEB)

Robben, F

1968-03-15

The electron temperature of a partially ionized gas in an electric field can be determined by the collision rate for momentum transfer and the collision rate for energy transfer. Mean values of these rates are defined such that a simple expression for the electron temperature is obtained, and which depends, among other things, on the ratio of these mean rates. This ratio is calculated in the Lorentz approximation for power law cross sections, and also as a function of the degree of ionization for a helium plasma. It is pointed out that the complete results of refined transport theory can be used in calculating electron mobility and electron temperature in a multicomponent plasma without undue difficulty.

The Electron Temperature of a Partially Ionized Gas in an Electric Field

International Nuclear Information System (INIS)

Robben, F.

1968-03-01

The electron temperature of a partially ionized gas in an electric field can be determined by the collision rate for momentum transfer and the collision rate for energy transfer. Mean values of these rates are defined such that a simple expression for the electron temperature is obtained, and which depends, among other things, on the ratio of these mean rates. This ratio is calculated in the Lorentz approximation for power law cross sections, and also as a function of the degree of ionization for a helium plasma. It is pointed out that the complete results of refined transport theory can be used in calculating electron mobility and electron temperature in a multicomponent plasma without undue difficulty

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.

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

Science.gov (United States)

Caglar, Mehmet Umut; Pal, Ranadip

2011-03-01

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

Economical analysis of the second partial reload for Angra 1 with partial low-leakage

International Nuclear Information System (INIS)

Mascarenhas, H.A.; Teixeira, M.C.C.; Dias, A.M.

1990-01-01

Preliminary results for the Angra 1 second reload design with partial low-leakage were assessed with NUCOST 1.0, code for nuclear power costs calculation. In the proposed scheme, some partially burned fuel assemblies (FAs) are located at the core boundary, while new FAs occupy more internal positions. The nuclear design - utilizing the code system SAV (from Siemens/KWU Group, F.R. Germany) - has been performed with detail for the 3rd cycle while simpler approach has been utilized for subsequent reloads. Results of NUCOST 1.0 show that the partial low-leakage reload in the 3rd cycle of Angra 1 offers fuel costs 1% lower when compared to the Plant's actual reload scheme, what corresponds to an savings of about US$190.000. When operation and maintenance and capital costs are also considered, economies in the order of US$2.6 million are obrained. (author) [pt

Influence of diesel engine combustion on the rupture strength of partially stabilized zirconia

International Nuclear Information System (INIS)

Brinkman, C.R.; Begun, G.M.; Cavin, O.B.; Foster, B.E.; Graves, R.L.; Kahl, W.K.; Liu, K.C.; Simpson, W.A.

1989-01-01

Results are reported for tests on partially stabilized zirconia (PSZ-TS and MS grade) bars exposed in the combustion chambers of two operating single-cylinder 0.825-L diesel engines. Specifics of test conditions and procedures are presented. Subsequent to exposure, the bars were subjected to four-point bending and the rupture strengths determined. The TS grade showed a decrease in average strength of 32%, while the strength of the MS grade decreased by about 9% in comparison to average behavior of unaged material. Results of X-ray diffraction analysis, Raman spectroscopy, isothermal aging studies, and ceramographic characterization are given to define reasons for material degradation

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

Arthroscopic Partial Repair of Irreparable Rotator Cuff Tears: Preoperative Factors Associated With Outcome Deterioration Over 2 Years.

Science.gov (United States)

Shon, Min Soo; Koh, Kyoung Hwan; Lim, Tae Kang; Kim, Won Ju; Kim, Kyung Cheon; Yoo, Jae Chul

2015-08-01

Arthroscopic partial repair is a treatment option in irreparable large-to-massive rotator cuff tears without arthritic changes. However, there are indications that arthroscopic partial repair does not yield satisfactory outcomes. To report the clinical and radiographic results of arthroscopic partial repairs in patients with irreparable large-to-massive cuff tears. In addition, an analysis was performed regarding preoperative factors that may influence patient outcomes and patient-rated satisfaction over time. Case series; Level of evidence, 4. From 2005 to 2011, a total of 31 patients who underwent arthroscopic partial repair for irreparable large-to-massive cuff tears were retrospectively evaluated. Partial repair was defined as posterior cuff tissue repair with or without subscapularis tendon repair to restore the transverse force couple of the cuff. Pain visual analog scale (PVAS), questionnaire results (American Shoulder and Elbow Surgeons [ASES] and Simple Shoulder Test [SST]), and radiographic changes (acromiohumeral distance and degenerative change) were assessed preoperatively, at first follow-up (roughly 1 year postoperatively), and at final follow-up (>2 years postoperatively). Patients rated their satisfaction level at each postoperative follow-up as well. Preoperative factors that might influence outcomes, such as patient demographics, tear size, and fatty infiltration, were investigated. The preoperative, first follow-up, and final follow-up results for mean PVAS (5.13, 2.13, and 3.16, respectively) and questionnaires (ASES: 41.97, 76.37, and 73.78; SST: 3.61, 6.33, and 6.07, respectively) improved significantly (all P .05) from the first to the final follow-up. Among preoperative factors, fatty infiltration of the teres minor was identified as the only statistically significant factor affecting patient-rated satisfaction (P = .007). This study showed that arthroscopic partial repair may produce initial improvement in selected outcomes at 2-year

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 transposition on bi-partite system

OpenAIRE

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

Simulation of consolidation in partially saturated soil materials

International Nuclear Information System (INIS)

Narasimhan, T.N.

1982-03-01

Partially saturated soil materials undergo consolidation, heave, collapse and failure due to changes in pore fluid pressure. The precise nature of the mechanics of such deformations is only poorly understood at present. Experimental evidence has shown that the volume change behavior of unsaturated soils cannot be adequately explained through changes in effective stress, even when a saturation dependent parameter is incorporated into the definition of effective stress. Two independent stress-state variables, involving combinations of total stress, pore air pressure and pore water pressure, are required to characterize volume changes and saturation changes in the partially saturated state. In general, two coupled conservation equations, one for the water-phase and the other for the air-phase need to be solved in order to predict the deformation behavior of unsaturated soils. If directional displacements and changes in the stress-field are required, then the conservation equations are to be integrated with an additional set of multi-dimensional force balance equations. For lack of a sufficient understanding of elastic constants such as Poisson's Ratio and Lame's constants as applied to unsaturated soils, little has been achieved so far in integrating the conservation equations and the force balance equations. For the long-term modeling of consolidation with respect to uranium mill tailings, it may be acceptable and economical to solve a single conservation equation for water, assuming that the air-phase is continuous and is at atmospheric pressure everywhere in the soil. The greatest challenge to modeling consolidation in the unsaturated zone at the presnt time is to develop enough experimental data defining the variation of void ratio and saturation with reference to the two chosen stress-state variables

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

Science.gov (United States)

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

2017-09-19

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

Two cases of partial trisomy 4p and partial trisomy 14q.

Science.gov (United States)

Kim, Yeo-Hyang; Kim, Heung-Sik; Ryoo, Nam-Hee; Ha, Jung-Sook

2013-01-01

We present clinical and cytogenetic data on 2 cases of partial trisomy 4p and partial trisomy 14q. Both patients had an extra der(14)t(4;14)(p15.31;q12) chromosome due to a 3:1 segregation from a balanced translocation carrier mother. Array analyses indicated that their chromosomal breakpoints were similar, but there was no relationship between the 2 families. Both patients showed prominent growth retardation and psychomotor developmental delay. Other phenotypic manifestations were generally mild and variable; for example, patient 1 had a short palpebral fissure and low-set ears whereas patient 2 had a round face, asymmetric eyes, small ears, a short neck, finger/toe abnormalities, and behavioral problems.

Prospective study of robotic partial nephrectomy for renal cancer in Japan: Comparison with a historical control undergoing laparoscopic partial nephrectomy.

Science.gov (United States)

Tanaka, Kazushi; Teishima, Jun; Takenaka, Atsushi; Shiroki, Ryoichi; Kobayashi, Yasuyuki; Hattori, Kazunori; Kanayama, Hiro-Omi; Horie, Shigeo; Yoshino, Yasushi; Fujisawa, Masato

2018-05-01

To evaluate the outcomes of robotic partial nephrectomy compared with those of laparoscopic partial nephrectomy for T1 renal tumors in Japanese centers. Patients with a T1 renal tumor who underwent robotic partial nephrectomy were eligible for inclusion in the present study. The primary end-point consisted of three components: a negative surgical margin, no conversion to open or laparoscopic surgery and a warm ischemia time ≤25 min. We compared data from these patients with the data from a retrospective study of laparoscopic partial nephrectomy carried out in Japan. A total of 108 patients were registered in the present study; 105 underwent robotic partial nephrectomy. The proportion of patients who met the primary end-point was 91.3% (95% confidence interval 84.1-95.9%), which was significantly higher than 23.3% in the historical data. Major complications were seen in 19 patients (18.1%). The mean change in the estimated glomerular filtration rate in the operated kidney, 180 days postoperatively, was -10.8 mL/min/1.73 m 2 (95% confidence interval -12.3-9.4%). Robotic partial nephrectomy for patients with a T1 renal tumor is a safe, feasible and more effective operative method compared with laparoscopic partial nephrectomy. It can be anticipated that robotic partial nephrectomy will become more widely used in Japan in the future. © 2018 The Japanese Urological Association.

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

Coordinating choice in partial cooperative equilibrium

NARCIS (Netherlands)

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

[Removable partial dentures. Oral functions and types

OpenAIRE

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 REINFORCEMENT (ACQUISITION) EFFECTS WITHIN SUBJECTS.

Science.gov (United States)

AMSEL, A; MACKINNON, J R; RASHOTTE, M E; SURRIDGE, C T

1964-03-01

Acquisition performance of 22 rats in a straight alley runway was examined. The animals were subjected to partial reinforcement when the alley was black (B+/-) and continuous reinforcement when it was white (W+). The results indicated (a) higher terminal performance, for partial as against continuous reinforcement conditions, for starting-time and running-time measures, and (b) lower terminal performance under partial conditions for a goal-entry-time measure. These results confirm within subjects an effect previously demonstrated, in the runway, only in between-groups tests, where one group is run under partial reinforcement and a separate group is run under continuous reinforcement in the presence of the same external stimuli. Differences between the runway situation, employing a discrete-trial procedure and performance measures at three points in the response chain, and the Skinner box situation, used in its free-operant mode with a single performance measure, are discussed in relation to the present findings.

Clustering stocks using partial correlation coefficients

Science.gov (United States)

Jung, Sean S.; Chang, Woojin

2016-11-01

A partial correlation analysis is performed on the Korean stock market (KOSPI). The difference between Pearson correlation and the partial correlation is analyzed and it is found that when conditioned on the market return, Pearson correlation coefficients are generally greater than those of the partial correlation, which implies that the market return tends to drive up the correlation between stock returns. A clustering analysis is then performed to study the market structure given by the partial correlation analysis and the members of the clusters are compared with the Global Industry Classification Standard (GICS). The initial hypothesis is that the firms in the same GICS sector are clustered together since they are in a similar business and environment. However, the result is inconsistent with the hypothesis and most clusters are a mix of multiple sectors suggesting that the traditional approach of using sectors to determine the proximity between stocks may not be sufficient enough to diversify a portfolio.

Performance of RC columns with partial length corrosion

International Nuclear Information System (INIS)

Wang Xiaohui; Liang Fayun

2008-01-01

Experimental and analytical studies on the load capacity of reinforced concrete (RC) columns with partial length corrosion are presented, where only a fraction of the column length was corroded. Twelve simply supported columns were eccentrically loaded. The primary variables were partial length corrosion in tensile or compressive zone and the corrosion level within this length. The failure of the corroded column occurs in the partial length, mainly developed from or located nearby or merged with the longitudinal corrosion cracks. For RC column with large eccentricity, load capacity of the column is mainly influenced by the partial length corrosion in tensile zone; while for RC column with small eccentricity, load capacity of the column greatly decreases due to the partial length corrosion in compressive zone. The destruction of the longitudinally mechanical integrality of the column in the partial length leads to this great reduction of the load capacity of the RC column

Multidisciplinary approach to restoring anterior maxillary partial edentulous area using an IPS Empress 2 fixed partial denture: a clinical report.

Science.gov (United States)

Dundar, Mine; Gungor, M Ali; Cal, Ebru

2003-04-01

Esthetics is a major concern during restoration of anterior partial edentulous areas. All-ceramic fixed partial dentures may provide better esthetics and biocompatibility in the restoration of anterior teeth. This clinic report describes a multidisciplinary approach and treatment procedures with an IPS Empress 2 fixed partial denture to restore missing anterior teeth.

Prevention of Postoperative Bile Leak in Partial Cystectomy for Hydatid Liver Disease: Tricks of the Trade.

Science.gov (United States)

Peker, Kivanc Derya; Gumusoglu, Alpen Yahya; Seyit, Hakan; Kabuli, Hamit Ahmet; Salik, Aysun Erbahceci; Gonenc, Murat; Kapan, Selin; Alis, Halil

2015-12-01

The presence of postoperative bile leak is the major outcome measure for the assessment of operative success in partial cystectomy for hydatid liver disease. However, the optimal operative strategy to reduce the postoperative bile leak rate is yet to be defined. Medical records of patients who underwent partial cystectomy for hydatid liver disease between January 2013 and January 2015 were reviewed in this retrospective analysis. All patients were managed with a specific operative protocol. The primary outcome measure was the rate of persistent postoperative bile leak. The secondary outcome measures were the morbidity and mortality rate, and the length of hospital stay. Twenty-eight patients were included in the study. Only one patient (3.6 %) developed persistent postoperative bile leak. The overall morbidity and mortality rate was 17.8 and 0 %, respectively. The median length of hospital stay was 5 days. Aggressive preventative surgical measures have led to low persistent bile leak rates with low morbidity and mortality.

Barrelet zeros and elastic π+p partial waves

International Nuclear Information System (INIS)

Chew, D.M.; Urban, M.

1976-06-01

A procedure is proposed for constructing low-order partial-wave amplitudes from a knowledge of Barrelet zeros near the physical region. The method is applied to the zeros already obtained for elastic π + p scattering data between 1.2 and 2.2 GeV cm energies. The partial waves emerge with errors that are straight-forwardly related to the accuracy of the data and satisfy unitarity without any constraint being imposed. There are significant differences from the partial waves obtained by other methods; this can be partially explained by the fact that no previous partial-wave analysis has been able to solve the discrete ambiguity. The cost of the analysis is much less

Series expansion solutions for the multi-term time and space fractional partial differential equations in two- and three-dimensions

Science.gov (United States)

Ye, H.; Liu, F.; Turner, I.; Anh, V.; Burrage, K.

2013-09-01

Fractional partial differential equations with more than one fractional derivative in time describe some important physical phenomena, such as the telegraph equation, the power law wave equation, or the Szabo wave equation. In this paper, we consider two- and three-dimensional multi-term time and space fractional partial differential equations. The multi-term time-fractional derivative is defined in the Caputo sense, whose order belongs to the interval (1,2],(2,3],(3,4] or (0, m], and the space-fractional derivative is referred to as the fractional Laplacian form. We derive series expansion solutions based on a spectral representation of the Laplacian operator on a bounded region. Some applications are given for the two- and three-dimensional telegraph equation, power law wave equation and Szabo wave equation.

An XFEM Model for Hydraulic Fracturing in Partially Saturated Rocks

Directory of Open Access Journals (Sweden)

Salimzadeh Saeed

2016-01-01

Full Text Available Hydraulic fracturing is a complex multi-physics phenomenon. Numerous analytical and numerical models of hydraulic fracturing processes have been proposed. Analytical solutions commonly are able to model the growth of a single hydraulic fracture into an initially intact, homogeneous rock mass. Numerical models are able to analyse complex problems such as multiple hydraulic fractures and fracturing in heterogeneous media. However, majority of available models are restricted to single-phase flow through fracture and permeable porous rock. This is not compatible with actual field conditions where the injected fluid does not have similar properties as the host fluid. In this study we present a fully coupled hydro-poroelastic model which incorporates two fluids i.e. fracturing fluid and host fluid. Flow through fracture is defined based on lubrication assumption, while flow through matrix is defined as Darcy flow. The fracture discontinuity in the mechanical model is captured using eXtended Finite Element Method (XFEM while the fracture propagation criterion is defined through cohesive fracture model. The discontinuous matrix fluid velocity across fracture is modelled using leak-off loading which couples fracture flow and matrix flow. The proposed model has been discretised using standard Galerkin method, implemented in Matlab and verified against several published solutions. Multiple hydraulic fracturing simulations are performed to show the model robustness and to illustrate how problem parameters such as injection rate and rock permeability affect the hydraulic fracturing variables i.e. injection pressure, fracture aperture and fracture length. The results show the impact of partial saturation on leak-off and the fact that single-phase models may underestimate the leak-off.

Partial volume effect in MRI

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

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

Complex partial seizure, disruptive behaviours and the Nigerian ...

African Journals Online (AJOL)

Background: Complex partial seizure is an epileptic seizure which results in impairment of responsiveness or awareness such as altered level of consciousness. Complex partial seizures are often preceded by an aura such as depersonalization, feelings of de javu, jamais vu and fear. The ictal phase of complex partial ...

Pointwise Partial Information Decomposition Using the Specificity and Ambiguity Lattices

Science.gov (United States)

Finn, Conor; Lizier, Joseph

2018-04-01

What are the distinct ways in which a set of predictor variables can provide information about a target variable? When does a variable provide unique information, when do variables share redundant information, and when do variables combine synergistically to provide complementary information? The redundancy lattice from the partial information decomposition of Williams and Beer provided a promising glimpse at the answer to these questions. However, this structure was constructed using a much criticised measure of redundant information, and despite sustained research, no completely satisfactory replacement measure has been proposed. In this paper, we take a different approach, applying the axiomatic derivation of the redundancy lattice to a single realisation from a set of discrete variables. To overcome the difficulty associated with signed pointwise mutual information, we apply this decomposition separately to the unsigned entropic components of pointwise mutual information which we refer to as the specificity and ambiguity. This yields a separate redundancy lattice for each component. Then based upon an operational interpretation of redundancy, we define measures of redundant specificity and ambiguity enabling us to evaluate the partial information atoms in each lattice. These atoms can be recombined to yield the sought-after multivariate information decomposition. We apply this framework to canonical examples from the literature and discuss the results and the various properties of the decomposition. In particular, the pointwise decomposition using specificity and ambiguity satisfies a chain rule over target variables, which provides new insights into the so-called two-bit-copy example.

Simulation assessment of continuous simulating moving bed chromatography process with partial feed and new strategy with partial feed

Directory of Open Access Journals (Sweden)

H. Khan

2009-09-01

Full Text Available Partial Feed simulating moving bed (SMB has proved to be more efficient in binary separation performance (purity, recovery, productivity because of its two additional degrees of freedom, namely feed length and feed time, as compared to classical SMB process. The binary separation of dextran T6 and fructose with linear isotherm is modeled with Aspen Chromatography simulator in a four zone SMB with one column per zone for both normal-feed and Partial Feed. Increase in number of feed length and feed time in the cycle plays a very important role in the separation performance with Partial Feed. In addition, the effect of mode of operation (early or late introduction of increase in number of feed length in the cycle on product purity and recovery is also investigated. Furthermore, the binary separation system is designed with the safety margin method and the optimum operating parameters for simulation are calculated with triangle theory. Finally, a new strategy with Partial Feed is developed, showing improved separation performance relative to the basic four-zone SMB with regard to extract stream purity and recovery. The results of the proposed study can served as a useful summary of Partial Feed operation.

Salt bridge as a gatekeeper against partial unfolding.

Science.gov (United States)

Hinzman, Mark W; Essex, Morgan E; Park, Chiwook

2016-05-01

Salt bridges are frequently observed in protein structures. Because the energetic contribution of salt bridges is strongly dependent on the environmental context, salt bridges are believed to contribute to the structural specificity rather than the stability. To test the role of salt bridges in enhancing structural specificity, we investigated the contribution of a salt bridge to the energetics of native-state partial unfolding in a cysteine-free version of Escherichia coli ribonuclease H (RNase H*). Thermolysin cleaves a protruding loop of RNase H(*) through transient partial unfolding under native conditions. Lys86 and Asp108 in RNase H(*) form a partially buried salt bridge that tethers the protruding loop. Investigation of the global stability of K86Q/D108N RNase H(*) showed that the salt bridge does not significantly contribute to the global stability. However, K86Q/D108N RNase H(*) is greatly more susceptible to proteolysis by thermolysin than wild-type RNase H(*) is. The free energy for partial unfolding determined by native-state proteolysis indicates that the salt bridge significantly increases the energy for partial unfolding by destabilizing the partially unfolded form. Double mutant cycles with single and double mutations of the salt bridge suggest that the partially unfolded form is destabilized due to a significant decrease in the interaction energy between Lys86 and Asp108 upon partial unfolding. This study demonstrates that, even in the case that a salt bridge does not contribute to the global stability, the salt bridge may function as a gatekeeper against partial unfolding that disturbs the optimal geometry of the salt bridge. © 2016 The Protein Society.

Behavior of corroded bonded partially prestressed concrete beams

Directory of Open Access Journals (Sweden)

Mohamed Moawad

2018-04-01

Full Text Available Prestressed concrete is widely used in the construction industry in buildings. And corrosion of reinforcing steel is one of the most important and prevalent mechanisms of deterioration for concrete structures. Consequently the capacity of post-tension elements decreased after exposure to corrosion. This study presents results of the experimental investigation of the performance and the behavior of partially prestressed beams, with 40 and 80 MPa compressive strength exposed to corrosion. The experimental program of this study consisted of six partially prestressed beams with overall dimensions equal to 150 × 400 × 4500 mm. The variables were considered in terms of concrete compressive strength, and corrosion location effect. The mode of failure, and strain of steel reinforcement, cracking, yield, ultimate load and the corresponding deflection of each beam, and crack width and distribution were recorded. The results showed that the partially prestressed beam with 80 MPa compressive strength has higher resistance to corrosion exposure than that of partially prestressed concrete beam with 40 MPa compressive strength. Not big difference in deterioration against fully/partially corrosion exposure found between partially prestressed beams at the same compressive strength. The most of deterioration incident in partially prestressed beam acts on non prestressed steel reinforcement. Because the bonded tendons are less likely to corrode, cement grout and duct act as a barrier to moisture and chloride penetration, especially plastic duct without splices and connections. The theoretical analysis based on strain compatibility and force equilibrium gave a good prediction of the deformational behavior for high/normal partially prestressed beams. Keywords: Beam, Corrosion, Deterioration, Partially prestressed, High strength concrete

Universal Partial Words over Non-Binary Alphabets

OpenAIRE

Goeckner, Bennet; Groothuis, Corbin; Hettle, Cyrus; Kell, Brian; Kirkpatrick, Pamela; Kirsch, Rachel; Solava, Ryan

2016-01-01

Chen, Kitaev, M\\"{u}tze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character $\\diamond$, which is a placeholder for any letter in the alphabet. We settle and strengthen conjectures posed in the same paper where this notion was introduced. For non-binary alphabets, we show that universal partial words have periodic $\\diamond$ structure and are cyclic, and we give ...

Languages for Software-Defined Networks

Science.gov (United States)

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

Finding small OBDDs for incompletely specified truth tables is hard

DEFF Research Database (Denmark)

Miltersen, Peter Bro; Kristensen, Jesper Torp

2006-01-01

We present an efficient reduction mapping undirected graphs G with n = 2^k vertices for integers k to tables of partially specified Boolean functions g: {0,1}^(4k+1) -> {0,1,*} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary dec...... decision diagram with at most (2m + 2)n^2 + 4n decision nodes. From this it follows that the problem of finding a minimum-sized consistent OBDD for an incompletely specified truth table is NP-hard and also hard to approximate....

When do evolutionary algorithms optimize separable functions in parallel?

DEFF Research Database (Denmark)

Doerr, Benjamin; Sudholt, Dirk; Witt, Carsten

2013-01-01

is that evolutionary algorithms make progress on all subfunctions in parallel, so that optimizing a separable function does not take not much longer than optimizing the hardest subfunction-subfunctions are optimized "in parallel." We show that this is only partially true, already for the simple (1+1) evolutionary...... algorithm ((1+1) EA). For separable functions composed of k Boolean functions indeed the optimization time is the maximum optimization time of these functions times a small O(log k) overhead. More generally, for sums of weighted subfunctions that each attain non-negative integer values less than r = o(log1...

Kinetic and thermodynamic control of butyrate conversion in non-defined methanogenic communities.

Science.gov (United States)

Junicke, H; van Loosdrecht, M C M; Kleerebezem, R

2016-01-01

Many anaerobic conversions proceed close to thermodynamic equilibrium and the microbial groups involved need to share their low energy budget to survive at the thermodynamic boundary of life. This study aimed to investigate the kinetic and thermodynamic control mechanisms of the electron transfer during syntrophic butyrate conversion in non-defined methanogenic communities. Despite the rather low energy content of butyrate, results demonstrate unequal energy sharing between the butyrate-utilizing species (17 %), the hydrogenotrophic methanogens (9-10 %), and the acetoclastic methanogens (73-74 %). As a key finding, the energy disproportion resulted in different growth strategies of the syntrophic partners. Compared to the butyrate-utilizing partner, the hydrogenotrophic methanogens compensated their lower biomass yield per mole of electrons transferred with a 2-fold higher biomass-specific electron transfer rate. Apart from these thermodynamic control mechanisms, experiments revealed a ten times lower hydrogen inhibition constant on butyrate conversion than proposed by the Anaerobic Digestion Model No. 1, suggesting a much stronger inhibitory effect of hydrogen on anaerobic butyrate conversion. At hydrogen partial pressures exceeding 40 Pa and at bicarbonate limited conditions, a shift from methanogenesis to reduced product formation was observed which indicates an important role of the hydrogen partial pressure in redirecting electron fluxes towards reduced products such as butanol. The findings of this study demonstrate that a careful consideration of thermodynamics and kinetics is required to advance our current understanding of flux regulation in energy-limited syntrophic ecosystems.

Toxicity and cosmetic outcome of three-dimensional conformal radiotherapy for accelerated partial breast irradiation

Energy Technology Data Exchange (ETDEWEB)

Gatti, M.; Bresciani, S.; Ponzone, R.; Panaia, R.; Salatino, A.; Stasi, M.; Gabriele, P. [IRCC, Candiolo (Italy)

2011-10-15

Full text of publication follows: Purpose.- To analyse the incidence and severity of acute and late normal tissue toxicity and cosmetic outcome using three - dimensional conformal radiotherapy to deliver accelerated partial breast irradiation. Patients and Methods.- 70 patients with stage I disease were treated with three-dimensional conformal radiotherapy for accelerated partial breast irradiation, in an approved protocol. The prescribed dose was 34 Gy in all patients delivered in 10 fractions over 5 consecutive days. On all CT scans gross tumor volume (GTV ) was defined around surgical clips. A 1.5 cm margin was added in order to account for clinical target volume (CTV) . A margin of 1 cm was added to CTI to define the planning target volume (PTV). The dose-volume constraints were followed in accordance with the specifications as dictated in the NSABP/RTOG protocol. After treatment, patients underwent a clinical and cosmetic evaluation every 3 months. Late toxicity was evaluated according to the RTOG grading schema. The cosmetic assessment was performed by the physicians using the controlateral untreated breast as the reference (Harvard scale). Results.- Median patient age was 66 years (range 51-80). Median follow-up was 15 months (range 6-46). Tumor size was < 10 mm in 33 patients (53%) and > 2 cm in 4(6%). The mean value of the ratio between the PTV and the whole ipsilateral breast volume was 38 % and the median percentage whole breast volume that received 95 % of prescribed dose was 34% (range 16%-55%). The rate of G1 and G2 acute skin toxicity was 28% and 2% respectively and the late toxicity was 17% (G1). G2 or greater toxicities were not observed. The most pronounced G1 late toxicity was subcutaneous fibrosis, developed in 3 patients. The cosmetic outcome was excellent in 83% and good in 17%. Conclusion.- Accelerated partial breast irradiation using three-dimensional conformal radiotherapy is technically feasible with very low acute and late toxicity. Long

Variable Selection via Partial Correlation.

Science.gov (United States)

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.

Does friendship give us non-derivative partial reasons ?

Directory of Open Access Journals (Sweden)

Andrew Reisner

2008-02-01

Full Text Available One way to approach the question of whether there are non-derivative partial reasons of any kind is to give an account of what partial reasons are, and then to consider whether there are such reasons. If there are, then it is at least possible that there are partial reasons of friendship. It is this approach that will be taken here, and it produces several interesting results. The first is a point about the structure of partial reasons. It is at least a necessary condition of a reason’s being partial that it has an explicit relational component. This component, technically, is a relatum in the reason relation that itself is a relation between the person to whom the reason applies and the person whom the action for which there is a reason concerns. The second conclusion of the paper is that this relational component is also required for a number of types of putatively impartial reasons. In order to avoid trivialising the distinction between partial and impartial reasons, some further sufficient condition must be applied. Finally, there is some prospect for a way of distinguishing between impartial reasons that contain a relational component and partial reasons, but that this approach suggests that the question of whether ethics is partial or impartial will be settled at the level of normative ethical discourse, or at least not at the level of discourse about the nature of reasons for action.

Spreading paths in partially observed social networks

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Spreading paths in partially observed social networks.

Science.gov (United States)

Onnela, Jukka-Pekka; Christakis, Nicholas A

2012-03-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

Personality characteristics and their connection with learning efficiency of deaf and partially deaf pupils in mainstream primary and secondary school

OpenAIRE

Kastelic, Helena

2012-01-01

This thesis deals with personality characteristics and their connection with learning efficiency of deaf and partially deaf pupils and students in mainstream primary and secondary school. The theoretical part defines learning efficiency and focuses on the most significant factors of learning efficiency, including also personality characteristics of an individual. This thesis represents the idea of inclusion and its advantages and disadvantages and suggests to what extent it is present in our ...

(Dry) arthroscopic partial wrist arthrodesis: tips and tricks.

Science.gov (United States)

del Piñal, F; Tandioy-Delgado, F

2014-10-01

One of the options for performing a partial wrist arthrodesis is the arthroscopic technique. As a first advantage arthroscopy allows us to directly assess the state of the articular surface of the carpal bones and define the best surgical option during the salvage operation. Furthermore, it allows performance of the procedure with minimal ligament damage and minimal interference with the blood supply of the carpals. These will (presumably) entail less capsular scarring and more rapid healing. Lastly, there is cosmetic benefit by reducing the amount of external scarring. The procedure has a steep learning curve even for accomplished arthroscopists but can be performed in a competitive manner to the open procedure if the dry technique is used. The aim of this paper is to present the technical details, tricks and tips to make the procedure accessible to all hand specialists with an arthroscopic interest. As it is paramount that the surgeon is acquainted with the "dry" technique, some technical details about it will also be presented. © Georg Thieme Verlag KG Stuttgart · New York.

Partially ordered models

NARCIS (Netherlands)

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

Quantification of anaesthetic effects on atrial fibrillation rate by partial least-squares

International Nuclear Information System (INIS)

Cervigón, R; Moreno, J; Pérez-Villacastín, J; Reilly, R B; Castells, F

2012-01-01

The mechanism underlying atrial fibrillation (AF) remains poorly understood. Multiple wandering propagation wavelets drifting through both atria under hierarchical models are not understood. Some pharmacological drugs, known as antiarrhythmics, modify the cardiac ionic currents supporting the fibrillation process within the atria and may modify the AF propagation dynamics terminating the fibrillation process. Other medications, theoretically non-antiarrhythmic, may slightly affect the fibrillation process in non-defined mechanisms. We evaluated whether the most commonly used anaesthetic agent, propofol, affects AF patterns. Partial least-squares (PLS) analysis was performed to reduce significant noise into the main latent variables to find the differences between groups. The final results showed an excellent discrimination between groups with slow atrial activity during the propofol infusion. (paper)

New Generalized Hyperbolic Functions to Find New Exact Solutions of the Nonlinear Partial Differential Equations

Directory of Open Access Journals (Sweden)

Yusuf Pandir

2013-01-01

Full Text Available We firstly give some new functions called generalized hyperbolic functions. By the using of the generalized hyperbolic functions, new kinds of transformations are defined to discover the exact approximate solutions of nonlinear partial differential equations. Based on the generalized hyperbolic function transformation of the generalized KdV equation and the coupled equal width wave equations (CEWE, we find new exact solutions of two equations and analyze the properties of them by taking different parameter values of the generalized hyperbolic functions. We think that these solutions are very important to explain some physical phenomena.

Tumor bed delineation for external beam accelerated partial breast irradiation: A systematic review

International Nuclear Information System (INIS)

Yang, T. Jonathan; Tao, Randa; Elkhuizen, Paula H.M.; Vliet-Vroegindeweij, Corine van; Li, Guang; Powell, Simon N.

2013-01-01

In recent years, accelerated partial breast irradiation (APBI) has been considered an alternative to whole breast irradiation for patients undergoing breast-conserving therapy. APBI delivers higher doses of radiation in fewer fractions to the post-lumpectomy tumor bed with a 1–2 cm margin, targeting the area at the highest risk of local recurrence while sparing normal breast tissue. However, there are inherent challenges in defining accurate target volumes for APBI. Studies have shown that significant interobserver variation exists among radiation oncologists defining the lumpectomy cavity, which raises the question of how to improve the accuracy and consistency in the delineation of tumor bed volumes. The combination of standardized guidelines and surgical clips significantly improves an observer’s ability in delineation, and it is the standard in multiple ongoing external-beam APBI trials. However, questions about the accuracy of the clips to mark the lumpectomy cavity remain, as clips only define a few points at the margin of the cavity. This paper reviews the techniques that have been developed so far to improve target delineation in APBI delivered by conformal external beam radiation therapy, including the use of standardized guidelines, surgical clips or fiducial markers, pre-operative computed tomography imaging, and additional imaging modalities, including magnetic resonance imaging, ultrasound imaging, and positron emission tomography/computed tomography. Alternatives to post-operative APBI, future directions, and clinical recommendations were also discussed

Diseño y simulación de un controlador difuso de temperatura empleando el concresor basado en relaciones booleanas

Directory of Open Access Journals (Sweden)

José Jairo Soriano Méndez

2012-06-01

Full Text Available This paper proposes the analysis and design of a Temperature Fuzzy controller using concresor based on Boolean relations (CBR. Firstly, presents the design of a Boolean controller. Later, fuzzy controller is designed based on Boolean controller raised previously. The control surfaces with and without simplification, show the features of proposes methodology. Additionally we analyze the effects of the simplifications made in the control rules.

Partial differential equations for scientists and engineers

CERN Document Server

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

Evaluation of partial beta-adrenoceptor agonist activity.

Science.gov (United States)

Lipworth, B J; Grove, A

1997-01-01

A partial beta-adrenoceptor (beta-AR) agonist will exhibit opposite agonist and antagonist activity depending on the prevailing degree of adrenergic tone or the presence of a beta-AR agonist with higher intrinsic activity. In vivo partial beta-AR agonist activity will be evident at rest with low endogenous adrenergic tone, as for example with chronotropicity (beta 1/beta 2), inotropicity (beta 1) or peripheral vasodilatation and finger tremor (beta 2). beta-AR blocking drugs which have partial agonist activity may exhibit a better therapeutic profile when used for hypertension because of maintained cardiac output without increased systemic vascular resistance, along with an improved lipid profile. In the presence of raised endogenous adrenergic tone such as exercise or an exogenous full agonist, beta-AR subtype antagonist activity will become evident in terms of effects on exercise induced heart rate (beta 1) and potassium (beta 2) responses. Reduction of exercise heart rate will occur to a lesser degree in the case of a beta-adrenoceptor blocker with partial beta 1-AR agonist activity compared with a beta-adrenoceptor blocker devoid of partial agonist activity. This may result in reduced therapeutic efficacy in the treatment of angina on effort when using beta-AR blocking drugs with partial beta 1-AR agonist activity. Effects on exercise hyperkalaemia are determined by the balance between beta 2-AR partial agonist activity and endogenous adrenergic activity. For predominantly beta 2-AR agonist such as salmeterol and salbutamol, potentiation of exercise hyperkalaemia occurs. For predominantly beta 2-AR antagonists such as carteolol, either potentiation or attenuation of exercise hyperkalaemia occurs at low and high doses respectively. beta 2-AR partial agonist activity may also be expressed as antagonism in the presence of an exogenous full agonist, as for example attenuation of fenoterol induced responses by salmeterol. Studies are required to investigate whether

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)

Laparoscopic Partial Nephrectomy With Potassium-titanyl-phosphate Laser Versus Conventional Laparoscopic Partial Nephrectomy: An Animal Randomized Controlled Trial

NARCIS (Netherlands)

Rioja, Jorge; Morcillo, Esther; Novalbos, José P.; Sánchez-Hurtado, Miguel A.; Soria, Federico; Pérez-Duarte, Francisco; Díaz-Güemes Martín-Portugüés, Idoia; Laguna, Maria Pilar; Sánchez-Margallo, Francisco Miguel; Rodríguez-Rubio Cortadellas, Federico

2017-01-01

OBJECTIVE To explore the feasibility, safety, and short-term results of potassium-titanyl-phosphate (KTP) laser laparoscopic partial nephrectomy (KTP-LPN) vs conventional laparoscopic partial nephrectomy (C-LPN). MATERIALS AND METHODS Thirty large white female pigs were randomized to KTP-LPN or

Landsliding in partially saturated materials

Science.gov (United States)

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.

Partially Cystic Thyroid Nodules: Ultrasound Findings of Malignancy

Energy Technology Data Exchange (ETDEWEB)

Park, Jang Mi; Choi, Yoon Jung; Kwag, Hyon Joo [Dept. of Radiology, Kangbuk Samsung Hospital, Sungkyunkwan University School of Medicine, Seoul (Korea, Republic of)

2012-09-15

To seek for the ultrasound (US) findings of partially cystic thyroid nodules that are associated with malignancy. We reviewed the US characteristics of 22 surgically confirmed partially cystic papillary carcinomas, and compared them with those of 80 benign partially cystic nodules. The review cases were selected in a random order from a total of 1029 partially cystic nodules that were diagnosed with an US-guided fine needle aspiration biopsy over a period of 8 years (June 2003 to October 2010) at our institution. In partially cystic thyroid nodules, a taller-than-wide shape (100%, p<0.001) and spiculated or microlobulated margin (58.3%, p 0.003) were significantly associated with malignancy. In terms of internal solid portion of the nodule, eccentric configuration (68.0%, p<0.001), non-smooth margin (81.3%, p<0.001), hypoechogenecity (30.0%, p<0.042), and microcalcification (89.5%, p<0.001) were more frequently demonstrated in malignant nodules than benign ones. In partially cystic thyroid nodules, understanding the characteristics of US findings is important to make a precise diagnosis of malignant nodules.

Partial migration in fishes: definitions, methodologies and taxonomic distribution

DEFF Research Database (Denmark)

Chapman, B B; Skov, C; Hulthén, K

2012-01-01

published. In addition, previous work and synthesis has been hampered by a varied lexicon associated with this phenomenon in fishes. In this review, definitions and important concepts in partial migration research are discussed, and a classification system of the different forms of partial migration......Partial migration, where populations are composed of both migratory and resident individuals, is extremely widespread across the animal kingdom. Researchers studying fish movements have long recognized that many fishes are partial migrants, however, no detailed taxonomic review has ever been...... in fishes introduced. Next, a detailed taxonomic overview of partial migration in this group is considered. Finally, methodological approaches that ichthyologists can use to study this fascinating phenomenon are reviewed. Partial migration is more widespread amongst fishes than previously thought, and given...

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

Basic linear partial differential equations

CERN Document Server

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

CERN Document Server

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

Fast Partial Evaluation of Pattern Matching in Strings

DEFF Research Database (Denmark)

Ager, Mads Sig; Danvy, Olivier; Rohde, Henning Korsholm

2003-01-01

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how...... to obtain it in linear time has remained an open problem.Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate...... computations can be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time....

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.

Flexible Thermoplastic Denture Base Materials for Aesthetical Removable Partial Denture Framework

OpenAIRE

Singh, Kunwarjeet; Aeran, Himanshu; Kumar, Narender; Gupta, Nidhi

2013-01-01

Conventional fixed partial dentures, implant supported Fixed Partial Dentures (FDPs) and removable partial dentures are the most common treatment modalities for the aesthetic and functional rehabilitation of partially edentulous patients. Although implants and FDP have certain advantages over removable partial dentures, in some cases, removable partial dentures may be the only choice which is available. Removable cast partial dentures are used as definitive removable prostheses when indicated...

Partial gigantism

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.

Flexible thermoplastic denture base materials for aesthetical removable partial denture framework.

Science.gov (United States)

Singh, Kunwarjeet; Aeran, Himanshu; Kumar, Narender; Gupta, Nidhi

2013-10-01

Conventional fixed partial dentures, implant supported Fixed Partial Dentures (FDPs) and removable partial dentures are the most common treatment modalities for the aesthetic and functional rehabilitation of partially edentulous patients. Although implants and FDP have certain advantages over removable partial dentures, in some cases, removable partial dentures may be the only choice which is available. Removable cast partial dentures are used as definitive removable prostheses when indicated, but location of clasps may affect aesthetics. So, when patient is concerned about aesthetics, flexible partial dentures which is aesthetically superior to flipper and cast partial dentures, may be considered. But for the success of flexible removable partial denture, proper diagnosis, treatment planning and insertion technique of this prosthesis is very important, which have been thoroughly described in this article.

Future Scenarios for Software-Defined Metro and Access Networks and Software-Defined Photonics

Directory of Open Access Journals (Sweden)

Tommaso Muciaccia

2017-01-01

Full Text Available In recent years, architectures, devices, and components in telecommunication networks have been challenged by evolutionary and revolutionary factors which are drastically changing the traffic features. Most of these changes imply the need for major re-configurability and programmability not only in data-centers and core networks, but also in the metro-access segment. In a wide variety of contexts, this necessity has been addressed by the proposed introduction of the innovative paradigm of software-defined networks (SDNs. Several solutions inspired by the SDN model have been recently proposed also for metro and access networks, where the adoption of a new generation of software-defined reconfigurable integrated photonic devices is highly desirable. In this paper, we review the possible future application scenarios for software-defined metro and access networks and software-defined photonics (SDP, on the base of analytics, statistics, and surveys. This work describes the reasons underpinning the presented radical change of paradigm and summarizes the most significant solutions proposed in literature, with a specific emphasis to physical-layer reconfigurable networks and a focus on both architectures and devices.

Partial Synchronization Manifolds for Linearly Time-Delay Coupled Systems

OpenAIRE

Steur, Erik; van Leeuwen, Cees; Michiels, Wim

2014-01-01

Sometimes a network of dynamical systems shows a form of incomplete synchronization characterized by synchronization of some but not all of its systems. This type of incomplete synchronization is called partial synchronization. Partial synchronization is associated with the existence of partial synchronization manifolds, which are linear invariant subspaces of C, the state space of the network of systems. We focus on partial synchronization manifolds in networks of system...

[Partial splenectomy in sickle cell disease].

Science.gov (United States)

Gutiérrez Díaz, A I; Svarch, E; Arencibia Núñez, A; Sabournin Ferrier, V; Machín García, S; Menendez Veitía, A; Ramón Rodriguez, L; Serrano Mirabal, J; García Peralta, T; López Martin, L G

2015-04-01

Total splenectomy in sickle cell disease is related to a high risk of fulminant sepsis and increased incidence of other events, which have not been reported in patients with partial splenectomy. In this study we examined the patients with sickle cell disease and partial splenectomy and compared the clinical and laboratory results with non-splenectomized patients. We studied 54 patients with sickle cell disease who underwent partial splenectomy in childhood from 1986 until 2011 at the Institute of Hematology and Immunology. They were compared with 54 non-splenectomized patients selected by random sampling with similar characteristics. Partial splenectomy was performed at a mean age of 4.1 years, with a higher frequency in homozygous hemoglobin S (70.4%), and the most common cause was recurrent splenic sequestration crisis. The most common postoperative complications were fever of unknown origin (14.8%) and acute chest syndrome (11.1%). After splenectomy there was a significant increase in leukocytes, neutrophils, and platelets, the latter two parameters remained significantly elevated when compared with non-splenectomized patients. There was no difference in the incidence of clinical events, except hepatic sequestration, which was more common in splenectomized patients. Partial splenectomy was a safe procedure in patients with sickle cell disease. There were no differences in the clinical picture in children splenectomized and non-splenectomized except the greater frequency of hepatic sequestration crisis in the first group. Copyright © 2013 Asociación Española de Pediatría. Published by Elsevier España, S.L.U. All rights reserved.

Partial Evaluation for Class-Based Object-Oriented Languages

DEFF Research Database (Denmark)

Schultz, Ulrik Pagh

2001-01-01

Object-oriented programming facilitates the development of generic software, but at a significant cost in terms of performance. We apply partial evaluation to object-oriented programs, to automatically map generic software into specific implementations. In this paper we give a concise, formal...... description of a simple partial evaluator for a minimal object-oriented language, and give directions for extending this partial evaluator to handle realistic programs....

Partial Actions, Paradoxicality and Topological full Groups

DEFF Research Database (Denmark)

Scarparo, Eduardo

uniform Roe algebra is finite. In Article C, we analyze the C*-algebra generated by the Koopman representation of a topological full group, showing, in particular, that it is not AF andhas real rank zero. We also prove that if G is a finitely generated, elementary amenable group, and C*(G) has real rank......We study how paradoxicality properties affect the way groups partially acton topological spaces and C*-algebras. We also investigate the real rank zero and AF properties for certain classes of group C*-algebras. Specifically, in article A, we characterize supramenable groups in terms of existence...... of invariant probability measures for partial actions on compact Hausdorff spaces and existence of tracial states on partial crossed products. These characterizations show that, in general, one cannot decompose a partial crossed product of a C*-algebra by a semidirect product of groups as two iterated...

Limited diagnostic accuracy of magnetic resonance imaging and clinical tests for detecting partial-thickness tears of the rotator cuff.

Science.gov (United States)

Brockmeyer, Matthias; Schmitt, Cornelia; Haupert, Alexander; Kohn, Dieter; Lorbach, Olaf

2017-12-01

The reliable diagnosis of partial-thickness tears of the rotator cuff is still elusive in clinical practise. Therefore, the purpose of the study was to determine the diagnostic accuracy of MR imaging and clinical tests for detecting partial-thickness tears of the rotator cuff as well as the combination of these parameters. 334 consecutive shoulder arthroscopies for rotator cuff pathologies performed during the time period between 2010 and 2012 were analyzed retrospectively for the findings of common clinical signs for rotator cuff lesions and preoperative MR imaging. These were compared with the intraoperative arthroscopic findings as "gold standard". The reports of the MR imaging were evaluated with regard to the integrity of the rotator cuff. The Ellman Classification was used to define partial-thickness tears of the rotator cuff in accordance with the arthroscopic findings. Descriptive statistics, sensitivity, specificity, positive and negative predictive value were calculated. MR imaging showed 80 partial-thickness and 70 full-thickness tears of the rotator cuff. The arthroscopic examination confirmed 64 partial-thickness tears of which 52 needed debridement or refixation of the rotator cuff. Sensitivity for MR imaging to identify partial-thickness tears was 51.6%, specificity 77.2%, positive predictive value 41.3% and negative predictive value 83.7%. For the Jobe-test, sensitivity was 64.1%, specificity 43.2%, positive predictive value 25.9% and negative predictive value 79.5%. Sensitivity for the Impingement-sign was 76.7%, specificity 46.6%, positive predictive value 30.8% and negative predictive value 86.5%. For the combination of MR imaging, Jobe-test and Impingement-sign sensitivity was 46.9%, specificity 85.4%, positive predictive value 50% and negative predictive value 83.8%. The diagnostic accuracy of MR imaging and clinical tests (Jobe-test and Impingement-sign) alone is limited for detecting partial-thickness tears of the rotator cuff. Additionally

Partial Remission Definition

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

48 CFR 49.109-5 - Partial settlements.

Science.gov (United States)

2010-10-01

... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Partial settlements. 49... MANAGEMENT TERMINATION OF CONTRACTS General Principles 49.109-5 Partial settlements. The TCO should attempt... settlements covering particular items of the prime contractor's settlement proposal. However, when a TCO...

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

“Maxillary lateral incisor partial anodontia sequence”: a clinical entity with epigenetic origin

Science.gov (United States)

Consolaro, Alberto; Cardoso, Maurício Almeida; Consolaro, Renata Bianco

2017-01-01

ABSTRACT The relationship between maxillary lateral incisor anodontia and the palatal displacement of unerupted maxillary canines cannot be considered as a multiple tooth abnormality with defined genetic etiology in order to be regarded as a “syndrome”. Neither were the involved genes identified and located in the human genome, nor was it presumed on which chromosome the responsible gene would be located. The palatal maxillary canine displacement in cases of partial anodontia of the maxillary lateral incisor is potentially associated with environmental changes caused by its absence in its place of formation and eruption, which would characterize an epigenetic etiology. The lack of the maxillary lateral incisor in the canine region means removing one of the reference guides for the eruptive trajectory of the maxillary canine, which would therefore, not erupt and /or impact on the palate. Consequently, and in sequence, it would lead to malocclusion, maxillary atresia, transposition, prolonged retention of the deciduous canine and resorption in the neighboring teeth. Thus, we can say that we are dealing with a set of anomalies and multiple sequential changes known as sequential development anomalies or, simply, sequence. Once the epigenetics and sequential condition is accepted for this clinical picture, it could be called “Maxillary Lateral Incisor Partial Anodontia Sequence.” PMID:29364376

“Maxillary lateral incisor partial anodontia sequence”: a clinical entity with epigenetic origin

Directory of Open Access Journals (Sweden)

Alberto Consolaro

Full Text Available ABSTRACT The relationship between maxillary lateral incisor anodontia and the palatal displacement of unerupted maxillary canines cannot be considered as a multiple tooth abnormality with defined genetic etiology in order to be regarded as a “syndrome”. Neither were the involved genes identified and located in the human genome, nor was it presumed on which chromosome the responsible gene would be located. The palatal maxillary canine displacement in cases of partial anodontia of the maxillary lateral incisor is potentially associated with environmental changes caused by its absence in its place of formation and eruption, which would characterize an epigenetic etiology. The lack of the maxillary lateral incisor in the canine region means removing one of the reference guides for the eruptive trajectory of the maxillary canine, which would therefore, not erupt and /or impact on the palate. Consequently, and in sequence, it would lead to malocclusion, maxillary atresia, transposition, prolonged retention of the deciduous canine and resorption in the neighboring teeth. Thus, we can say that we are dealing with a set of anomalies and multiple sequential changes known as sequential development anomalies or, simply, sequence. Once the epigenetics and sequential condition is accepted for this clinical picture, it could be called “Maxillary Lateral Incisor Partial Anodontia Sequence.”

Challenges in defining a radiologic and hydrologic source term for underground nuclear test centers, Nevada Test Site, Nye County, Nevada

International Nuclear Information System (INIS)

Smith, D.K.

1995-06-01

The compilation of a radionuclide inventory for long-lived radioactive contaminants residual from nuclear testing provides a partial measure of the radiologic source term at the Nevada Test Site. The radiologic source term also includes potentially mobile short-lived radionuclides excluded from the inventory. The radiologic source term for tritium is known with accuracy and is equivalent to the hydrologic source term within the saturated zone. Definition of the total hydrologic source term for fission and activation products that have high activities for decades following underground testing involves knowledge and assumptions which are presently unavailable. Systematic investigation of the behavior of fission products, activation products and actinides under saturated or Partially saturated conditions is imperative to define a representative total hydrologic source term. This is particularly important given the heterogeneous distribution of radionuclides within testing centers. Data quality objectives which emphasize a combination of measurements and credible estimates of the hydrologic source term are a priority for near-field investigations at the Nevada Test Site

Ultrasonic partial discharge monitoring method on instrument transformers

Directory of Open Access Journals (Sweden)

Kartalović Nenad

2012-01-01

Full Text Available Sonic and ultrasonic partial discharge monitoring have been applied since the early days of these phenomena monitoring. Modern measurement and partial discharge acoustic (ultrasonic and sonic monitoring method has been rapidly evolving as a result of new electronic component design, information technology and updated software solutions as well as the development of knowledge in the partial discharge diagnosis. Electrical discharges in the insulation system generate voltage-current pulses in the network and ultrasonic waves that propagate through the insulation system and structure. Amplitude-phase-frequency analysis of these signals reveals information about the intensity, type and location of partial discharges. The paper discusses the possibility of ultrasonic method selectivity improvement and the increase of diagnosis reliability in the field. Measurements were performed in the laboratory and in the field while a number of transformers were analysed for dissolved gases in the oil. A comparative review of methods for the partial discharge detection is also presented in this paper.

$L^2$ estimates for the $\\bar \\partial$ operator

OpenAIRE

McNeal, Jeffery D.; Varolin, Dror

2015-01-01

This is a survey article about $L^2$ estimates for the $\\bar \\partial$ operator. After a review of the basic approach that has come to be called the "Bochner-Kodaira Technique", the focus is on twisted techniques and their applications to estimates for $\\bar \\partial$, to $L^2$ extension theorems, and to other problems in complex analysis and geometry, including invariant metric estimates and the $\\bar \\partial$-Neumann Problem.

Environmental control and life support - Partially closed system will save big money

Science.gov (United States)

Guy, W. W.

1983-01-01

Although the NASA space station has not yet been completely defined, realistic estimates may be made of the environmental control and life support system requirements entailed by a crew of eight, a resupply interval of 90 days, an initial launch which includes expendables for the first resupply interval, 7.86 lb/day of water per person, etc. An appraisal of these requirements is presented which strongly suggests the utility of a partially closed life support system. Such a scheme would give the crew high quality water to drink, and recycle nonpotable water from hand washing, bathing, clothes and dish washing, and urinal flushing. The excess recovery process water is electrolyzed to provide metabolic and leakage oxygen. The crew would drink electrolysis water and atmospheric humidity control moisture-derived water.

Thin film devices used as oxygen partial pressure sensors

Science.gov (United States)

Canady, K. S.; Wortman, J. J.

1970-01-01

Electrical conductivity of zinc oxide films to be used in an oxygen partial pressure sensor is measured as a function of temperature, oxygen partial pressure, and other atmospheric constituents. Time response following partial pressure changes is studied as a function of temperature and environmental changes.

Defining Nitrogen Kinetics for Air Break in Prebreath

Science.gov (United States)

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

Science.gov (United States)

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 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 differential equations in several complex variables

CERN Document Server

Chen, So-Chin

2001-01-01

This book is intended both as an introductory text and as a reference book for those interested in studying several complex variables in the context of partial differential equations. In the last few decades, significant progress has been made in the fields of Cauchy-Riemann and tangential Cauchy-Riemann operators. This book gives an up-to-date account of the theories for these equations and their applications. The background material in several complex variables is developed in the first three chapters, leading to the Levi problem. The next three chapters are devoted to the solvability and regularity of the Cauchy-Riemann equations using Hilbert space techniques. The authors provide a systematic study of the Cauchy-Riemann equations and the \\bar\\partial-Neumann problem, including L^2 existence theorems on pseudoconvex domains, \\frac 12-subelliptic estimates for the \\bar\\partial-Neumann problems on strongly pseudoconvex domains, global regularity of \\bar\\partial on more general pseudoconvex domains, boundary ...

Partial Differential Equations Modeling and Numerical Simulation

CERN Document Server

Glowinski, Roland

2008-01-01

This book is dedicated to Olivier Pironneau. For more than 250 years partial differential equations have been clearly the most important tool available to mankind in order to understand a large variety of phenomena, natural at first and then those originating from human activity and technological development. Mechanics, physics and their engineering applications were the first to benefit from the impact of partial differential equations on modeling and design, but a little less than a century ago the Schrödinger equation was the key opening the door to the application of partial differential equations to quantum chemistry, for small atomic and molecular systems at first, but then for systems of fast growing complexity. Mathematical modeling methods based on partial differential equations form an important part of contemporary science and are widely used in engineering and scientific applications. In this book several experts in this field present their latest results and discuss trends in the numerical analy...

Clinical evaluation of failures in removable partial dentures.

Science.gov (United States)

Jorge, Janaina H; Quishida, Cristiane C C; Vergani, Carlos E; Machado, Ana L; Pavarina, Ana C; Giampaolo, Eunice T

2012-01-01

The aim of this clinical study was to evaluate the effects of removable partial dentures on the support tissues and changes occurring in lower tooth-supported and bilateral distal-extension dentures, 5 years after placement. The study involved analysis of a total of 53 patients who received prosthetic treatment for removable partial dentures. The patients were divided into two groups. In group 1, the patients had a completely edentulous maxilla and an edentulous area with natural teeth remaining in both the anterior and posterior regions. In group 2, the patients had a completely edentulous maxilla and partially edentulous mandible with preserved anterior teeth. Tooth mobility, prevalence of caries, fracture of the abutment teeth, fracture and/or deformation of the removable partial denture components and stability of the denture base were evaluated. The use of a removable partial denture increased tooth mobility, reduced the prevalence of caries, and did not cause loss or fracture of the abutments or damage to their components, when compared with the baseline. It was concluded that there was no difference between the groups as evaluated in terms of tooth mobility, prevalence of caries, loss and fracture of the abutments or damage to the components of the removable partial denture.

Does training of fellows affect peri-operative outcomes of robot-assisted partial nephrectomy?

Science.gov (United States)

Khene, Zine-Eddine; Peyronnet, Benoit; Bosquet, Elise; Pradère, Benjamin; Robert, Corentin; Fardoun, Tarek; Kammerer-Jacquet, Solène-Florence; Verhoest, Grégory; Rioux-Leclercq, Nathalie; Mathieu, Romain; Bensalah, Karim

2017-10-01

To evaluate the impact of fellows' involvement on the peri-operative outcomes of robot-assisted partial nephrectomy (RAPN). We analysed 216 patients who underwent RAPN for a small renal tumour. We stratified our cohort into two groups according to the involvement of a fellow surgeon during the procedure: expert surgeon operating alone (expert group) and fellow operating under the supervision of the expert surgeon (fellow group). Peri-operative data were compared between the two groups. Linear and logistic regression analyses were performed to assess the impact of fellows' involvement on peri-operative and postoperative outcomes. Trifecta and margins ischaemia complications (MIC) score achievement rates were used to assess the quality of surgery in both the expert and fellow groups. Trifecta was defined as a combination of warm ischaemia time negative surgical margins and no peri-operative complications. MIC score was defined as negative surgical margins, ischaemia time Training fellows to perform RAPN is associated with longer operating time and WIT but does not appear to compromise other peri-operative outcomes. © 2017 The Authors BJU International © 2017 BJU International Published by John Wiley & Sons Ltd.

Partial knee replacement - slideshow

Science.gov (United States)

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

On the relation between elementary partial difference equations and partial differential equations

NARCIS (Netherlands)

van den Berg, I.P.

1998-01-01

The nonstandard stroboscopy method links discrete-time ordinary difference equations of first-order and continuous-time, ordinary differential equations of first order. We extend this method to the second order, and also to an elementary, yet general class of partial difference/differential

Exergy of partially coherent thermal radiation

International Nuclear Information System (INIS)

Wijewardane, S.; Goswami, Yogi

2012-01-01

Exergy of electromagnetic radiation has been studied by a number of researchers for well over four decades in order to estimate the maximum conversion efficiencies of thermal radiation. As these researchers primarily dealt with solar and blackbody radiation, which have a low degree of coherence, they did not consider the partial coherence properties of thermal radiation. With the recent development of surface structures, which can emit radiation with high degree of coherence, the importance of considering the partial coherent properties in exergy calculation has become a necessity as the coherence properties directly influence the entropy of the wave field. Here in this paper we derive an expression for the exergy of quasi-monochromatic radiation using statistical thermodynamics and show that it is identical with the expressions derived using classical thermodynamics. We also present a method to calculate the entropy, thereby the exergy of partially coherent radiation using statistical thermodynamics and a method called matrix treatment of wave field. -- Highlights: ► Considered partial coherence of radiation for the first time to calculate exergy. ► The importance of this method is emphasized with energy conversion examples. ► Derived an expression for the exergy of radiation using statistical thermodynamics. ► Adopted a method to calculate intensity of statistically independent principle wave.

Utilization of Large Scale Surface Models for Detailed Visibility Analyses

Science.gov (United States)

Caha, J.; Kačmařík, M.

2017-11-01

This article demonstrates utilization of large scale surface models with small spatial resolution and high accuracy, acquired from Unmanned Aerial Vehicle scanning, for visibility analyses. The importance of large scale data for visibility analyses on the local scale, where the detail of the surface model is the most defining factor, is described. The focus is not only the classic Boolean visibility, that is usually determined within GIS, but also on so called extended viewsheds that aims to provide more information about visibility. The case study with examples of visibility analyses was performed on river Opava, near the Ostrava city (Czech Republic). The multiple Boolean viewshed analysis and global horizon viewshed were calculated to determine most prominent features and visibility barriers of the surface. Besides that, the extended viewshed showing angle difference above the local horizon, which describes angular height of the target area above the barrier, is shown. The case study proved that large scale models are appropriate data source for visibility analyses on local level. The discussion summarizes possible future applications and further development directions of visibility analyses.

Partial agonist therapy in schizophrenia: relevance to diminished criminal responsibility.

Science.gov (United States)

Gavaudan, Gilles; Magalon, David; Cohen, Julien; Lançon, Christophe; Léonetti, Georges; Pélissier-Alicot, Anne-Laure

2010-11-01

Pathological gambling (PG), classified in the DSM-IV among impulse control disorders, is defined as inappropriate, persistent gaming for money with serious personal, family, and social consequences. Offenses are frequently committed to obtain money for gambling. Pathological gambling, a planned and structured behavioral disorder, has often been described as a complication of dopamine agonist treatment in patients with Parkinson's disease. It has never been described in patients with schizophrenia receiving dopamine agonists. We present two patients with schizophrenia, previously treated with antipsychotic drugs without any suggestion of PG, who a short time after starting aripiprazole, a dopamine partial agonist, developed PG and criminal behavior, which totally resolved when aripiprazole was discontinued. Based on recent advances in research on PG and adverse drug reactions to dopamine agonists in Parkinson's disease, we postulate a link between aripiprazole and PG in both our patients with schizophrenia and raise the question of criminal responsibility. © 2010 American Academy of Forensic Sciences.

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

Partial monosomy 8q and partial trisomy 9q due to the maternal translocation t(8;9(q24.3;q34.1)

DEFF Research Database (Denmark)

Tos, T; Alp, M Y; Eker, H K

2014-01-01

Partial trisomy 9q34-qter and partial monosomy 8q24.3-qter are very rare chromosomal abnormalities. Characteristic features of partial trisomy 9q34-qter are hypotonia, developmental delay, mild intellectual disability, dolichocephaly, distinct facial phenotype, long and thin fingers, and cardiac...

Comparative videostroboscopic analysis after different external partial laryngectomies

Directory of Open Access Journals (Sweden)

Mumović Gordana M.

2014-01-01

Full Text Available Background/Aim. After external partial laryngectomias, videostroborscopy is very usefull in evaluation of postoperative phonatory mehanisms showing the “slow motion” of the vibrations of the remaining laryngeal structures. The aim of this paper was to compare the videostroboscopic characteristics of the vibration and to establish the differences in the phonation mechanisms depending on the type of external partial laryngectomy performed. Methods. This prospective study was conducted during the period 2003-2009 at the Ear, Nose and Throat Clinic, Clinical Center of Vojvodina, Novi Sad, including 99 patients with laryngeal carcinoma, treated with open surgical approach using different types of vertical and horizontal partial laryngectomy. Videostroboscopy was used to analyse vibrations of the remaining laryngeal structures. Results. The dominant vibration structure after partial horizontal laryngectomy, chordectomy, frontolateral laryngectomy and three quarter laryngectomy was the remaining vocal fold, after hemilaryngectomy it was the false vocal fold and after subtotal and near total laryngectomy it was the arythenoid. In patients with supracricoid hemilaryngopharyngectomy performed, many different structures were involved in the vibration. After most of the partial laryngectomies, vibrations can be found in the reconstructed part of the defect. In both horizontal and vertical partial laryngectomies movements of the larynx during phonation were mostly medial, while in cricohyoidoglottopexies they were anterior-posterior. Most of the operated patients (72.7% had insufficient occlusion of the neoglottis during the phonation. Conclusion. Videostroboscopy is a useful method in examining the phonation mechanisms of reconstructed laryngeal structures after partial laryngectomy as well as in planning postoperative voice therapy.

New approach to breast cancer CAD using partial least squares and kernel-partial least squares

Science.gov (United States)

Land, Walker H., Jr.; Heine, John; Embrechts, Mark; Smith, Tom; Choma, Robert; Wong, Lut

2005-04-01

Breast cancer is second only to lung cancer as a tumor-related cause of death in women. Currently, the method of choice for the early detection of breast cancer is mammography. While sensitive to the detection of breast cancer, its positive predictive value (PPV) is low, resulting in biopsies that are only 15-34% likely to reveal malignancy. This paper explores the use of two novel approaches called Partial Least Squares (PLS) and Kernel-PLS (K-PLS) to the diagnosis of breast cancer. The approach is based on optimization for the partial least squares (PLS) algorithm for linear regression and the K-PLS algorithm for non-linear regression. Preliminary results show that both the PLS and K-PLS paradigms achieved comparable results with three separate support vector learning machines (SVLMs), where these SVLMs were known to have been trained to a global minimum. That is, the average performance of the three separate SVLMs were Az = 0.9167927, with an average partial Az (Az90) = 0.5684283. These results compare favorably with the K-PLS paradigm, which obtained an Az = 0.907 and partial Az = 0.6123. The PLS paradigm provided comparable results. Secondly, both the K-PLS and PLS paradigms out performed the ANN in that the Az index improved by about 14% (Az ~ 0.907 compared to the ANN Az of ~ 0.8). The "Press R squared" value for the PLS and K-PLS machine learning algorithms were 0.89 and 0.9, respectively, which is in good agreement with the other MOP values.

Multi-Valued Logic Gates, Continuous Sensitivity, Reversibility, and Threshold Functions

OpenAIRE

İlhan, Aslı Güçlükan; Ünlü, Özgün

2016-01-01

We define an invariant of a multi-valued logic gate by considering the number of certain threshold functions associated with the gate. We call this invariant the continuous sensitivity of the gate. We discuss a method for analysing continuous sensitivity of a multi-valued logic gate by using experimental data about the gate. In particular, we will show that this invariant provides a lower bound for the sensitivity of a boolean function considered as a multi-valued logic gate. We also discuss ...

40 CFR Table 7 to Subpart Vvvvvv... - Partially Soluble HAP

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 14 2010-07-01 2010-07-01 false Partially Soluble HAP 7 Table 7 to... Pt. 63, Subpt. VVVVVV, Table 7 Table 7 to Subpart VVVVVV of Part 63—Partially Soluble HAP As required... partially soluble HAP listed in the following table. Partially soluble HAP name CAS No. 1. 1,1,1...

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

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