WorldWideScience

Sample records for locally boolean domains

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

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

  3. Nonlinear threshold Boolean automata networks and phase transitions

    OpenAIRE

    Demongeot, Jacques; Sené, Sylvain

    2010-01-01

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

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

  5. Interpolative Boolean Networks

    Directory of Open Access Journals (Sweden)

    Vladimir Dobrić

    2017-01-01

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

  6. Boolean algebra essentials

    CERN Document Server

    Solomon, Alan D

    2012-01-01

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

  7. Boolean reasoning the logic of boolean equations

    CERN Document Server

    Brown, Frank Markham

    2012-01-01

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

  8. Monotone Boolean functions

    International Nuclear Information System (INIS)

    Korshunov, A D

    2003-01-01

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

  9. Boolean integral calculus

    Science.gov (United States)

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

    1988-01-01

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

  10. Free Boolean Topological Groups

    Directory of Open Access Journals (Sweden)

    Ol’ga Sipacheva

    2015-11-01

    Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.

  11. Properties of Boolean orthoposets

    Science.gov (United States)

    Tkadlec, Josef

    1993-10-01

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

  12. Computational complexity of Boolean functions

    Energy Technology Data Exchange (ETDEWEB)

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

    2012-02-28

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

  13. Quantum algorithms for testing Boolean functions

    Directory of Open Access Journals (Sweden)

    Erika Andersson

    2010-06-01

    Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

  14. Geometric Operators on Boolean Functions

    DEFF Research Database (Denmark)

    Frisvad, Jeppe Revall; Falster, Peter

    In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...

  15. Cryptographic Boolean functions and applications

    CERN Document Server

    Cusick, Thomas W

    2009-01-01

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

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

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

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

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

  20. Algebraic partial Boolean algebras

    International Nuclear Information System (INIS)

    Smith, Derek

    2003-01-01

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

  1. GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS

    OpenAIRE

    Ho, Juei-Ling

    2009-01-01

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

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

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

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

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

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

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

  8. On Boolean functions with generalized cryptographic properties

    NARCIS (Netherlands)

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

    2004-01-01

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

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

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

  11. Boolean modeling in systems biology: an overview of methodology and applications

    International Nuclear Information System (INIS)

    Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh

    2012-01-01

    Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    CERN Document Server

    Wehrung, Friedrich

    2017-01-01

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

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

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

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

    Science.gov (United States)

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

    2017-11-25

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

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

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

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

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

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

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

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

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

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

  6. Localization of vector field on dynamical domain wall

    Directory of Open Access Journals (Sweden)

    Masafumi Higuchi

    2017-03-01

    Full Text Available In the previous works (arXiv:1202.5375 and arXiv:1402.1346, the dynamical domain wall, where the four dimensional FRW universe is embedded in the five dimensional space–time, has been realized by using two scalar fields. In this paper, we consider the localization of vector field in three formulations. The first formulation was investigated in the previous paper (arXiv:1510.01099 for the U(1 gauge field. In the second formulation, we investigate the Dvali–Shifman mechanism (arXiv:hep-th/9612128, where the non-abelian gauge field is confined in the bulk but the gauge symmetry is spontaneously broken on the domain wall. In the third formulation, we investigate the Kaluza–Klein modes coming from the five dimensional graviton. In the Randall–Sundrum model, the graviton was localized on the brane. We show that the (5,μ components (μ=0,1,2,3 of the graviton are also localized on the domain wall and can be regarded as the vector field on the domain wall. There are, however, some corrections coming from the bulk extra dimension if the domain wall universe is expanding.

  7. A Boolean Approach to Airline Business Model Innovation

    DEFF Research Database (Denmark)

    Hvass, Kristian Anders

    Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....

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

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

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

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

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

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

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

  15. A localized interaction surface for voltage-sensing domains on the pore domain of a K+ channel.

    Science.gov (United States)

    Li-Smerin, Y; Hackos, D H; Swartz, K J

    2000-02-01

    Voltage-gated K+ channels contain a central pore domain and four surrounding voltage-sensing domains. How and where changes in the structure of the voltage-sensing domains couple to the pore domain so as to gate ion conduction is not understood. The crystal structure of KcsA, a bacterial K+ channel homologous to the pore domain of voltage-gated K+ channels, provides a starting point for addressing this question. Guided by this structure, we used tryptophan-scanning mutagenesis on the transmembrane shell of the pore domain in the Shaker voltage-gated K+ channel to localize potential protein-protein and protein-lipid interfaces. Some mutants cause only minor changes in gating and when mapped onto the KcsA structure cluster away from the interface between pore domain subunits. In contrast, mutants producing large changes in gating tend to cluster near this interface. These results imply that voltage-sensing domains interact with localized regions near the interface between adjacent pore domain subunits.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  10. Magnetic domain wall gratings for magnetization reversal tuning and confined dynamic mode localization.

    Science.gov (United States)

    Trützschler, Julia; Sentosun, Kadir; Mozooni, Babak; Mattheis, Roland; McCord, Jeffrey

    2016-08-04

    High density magnetic domain wall gratings are imprinted in ferromagnetic-antiferromagnetic thin films by local ion irradiation by which alternating head-to-tail-to-head-to-tail and head-to-head-to-tail-to-tail spatially overlapping domain wall networks are formed. Unique magnetic domain processes result from the interaction of anchored domain walls. Non-linear magnetization response is introduced by the laterally distributed magnetic anisotropy phases. The locally varying magnetic charge distribution gives rise to localized and guided magnetization spin-wave modes directly constrained by the narrow domain wall cores. The exchange coupled multiphase material structure leads to unprecedented static and locally modified dynamic magnetic material properties.

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

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

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

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

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

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

  17. Local coercive force of domain boundaries

    International Nuclear Information System (INIS)

    Kandaurova, G.S.; Vas'kovskij, V.O.

    1980-01-01

    The aim of the present paper is to show the variety of effects resulting from local coercivity using RFeO 3 orthoferrites crystals-plates, to separate factors which are not directly connected with the nature of every single defect but influence significantly Hsub(cw) local coercivity and, at last, to attract attention of physisists-theorists to new tasks of the magnetic hysteresis theory. Measurements have been carried out on a great number of defect of YFeO 3 and PyFeO 3 crystals. Such peculiarities of local coercivity as Hsub(cw) anisotropy and asymmetry, Hsub(cw) nonstability and its dependence on the sample magnetic prehistory. Qualitative explanation of these effects in based on the presumable interaction of the domain wall with magnetic heterogeneities existing in a region of structural defects

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

  19. Glycogen synthase kinase 3-{beta} phosphorylates novel S/T-P-S/T domains in Notch1 intracellular domain and induces its nuclear localization

    Energy Technology Data Exchange (ETDEWEB)

    Han, Xiangzi [Department of Life Science, College of Natural Sciences, Hanyang University, Seoul 133-791 (Korea, Republic of); Department of Preventive Medicine, Yanbian University College of Medicine, Yanji (China); Ju, Ji-hyun [Department of Life Science, College of Natural Sciences, Hanyang University, Seoul 133-791 (Korea, Republic of); Shin, Incheol, E-mail: incheol@hanyang.ac.kr [Department of Life Science, College of Natural Sciences, Hanyang University, Seoul 133-791 (Korea, Republic of)

    2012-06-29

    Highlights: Black-Right-Pointing-Pointer Novel S/T-P-S/T domains were identified in NICD. Black-Right-Pointing-Pointer Phosphorylation of NICD on the S/T-P-S/T domains induced nuclear localization. Black-Right-Pointing-Pointer GSK-3{beta} phosphorylated S and T residues in NICD S/T-P-S/T domains. -- Abstract: We identified two S/T-P-S/T domains (2122-2124, 2126-2128) inducing Notch intracellular domain (NICD) nuclear localization. The GFP-NICD (1963-2145) fusion protein deletion mutant without classical NLS was localized in the nucleus like the full length GFP-NICD. However, quadruple substitution mutant (T2122A T2124A S2126A T2128A) showed increased cytoplasmic localization. GSK-3{beta} enhanced nuclear localization and transcriptional activity of WT NICD but not of quadruple substitution mutant. In vitro kinase assays revealed that GSK-3{beta} phosphorylated S and T residues in NICD S/T-P-S/T domains. These results suggest that the novel S/T-P-S/T domain, phosphorylated by GSK-3{beta} is also involved in the nuclear localization of NICD as well as classical NLS.

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

    Science.gov (United States)

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

    2016-04-01

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

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

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

  3. Local coercive force of domain boundaries

    Energy Technology Data Exchange (ETDEWEB)

    Kandaurova, G S; Vas' kovskii, V O [Ural' skij Gosudarstvennyj Univ., Sverdlovsk (USSR)

    1980-04-01

    The aim of the present paper is to show the variety of effects resulting from local coercivity using RFeO/sub 3/ orthoferrites crystals-plates, to separate factors which are not directly connected with the nature of every single defect but influence significantly H/sub cw/ local coercivity and, at last, to attract attention of physisists-theorists to new tasks of the magnetic hysteresis theory. Measurements have been carried out on a great number of defect of YFeO/sub 3/ and PyFeO/sub 3/ crystals. Such peculiarities of local coercivity as H/sub cw/ anisotropy and asymmetry, H/sub cw/ nonstability and its dependence on the sample magnetic prehistory. Qualitative explanation of these effects in based on the presumable interaction of the domain wall with magnetic heterogeneities existing in a region of structural defects.

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

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

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

  7. Localization of bulk form fields on dilatonic domain walls

    International Nuclear Information System (INIS)

    Youm, Donam

    2001-06-01

    We study the localization properties of bulk form potentials on dilatonic domain walls. We find that bulk form potentials of any ranks can be localized as form potentials of the same ranks or one lower ranks, for any values of the dilaton coupling parameter. For large enough values of the dilaton coupling parameter, bulk form potentials of any ranks can be localized as form potentials of both the same ranks and one lower ranks. (author)

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

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

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

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

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

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

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

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

  16. Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

    Directory of Open Access Journals (Sweden)

    Vladimir A. Emelichev

    2002-11-01

    Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained.

  17. The characterization of weighted local hardy spaces on domains and its application.

    Science.gov (United States)

    Wang, Heng-geng; Yang, Xiao-ming

    2004-09-01

    In this paper, we give the four equivalent characterizations for the weighted local hardy spaces on Lipschitz domains. Also, we give their application for the harmonic function defined in bounded Lipschitz domains.

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

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

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

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

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

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

  4. CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS

    Directory of Open Access Journals (Sweden)

    P. N. Bibilo

    2016-01-01

    Full Text Available Method for description of incompletely specified (partial Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.

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

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

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

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

  9. Laser induced local modification of magnetic domain in Co/Pt multilayer

    International Nuclear Information System (INIS)

    Talapatra, A.; Mohanty, J.

    2016-01-01

    Manipulation of magnetic system by the use of laser has drawn the attention of contemporary research. We demonstrate here the modification of magnetic domain in perpendicularly magnetized Co/Pt multilayer by using ultrashort laser pulse. The as-prepared sample shows an out-of-plane saturation magnetic field of 803.4 mT and almost zero remanence with a labyrinth-like domain pattern at room temperature. Atomistic simulation showed that interaction with femto-second laser results in demagnetization of the material in 200 fs followed by a slower recovery. As it indicates a net loss in magnetization, so magnetic force microscopy is carried out to investigate the equilibrium state after the system is relaxed. Demagnetized random domains appeared at the centre of the laser spot with having a rim at the boundary which signifies a deterministic switching with respect to the neighbouring area. Rotation of domains at the central area with the application of small transverse field (100 mT) proves the region to be magnetically weaker. Systematic 3D micromagnetic simulation has been performed to model the laser induced change by selective reduction of anisotropy which is discussed in detail. This shows shrinking of domains to a near circular pattern to minimize the magnetostatic energy. 50% reduction in anisotropy energy is observed with increasing the total energy of the system and a sharp increase in demagnetization energy also takes place simultaneously. This also satisfies the anisotropy in domain rotation with the application of transverse field. - Highlights: • Laser induced magnetization dynamics. • Local manipulation of magnetic domains. • Deterministic switching of domains with laser. • Modeling magnetic domain structure with local anisotropy distribution.

  10. Laser induced local modification of magnetic domain in Co/Pt multilayer

    Energy Technology Data Exchange (ETDEWEB)

    Talapatra, A., E-mail: ph13p1001@iith.ac.in; Mohanty, J., E-mail: jmohanty@iith.ac.in

    2016-11-15

    Manipulation of magnetic system by the use of laser has drawn the attention of contemporary research. We demonstrate here the modification of magnetic domain in perpendicularly magnetized Co/Pt multilayer by using ultrashort laser pulse. The as-prepared sample shows an out-of-plane saturation magnetic field of 803.4 mT and almost zero remanence with a labyrinth-like domain pattern at room temperature. Atomistic simulation showed that interaction with femto-second laser results in demagnetization of the material in 200 fs followed by a slower recovery. As it indicates a net loss in magnetization, so magnetic force microscopy is carried out to investigate the equilibrium state after the system is relaxed. Demagnetized random domains appeared at the centre of the laser spot with having a rim at the boundary which signifies a deterministic switching with respect to the neighbouring area. Rotation of domains at the central area with the application of small transverse field (100 mT) proves the region to be magnetically weaker. Systematic 3D micromagnetic simulation has been performed to model the laser induced change by selective reduction of anisotropy which is discussed in detail. This shows shrinking of domains to a near circular pattern to minimize the magnetostatic energy. 50% reduction in anisotropy energy is observed with increasing the total energy of the system and a sharp increase in demagnetization energy also takes place simultaneously. This also satisfies the anisotropy in domain rotation with the application of transverse field. - Highlights: • Laser induced magnetization dynamics. • Local manipulation of magnetic domains. • Deterministic switching of domains with laser. • Modeling magnetic domain structure with local anisotropy distribution.

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

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

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

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

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

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

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

  18. A Cross-Domain Collaborative Filtering Algorithm Based on Feature Construction and Locally Weighted Linear Regression.

    Science.gov (United States)

    Yu, Xu; Lin, Jun-Yu; Jiang, Feng; Du, Jun-Wei; Han, Ji-Zhong

    2018-01-01

    Cross-domain collaborative filtering (CDCF) solves the sparsity problem by transferring rating knowledge from auxiliary domains. Obviously, different auxiliary domains have different importance to the target domain. However, previous works cannot evaluate effectively the significance of different auxiliary domains. To overcome this drawback, we propose a cross-domain collaborative filtering algorithm based on Feature Construction and Locally Weighted Linear Regression (FCLWLR). We first construct features in different domains and use these features to represent different auxiliary domains. Thus the weight computation across different domains can be converted as the weight computation across different features. Then we combine the features in the target domain and in the auxiliary domains together and convert the cross-domain recommendation problem into a regression problem. Finally, we employ a Locally Weighted Linear Regression (LWLR) model to solve the regression problem. As LWLR is a nonparametric regression method, it can effectively avoid underfitting or overfitting problem occurring in parametric regression methods. We conduct extensive experiments to show that the proposed FCLWLR algorithm is effective in addressing the data sparsity problem by transferring the useful knowledge from the auxiliary domains, as compared to many state-of-the-art single-domain or cross-domain CF methods.

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

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

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

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

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

    NARCIS (Netherlands)

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

    2011-01-01

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

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

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

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

  7. A Cross-Domain Collaborative Filtering Algorithm Based on Feature Construction and Locally Weighted Linear Regression

    Directory of Open Access Journals (Sweden)

    Xu Yu

    2018-01-01

    Full Text Available Cross-domain collaborative filtering (CDCF solves the sparsity problem by transferring rating knowledge from auxiliary domains. Obviously, different auxiliary domains have different importance to the target domain. However, previous works cannot evaluate effectively the significance of different auxiliary domains. To overcome this drawback, we propose a cross-domain collaborative filtering algorithm based on Feature Construction and Locally Weighted Linear Regression (FCLWLR. We first construct features in different domains and use these features to represent different auxiliary domains. Thus the weight computation across different domains can be converted as the weight computation across different features. Then we combine the features in the target domain and in the auxiliary domains together and convert the cross-domain recommendation problem into a regression problem. Finally, we employ a Locally Weighted Linear Regression (LWLR model to solve the regression problem. As LWLR is a nonparametric regression method, it can effectively avoid underfitting or overfitting problem occurring in parametric regression methods. We conduct extensive experiments to show that the proposed FCLWLR algorithm is effective in addressing the data sparsity problem by transferring the useful knowledge from the auxiliary domains, as compared to many state-of-the-art single-domain or cross-domain CF methods.

  8. Localization and chiral symmetry in 2+1 flavor domain wall QCD

    Energy Technology Data Exchange (ETDEWEB)

    David J. Antonio; Kenneth C. Bowler; Peter A. Boyle; Norman H. Christ; Michael A. Clark; Saul D. Cohen; Chris Dawson; Alistair Hart; Balint Joó; Chulwoo Jung; Richard D. Kenway; Shu Li; Meifeng Lin; Robert D. Mawhinney; Christopher M. Maynard; Shigemi Ohta; Robert J. Tweedie; Azusa Yamaguchi

    2008-01-01

    We present results for the dependence of the residual mass of domain wall fermions (DWF) on the size of the fifth dimension and its relation to the density and localization properties of low-lying eigenvectors of the corresponding hermitian Wilson Dirac operator relevant to simulations of 2+1 flavor domain wall QCD. Using the DBW2 and Iwasaki gauge actions, we generate ensembles of configurations with a $16^3\\times 32$ space-time volume and an extent of 8 in the fifth dimension for the sea quarks. We demonstrate the existence of a regime where the degree of locality, the size of chiral symmetry breaking and the rate of topology change can be acceptable for inverse lattice spacings $a^{-1} \\ge 1.6$ GeV.

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

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

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

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

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

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

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

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

  17. Localized fermions on domain walls and extended supersymmetric quantum mechanics

    International Nuclear Information System (INIS)

    Oikonomou, V K

    2014-01-01

    We study fermionic fields localized on topologically unstable domain walls bounded by strings in a grand unified theory theoretical framework. Particularly, we found that the localized fermionic degrees of freedom, which are up and down-quarks as well as charged leptons, are connected to three independent N = 2, d = 1 supersymmetric quantum mechanics algebras. As we demonstrate, these algebras can be combined to form higher order representations of N = 2, d = 1 supersymmetry. Due to the uniform coupling of the domain wall solutions to the down-quarks and leptons, we also show that a higher order N = 2, d = 1 representation of the down-quark–lepton system is invariant under a duality transformation between the couplings. In addition, the two N = 2, d = 1 supersymmetries of the down-quark–lepton system, combine at the coupling unification scale to form an N = 4, d = 1 supersymmetry. Furthermore, we present the various extra geometric and algebraic attributes that the fermionic systems acquire, owing to the underlying N = 2, d = 1 algebras. (paper)

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

  19. PH Domain-Arf G Protein Interactions Localize the Arf-GEF Steppke for Cleavage Furrow Regulation in Drosophila.

    Directory of Open Access Journals (Sweden)

    Donghoon M Lee

    Full Text Available The recruitment of GDP/GTP exchange factors (GEFs to specific subcellular sites dictates where they activate small G proteins for the regulation of various cellular processes. Cytohesins are a conserved family of plasma membrane GEFs for Arf small G proteins that regulate endocytosis. Analyses of mammalian cytohesins have identified a number of recruitment mechanisms for these multi-domain proteins, but the conservation and developmental roles for these mechanisms are unclear. Here, we report how the pleckstrin homology (PH domain of the Drosophila cytohesin Steppke affects its localization and activity at cleavage furrows of the early embryo. We found that the PH domain is necessary for Steppke furrow localization, and for it to regulate furrow structure. However, the PH domain was not sufficient for the localization. Next, we examined the role of conserved PH domain amino acid residues that are required for mammalian cytohesins to bind PIP3 or GTP-bound Arf G proteins. We confirmed that the Steppke PH domain preferentially binds PIP3 in vitro through a conserved mechanism. However, disruption of residues for PIP3 binding had no apparent effect on GFP-Steppke localization and effects. Rather, residues for binding to GTP-bound Arf G proteins made major contributions to this Steppke localization and activity. By analyzing GFP-tagged Arf and Arf-like small G proteins, we found that Arf1-GFP, Arf6-GFP and Arl4-GFP, but not Arf4-GFP, localized to furrows. However, analyses of embryos depleted of Arf1, Arf6 or Arl4 revealed either earlier defects than occur in embryos depleted of Steppke, or no detectable furrow defects, possibly because of redundancies, and thus it was difficult to assess how individual Arf small G proteins affect Steppke. Nonetheless, our data show that the Steppke PH domain and its conserved residues for binding to GTP-bound Arf G proteins have substantial effects on Steppke localization and activity in early Drosophila embryos.

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

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

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

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

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

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

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

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

  8. Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann

    Czech Academy of Sciences Publication Activity Database

    Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš

    2005-01-01

    Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005

  9. Membrane Localization is Critical for Activation of the PICK1 BAR Domain

    Science.gov (United States)

    Madsen, Kenneth L.; Eriksen, Jacob; Milan-Lobo, Laura; Han, Daniel S.; Niv, Masha Y.; Ammendrup-Johnsen, Ina; Henriksen, Ulla; Bhatia, Vikram K.; Stamou, Dimitrios; Sitte, Harald H.; McMahon, Harvey T.; Weinstein, Harel; Gether, Ulrik

    2013-01-01

    The PSD-95/Discs-large/ZO-1 homology (PDZ) domain protein, protein interacting with C kinase 1 (PICK1) contains a C-terminal Bin/amphiphysin/Rvs (BAR) domain mediating recognition of curved membranes; however, the molecular mechanisms controlling the activity of this domain are poorly understood. In agreement with negative regulation of the BAR domain by the N-terminal PDZ domain, PICK1 distributed evenly in the cytoplasm, whereas truncation of the PDZ domain caused BAR domain-dependent redistribution to clusters colocalizing with markers of recycling endosomal compartments. A similar clustering was observed both upon truncation of a short putative α-helical segment in the linker between the PDZ and the BAR domains and upon coexpression of PICK1 with a transmembrane PDZ ligand, including the alpha-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptor GluR2 subunit, the GluR2 C-terminus transferred to the single transmembrane protein Tac or the dopamine transporter C-terminus transferred to Tac. In contrast, transfer of the GluR2 C-terminus to cyan fluorescent protein, a cytosolic protein, did not elicit BAR domain-dependent clustering. Instead, localizing PICK1 to the membrane by introducing an N-terminal myristoylation site produced BAR domain-dependent, but ligand-independent, PICK1 clustering. The data support that in the absence of PDZ ligand, the PICK1 BAR domain is inhibited through a PDZ domain-dependent and linker-dependent mechanism. Moreover, they suggest that unmasking of the BAR domain’s membrane-binding capacity is not a consequence of ligand binding to the PDZ domain per se but results from, and coincides with, recruitment of PICK1 to a membrane compartment. PMID:18466293

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

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

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

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

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

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

  16. Adaptive Meshless Local Petrov-Galerkin Method with Variable Domain of Influence in 2D Elastostatic Problems

    Directory of Open Access Journals (Sweden)

    Pamuda Pudjisuryadi

    2008-01-01

    Full Text Available A meshless local Petrov-Galerkin (MLPG method that employs polygonal sub-domains constructed from several triangular patches rather than the typically used circular sub-domains is presented. Moving least-squares approximation is used to construct the trial displacements and linear, Lagrange interpolation functions are used to construct the test functions. An adaptive technique to improve the accuracy of approximate solutions is developed to minimize the computational cost. Variable domain of influence (VDOI and effective stress gradient indicator (EK for local error assessment are the focus of this study. Several numerical examples are presented to verify the efficiency and accuracy of the proposed adaptive MLPG method. The results show that the proposed adaptive technique performs as expected that is refining the problem domain in area with high stress concentration in which higher accuracy is commonly required.

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

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

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

  20. Documentation and localization of force-mediated filamin A domain perturbations in moving cells

    Science.gov (United States)

    Nakamura, Fumihiko; Song, Mia; Hartwig, John H.; Stossel, Thomas P.

    2014-08-01

    Endogenously and externally generated mechanical forces influence diverse cellular activities, a phenomenon defined as mechanotransduction. Deformation of protein domains by application of stress, previously documented to alter macromolecular interactions in vitro, could mediate these effects. We engineered a photon-emitting system responsive to unfolding of two repeat domains of the actin filament (F-actin) crosslinker protein filamin A (FLNA) that binds multiple partners involved in cell signalling reactions and validated the system using F-actin networks subjected to myosin-based contraction. Expressed in cultured cells, the sensor-containing FLNA construct reproducibly reported FLNA domain unfolding strikingly localized to dynamic, actively protruding, leading cell edges. The unfolding signal depends upon coherence of F-actin-FLNA networks and is enhanced by stimulating cell contractility. The results establish protein domain distortion as a bona fide mechanism for mechanotransduction in vivo.

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

  2. Eliminating the domain error in local explicitly correlated second-order Møller-Plesset perturbation theory.

    Science.gov (United States)

    Werner, Hans-Joachim

    2008-09-14

    A new explicitly correlated local MP2-F12 method is proposed in which the error caused by truncating the virtual orbital space to pair-specific local domains is almost entirely removed. This is achieved by a simple modification of the ansatz for the explicitly correlated wave function, which makes it possible that the explicitly correlated terms correct both for the basis set incompleteness error as well as for the domain error in the LMP2. Benchmark calculations are presented for 21 molecules and 16 chemical reactions. The results demonstrate that the local approximations have hardly any effect on the accuracy of the computed correlation energies and reaction energies, and the LMP2-F12 reaction energies agree within 0.1-0.2 kcal/mol with estimated MP2 basis set limits.

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

  4. Centimeter-order view for magnetic domain imaging with local magnetization direction by longitudinal Kerr effect

    Directory of Open Access Journals (Sweden)

    Sakae Meguro

    2016-05-01

    Full Text Available An observation system of centimeter-order of view of magnetic domain with local magnetization direction was developed by designing a telecentric optical system of finite design through the extension of microscope technology. The field of view realized in the developed system was 1.40 × 1.05 cm as suppressing defocus and distortion. Detection of the local magnetization direction has become possible by longitudinal Kerr observation from the orthogonal two directions. This system can be applied to the domain observation of rough surface samples and time resolved analysis for soft magnetic materials such as amorphous foil strips and soft magnetic thin films.

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

  6. The effect of phase assemblages, grain boundaries and domain structure on the local switching behavior of rare-earth modified bismuth ferrite ceramics

    International Nuclear Information System (INIS)

    Alikin, Denis O.; Turygin, Anton P.; Walker, Julian; Bencan, Andreja; Malic, Barbara; Rojac, Tadej; Shur, Vladimir Ya.; Kholkin, Andrei L.

    2017-01-01

    Piezoelectric properties and ferroelectric/ferroelastic domain switching behavior of polycrystalline ceramics are strongly influenced by local scale (i.e. <100 nm) phenomena, such as, the phase assemblages, domain structure, and defects. The method of ceramic synthesis strongly effects the local properties and thus plays a critical role in determining the macroscopic ferroelectric and piezoelectric performance. The link between synthesis and local scale properties of ferroelectrics is, however, rarely reported, especially for the emerging lead-free materials systems. In this work, we focus on samarium modified bismuth ferrite ceramics (Bi_0_._8_8Sm_0_._1_2FeO_3, BSFO) prepared by two methods: standard solid state reaction (SSR) and mechanochemi≿ally assisted synthesis (MAS). Each ceramic possesses different properties at the local scale and we used the piezoresponse force microscopy (PFM) complemented by transmission electron microscopy (TEM) to evaluate phase distribution, domain structure and polarization switching to show that an increase in the anti-polar phase assemblages within the polar matrix leads to notable changes in the local polarization switching. SSR ceramics exhibit larger internal bias fields relative to the MAS ceramics, and the grain boundaries produce a stronger effect on the local switching response. MAS ceramics were able to nucleate domains at lower electric-fields and grow them at faster rates, reaching larger final domain sizes than the SSR ceramics. Local evidence of the electric-field induced phase transition from the anti-ferroelectric Pbam to ferroelectric R3c phase was observed together with likely evidence of the existence of head-to-head/tail-to-tail charged domain walls and domain vortex core structures. By comparing the domain structure and local switching behavior of ceramics prepared by two different methods this work brings new insights the synthesis-structure-property relationship in lead-free piezoceramics.

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

  8. Strain localization at the margins of strong lithospheric domains: insights from analogue models

    NARCIS (Netherlands)

    Calignano, Elisa; Sokoutis, Dimitrios; Willingshofer, Ernst; Gueydan, Frederic; Cloetingh, Sierd

    The lateral variation of the mechanical properties of continental lithosphere is an important factor controlling the localization of deformation and thus the deformation history and geometry of intra-plate mountain belts. A series of three-layer lithospheric-scale analog models, with a strong domain

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

  10. Introduction and pinning of domain walls in 50 nm NiFe constrictions using local and external magnetic fields

    International Nuclear Information System (INIS)

    Zahnd, G.; Pham, V.T.; Marty, A.; Jamet, M.; Beigné, C.; Notin, L.; Vergnaud, C.; Rortais, F.; Vila, L.; Attané, J.-P.

    2016-01-01

    We study domain wall injection in 100 nm wide NiFe nanowires, followed by domain wall propagation and pinning on 50 nm wide constrictions. The injection is performed using local and external magnetic fields. Using several nucleation pad geometries, we show that at these small dimensions the use of an external field only does not allow obtaining a reproducible injection/pinning process. However, the use of an additional local field, created by an Oersted line, allows to nucleate a reversed domain at zero external applied field. Then, an external field of 5 mT enables the domain wall to propagate far from the Oersted line, and the pinning occurs reproducibly. We also show that notwithstanding the reproducibility of the pinning process, the depinning field is found to be stochastic, following a bimodal distribution. Using micromagnetic simulation we link two different DW configurations, vortex and transverse, to the two typical depinning fields. - Highlights: • Magnetic domain wall introduction and pinning in Permalloy nanowires with 50 nm wide constrictions. • Magnetic domain nucleation at zero external applied field. • Bimodal distribution of the domain wall configuration in the constriction.

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

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

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

  14. Randomness and locality in quantum mechanics

    International Nuclear Information System (INIS)

    Bub, J.

    1976-01-01

    This paper considers the problem of representing the statistical states of a quantum mechanical system by measures on a classical probability space. The Kochen and Specker theorem proves the impossibility of embedding the possibility structure of a quantum mechanical system into a Boolean algebra. It is shown that a hidden variable theory involves a Boolean representation which is not an embedding, and that such a representation cannot recover the quantum statistics for sequential probabilities without introducing a randomization process for the hidden variables which is assumed to apply only on measurement. It is suggested that the relation of incompatability is to be understood as a type of stochastic independence, and that the indeterminism of a quantum mechanical system is engendered by the existence of independent families of properties. Thus, the statistical relations reflect the possibility structure of the system: the probabilities are logical. The hidden variable thesis is influenced by the Copenhagen interpretation of quantum mechanics, i.e. by some version of the disturbance theory of measurement. Hence, the significance of the representation problem is missed, and the completeness of quantum mechanics is seen to turn on the possibility of recovering the quantum statistics by a hidden variable scheme which satisfies certain physically motivated conditions, such as locality. Bell's proof that no local hidden variable theory can reproduce the statistical relations of quantum mechanics is considered. (Auth.)

  15. Local coexpression domains of two to four genes in the genome of Arabidopsis

    NARCIS (Netherlands)

    Ren, X.Y.; Fiers, M.W.E.J.; Stiekema, W.J.; Nap, J.P.H.

    2005-01-01

    Expression of genes in eukaryotic genomes is known to cluster, but cluster size is generally loosely defined and highly variable. We have here taken a very strict definition of cluster as sets of physically adjacent genes that are highly coexpressed and form so-called local coexpression domains. The

  16. Asymptotically exact localized expansions for signals in the time–frequency domain

    International Nuclear Information System (INIS)

    Muzhikyan, Aramazd H; Avanesyan, Gagik T

    2012-01-01

    Based on a unique waveform with strong exponential localization property, an exact mathematical method for solving problems in signal analysis in the time–frequency domain is presented. An analogue of the Gabor frame exposes the non-commutative geometry of the time–frequency plane. Signals are visualized using the constructed graphical representation. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Coherent states: mathematical and physical aspects’. (paper)

  17. Local homotopy theory

    CERN Document Server

    Jardine, John F

    2015-01-01

    This monograph on the homotopy theory of topologized diagrams of spaces and spectra gives an expert account of a subject at the foundation of motivic homotopy theory and the theory of topological modular forms in stable homotopy theory. Beginning with an introduction to the homotopy theory of simplicial sets and topos theory, the book covers core topics such as the unstable homotopy theory of simplicial presheaves and sheaves, localized theories, cocycles, descent theory, non-abelian cohomology, stacks, and local stable homotopy theory. A detailed treatment of the formalism of the subject is interwoven with explanations of the motivation, development, and nuances of ideas and results. The coherence of the abstract theory is elucidated through the use of widely applicable tools, such as Barr's theorem on Boolean localization, model structures on the category of simplicial presheaves on a site, and cocycle categories. A wealth of concrete examples convey the vitality and importance of the subject in topology, n...

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

  19. Variances as order parameter and complexity measure for random Boolean networks

    Energy Technology Data Exchange (ETDEWEB)

    Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)

    2005-02-04

    Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.

  20. The C-terminal domain of TRPV4 is essential for plasma membrane localization.

    Science.gov (United States)

    Becker, Daniel; Müller, Margarethe; Leuner, Kristina; Jendrach, Marina

    2008-02-01

    Many members of the TRP superfamily oligomerize in the ER before trafficking to the plasma membrane. For membrane localization of the non-selective cation channel TRPV4 specific domains in the N-terminus are required, but the role of the C-terminus in the oligomerization and trafficking process has been not determined until now. Therefore, the localization of recombinant TRPV4 in two cell models was analyzed: HaCaT keratinocytes that express TRPV4 endogenously were compared to CHO cells that are devoid of endogenous TRPV4. When deletions were introduced in the C-terminal domain three states of TRPV4 localization were defined: a truncated TRPV4 protein of 855 amino acids was exported to the plasma membrane like the full-length channel (871 aa) and was also functional. Mutants with a length of 828 to 844 amino acids remained in the ER of CHO cells, but in HaCaT cells plasma membrane localization was partially rescued by oligomerization with endogenous TRPV4. This was confirmed by coexpression of recombinant full-length TRPV4 together with these deletion mutants, which resulted in an almost complete plasma membrane localization of both proteins and significant FRET in the plasma membrane and the ER. All deletions upstream of amino acid 828 resulted in total ER retention that could not rescued by coexpression with the full-length protein. However, these deletion mutants did not impair export of full-length TRPV4, implying that no oligomerization took place. These data indicate that the C-terminus of TRPV4 is required for oligomerization, which takes place in the ER and precedes plasma membrane trafficking.

  1. A note on eigenfrequency sensitivities and structural eigenfrequency optimization based on local sub-domain frequencies

    DEFF Research Database (Denmark)

    Pedersen, Pauli; Pedersen, Niels Leergaard

    2014-01-01

    foundation. A numerical heuristic redesign procedure is proposed and illustrated with examples. For the ideal case, an optimality criterion is fulfilled if the design have the same sub-domain frequency (local Rayleigh quotient). Sensitivity analysis shows an important relation between squared system...... eigenfrequency and squared local sub-domain frequency for a given eigenmode. Higher order eigenfrequenciesmay also be controlled in this manner. The presented examples are based on 2D finite element models with the use of subspace iteration for analysis and a heuristic recursive design procedure based...... on the derived optimality condition. The design that maximize a frequency depend on the total amount of available material and on a necessary interpolation as illustrated by different design cases.In this note we have assumed a linear and conservative eigenvalue problem without multiple eigenvalues. The presence...

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

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

  4. Characterization of a baculovirus nuclear localization signal domain in the late expression factor 3 protein

    International Nuclear Information System (INIS)

    Au, Victoria; Yu Mei; Carstens, Eric B.

    2009-01-01

    The baculovirus Autographa californica multicapsid nucleopolyhedrovirus (AcMNPV) single-stranded DNA binding protein LEF-3 is a multi-functional protein that is required to transport the helicase protein P143 into the nucleus of infected cells where they function to replicate viral DNA. The N-terminal 56 amino acid region of LEF-3 is required for nuclear transport. In this report, we analyzed the effect of site-specific mutagenesis of LEF-3 on its intracellular distribution. Fluorescence microscopy of expression plasmid-transfected cells demonstrated that the residues 28 to 32 formed the core nuclear localization signal, but other adjacent positively-charged residues augmented these sequences. Comparison with other group I Alphabaculoviruses suggested that this core region functionally duplicated residues including 18 and 19. This was demonstrated by the loss of nuclear localization when the equivalent residues (18 to 20) in Choristoneura fumiferana nucleopolyhedrovirus (CfMNPV) LEF-3 were mutated. The AcMNPV LEF-3 nuclear localization domain was also shown to drive nuclear transport in mammalian cells indicating that the protein nuclear import systems in insect and mammalian cells are conserved. We also demonstrated by mutagenesis that two conserved cysteine residues located at 82 and 106 were not essential for nuclear localization or for interaction with P143. However, by using a modified construct of P143 that localized on its own to the nucleus, we demonstrated that a functional nuclear localization domain on LEF-3 was required for interaction between LEF-3 and P143

  5. .Gov Domains API

    Data.gov (United States)

    General Services Administration — This dataset offers the list of all .gov domains, including state, local, and tribal .gov domains. It does not include .mil domains, or other federal domains outside...

  6. The effectivenes of science domain-based science learning integrated with local potency

    Science.gov (United States)

    Kurniawati, Arifah Putri; Prasetyo, Zuhdan Kun; Wilujeng, Insih; Suryadarma, I. Gusti Putu

    2017-08-01

    This research aimed to determine the significant effect of science domain-based science learning integrated with local potency toward science process skills. The research method used was a quasi-experimental design with nonequivalent control group design. The population of this research was all students of class VII SMP Negeri 1 Muntilan. The sample of this research was selected through cluster random sampling, namely class VII B as an experiment class (24 students) and class VII C as a control class (24 students). This research used a test instrument that was adapted from Agus Dwianto's research. The aspect of science process skills in this research was observation, classification, interpretation and communication. The analysis of data used the one factor anova at 0,05 significance level and normalized gain score. The significance level result of science process skills with one factor anova is 0,000. It shows that the significance level < alpha (0,05). It means that there was significant effect of science domain-based science learning integrated with local potency toward science learning process skills. The results of analysis show that the normalized gain score are 0,29 (low category) in control class and 0,67 (medium category) in experiment class.

  7. An Amphiphysin-Like Domain in Fus2p Is Required for Rvs161p Interaction and Cortical Localization

    Directory of Open Access Journals (Sweden)

    Richard A. Stein

    2016-02-01

    Full Text Available Cell–cell fusion fulfils essential roles in fertilization, development and tissue repair. In the budding yeast, Saccharomyces cerevisiae, fusion between two haploid cells of opposite mating type generates the diploid zygote. Fus2p is a pheromone-induced protein that regulates cell wall removal during mating. Fus2p shuttles from the nucleus to localize at the shmoo tip, bound to Rvs161p, an amphiphysin. However, Rvs161p independently binds a second amphiphysin, Rvs167p, playing an essential role in endocytosis. To understand the basis of the Fus2p–Rvs161p interaction, we analyzed Fus2p structural domains. A previously described N-terminal domain (NTD is necessary and sufficient to regulate nuclear/cytoplasmic trafficking of Fus2p. The Dbl homology domain (DBH binds GTP-bound Cdc42p; binding is required for cell fusion, but not localization. We identified an approximately 200 amino acid region of Fus2p that is both necessary and sufficient for Rvs161p binding. The Rvs161p binding domain (RBD contains three predicted alpha-helices; structural modeling suggests that the RBD adopts an amphiphysin-like structure. The RBD contains a 13-amino-acid region, conserved with Rvs161p and other amphiphysins, which is essential for binding. Mutations in the RBD, predicted to affect membrane binding, abolish cell fusion without affecting Rvs161p binding. We propose that Fus2p/Rvs161p form a novel heterodimeric amphiphysin required for cell fusion. Rvs161p binding is required but not sufficient for Fus2p localization. Mutations in the C-terminal domain (CTD of Fus2p block localization, but not Rvs161p binding, causing a significant defect in cell fusion. We conclude that the Fus2p CTD mediates an additional, Rvs161p-independent interaction at the shmoo tip.

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

  9. The identification of FANCD2 DNA binding domains reveals nuclear localization sequences.

    Science.gov (United States)

    Niraj, Joshi; Caron, Marie-Christine; Drapeau, Karine; Bérubé, Stéphanie; Guitton-Sert, Laure; Coulombe, Yan; Couturier, Anthony M; Masson, Jean-Yves

    2017-08-21

    Fanconi anemia (FA) is a recessive genetic disorder characterized by congenital abnormalities, progressive bone-marrow failure, and cancer susceptibility. The FA pathway consists of at least 21 FANC genes (FANCA-FANCV), and the encoded protein products interact in a common cellular pathway to gain resistance against DNA interstrand crosslinks. After DNA damage, FANCD2 is monoubiquitinated and accumulates on chromatin. FANCD2 plays a central role in the FA pathway, using yet unidentified DNA binding regions. By using synthetic peptide mapping and DNA binding screen by electromobility shift assays, we found that FANCD2 bears two major DNA binding domains predominantly consisting of evolutionary conserved lysine residues. Furthermore, one domain at the N-terminus of FANCD2 bears also nuclear localization sequences for the protein. Mutations in the bifunctional DNA binding/NLS domain lead to a reduction in FANCD2 monoubiquitination and increase in mitomycin C sensitivity. Such phenotypes are not fully rescued by fusion with an heterologous NLS, which enable separation of DNA binding and nuclear import functions within this domain that are necessary for FANCD2 functions. Collectively, our results enlighten the importance of DNA binding and NLS residues in FANCD2 to activate an efficient FA pathway. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

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

  11. Localization of Simultaneous Moving Sound Sources for Mobile Robot Using a Frequency-Domain Steered Beamformer Approach

    OpenAIRE

    Valin, Jean-Marc; Michaud, François; Hadjou, Brahim; Rouat, Jean

    2016-01-01

    Mobile robots in real-life settings would benefit from being able to localize sound sources. Such a capability can nicely complement vision to help localize a person or an interesting event in the environment, and also to provide enhanced processing for other capabilities such as speech recognition. In this paper we present a robust sound source localization method in three-dimensional space using an array of 8 microphones. The method is based on a frequency-domain implementation of a steered...

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

  13. Domain-induced activation of human phospholipase A2 type IIA: Local versus global lipid composition

    DEFF Research Database (Denmark)

    Leidy, C.; Linderoth, L.; Andresen, T.L.

    2006-01-01

    , we show that local enrichment of anionic lipids into fluid domains triggers PLA(2)-IIA activity. In addition, the compositional range of enzyme activity is shown to be related to the underlying lipid phase diagram. A comparison is done between PLA(2)-IIA and snake venom PLA(2), which in contrast...... to PLA(2)-IIA hydrolyzes both anionic and zwitterionic membranes. In general, this work shows that PLA(2)-IIA activation can be accomplished through local enrichment of anionic lipids into domains, indicating a mechanism for PLA(2)-IIA to target perturbed native membranes with low global anionic lipid...

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

  15. Non-local effect in Brillouin optical time-domain analyzer based on Raman amplification

    International Nuclear Information System (INIS)

    Jia Xinhong; Rao Yunjiang; Wang Zinan; Zhang Weili; Ran Zengling; Deng Kun; Yang Zixin

    2012-01-01

    Compared with conventional Brillouin optical time-domain analyzer (BOTDA), the BOTDA based on Raman amplification allows longer sensing range, higher signal-to-noise ratio and higher measurement accuracy. However, the non-local effect induced by pump depletion significantly restricts the probe optical power injected to sensing fiber, thereby limiting the further extension for sensing distance. In this paper, the coupled equations including the interaction of probe light, Brillouin and Raman pumps are applied to the study on the non-local characteristics of BOTDA based on Raman amplification. The results show that, the system error induced by non-local effect worsens with increased powers of probe wave and Raman pump. The frequency-division-multiplexing (cascading the fibers with various Brillouin frequency shifts) and time-division-multiplexing (modulating both of the Brillouin pump and probe lights) technologies are efficient approaches to suppress the non-local effect, through shortening the effective interaction range between Brillouin pump and probe lights. (authors)

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

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

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

  19. Molecular basis of the specific subcellular localization of the C2-like domain of 5-lipoxygenase.

    Science.gov (United States)

    Kulkarni, Shilpa; Das, Sudipto; Funk, Colin D; Murray, Diana; Cho, Wonhwa

    2002-04-12

    The activation of 5-lipoxygenase (5-LO) involves its calcium-dependent translocation to the nuclear envelope, where it catalyzes the two-step transformation of arachidonic acid into leukotriene A(4), leading to the synthesis of various leukotrienes. To understand the mechanism by which 5-LO is specifically targeted to the nuclear envelope, we studied the membrane binding properties of the amino-terminal domain of 5-LO, which has been proposed to have a C2 domain-like structure. The model building, electrostatic potential calculation, and in vitro membrane binding studies of the isolated C2-like domain of 5-LO and selected mutants show that this Ca(2+)-dependent domain selectively binds zwitterionic phosphatidylcholine, which is conferred by tryptophan residues (Trp(13), Trp(75), and Trp(102)) located in the putative Ca(2+)-binding loops. The spatiotemporal dynamics of the enhanced green fluorescence protein-tagged C2-like domain of 5-LO and mutants in living cells also show that the phosphatidylcholine selectivity of the C2-like domain accounts for the specific targeting of 5-LO to the nuclear envelope. Together, these results show that the C2-like domain of 5-LO is a genuine Ca(2+)-dependent membrane-targeting domain and that the subcellular localization of the domain is governed in large part by its membrane binding properties.

  20. An N-terminal nuclear localization sequence but not the calmodulin-binding domain mediates nuclear localization of nucleomorphin, a protein that regulates nuclear number in Dictyostelium

    International Nuclear Information System (INIS)

    Myre, Michael A.; O'Day, Danton H.

    2005-01-01

    Nucleomorphin is a novel nuclear calmodulin (CaM)-binding protein (CaMBP) containing an extensive DEED (glu/asp repeat) domain that regulates nuclear number. GFP-constructs of the 38 kDa NumA1 isoform localize as intranuclear patches adjacent to the inner nuclear membrane. The translocation of CaMBPs into nuclei has previously been shown by others to be mediated by both classic nuclear localization sequences (NLSs) and CaM-binding domains (CaMBDs). Here we show that NumA1 possesses a CaMBD ( 171 EDVSRFIKGKLLQKQQKIYKDLERF 195 ) containing both calcium-dependent-binding motifs and an IQ-like motif for calcium-independent binding. GFP-constructs containing only NumA1 residues 1-129, lacking the DEED and CaMBDs, still localized as patches at the internal periphery of nuclei thus ruling out a direct role for the CaMBD in nuclear import. These constructs contained the amino acid residues 48 KKSYQDPEIIAHSRPRK 64 that include both a putative bipartite and classical NLS. GFP-bipartite NLS constructs localized uniformly within nuclei but not as patches. As with previous work, removal of the DEED domain resulted in highly multinucleate cells. However as shown here, multinuclearity only occurred when the NLS was present allowing the protein to enter nuclei. Site-directed mutation analysis in which the NLS was changed to 48 EF 49 abolished the stability of the GFP fusion at the protein but not RNA level preventing subcellular analyses. Cells transfected with the 48 EF 49 construct exhibited slowed growth when compared to parental AX3 cells and other GFP-NumA1 deletion mutants. In addition to identifying an NLS that is sufficient for nuclear translocation of nucleomorphin and ruling out CaM-binding in this event, this work shows that the nuclear localization of NumA1 is crucial to its ability to regulate nuclear number in Dictyostelium

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

  2. Protein Sub-Nuclear Localization Prediction Using SVM and Pfam Domain Information

    Science.gov (United States)

    Kumar, Ravindra; Jain, Sohni; Kumari, Bandana; Kumar, Manish

    2014-01-01

    The nucleus is the largest and the highly organized organelle of eukaryotic cells. Within nucleus exist a number of pseudo-compartments, which are not separated by any membrane, yet each of them contains only a specific set of proteins. Understanding protein sub-nuclear localization can hence be an important step towards understanding biological functions of the nucleus. Here we have described a method, SubNucPred developed by us for predicting the sub-nuclear localization of proteins. This method predicts protein localization for 10 different sub-nuclear locations sequentially by combining presence or absence of unique Pfam domain and amino acid composition based SVM model. The prediction accuracy during leave-one-out cross-validation for centromeric proteins was 85.05%, for chromosomal proteins 76.85%, for nuclear speckle proteins 81.27%, for nucleolar proteins 81.79%, for nuclear envelope proteins 79.37%, for nuclear matrix proteins 77.78%, for nucleoplasm proteins 76.98%, for nuclear pore complex proteins 88.89%, for PML body proteins 75.40% and for telomeric proteins it was 83.33%. Comparison with other reported methods showed that SubNucPred performs better than existing methods. A web-server for predicting protein sub-nuclear localization named SubNucPred has been established at http://14.139.227.92/mkumar/subnucpred/. Standalone version of SubNucPred can also be downloaded from the web-server. PMID:24897370

  3. The extracytoplasmic domain of the Mycobacterium tuberculosis Ser/Thr kinase PknB binds specific muropeptides and is required for PknB localization.

    Science.gov (United States)

    Mir, Mushtaq; Asong, Jinkeng; Li, Xiuru; Cardot, Jessica; Boons, Geert-Jan; Husson, Robert N

    2011-07-01

    The Mycobacterium tuberculosis Ser/Thr kinase PknB has been implicated in the regulation of cell growth and morphology in this organism. The extracytoplasmic domain of this membrane protein comprises four penicillin binding protein and Ser/Thr kinase associated (PASTA) domains, which are predicted to bind stem peptides of peptidoglycan. Using a comprehensive library of synthetic muropeptides, we demonstrate that the extracytoplasmic domain of PknB binds muropeptides in a manner dependent on the presence of specific amino acids at the second and third positions of the stem peptide, and on the presence of the sugar moiety N-acetylmuramic acid linked to the peptide. We further show that PknB localizes strongly to the mid-cell and also to the cell poles, and that the extracytoplasmic domain is required for PknB localization. In contrast to strong growth stimulation by conditioned medium, we observe no growth stimulation of M. tuberculosis by a synthetic muropeptide with high affinity for the PknB PASTAs. We do find a moderate effect of a high affinity peptide on resuscitation of dormant cells. While the PASTA domains of PknB may play a role in stimulating growth by binding exogenous peptidoglycan fragments, our data indicate that a major function of these domains is for proper PknB localization, likely through binding of peptidoglycan fragments produced locally at the mid-cell and the cell poles. These data suggest a model in which PknB is targeted to the sites of peptidoglycan turnover to regulate cell growth and cell division.

  4. The extracytoplasmic domain of the Mycobacterium tuberculosis Ser/Thr kinase PknB binds specific muropeptides and is required for PknB localization.

    Directory of Open Access Journals (Sweden)

    Mushtaq Mir

    2011-07-01

    Full Text Available The Mycobacterium tuberculosis Ser/Thr kinase PknB has been implicated in the regulation of cell growth and morphology in this organism. The extracytoplasmic domain of this membrane protein comprises four penicillin binding protein and Ser/Thr kinase associated (PASTA domains, which are predicted to bind stem peptides of peptidoglycan. Using a comprehensive library of synthetic muropeptides, we demonstrate that the extracytoplasmic domain of PknB binds muropeptides in a manner dependent on the presence of specific amino acids at the second and third positions of the stem peptide, and on the presence of the sugar moiety N-acetylmuramic acid linked to the peptide. We further show that PknB localizes strongly to the mid-cell and also to the cell poles, and that the extracytoplasmic domain is required for PknB localization. In contrast to strong growth stimulation by conditioned medium, we observe no growth stimulation of M. tuberculosis by a synthetic muropeptide with high affinity for the PknB PASTAs. We do find a moderate effect of a high affinity peptide on resuscitation of dormant cells. While the PASTA domains of PknB may play a role in stimulating growth by binding exogenous peptidoglycan fragments, our data indicate that a major function of these domains is for proper PknB localization, likely through binding of peptidoglycan fragments produced locally at the mid-cell and the cell poles. These data suggest a model in which PknB is targeted to the sites of peptidoglycan turnover to regulate cell growth and cell division.

  5. The nuclear localization of low risk HPV11 E7 protein mediated by its zinc binding domain is independent of nuclear import receptors

    International Nuclear Information System (INIS)

    Piccioli, Zachary; McKee, Courtney H.; Leszczynski, Anna; Onder, Zeynep; Hannah, Erin C.; Mamoor, Shahan; Crosby, Lauren; Moroianu, Junona

    2010-01-01

    We investigated the nuclear import of low risk HPV11 E7 protein using 1) transfection assays in HeLa cells with EGFP fusion plasmids containing 11E7 and its domains and 2) nuclear import assays in digitonin-permeabilized HeLa cells with GST fusion proteins containing 11E7 and its domains. The EGFP-11E7 and EGFP-11cE7 39-98 localized mostly to the nucleus. The GST-11E7 and GST-11cE7 39-98 were imported into the nuclei in the presence of either Ran-GDP or RanG19V-GTP mutant and in the absence of nuclear import receptors. This suggests that 11E7 enters the nucleus via a Ran-dependent pathway, independent of nuclear import receptors, mediated by a nuclear localization signal located in its C-terminal domain (cNLS). This cNLS contains the zinc binding domain consisting of two copies of Cys-X-X-Cys motif. Mutagenesis of Cys residues in these motifs changed the localization of the EGFP-11cE7/-11E7 mutants to cytoplasmic, suggesting that the zinc binding domain is essential for nuclear localization of 11E7.

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

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

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

    Directory of Open Access Journals (Sweden)

    A. A. Butov

    2014-01-01

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

  9. A fraction of Crm1 locates at centrosomes by its CRIME domain and regulates the centrosomal localization of pericentrin

    International Nuclear Information System (INIS)

    Liu, Qinying; Jiang, Qing; Zhang, Chuanmao

    2009-01-01

    Crm1 plays a role in exporting proteins containing nuclear export signals (NESs) from the nucleus to the cytoplasm. Some proteins that are capable of interacting with Ran/Crm1 were reported to be localized at centrosomes and to function as centrosome checkpoints. But it remains unclear how Crm1 locates at centrosomes. In this study, we found that a fraction of Crm1 is located at centrosomes through its N-terminal CRM1, importin β etc. (CRIME) domain, which is responsible for interacting with RanGTP, suggesting that Crm1 might target to centrosomes through binding centrosomal RanGTP. Moreover, overexpression of the CRIME domain, which is free of NES binding domain, resulted in the dissociation of pericentrin and γ-tubulin complex from centrosomes and the disruption of microtubule nucleation. Deficiency of Crm1 provoked by RNAi also decreased the spindle poles localization of pericentrin and γ-tubulin complex, coupled with mitotic defects. Since pericentrin was sensitive to Crm1 specific inhibitor leptomycin B, we propose that the centrosomal Crm1 might interact with pericentrin and regulate the localization and function of pericentrin at centrosomes.

  10. Correlation of Bulk Dielectric and Piezoelectric Properties to the Local Scale Phase Transformations, Domain Morphology, and Crystal Structure Modified

    Energy Technology Data Exchange (ETDEWEB)

    Priya, Shashank [Virginia Polytechnic Inst. and State Univ. (Virginia Tech), Blacksburg, VA (United States); Viehland, Dwight [Virginia Polytechnic Inst. and State Univ. (Virginia Tech), Blacksburg, VA (United States)

    2014-12-14

    Three year program entitled “Correlation of bulk dielectric and piezoelectric properties to the local scale phase transformations, domain morphology, and crystal structure in modified lead-free grain-textured ceramics and single crystals” was supported by the Department of Energy. This was a joint research program between D. Viehland and S. Priya at Virginia Tech. Single crystal and textured ceramics have been synthesized and characterized. Our goals have been (i) to conduct investigations of lead-free piezoelectric systems to establish the local structural and domain morphologies that result in enhanced properties, and (ii) to synthesize polycrystalline and grain oriented ceramics for understanding the role of composition, microstructure, and anisotropy

  11. Requirement of the coiled-coil domain of PML-RARα oncoprotein for localization, sumoylation, and inhibition of monocyte differentiation

    International Nuclear Information System (INIS)

    Kim, Young-Eui; Kim, Dong-Yeon; Lee, Jang-Mi; Kim, Seong-Tae; Han, Tae-Hee; Ahn, Jin-Hyun

    2005-01-01

    Homo-oligomerization via a coiled-coil (C-C) domain has been shown to be necessary for the promyelocytic leukemia (PML)-retinoic acid receptor-α (RARα) fusion protein to acquire oncogenic potential in acute promyelocytic leukemia. We show here that PML(ΔC-C)-RARα, which contains a deletion in its C-C domain, is neither localized as characteristic microspeckles nor modified by small ubiquitin-like modifiers (SUMO). The absence of sumoylation of the ΔC-C mutant was due to the lack of binding to Ubc9, a SUMO conjugation enzyme. The integrity of RING finger domain was also needed for both sumoylation and microspeckle formation. In GAL4-DNA tethering assays, the ΔC-C mutant completely lost the inhibitory effect on retinoic acid (RA)-mediated transactivation. Furthermore, the expression of CD14 in U937 cells expressing the ΔC-C mutant in response to vitamin D3 was markedly higher than in cells expressing PML-RARα. However, the RA-mediated induction of C/EBPβ in cells expressing the ΔC-C mutant was comparable to that of control cells. Thus, our results suggest that the C-C domain-associated functions of sumoylation, localization as microspeckles, and the inhibition of monocyte differentiation all contribute to the oncogenic activity of PML-RARα

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

  13. When Gravity Fails: Local Search Topology

    Science.gov (United States)

    Frank, Jeremy; Cheeseman, Peter; Stutz, John; Lau, Sonie (Technical Monitor)

    1997-01-01

    Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\\em plateau moves), dominate the time spent in local search. We analyze and characterize {\\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

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

  15. DPP6 domains responsible for its localization and function.

    Science.gov (United States)

    Lin, Lin; Long, Laura K; Hatch, Michael M; Hoffman, Dax A

    2014-11-14

    Dipeptidyl peptidase-like protein 6 (DPP6) is an auxiliary subunit of the Kv4 family of voltage-gated K(+) channels known to enhance channel surface expression and potently accelerate their kinetics. DPP6 is a single transmembrane protein, which is structurally remarkable for its large extracellular domain. Included in this domain is a cysteine-rich motif, the function of which is unknown. Here we show that this cysteine-rich domain of DPP6 is required for its export from the ER and expression on the cell surface. Disulfide bridges formed at C349/C356 and C465/C468 of the cysteine-rich domain are necessary for the enhancement of Kv4.2 channel surface expression but not its interaction with Kv4.2 subunits. The short intracellular N-terminal and transmembrane domains of DPP6 associates with and accelerates the recovery from inactivation of Kv4.2, but the entire extracellular domain is necessary to enhance Kv4.2 surface expression and stabilization. Our findings show that the cysteine-rich domain of DPP6 plays an important role in protein folding of DPP6 that is required for transport of DPP6/Kv4.2 complexes out of the ER. © 2014 by The American Society for Biochemistry and Molecular Biology, Inc.

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

  17. The N-terminal 33 amino acid domain of Siva-1 is sufficient for nuclear localization

    Energy Technology Data Exchange (ETDEWEB)

    Chen, J.Y.; Yang, L.X. [Institute of Human Virology, Zhongshan School of Medicine, Sun Yat-sen University, Guangzhou (China); Huang, Z.F. [Institute of Human Virology, Zhongshan School of Medicine, Sun Yat-sen University, Guangzhou (China); Department of Biochemistry, Zhongshan School of Medicine, Sun Yat-sen University, Guangzhou (China); Key Laboratory of Tropical Diseases Control, Sun Yat-sen University, Ministry of Education in China, Guangzhou (China)

    2013-12-02

    Siva-1 induces apoptosis in multiple pathological processes and plays an important role in the suppression of tumor metastasis, protein degradation, and other functions. Although many studies have demonstrated that Siva-1 functions in the cytoplasm, a few have found that Siva-1 can relocate to the nucleus. In this study, we found that the first 33 amino acid residues of Siva-1 are required for its nuclear localization. Further study demonstrated that the green fluorescent protein can be imported into the nucleus after fusion with these 33 amino acid residues. Other Siva-1 regions and domains showed less effect on Siva-1 nuclear localization. By site-mutagenesis of all of these 33 amino acid residues, we found that mutants of the first 1-18 amino acids affected Siva-1 nuclear compartmentalization but could not complete this localization independently. In summary, we demonstrated that the N-terminal 33 amino acid residues were sufficient for Siva-1 nuclear localization, but the mechanism of this translocation needs additional investigation.

  18. The N-terminal 33 amino acid domain of Siva-1 is sufficient for nuclear localization

    International Nuclear Information System (INIS)

    Chen, J.Y.; Yang, L.X.; Huang, Z.F.

    2013-01-01

    Siva-1 induces apoptosis in multiple pathological processes and plays an important role in the suppression of tumor metastasis, protein degradation, and other functions. Although many studies have demonstrated that Siva-1 functions in the cytoplasm, a few have found that Siva-1 can relocate to the nucleus. In this study, we found that the first 33 amino acid residues of Siva-1 are required for its nuclear localization. Further study demonstrated that the green fluorescent protein can be imported into the nucleus after fusion with these 33 amino acid residues. Other Siva-1 regions and domains showed less effect on Siva-1 nuclear localization. By site-mutagenesis of all of these 33 amino acid residues, we found that mutants of the first 1-18 amino acids affected Siva-1 nuclear compartmentalization but could not complete this localization independently. In summary, we demonstrated that the N-terminal 33 amino acid residues were sufficient for Siva-1 nuclear localization, but the mechanism of this translocation needs additional investigation

  19. Local mobility in lipid domains of supported bilayers characterized by atomic force microscopy and fluorescence correlation spectroscopy.

    Energy Technology Data Exchange (ETDEWEB)

    Frankel, Daniel J.; Buranda, T. (University of New Mexico, Albuquerque, NM); Burns, Alan Richard

    2005-01-01

    Fluorescence correlation spectroscopy (FCS) is used to examine mobility of labeled probes at specific sites in supported bilayers consisting of 1,2-dipalmitoyl-sn-glycero-3-phosphocholine (DPPC) lipid domains in 1,2-dioleoyl-sn-glycero-3-phosphocholine (DOPC). Those sites are mapped beforehand with simultaneous atomic force microscopy and submicron confocal fluorescence imaging, allowing characterization of probe partitioning between gel DPPC and disordered liquid DOPC domains with corresponding topography of domain structure. We thus examine the relative partitioning and mobility in gel and disordered liquid phases for headgroup- and tailgroup-labeled GM1 ganglioside probes and for headgroup- and tailgroup-labeled phospholipid probes. For the GM1 probes, large differences in mobility between fluid and gel domains are observed; whereas unexpected mobility is observed in submicron gel domains for the phospholipid probes. We attribute the latter to domain heterogeneities that could be induced by the probe. Furthermore, fits to the FCS data for the phospholipid probes in the DOPC fluid phase require two components (fast and slow). Although proximity to the glass substrate may be a factor, local distortion of the probe by the fluorophore could also be important. Overall, we observe nonideal aspects of phospholipid probe mobility and partitioning that may not be restricted to supported bilayers.

  20. Multifunctionalities driven by ferroic domains

    Science.gov (United States)

    Yang, J. C.; Huang, Y. L.; He, Q.; Chu, Y. H.

    2014-08-01

    Considerable attention has been paid to ferroic systems in pursuit of advanced applications in past decades. Most recently, the emergence and development of multiferroics, which exhibit the coexistence of different ferroic natures, has offered a new route to create functionalities in the system. In this manuscript, we step from domain engineering to explore a roadmap for discovering intriguing phenomena and multifunctionalities driven by periodic domain patters. As-grown periodic domains, offering exotic order parameters, periodic local perturbations and the capability of tailoring local spin, charge, orbital and lattice degrees of freedom, are introduced as modeling templates for fundamental studies and novel applications. We discuss related significant findings on ferroic domain, nanoscopic domain walls, and conjunct heterostructures based on the well-organized domain patterns, and end with future prospects and challenges in the field.

  1. An innovative application of time-domain spectroscopy on localized surface plasmon resonance sensing

    Science.gov (United States)

    Li, Meng-Chi; Chang, Ying-Feng; Wang, Huai-Yi; Lin, Yu-Xen; Kuo, Chien-Cheng; Annie Ho, Ja-An; Lee, Cheng-Chung; Su, Li-Chen

    2017-03-01

    White-light scanning interferometry (WLSI) is often used to study the surface profiles and properties of thin films because the strength of the technique lies in its ability to provide fast and high resolution measurements. An innovative attempt is made in this paper to apply WLSI as a time-domain spectroscopic system for localized surface plasmon resonance (LSPR) sensing. A WLSI-based spectrometer is constructed with a breadboard of WLSI in combination with a spectral centroid algorithm for noise reduction and performance improvement. Experimentally, the WLSI-based spectrometer exhibits a limit of detection (LOD) of 1.2 × 10-3 refractive index units (RIU), which is better than that obtained with a conventional UV-Vis spectrometer, by resolving the LSPR peak shift. Finally, the bio-applicability of the proposed spectrometer was investigated using the rs242557 tau gene, an Alzheimer’s and Parkinson’s disease biomarker. The LOD was calculated as 15 pM. These results demonstrate that the proposed WLSI-based spectrometer could become a sensitive time-domain spectroscopic biosensing platform.

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

  3. Mechanistic applicability domain classification of a local lymph node assay dataset for skin sensitization.

    Science.gov (United States)

    Roberts, David W; Patlewicz, Grace; Kern, Petra S; Gerberick, Frank; Kimber, Ian; Dearman, Rebecca J; Ryan, Cindy A; Basketter, David A; Aptula, Aynur O

    2007-07-01

    The goal of eliminating animal testing in the predictive identification of chemicals with the intrinsic ability to cause skin sensitization is an important target, the attainment of which has recently been brought into even sharper relief by the EU Cosmetics Directive and the requirements of the REACH legislation. Development of alternative methods requires that the chemicals used to evaluate and validate novel approaches comprise not only confirmed skin sensitizers and non-sensitizers but also substances that span the full chemical mechanistic spectrum associated with skin sensitization. To this end, a recently published database of more than 200 chemicals tested in the mouse local lymph node assay (LLNA) has been examined in relation to various chemical reaction mechanistic domains known to be associated with sensitization. It is demonstrated here that the dataset does cover the main reaction mechanistic domains. In addition, it is shown that assignment to a reaction mechanistic domain is a critical first step in a strategic approach to understanding, ultimately on a quantitative basis, how chemical properties influence the potency of skin sensitizing chemicals. This understanding is necessary if reliable non-animal approaches, including (quantitative) structure-activity relationships (Q)SARs, read-across, and experimental chemistry based models, are to be developed.

  4. Eps homology domain endosomal transport proteins differentially localize to the neuromuscular junction

    Directory of Open Access Journals (Sweden)

    Mate Suzanne E

    2012-09-01

    Full Text Available Abstract Background Recycling of endosomes is important for trafficking and maintenance of proteins at the neuromuscular junction (NMJ. We have previously shown high expression of the endocytic recycling regulator Eps15 homology domain-containing (EHD1 proteinin the Torpedo californica electric organ, a model tissue for investigating a cholinergic synapse. In this study, we investigated the localization of EHD1 and its paralogs EHD2, EHD3, and EHD4 in mouse skeletal muscle, and assessed the morphological changes in EHD1−/− NMJs. Methods Localization of the candidate NMJ protein EHD1 was assessed by confocal microscopy analysis of whole-mount mouse skeletal muscle fibers after direct gene transfer and immunolabeling. The potential function of EHD1 was assessed by specific force measurement and α-bungarotoxin-based endplate morphology mapping in EHD1−/− mouse skeletal muscle. Results Endogenous EHD1 localized to primary synaptic clefts of murine NMJ, and this localization was confirmed by expression of recombinant green fluorescent protein labeled-EHD1 in murine skeletal muscle in vivo. EHD1−/− mouse skeletal muscle had normal histology and NMJ morphology, and normal specific force generation during muscle contraction. The EHD 1–4 proteins showed differential localization in skeletal muscle: EHD2 to muscle vasculature, EHD3 to perisynaptic regions, and EHD4 to perinuclear regions and to primary synaptic clefts, but at lower levels than EHD1. Additionally, specific antibodies raised against mammalian EHD1-4 recognized proteins of the expected mass in the T. californica electric organ. Finally, we found that EHD4 expression was more abundant in EHD1−/− mouse skeletal muscle than in wild-type skeletal muscle. Conclusion EHD1 and EHD4 localize to the primary synaptic clefts of the NMJ. Lack of obvious defects in NMJ structure and muscle function in EHD1−/− muscle may be due to functional compensation by other EHD paralogs.

  5. The N-terminal domains of Vps3 and Vps8 are critical for localization and function of the CORVET tethering complex on endosomes.

    Directory of Open Access Journals (Sweden)

    Nadine Epp

    Full Text Available Endosomal biogenesis depends on multiple fusion and fission events. For fusion, the heterohexameric CORVET complex as an effector of the endosomal Rab5/Vps21 GTPase has a central function in the initial tethering event. Here, we show that the CORVET-specific Vps3 and Vps8 subunits, which interact with Rab5/Vps21, require their N-terminal domains for localization and function. Surprisingly, CORVET may lack either one of the two N-terminal domains, but not both, to promote protein sorting via the endosome. The dually truncated complex mislocalizes to the cytosol and is impaired in endocytic protein sorting, but not in assembly. Furthermore, the endosomal localization can be rescued by overexpression of Vps21 or one of the truncated CORVET subunits, even though CORVET assembly is not impaired by loss of the N-terminal domains or in strains lacking all endosomal Rab5s and Ypt7. We thus conclude that CORVET requires only its C-terminal domains for assembly and has beyond its putative β-propeller domains additional binding sites for endosomes, which could be important to bind Vps21 and other endosome-specific factors for efficient endosome tethering.

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

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

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

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

  10. Membrane Localization is Critical for Activation of the PICK1 BAR Domain

    OpenAIRE

    Madsen, Kenneth L.; Eriksen, Jacob; Milan-Lobo, Laura; Han, Daniel S.; Niv, Masha Y.; Ammendrup-Johnsen, Ina; Henriksen, Ulla; Bhatia, Vikram K.; Stamou, Dimitrios; Sitte, Harald H.; McMahon, Harvey T.; Weinstein, Harel; Gether, Ulrik

    2008-01-01

    The PSD-95/Discs-large/ZO-1 homology (PDZ) domain protein, protein interacting with C kinase 1 (PICK1) contains a C-terminal Bin/amphiphysin/Rvs (BAR) domain mediating recognition of curved membranes; however, the molecular mechanisms controlling the activity of this domain are poorly understood. In agreement with negative regulation of the BAR domain by the N-terminal PDZ domain, PICK1 distributed evenly in the cytoplasm, whereas truncation of the PDZ domain caused BAR domain-dependent redis...

  11. Detection of local birefringence in embedded fiber Bragg grating caused by concentrated transverse load using optical frequency domain reflectometry

    Science.gov (United States)

    Wada, D.; Murayama, H.; Igawa, H.

    2014-05-01

    We investigate the capability of local birefringence detection in an embedded fiber Bragg grating (FBG) using optical frequency domain reflectometry. We embed an FBG into carbon fiber reinforced plastic specimen, and conduct 3-point bending test. The cross-sectional stresses are applied to the FBG at the loading location in addition to the non-uniform longitudinal strain distribution over the length of the FBG. The local birefringence due to the cross-sectional stresses was successfully detected while the non-uniform longitudinal strain distribution was accurately measured.

  12. The SPOR Domain, a Widely Conserved Peptidoglycan Binding Domain That Targets Proteins to the Site of Cell Division.

    Science.gov (United States)

    Yahashiri, Atsushi; Jorgenson, Matthew A; Weiss, David S

    2017-07-15

    Sporulation-related repeat (SPOR) domains are small peptidoglycan (PG) binding domains found in thousands of bacterial proteins. The name "SPOR domain" stems from the fact that several early examples came from proteins involved in sporulation, but SPOR domain proteins are quite diverse and contribute to a variety of processes that involve remodeling of the PG sacculus, especially with respect to cell division. SPOR domains target proteins to the division site by binding to regions of PG devoid of stem peptides ("denuded" glycans), which in turn are enriched in septal PG by the intense, localized activity of cell wall amidases involved in daughter cell separation. This targeting mechanism sets SPOR domain proteins apart from most other septal ring proteins, which localize via protein-protein interactions. In addition to SPOR domains, bacteria contain several other PG-binding domains that can exploit features of the cell wall to target proteins to specific subcellular sites. Copyright © 2017 American Society for Microbiology.

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

  14. Three-dimensional local ALE-FEM method for fluid flow in domains containing moving boundaries/objects interfaces

    Energy Technology Data Exchange (ETDEWEB)

    Carrington, David Bradley [Los Alamos National Laboratory (LANL), Los Alamos, NM (United States); Monayem, A. K. M. [Univ. of New Mexico, Albuquerque, NM (United States); Mazumder, H. [Univ. of New Mexico, Albuquerque, NM (United States); Heinrich, Juan C. [Univ. of New Mexico, Albuquerque, NM (United States)

    2015-03-05

    A three-dimensional finite element method for the numerical simulations of fluid flow in domains containing moving rigid objects or boundaries is developed. The method falls into the general category of Arbitrary Lagrangian Eulerian methods; it is based on a fixed mesh that is locally adapted in the immediate vicinity of the moving interfaces and reverts to its original shape once the moving interfaces go past the elements. The moving interfaces are defined by separate sets of marker points so that the global mesh is independent of interface movement and the possibility of mesh entanglement is eliminated. The results is a fully robust formulation capable of calculating on domains of complex geometry with moving boundaries or devises that can also have a complex geometry without danger of the mesh becoming unsuitable due to its continuous deformation thus eliminating the need for repeated re-meshing and interpolation. Moreover, the boundary conditions on the interfaces are imposed exactly. This work is intended to support the internal combustion engines simulator KIVA developed at Los Alamos National Laboratories. The model's capabilities are illustrated through application to incompressible flows in different geometrical settings that show the robustness and flexibility of the technique to perform simulations involving moving boundaries in a three-dimensional domain.

  15. Local Stereo Matching Using Adaptive Local Segmentation

    NARCIS (Netherlands)

    Damjanovic, S.; van der Heijden, Ferdinand; Spreeuwers, Lieuwe Jan

    We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The

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

  17. Time domain localization technique with sparsity constraint for imaging acoustic sources

    Science.gov (United States)

    Padois, Thomas; Doutres, Olivier; Sgard, Franck; Berry, Alain

    2017-09-01

    This paper addresses source localization technique in time domain for broadband acoustic sources. The objective is to accurately and quickly detect the position and amplitude of noise sources in workplaces in order to propose adequate noise control options and prevent workers hearing loss or safety risk. First, the generalized cross correlation associated with a spherical microphone array is used to generate an initial noise source map. Then a linear inverse problem is defined to improve this initial map. Commonly, the linear inverse problem is solved with an l2 -regularization. In this study, two sparsity constraints are used to solve the inverse problem, the orthogonal matching pursuit and the truncated Newton interior-point method. Synthetic data are used to highlight the performances of the technique. High resolution imaging is achieved for various acoustic sources configurations. Moreover, the amplitudes of the acoustic sources are correctly estimated. A comparison of computation times shows that the technique is compatible with quasi real-time generation of noise source maps. Finally, the technique is tested with real data.

  18. Domain-to-domain coupling in voltage-sensing phosphatase.

    Science.gov (United States)

    Sakata, Souhei; Matsuda, Makoto; Kawanabe, Akira; Okamura, Yasushi

    2017-01-01

    Voltage-sensing phosphatase (VSP) consists of a transmembrane voltage sensor and a cytoplasmic enzyme region. The enzyme region contains the phosphatase and C2 domains, is structurally similar to the tumor suppressor phosphatase PTEN, and catalyzes the dephosphorylation of phosphoinositides. The transmembrane voltage sensor is connected to the phosphatase through a short linker region, and phosphatase activity is induced upon membrane depolarization. Although the detailed molecular characteristics of the voltage sensor domain and the enzyme region have been revealed, little is known how these two regions are coupled. In addition, it is important to know whether mechanism for coupling between the voltage sensor domain and downstream effector function is shared among other voltage sensor domain-containing proteins. Recent studies in which specific amino acid sites were genetically labeled using a fluorescent unnatural amino acid have enabled detection of the local structural changes in the cytoplasmic region of Ciona intestinalis VSP that occur with a change in membrane potential. The results of those studies provide novel insight into how the enzyme activity of the cytoplasmic region of VSP is regulated by the voltage sensor domain.

  19. Hum-mPLoc 3.0: prediction enhancement of human protein subcellular localization through modeling the hidden correlations of gene ontology and functional domain features.

    Science.gov (United States)

    Zhou, Hang; Yang, Yang; Shen, Hong-Bin

    2017-03-15

    Protein subcellular localization prediction has been an important research topic in computational biology over the last decade. Various automatic methods have been proposed to predict locations for large scale protein datasets, where statistical machine learning algorithms are widely used for model construction. A key step in these predictors is encoding the amino acid sequences into feature vectors. Many studies have shown that features extracted from biological domains, such as gene ontology and functional domains, can be very useful for improving the prediction accuracy. However, domain knowledge usually results in redundant features and high-dimensional feature spaces, which may degenerate the performance of machine learning models. In this paper, we propose a new amino acid sequence-based human protein subcellular location prediction approach Hum-mPLoc 3.0, which covers 12 human subcellular localizations. The sequences are represented by multi-view complementary features, i.e. context vocabulary annotation-based gene ontology (GO) terms, peptide-based functional domains, and residue-based statistical features. To systematically reflect the structural hierarchy of the domain knowledge bases, we propose a novel feature representation protocol denoted as HCM (Hidden Correlation Modeling), which will create more compact and discriminative feature vectors by modeling the hidden correlations between annotation terms. Experimental results on four benchmark datasets show that HCM improves prediction accuracy by 5-11% and F 1 by 8-19% compared with conventional GO-based methods. A large-scale application of Hum-mPLoc 3.0 on the whole human proteome reveals proteins co-localization preferences in the cell. www.csbio.sjtu.edu.cn/bioinf/Hum-mPLoc3/. hbshen@sjtu.edu.cn. Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

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

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

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

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

  4. Membrane localization is critical for activation of the PICK1 BAR domain

    DEFF Research Database (Denmark)

    Madsen, Kenneth L; Eriksen, Jacob; Milan-Lobo, Laura

    2008-01-01

    The PSD-95/Discs-large/ZO-1 homology (PDZ) domain protein, protein interacting with C kinase 1 (PICK1) contains a C-terminal Bin/amphiphysin/Rvs (BAR) domain mediating recognition of curved membranes; however, the molecular mechanisms controlling the activity of this domain are poorly understood....

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

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

  7. A domain decomposition approach for full-field measurements based identification of local elastic parameters

    KAUST Repository

    Lubineau, Gilles

    2015-03-01

    We propose a domain decomposition formalism specifically designed for the identification of local elastic parameters based on full-field measurements. This technique is made possible by a multi-scale implementation of the constitutive compatibility method. Contrary to classical approaches, the constitutive compatibility method resolves first some eigenmodes of the stress field over the structure rather than directly trying to recover the material properties. A two steps micro/macro reconstruction of the stress field is performed: a Dirichlet identification problem is solved first over every subdomain, the macroscopic equilibrium is then ensured between the subdomains in a second step. We apply the method to large linear elastic 2D identification problems to efficiently produce estimates of the material properties at a much lower computational cost than classical approaches.

  8. Distinct domains within the NITROGEN LIMITATION ADAPTATION protein mediate its subcellular localization and function in the nitrate-dependent phosphate homeostasis pathway

    Science.gov (United States)

    The NITROGEN LIMITATION ADAPTATION (NLA) protein is a RING-type E3 ubiquitin ligase that plays an essential role in the regulation of nitrogen and phosphate homeostasis. NLA is localized to two distinct subcellular sites, the plasma membrane and nucleus, and contains four distinct domains: i) a RING...

  9. Identifying interactions in the time and frequency domains in local and global networks - A Granger Causality Approach.

    Science.gov (United States)

    Zou, Cunlu; Ladroue, Christophe; Guo, Shuixia; Feng, Jianfeng

    2010-06-21

    Reverse-engineering approaches such as Bayesian network inference, ordinary differential equations (ODEs) and information theory are widely applied to deriving causal relationships among different elements such as genes, proteins, metabolites, neurons, brain areas and so on, based upon multi-dimensional spatial and temporal data. There are several well-established reverse-engineering approaches to explore causal relationships in a dynamic network, such as ordinary differential equations (ODE), Bayesian networks, information theory and Granger Causality. Here we focused on Granger causality both in the time and frequency domain and in local and global networks, and applied our approach to experimental data (genes and proteins). For a small gene network, Granger causality outperformed all the other three approaches mentioned above. A global protein network of 812 proteins was reconstructed, using a novel approach. The obtained results fitted well with known experimental findings and predicted many experimentally testable results. In addition to interactions in the time domain, interactions in the frequency domain were also recovered. The results on the proteomic data and gene data confirm that Granger causality is a simple and accurate approach to recover the network structure. Our approach is general and can be easily applied to other types of temporal data.

  10. Identifying interactions in the time and frequency domains in local and global networks - A Granger Causality Approach

    Directory of Open Access Journals (Sweden)

    Guo Shuixia

    2010-06-01

    Full Text Available Abstract Background Reverse-engineering approaches such as Bayesian network inference, ordinary differential equations (ODEs and information theory are widely applied to deriving causal relationships among different elements such as genes, proteins, metabolites, neurons, brain areas and so on, based upon multi-dimensional spatial and temporal data. There are several well-established reverse-engineering approaches to explore causal relationships in a dynamic network, such as ordinary differential equations (ODE, Bayesian networks, information theory and Granger Causality. Results Here we focused on Granger causality both in the time and frequency domain and in local and global networks, and applied our approach to experimental data (genes and proteins. For a small gene network, Granger causality outperformed all the other three approaches mentioned above. A global protein network of 812 proteins was reconstructed, using a novel approach. The obtained results fitted well with known experimental findings and predicted many experimentally testable results. In addition to interactions in the time domain, interactions in the frequency domain were also recovered. Conclusions The results on the proteomic data and gene data confirm that Granger causality is a simple and accurate approach to recover the network structure. Our approach is general and can be easily applied to other types of temporal data.

  11. Differential Regulation of Disheveled in a Novel Vegetal Cortical Domain in Sea Urchin Eggs and Embryos: Implications for the Localized Activation of Canonical Wnt Signaling

    Science.gov (United States)

    Peng, ChiehFu Jeff; Wikramanayake, Athula H.

    2013-01-01

    Pattern formation along the animal-vegetal (AV) axis in sea urchin embryos is initiated when canonical Wnt (cWnt) signaling is activated in vegetal blastomeres. The mechanisms that restrict cWnt signaling to vegetal blastomeres are not well understood, but there is increasing evidence that the egg’s vegetal cortex plays a critical role in this process by mediating localized “activation” of Disheveled (Dsh). To investigate how Dsh activity is regulated along the AV axis, sea urchin-specific Dsh antibodies were used to examine expression, subcellular localization, and post-translational modification of Dsh during development. Dsh is broadly expressed during early sea urchin development, but immunolocalization studies revealed that this protein is enriched in a punctate pattern in a novel vegetal cortical domain (VCD) in the egg. Vegetal blastomeres inherit this VCD during embryogenesis, and at the 60-cell stage Dsh puncta are seen in all cells that display nuclear β-catenin. Analysis of Dsh post-translational modification using two-dimensional Western blot analysis revealed that compared to Dsh pools in the bulk cytoplasm, this protein is differentially modified in the VCD and in the 16-cell stage micromeres that partially inherit this domain. Dsh localization to the VCD is not directly affected by disruption of microfilaments and microtubules, but unexpectedly, microfilament disruption led to degradation of all the Dsh pools in unfertilized eggs over a period of incubation suggesting that microfilament integrity is required for maintaining Dsh stability. These results demonstrate that a pool of differentially modified Dsh in the VCD is selectively inherited by the vegetal blastomeres that activate cWnt signaling in early embryos, and suggests that this domain functions as a scaffold for localized Dsh activation. Localized cWnt activation regulates AV axis patterning in many metazoan embryos. Hence, it is possible that the VCD is an evolutionarily conserved

  12. The heparin-binding domain of HB-EGF mediates localization to sites of cell-cell contact and prevents HB-EGF proteolytic release

    Energy Technology Data Exchange (ETDEWEB)

    Prince, Robin N.; Schreiter, Eric R.; Zou, Peng; Wiley, H. S.; Ting, Alice Y.; Lee, Richard T.; Lauffenburger, Douglas A.

    2010-07-01

    Heparin-binding EGF-like growth factor (HB-EGF) is a ligand for EGF receptor (EGFR) and possesses the ability to signal in juxtacrine, autocrine and/or paracrine mode, with these alternatives being governed by the degree of proteolytic release of the ligand. Although the spatial range of diffusion of released HB-EGF is restricted by binding heparan-sulfate proteoglycans (HSPGs) in the extracellular matrix and/or cellular glycocalyx, ascertaining mechanisms governing non-released HB-EGF localization is also important for understanding its effects. We have employed a new method for independently tracking the localization of the extracellular EGFlike domain of HB-EGF and the cytoplasmic C-terminus. A striking observation was the absence of the HB-EGF transmembrane proform from the leading edge of COS-7 cells in a wound-closure assay; instead, this protein localized in regions of cell-cell contact. A battery of detailed experiments found that this localization derives from a trans interaction between extracellular HSPGs and the HBEGF heparin-binding domain, and that disruption of this interaction leads to increased release of soluble ligand and a switch in cell phenotype from juxtacrine-induced growth inhibition to autocrine-induced proliferation. Our results indicate that extracellular HSPGs serve to sequester the transmembrane pro-form of HB-EGF at the point of cell-cell contact, and that this plays a role in governing the balance between juxtacrine versus autocrine and paracrine signaling.

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

  14. The morphing method as a flexible tool for adaptive local/non-local simulation of static fracture

    KAUST Repository

    Azdoud, Yan

    2014-04-19

    We introduce a framework that adapts local and non-local continuum models to simulate static fracture problems. Non-local models based on the peridynamic theory are promising for the simulation of fracture, as they allow discontinuities in the displacement field. However, they remain computationally expensive. As an alternative, we develop an adaptive coupling technique based on the morphing method to restrict the non-local model adaptively during the evolution of the fracture. The rest of the structure is described by local continuum mechanics. We conduct all simulations in three dimensions, using the relevant discretization scheme in each domain, i.e., the discontinuous Galerkin finite element method in the peridynamic domain and the continuous finite element method in the local continuum mechanics domain. © 2014 Springer-Verlag Berlin Heidelberg.

  15. Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

    Science.gov (United States)

    Xu, Gang; Li, Ming; Mourrain, Bernard; Rabczuk, Timon; Xu, Jinlan; Bordas, Stéphane P. A.

    2018-01-01

    In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach.

  16. Site-specific genomic (SSG and random domain-localized (RDL mutagenesis in yeast

    Directory of Open Access Journals (Sweden)

    Honigberg Saul M

    2004-04-01

    Full Text Available Abstract Background A valuable weapon in the arsenal available to yeast geneticists is the ability to introduce specific mutations into yeast genome. In particular, methods have been developed to introduce deletions into the yeast genome using PCR fragments. These methods are highly efficient because they do not require cloning in plasmids. Results We have modified the existing method for introducing deletions in the yeast (S. cerevisiae genome using PCR fragments in order to target point mutations to this genome. We describe two PCR-based methods for directing point mutations into the yeast genome such that the final product contains no other disruptions. In the first method, site-specific genomic (SSG mutagenesis, a specific point mutation is targeted into the genome. In the second method, random domain-localized (RDL mutagenesis, a mutation is introduced at random within a specific domain of a gene. Both methods require two sequential transformations, the first transformation integrates the URA3 marker into the targeted locus, and the second transformation replaces URA3 with a PCR fragment containing one or a few mutations. This PCR fragment is synthesized using a primer containing a mutation (SSG mutagenesis or is synthesized by error-prone PCR (RDL mutagenesis. In SSG mutagenesis, mutations that are proximal to the URA3 site are incorporated at higher frequencies than distal mutations, however mutations can be introduced efficiently at distances of at least 500 bp from the URA3 insertion. In RDL mutagenesis, to ensure that incorporation of mutations occurs at approximately equal frequencies throughout the targeted region, this region is deleted at the same time URA3 is integrated. Conclusion SSG and RDL mutagenesis allow point mutations to be easily and efficiently incorporated into the yeast genome without disrupting the native locus.

  17. Domain wall networks on solitons

    International Nuclear Information System (INIS)

    Sutcliffe, Paul

    2003-01-01

    Domain wall networks on the surface of a soliton are studied in a simple theory. It consists of two complex scalar fields, in 3+1 dimensions, with a global U(1)xZ n symmetry, where n>2. Solutions are computed numerically in which one of the fields forms a Q ball and the other field forms a network of domain walls localized on the surface of the Q ball. Examples are presented in which the domain walls lie along the edges of a spherical polyhedron, forming junctions at its vertices. It is explained why only a small restricted class of polyhedra can arise as domain wall networks

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

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

  20. Non-volatile polarization switch of magnetic domain wall velocity

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Z.; Stolichnov, I.; Setter, N. [Ceramics Laboratory, EPFL-Swiss Federal Institute of Technology, Lausanne 1015 (Switzerland); Bernand-Mantel, A.; Schott, Marine; Pizzini, S.; Ranno, L. [University of Grenoble Alpes, Institut Néel, F-38042 Grenoble (France); CNRS, Institut Néel, F-38042 Grenoble (France); Auffret, S.; Gaudin, G. [SPINTEC, UMR-8191, CEA/CNRS/UJF/GINP, INAC, F-38054 Grenoble (France)

    2015-12-21

    Controlled propagation speed of individual magnetic domains in metal channels at the room temperature is obtained via the non-volatile field effect associated with the switchable polarization of P(VDF-TrFE) (polyvinylidene fluoride-trifluoroethylene) ferroelectric polymer. Polarization domains directly written using conducting atomic force microscope probe locally accelerate/decelerate the magnetic domains in the 0.6 nm thick Co film. The change of the magnetic domain wall velocity is consistent with the magnetic anisotropy energy modulation through the polarization upward/downward orientation. Excellent retention is observed. The demonstrated local non-destructive and reversible change of magnetic properties via rewritable patterning of ferroelectric domains could be attractive for exploring the ultimate limit of miniaturization in devices based on ferromagnetic/ferroelectric bilayers.

  1. Optical Coherence Tomography Noise Reduction Using Anisotropic Local Bivariate Gaussian Mixture Prior in 3D Complex Wavelet Domain

    OpenAIRE

    Rabbani, Hossein; Sonka, Milan; Abramoff, Michael D.

    2013-01-01

    In this paper, MMSE estimator is employed for noise-free 3D OCT data recovery in 3D complex wavelet domain. Since the proposed distribution for noise-free data plays a key role in the performance of MMSE estimator, a priori distribution for the pdf of noise-free 3D complex wavelet coefficients is proposed which is able to model the main statistical properties of wavelets. We model the coefficients with a mixture of two bivariate Gaussian pdfs with local parameters which are able to capture th...

  2. NBS1 localizes to gamma-H2AX foci through interaction with the FHA/BRCT domain

    International Nuclear Information System (INIS)

    Kobayashi, J.; Chen, D.J.; Sakamoto, S.; Matsuura, S.; Tanimoto, K.; Komatsu, K.

    2003-01-01

    Full text: DNA double-strand breaks (DSBs) represent the most potentially serious damage to a genome, and hence, many repair proteins are recruited to nuclear damage sites by as yet poorly characterized sensor mechanisms. Histone H2AX, one of histone H2A family, is phosphorylated within a few minutes in response to ionizing radiation (IR) and the phosphorylated H2AX (gamma-H2AX) forms foci at the region of DSBs. Moreover, Histone H2AX is essential for the IR-induced focus formation of DNA repair proteins such as BRCA1, NBS1 and 53BP1. Hence, we investigated that the function of histone H2AX for the recruitment of NBS1/hMRE11/ hRAD50 complex to DSBs sites. We clarify that NBS1 physically interacts with histone H2AX independent of DNA. We also show that the NBS1-binding can occur in the absence of interaction with hMRE11 or BRCA1. Furthermore, this NBS1 physical interaction was reduced when anti-gamma-H2AX antibody was introduced into normal cells. We also demonstrate that the FHA/BRCT domain of NBS1 is essential for this physical interaction by the immunoprecipitation studies and a pull-down assay with recombinant FHA/BRCT domain. These findings suggest that the FHA/BRCT domain have a crucial role for both binding to histone and for re-localization of hMRE11/hRAD50 nuclease complex to the vicinity of DNA damage

  3. Domain-size-dependent exchange bias in Co/LaFeO3

    Energy Technology Data Exchange (ETDEWEB)

    Scholl, A.; Nolting, F.; Seo, J.W.; Ohldag, H.; Stohr, J.; Raoux,S.; Locquet, J.-P.; Fompeyrine, J.

    2004-09-22

    X-ray microscopy using magnetic linear dichroism of a zero-field-grown, multi-domain Co/LaFeO{sub 3} ferromagnet/antiferromagnet sample shows a local exchange bias of random direction and magnitude. A statistical analysis of the local bias of individual, micron-size magnetic domains demonstrates an increasing bias field with decreasing domain size as expected for a random distribution of pinned, uncompensated spins, which are believed to mediate the interface coupling. A linear dependence with the inverse domain diameter is found.

  4. Localization of epileptogenic zones in Lennox–Gastaut syndrome using frequency domain source imaging of intracranial electroencephalography: a preliminary investigation

    International Nuclear Information System (INIS)

    Cho, Jae-Hyun; Jung, Young-Jin; Kim, Jeong-Youn; Im, Chang-Hwan; Kang, Hoon-Chul; Kim, Heung Dong; Yoon, Dae Sung; Lee, Yong-Ho

    2013-01-01

    Although intracranial electroencephalography (iEEG) has been widely used to localize epileptogenic zones in epilepsy, visual inspection of iEEG recordings does not always result in a favorable surgical outcome, especially in secondary generalized epilepsy such as Lennox–Gastaut syndrome (LGS). Various computational iEEG analysis methods have recently been introduced to confirm the visual inspection results. Of these methods, high gamma oscillation in iEEG has attracted interest because a series of studies have reported a close relationship between epileptogenic zones and cortical areas with high gamma oscillation. Meanwhile, frequency domain source imaging of EEG and MEG oscillations has proven to be a useful auxiliary tool for identifying rough locations of epileptogenic zones. To the best of our knowledge, however, frequency domain source imaging of high gamma iEEG oscillations has not been studied. In this study, we investigated whether the iEEG-based frequency domain source imaging of high gamma oscillation (60–100 Hz) would be a useful supplementary tool for identifying epileptogenic zones in patients with secondary generalized epilepsy. The method was applied to three successfully operated on LGS patients, whose iEEG contained some ictal events with distinct high gamma oscillations before seizure onset. The resultant cortical source distributions were compared with surgical resection areas and with high gamma spectral power distributions on the intracranial sensor plane. While the results of the sensor-level analyses contained many spurious activities, the results of frequency domain source imaging coincided better with the surgical resection areas, suggesting that the frequency domain source imaging of iEEG high gamma oscillations might help enhance the accuracy of pre-surgical evaluations of patients with secondary generalized epilepsy. (paper)

  5. Localization of Daucus carota NMCP1 to the nuclear periphery: the role of the N-terminal region and an NLS-linked sequence motif, RYNLRR, in the tail domain

    Directory of Open Access Journals (Sweden)

    Yuta eKimura

    2014-02-01

    Full Text Available Recent ultrastructural studies revealed that a structure similar to the vertebrate nuclear lamina exists in the nuclei of higher plants. However, plant genomes lack genes for lamins and intermediate-type filament proteins, and this suggests that plant-specific nuclear coiled-coil proteins make up the lamina-like structure in plants. NMCP1 is a protein, first identified in Daucus carota cells, that localizes exclusively to the nuclear periphery in interphase cells. It has a tripartite structure comprised of head, rod, and tail domains, and includes putative nuclear localization signal (NLS motifs. We identified the functional NLS of DcNMCP1 (carrot NMCP1 and determined the protein regions required for localizing to the nuclear periphery using EGFP-fused constructs transiently expressed in Apium graveolens epidermal cells. Transcription was driven under a CaMV35S promoter, and the genes were introduced into the epidermal cells by a DNA-coated microprojectile delivery system. Of the NLS motifs, KRRRK and RRHK in the tail domain were highly functional for nuclear localization. Addition of the N-terminal 141 amino acids from DcNMCP1 shifted the localization of a region including these NLSs from the entire nucleus to the nuclear periphery. Using this same construct, the replacement of amino acids in RRHK or its preceding sequence, YNL, with alanine residues abolished localization to the nuclear periphery, while replacement of KRRRK did not affect localization. The sequence R/Q/HYNLRR/H, including YNL and the first part of the sequence of RRHK, is evolutionarily conserved in a subclass of NMCP1 sequences from many plant species. These results show that NMCP1 localizes to the nuclear periphery by a combined action of a sequence composed of R/Q/HYNLRR/H, NLS, and the N-terminal region including the head and a portion of the rod domain, suggesting that more than one binding site is implicated in localization of NMCP1.

  6. EH domain of EHD1

    Energy Technology Data Exchange (ETDEWEB)

    Kieken, Fabien; Jovic, Marko; Naslavsky, Naava; Caplan, Steve, E-mail: scaplan@unmc.edu; Sorgen, Paul L. [University of Nebraska Medical Center, Department of Biochemistry and Molecular Biology and Eppley Cancer Center (United States)], E-mail: psorgen@unmc.edu

    2007-12-15

    EHD1 is a member of the mammalian C-terminal Eps15 homology domain (EH) containing protein family, and regulates the recycling of various receptors from the endocytic recycling compartment to the plasma membrane. The EH domain of EHD1 binds to proteins containing either an Asn-Pro-Phe or Asp-Pro-Phe motif, and plays an important role in the subcellular localization and function of EHD1. Thus far, the structures of five N-terminal EH domains from other proteins have been solved, but to date, the structure of the EH domains from the four C-terminal EHD family paralogs remains unknown. In this study, we have assigned the 133 C-terminal residues of EHD1, which includes the EH domain, and solved its solution structure. While the overall structure resembles that of the second of the three N-terminal Eps15 EH domains, potentially significant differences in surface charge and the structure of the tripeptide-binding pocket are discussed.

  7. EH domain of EHD1

    International Nuclear Information System (INIS)

    Kieken, Fabien; Jovic, Marko; Naslavsky, Naava; Caplan, Steve; Sorgen, Paul L.

    2007-01-01

    EHD1 is a member of the mammalian C-terminal Eps15 homology domain (EH) containing protein family, and regulates the recycling of various receptors from the endocytic recycling compartment to the plasma membrane. The EH domain of EHD1 binds to proteins containing either an Asn-Pro-Phe or Asp-Pro-Phe motif, and plays an important role in the subcellular localization and function of EHD1. Thus far, the structures of five N-terminal EH domains from other proteins have been solved, but to date, the structure of the EH domains from the four C-terminal EHD family paralogs remains unknown. In this study, we have assigned the 133 C-terminal residues of EHD1, which includes the EH domain, and solved its solution structure. While the overall structure resembles that of the second of the three N-terminal Eps15 EH domains, potentially significant differences in surface charge and the structure of the tripeptide-binding pocket are discussed

  8. Domain decomposition with local refinement for flow simulation around a nuclear waste disposal site: direct computation versus simulation using code coupling with OCamlP3L

    Energy Technology Data Exchange (ETDEWEB)

    Clement, F.; Vodicka, A.; Weis, P. [Institut National de Recherches Agronomiques (INRA), 78 - Le Chesnay (France); Martin, V. [Institut National de Recherches Agronomiques (INRA), 92 - Chetenay Malabry (France); Di Cosmo, R. [Institut National de Recherches Agronomiques (INRA), 78 - Le Chesnay (France); Paris-7 Univ., 75 (France)

    2003-07-01

    We consider the application of a non-overlapping domain decomposition method with non-matching grids based on Robin interface conditions to the problem of flow surrounding an underground nuclear waste disposal. We show with a simple example how one can refine the mesh locally around the storage with this technique. A second aspect is studied in this paper. The coupling between the sub-domains can be achieved by computing in two ways: either directly (i.e. the domain decomposition algorithm is included in the code that solves the problems on the sub-domains) or using code coupling. In the latter case, each sub-domain problem is solved separately and the coupling is performed by another program. We wrote a coupling program in the functional language Ocaml, using the OcamIP31 environment devoted to ease the parallelism. This at the same time we test the code coupling and we use the natural parallel property of domain decomposition methods. Some simple 2D numerical tests show promising results, and further studies are under way. (authors)

  9. Domain decomposition with local refinement for flow simulation around a nuclear waste disposal site: direct computation versus simulation using code coupling with OCamlP3L

    International Nuclear Information System (INIS)

    Clement, F.; Vodicka, A.; Weis, P.; Martin, V.; Di Cosmo, R.

    2003-01-01

    We consider the application of a non-overlapping domain decomposition method with non-matching grids based on Robin interface conditions to the problem of flow surrounding an underground nuclear waste disposal. We show with a simple example how one can refine the mesh locally around the storage with this technique. A second aspect is studied in this paper. The coupling between the sub-domains can be achieved by computing in two ways: either directly (i.e. the domain decomposition algorithm is included in the code that solves the problems on the sub-domains) or using code coupling. In the latter case, each sub-domain problem is solved separately and the coupling is performed by another program. We wrote a coupling program in the functional language Ocaml, using the OcamIP31 environment devoted to ease the parallelism. This at the same time we test the code coupling and we use the natural parallel property of domain decomposition methods. Some simple 2D numerical tests show promising results, and further studies are under way. (authors)

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

  11. Peptide domains involved in the localization of the porcine reproductive and respiratory syndrome virus nucleocapsid protein to the nucleolus

    International Nuclear Information System (INIS)

    Rowland, Raymond R.R.; Schneider, Paula; Fang Ying; Wootton, Sarah; Yoo, Dongwan; Benfield, David A.

    2003-01-01

    The nucleocapsid (N) protein of porcine reproductive and respiratory syndrome virus (PRRSV) is the principal component of the viral nucleocapsid and localizes to the nucleolus. Peptide sequence analysis of the N protein of several North American isolates identified two potential nuclear localization signal (NLS) sequences located at amino acids 10-13 and 41-42, which were labeled NLS-1 and NLS-2, respectively. Peptides containing NLS-1 or NLS-2 were sufficient to accumulate enhanced green fluorescent protein (EGFP) in the nucleus. The inactivation of NLS-1 by site-directed mutagenesis or the deletion of the first 14 amino acids did not affect N protein localization to the nucleolus. The substitution of key lysine residues with uncharged amino acids in NLS-2 blocked nuclear/nucleolar localization. Site-directed mutagenesis within NLS-2 identified the sequence, KKNKK, as forming the core localization domain within NLS-2. Using an in vitro pull-down assay, the N protein was able to bind importin-α, importin-β nuclear transport proteins. The localization pattern of N-EGFP fusion peptides represented by a series of deletions from the C- and N-terminal ends of the N protein identified a region covering amino acids 41-72, which contained a nucleolar localization signal (NoLS) sequence. The 41-72 N peptide when fused to EGFP mimicked the nucleolar-cytoplasmic distribution of native N. These results identify a single NLS involved in the transport of N from the cytoplasm and into nucleus. An additional peptide sequence, overlapping NLS-2, is involved in the further targeting of N to the nucleolus

  12. Defining local food

    DEFF Research Database (Denmark)

    Eriksen, Safania Normann

    2013-01-01

    Despite evolving local food research, there is no consistent definition of “local food.” Various understandings are utilized, which have resulted in a diverse landscape of meaning. The main purpose of this paper is to examine how researchers within the local food systems literature define local...... food, and how these definitions can be used as a starting point to identify a new taxonomy of local food based on three domains of proximity....

  13. Electric-field-induced magnetic domain writing in a Co wire

    Science.gov (United States)

    Tanaka, Yuki; Hirai, Takamasa; Koyama, Tomohiro; Chiba, Daichi

    2018-05-01

    We have demonstrated that the local magnetization in a Co microwire can be switched by an application of a gate voltage without using any external magnetic fields. The electric-field-induced reversible ferromagnetic phase transition was used to realize this. An internal stray field from a ferromagnetic gate electrode assisted the local domain reversal in the Co wire. This new concept of electrical domain switching may be useful for dramatically reducing the power consumption of writing information in a magnetic racetrack memory, in which a shift of a magnetic domain by electric current is utilized.

  14. Frequency-domain waveform inversion using the unwrapped phase

    KAUST Repository

    Choi, Yun Seok; Alkhalifah, Tariq Ali

    2011-01-01

    Phase wrapping in the frequency-domain (or cycle skipping in the time-domain) is the major cause of the local minima problem in the waveform inversion. The unwrapped phase has the potential to provide us with a robust and reliable waveform inversion

  15. Distinct Subunit Domains Govern Synaptic Stability and Specificity of the Kainate Receptor

    Directory of Open Access Journals (Sweden)

    Christoph Straub

    2016-07-01

    Full Text Available Synaptic communication between neurons requires the precise localization of neurotransmitter receptors to the correct synapse type. Kainate-type glutamate receptors restrict synaptic localization that is determined by the afferent presynaptic connection. The mechanisms that govern this input-specific synaptic localization remain unclear. Here, we examine how subunit composition and specific subunit domains contribute to synaptic localization of kainate receptors. The cytoplasmic domain of the GluK2 low-affinity subunit stabilizes kainate receptors at synapses. In contrast, the extracellular domain of the GluK4/5 high-affinity subunit synergistically controls the synaptic specificity of kainate receptors through interaction with C1q-like proteins. Thus, the input-specific synaptic localization of the native kainate receptor complex involves two mechanisms that underlie specificity and stabilization of the receptor at synapses.

  16. Frequency-domain waveform inversion using the phase derivative

    KAUST Repository

    Choi, Yun Seok; Alkhalifah, Tariq Ali

    2013-01-01

    Phase wrapping in the frequency domain or cycle skipping in the time domain is the major cause of the local minima problem in the waveform inversion when the starting model is far from the true model. Since the phase derivative does not suffer from

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

  18. Interaction between the PH and START domains of ceramide transfer protein competes with phosphatidylinositol 4-phosphate binding by the PH domain.

    Science.gov (United States)

    Prashek, Jennifer; Bouyain, Samuel; Fu, Mingui; Li, Yong; Berkes, Dusan; Yao, Xiaolan

    2017-08-25

    De novo synthesis of the sphingolipid sphingomyelin requires non-vesicular transport of ceramide from the endoplasmic reticulum to the Golgi by the multidomain protein ceramide transfer protein (CERT). CERT's N-terminal pleckstrin homology (PH) domain targets it to the Golgi by binding to phosphatidylinositol 4-phosphate (PtdIns(4)P) in the Golgi membrane, whereas its C-terminal StAR-related lipid transfer domain (START) carries out ceramide transfer. Hyperphosphorylation of a serine-rich motif immediately after the PH domain decreases both PtdIns(4)P binding and ceramide transfer by CERT. This down-regulation requires both the PH and START domains, suggesting a possible inhibitory interaction between the two domains. In this study we show that isolated PH and START domains interact with each other. The crystal structure of a PH-START complex revealed that the START domain binds to the PH domain at the same site for PtdIns(4)P-binding, suggesting that the START domain competes with PtdIns(4)P for association with the PH domain. We further report that mutations disrupting the PH-START interaction increase both PtdIns(4)P-binding affinity and ceramide transfer activity of a CERT-serine-rich phosphorylation mimic. We also found that these mutations increase the Golgi localization of CERT inside the cell, consistent with enhanced PtdIns(4)P binding of the mutant. Collectively, our structural, biochemical, and cellular investigations provide important structural insight into the regulation of CERT function and localization. © 2017 by The American Society for Biochemistry and Molecular Biology, Inc.

  19. Target Control in Logical Models Using the Domain of Influence of Nodes.

    Science.gov (United States)

    Yang, Gang; Gómez Tejeda Zañudo, Jorge; Albert, Réka

    2018-01-01

    Dynamical models of biomolecular networks are successfully used to understand the mechanisms underlying complex diseases and to design therapeutic strategies. Network control and its special case of target control, is a promising avenue toward developing disease therapies. In target control it is assumed that a small subset of nodes is most relevant to the system's state and the goal is to drive the target nodes into their desired states. An example of target control would be driving a cell to commit to apoptosis (programmed cell death). From the experimental perspective, gene knockout, pharmacological inhibition of proteins, and providing sustained external signals are among practical intervention techniques. We identify methodologies to use the stabilizing effect of sustained interventions for target control in Boolean network models of biomolecular networks. Specifically, we define the domain of influence (DOI) of a node (in a certain state) to be the nodes (and their corresponding states) that will be ultimately stabilized by the sustained state of this node regardless of the initial state of the system. We also define the related concept of the logical domain of influence (LDOI) of a node, and develop an algorithm for its identification using an auxiliary network that incorporates the regulatory logic. This way a solution to the target control problem is a set of nodes whose DOI can cover the desired target node states. We perform greedy randomized adaptive search in node state space to find such solutions. We apply our strategy to in silico biological network models of real systems to demonstrate its effectiveness.

  20. Domain engineering of the metastable domains in the 4f-uniaxial-ferromagnet CeRu2Ga2B

    Science.gov (United States)

    Wulferding, D.; Kim, H.; Yang, I.; Jeong, J.; Barros, K.; Kato, Y.; Martin, I.; Ayala-Valenzuela, O. E.; Lee, M.; Choi, H. C.; Ronning, F.; Civale, L.; Baumbach, R. E.; Bauer, E. D.; Thompson, J. D.; Movshovich, R.; Kim, Jeehoon

    2017-04-01

    In search of novel, improved materials for magnetic data storage and spintronic devices, compounds that allow a tailoring of magnetic domain shapes and sizes are essential. Good candidates are materials with intrinsic anisotropies or competing interactions, as they are prone to host various domain phases that can be easily and precisely selected by external tuning parameters such as temperature and magnetic field. Here, we utilize vector magnetic fields to visualize directly the magnetic anisotropy in the uniaxial ferromagnet CeRu2Ga2B. We demonstrate a feasible control both globally and locally of domain shapes and sizes by the external field as well as a smooth transition from single stripe to bubble domains, which opens the door to future applications based on magnetic domain tailoring.

  1. SH2 domains: modulators of nonreceptor tyrosine kinase activity

    OpenAIRE

    Filippakopoulos, Panagis; Müller, Susanne; Knapp, Stefan

    2009-01-01

    The Src homology 2 (SH2) domain is a sequence-specific phosphotyrosine-binding module present in many signaling molecules. In cytoplasmic tyrosine kinases, the SH2 domain is located N-terminally to the catalytic kinase domain (SH1) where it mediates cellular localization, substrate recruitment, and regulation of kinase activity. Initially, structural studies established a role of the SH2 domain stabilizing the inactive state of Src family members. However, biochemical characterization showed ...

  2. Stress induced magnetic-domain evolution in magnetoelectric composites

    Science.gov (United States)

    Trivedi, Harsh; Shvartsman, Vladimir V.; Lupascu, Doru C.; Medeiros, Marco S. A.; Pullar, Robert C.

    2018-06-01

    Local observation of the stress mediated magnetoelectric (ME) effect in composites has gained a great deal of interest over the last decades. However, there is an apparent lack of rigorous methods for a quantitative characterization of the ME effect at the local scale, especially in polycrystalline microstructures. In the present work, we address this issue by locally probing the surface magnetic state of barium titante–hexagonal barium ferrite (BaTiO3–BaFe12O19) ceramic composites using magnetic force microscopy (MFM). The effect of the piezoelectrically induced local stress on the magnetostrictive component (BaFe12O19, BaM) was observed in the form of the evolution of the magnetic domains. The local piezoelectric stress was induced by applying a voltage to the neighboring BaTiO3 grains, using a conductive atomic force microscopy tip. The resulting stochastic evolution of magnetic domains was studied in the context of the induced magnetoelastic anisotropy. In order to overcome the ambiguity in the domain changes observed by MFM, certain generalizations about the observed MFM contrast are put forward, followed by application of an algorithm for extracting the average micromagnetic changes. An average change in domain wall thickness of 50 nm was extracted, giving a lower limit on the corresponding induced magnetoelastic anisotropy energy. Furthermore, we demonstrate that this induced magnetomechanical energy is approximately equal to the K1 magnetocrystalline anisotropy constant of BaM, and compare it with a modeled value of applied elastic energy density. The comparison allowed us to judge the quality of the interfaces in the composite system, by roughly gauging the energy conversion ratio.

  3. Domain decomposition methods for the neutron diffusion problem

    International Nuclear Information System (INIS)

    Guerin, P.; Baudron, A. M.; Lautard, J. J.

    2010-01-01

    The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, simplified transport (SPN) or diffusion approximations are often used. The MINOS solver developed at CEA Saclay uses a mixed dual finite element method for the resolution of these problems. and has shown his efficiency. In order to take into account the heterogeneities of the geometry, a very fine mesh is generally required, and leads to expensive calculations for industrial applications. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose here two domain decomposition methods based on the MINOS solver. The first approach is a component mode synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is an iterative method based on a non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the adjacent sub-domains estimated at the previous iteration. Numerical results on parallel computers are presented for the diffusion model on realistic 2D and 3D cores. (authors)

  4. Optical Coherence Tomography Noise Reduction Using Anisotropic Local Bivariate Gaussian Mixture Prior in 3D Complex Wavelet Domain.

    Science.gov (United States)

    Rabbani, Hossein; Sonka, Milan; Abramoff, Michael D

    2013-01-01

    In this paper, MMSE estimator is employed for noise-free 3D OCT data recovery in 3D complex wavelet domain. Since the proposed distribution for noise-free data plays a key role in the performance of MMSE estimator, a priori distribution for the pdf of noise-free 3D complex wavelet coefficients is proposed which is able to model the main statistical properties of wavelets. We model the coefficients with a mixture of two bivariate Gaussian pdfs with local parameters which are able to capture the heavy-tailed property and inter- and intrascale dependencies of coefficients. In addition, based on the special structure of OCT images, we use an anisotropic windowing procedure for local parameters estimation that results in visual quality improvement. On this base, several OCT despeckling algorithms are obtained based on using Gaussian/two-sided Rayleigh noise distribution and homomorphic/nonhomomorphic model. In order to evaluate the performance of the proposed algorithm, we use 156 selected ROIs from 650 × 512 × 128 OCT dataset in the presence of wet AMD pathology. Our simulations show that the best MMSE estimator using local bivariate mixture prior is for the nonhomomorphic model in the presence of Gaussian noise which results in an improvement of 7.8 ± 1.7 in CNR.

  5. Optical Coherence Tomography Noise Reduction Using Anisotropic Local Bivariate Gaussian Mixture Prior in 3D Complex Wavelet Domain

    Directory of Open Access Journals (Sweden)

    Hossein Rabbani

    2013-01-01

    Full Text Available In this paper, MMSE estimator is employed for noise-free 3D OCT data recovery in 3D complex wavelet domain. Since the proposed distribution for noise-free data plays a key role in the performance of MMSE estimator, a priori distribution for the pdf of noise-free 3D complex wavelet coefficients is proposed which is able to model the main statistical properties of wavelets. We model the coefficients with a mixture of two bivariate Gaussian pdfs with local parameters which are able to capture the heavy-tailed property and inter- and intrascale dependencies of coefficients. In addition, based on the special structure of OCT images, we use an anisotropic windowing procedure for local parameters estimation that results in visual quality improvement. On this base, several OCT despeckling algorithms are obtained based on using Gaussian/two-sided Rayleigh noise distribution and homomorphic/nonhomomorphic model. In order to evaluate the performance of the proposed algorithm, we use 156 selected ROIs from 650 × 512 × 128 OCT dataset in the presence of wet AMD pathology. Our simulations show that the best MMSE estimator using local bivariate mixture prior is for the nonhomomorphic model in the presence of Gaussian noise which results in an improvement of 7.8 ± 1.7 in CNR.

  6. Single-domain epitaxial silicene on diboride thin films

    Energy Technology Data Exchange (ETDEWEB)

    Fleurence, A., E-mail: antoine@jaist.ac.jp; Friedlein, R.; Aoyagi, K.; Yamada-Takamura, Y. [School of Materials Science, Japan Advanced Institute of Science and Technology (JAIST), 1-1 Asahidai, Nomi, Ishikawa 923-1292 (Japan); Gill, T. G. [School of Materials Science, Japan Advanced Institute of Science and Technology (JAIST), 1-1 Asahidai, Nomi, Ishikawa 923-1292 (Japan); London Centre for Nanotechnology, University College London (UCL), London WC1H 0AH (United Kingdom); Department of Chemistry, UCL, London WC1H 0AJ (United Kingdom); Sadowski, J. T. [Center for Functional Nanomaterials, Brookhaven National Laboratory, Upton, New York 11973 (United States); Copel, M.; Tromp, R. M. [IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, New York 10598 (United States); Hirjibehedin, C. F. [London Centre for Nanotechnology, University College London (UCL), London WC1H 0AH (United Kingdom); Department of Chemistry, UCL, London WC1H 0AJ (United Kingdom); Department of Physics and Astronomy, UCL, London WC1E 6BT (United Kingdom)

    2016-04-11

    Epitaxial silicene, which forms spontaneously on ZrB{sub 2}(0001) thin films grown on Si(111) wafers, has a periodic stripe domain structure. By adsorbing additional Si atoms on this surface, we find that the domain boundaries vanish, and a single-domain silicene sheet can be prepared without altering its buckled honeycomb structure. The amount of Si required to induce this change suggests that the domain boundaries are made of a local distortion of the silicene honeycomb lattice. The realization of a single domain sheet with structural and electronic properties close to those of the original striped state demonstrates the high structural flexibility of silicene.

  7. Localization of a guanylyl cyclase to chemosensory cilia requires the novel ciliary MYND domain protein DAF-25.

    Directory of Open Access Journals (Sweden)

    Victor L Jensen

    2010-11-01

    Full Text Available In harsh conditions, Caenorhabditis elegans arrests development to enter a non-aging, resistant diapause state called the dauer larva. Olfactory sensation modulates the TGF-β and insulin signaling pathways to control this developmental decision. Four mutant alleles of daf-25 (abnormal DAuer Formation were isolated from screens for mutants exhibiting constitutive dauer formation and found to be defective in olfaction. The daf-25 dauer phenotype is suppressed by daf-10/IFT122 mutations (which disrupt ciliogenesis, but not by daf-6/PTCHD3 mutations (which prevent environmental exposure of sensory cilia, implying that DAF-25 functions in the cilia themselves. daf-25 encodes the C. elegans ortholog of mammalian Ankmy2, a MYND domain protein of unknown function. Disruption of DAF-25, which localizes to sensory cilia, produces no apparent cilia structure anomalies, as determined by light and electron microscopy. Hinting at its potential function, the dauer phenotype, epistatic order, and expression profile of daf-25 are similar to daf-11, which encodes a cilium-localized guanylyl cyclase. Indeed, we demonstrate that DAF-25 is required for proper DAF-11 ciliary localization. Furthermore, the functional interaction is evolutionarily conserved, as mouse Ankmy2 interacts with guanylyl cyclase GC1 from ciliary photoreceptors. The interaction may be specific because daf-25 mutants have normally-localized OSM-9/TRPV4, TAX-4/CNGA1, CHE-2/IFT80, CHE-11/IFT140, CHE-13/IFT57, BBS-8, OSM-5/IFT88, and XBX-1/D2LIC in the cilia. Intraflagellar transport (IFT (required to build cilia is not defective in daf-25 mutants, although the ciliary localization of DAF-25 itself is influenced in che-11 mutants, which are defective in retrograde IFT. In summary, we have discovered a novel ciliary protein that plays an important role in cGMP signaling by localizing a guanylyl cyclase to the sensory organelle.

  8. Modulation of catalytic activity in multi-domain protein tyrosine phosphatases.

    Directory of Open Access Journals (Sweden)

    Lalima L Madan

    Full Text Available Signaling mechanisms involving protein tyrosine phosphatases govern several cellular and developmental processes. These enzymes are regulated by several mechanisms which include variation in the catalytic turnover rate based on redox stimuli, subcellular localization or protein-protein interactions. In the case of Receptor Protein Tyrosine Phosphatases (RPTPs containing two PTP domains, phosphatase activity is localized in their membrane-proximal (D1 domains, while the membrane-distal (D2 domain is believed to play a modulatory role. Here we report our analysis of the influence of the D2 domain on the catalytic activity and substrate specificity of the D1 domain using two Drosophila melanogaster RPTPs as a model system. Biochemical studies reveal contrasting roles for the D2 domain of Drosophila Leukocyte antigen Related (DLAR and Protein Tyrosine Phosphatase on Drosophila chromosome band 99A (PTP99A. While D2 lowers the catalytic activity of the D1 domain in DLAR, the D2 domain of PTP99A leads to an increase in the catalytic activity of its D1 domain. Substrate specificity, on the other hand, is cumulative, whereby the individual specificities of the D1 and D2 domains contribute to the substrate specificity of these two-domain enzymes. Molecular dynamics simulations on structural models of DLAR and PTP99A reveal a conformational rationale for the experimental observations. These studies reveal that concerted structural changes mediate inter-domain communication resulting in either inhibitory or activating effects of the membrane distal PTP domain on the catalytic activity of the membrane proximal PTP domain.

  9. Exploratory analysis regarding the domain definitions for computer based analytical models

    Science.gov (United States)

    Raicu, A.; Oanta, E.; Barhalescu, M.

    2017-08-01

    Our previous computer based studies dedicated to structural problems using analytical methods defined the composite cross section of a beam as a result of Boolean operations with so-called ‘simple’ shapes. Using generalisations, in the class of the ‘simple’ shapes were included areas bounded by curves approximated using spline functions and areas approximated as polygons. However, particular definitions lead to particular solutions. In order to ascend above the actual limitations, we conceived a general definition of the cross sections that are considered now calculus domains consisting of several subdomains. The according set of input data use complex parameterizations. This new vision allows us to naturally assign a general number of attributes to the subdomains. In this way there may be modelled new phenomena that use map-wise information, such as the metal alloys equilibrium diagrams. The hierarchy of the input data text files that use the comma-separated-value format and their structure are also presented and discussed in the paper. This new approach allows us to reuse the concepts and part of the data processing software instruments already developed. The according software to be subsequently developed will be modularised and generalised in order to be used in the upcoming projects that require rapid development of computer based models.

  10. Domain reversal dynamics in ferromagnetic thin films of Co/Pd nanomultilayers

    International Nuclear Information System (INIS)

    Choe, Sug Bong; Kim, Dong Hyun; Shin, Sung Chul

    2002-01-01

    Domain reversal dynamics in ferromagnetic thin films has been quantitatively investigated by means of a magneto-optical microscope magnetometer (MOMM), capable of grabbing domain reversal patterns in real time under an applied magnetic field and of measuring local magnetic properties with 400-nm spatial resolution. The domain reversal behavior sensitively changed between wall-motion and nucleation-dominant behavior with changing multilayer structure of the Co-Pd multilayers. Quantitative analysis revealed that the contrasting reversal behavior was mainly caused by a sensitive change in wall-motion speed and that the reversal ratio of wall-motion speed over nucleation rate was a governing parameter for the contrasting domain reversal dynamics. The activation volumes of the wall-motion and nucleation processes were generally unequal, and the inequality was closely related with the domain dynamics. Based on a Monte-Carlo simulation, both the macroscopic magnetic properties and the local magnetic variation were responsible for the contrasting domain reversal behavior

  11. Comparative Hi-C Reveals that CTCF Underlies Evolution of Chromosomal Domain Architecture

    Directory of Open Access Journals (Sweden)

    Matteo Vietri Rudan

    2015-03-01

    Full Text Available Topological domains are key architectural building blocks of chromosomes, but their functional importance and evolutionary dynamics are not well defined. We performed comparative high-throughput chromosome conformation capture (Hi-C in four mammals and characterized the conservation and divergence of chromosomal contact insulation and the resulting domain architectures within distantly related genomes. We show that the modular organization of chromosomes is robustly conserved in syntenic regions and that this is compatible with conservation of the binding landscape of the insulator protein CTCF. Specifically, conserved CTCF sites are co-localized with cohesin, are enriched at strong topological domain borders, and bind to DNA motifs with orientations that define the directionality of CTCF’s long-range interactions. Conversely, divergent CTCF binding between species is correlated with divergence of internal domain structure, likely driven by local CTCF binding sequence changes, demonstrating how genome evolution can be linked to a continuous flux of local conformation changes. We also show that large-scale domains are reorganized during genome evolution as intact modules.

  12. The defects influence on domain wall propagation in bistable glass-coated microwires

    International Nuclear Information System (INIS)

    Rodionova, V.; Zhukova, V.; Ilyn, M.; Ipatov, M.; Perov, N.; Zhukov, A.

    2012-01-01

    We studied the domain wall (DW) dynamics of magnetically bistable amorphous glass-coated Fe 74 B 13 Si 11 C 2 microwires. In according to our experimental results magnetic field dependences of DW velocity of studied microwires can be divided into two groups: with uniform or uniformly accelerated DW propagation along the microwire. Strong correlation between the type of the magnetic field dependence of domain wall velocity, v(H), and the distribution of the local nucleation fields has been observed. Moreover, we observed abrupt increasing of DW velocity (jump) on the magnetic field dependences of the domain wall velocity, v(H), for the both types of the v(H) dependences. At the same time usual linear increasing of the domain wall velocity with magnetic field persists below these jumps. It was found that the jump height correlates with the location of nucleation place of the new domain wall. We have measured local nucleation field distribution in all the microwires. From local nucleation field distribution we have obtained the DW nucleation locations and estimated the jump height

  13. The defects influence on domain wall propagation in bistable glass-coated microwires

    Energy Technology Data Exchange (ETDEWEB)

    Rodionova, V. [Magnetism Division, Faculty of Physics, M.V. Lomonosov Moscow State University, Moscow 119991 (Russian Federation); Immanuel Kant Baltic Federal University, Kaliningrad 236041 (Russian Federation); Dpto. Fisica de Materiales, Fac. Quimicas, UPV/EHU, San Sebastian 20018 (Spain); Zhukova, V., E-mail: valentina.zhukova@ehu.es [Dpto. Fisica de Materiales, Fac. Quimicas, UPV/EHU, San Sebastian 20018 (Spain); Ilyn, M.; Ipatov, M. [Dpto. Fisica de Materiales, Fac. Quimicas, UPV/EHU, San Sebastian 20018 (Spain); Perov, N. [Magnetism Division, Faculty of Physics, M.V. Lomonosov Moscow State University, Moscow 119991 (Russian Federation); Zhukov, A. [Dpto. Fisica de Materiales, Fac. Quimicas, UPV/EHU, San Sebastian 20018 (Spain); IKERBASQUE, Basque Foundation for Science, Bilbao 48011 (Spain)

    2012-05-01

    We studied the domain wall (DW) dynamics of magnetically bistable amorphous glass-coated Fe{sub 74}B{sub 13}Si{sub 11}C{sub 2} microwires. In according to our experimental results magnetic field dependences of DW velocity of studied microwires can be divided into two groups: with uniform or uniformly accelerated DW propagation along the microwire. Strong correlation between the type of the magnetic field dependence of domain wall velocity, v(H), and the distribution of the local nucleation fields has been observed. Moreover, we observed abrupt increasing of DW velocity (jump) on the magnetic field dependences of the domain wall velocity, v(H), for the both types of the v(H) dependences. At the same time usual linear increasing of the domain wall velocity with magnetic field persists below these jumps. It was found that the jump height correlates with the location of nucleation place of the new domain wall. We have measured local nucleation field distribution in all the microwires. From local nucleation field distribution we have obtained the DW nucleation locations and estimated the jump height.

  14. Non-local boxes and their implementation in Minecraft

    Science.gov (United States)

    Simnacher, Timo Yannick

    PR-boxes are binary devices connecting two remote parties satisfying x AND y = a + b mod 2, where x and y denote the binary inputs and a and b are the respective outcomes without signaling. These devices are named after their inventors Sandu Popescu and Daniel Rohrlich and saturate the Clauser-Horne-Shimony-Holt (CHSH) inequality. This Bell-like inequality bounds the correlation that can exist between two remote, non-signaling, classical systems described by local hidden variable theories. Experiments have now convincingly shown that quantum entanglement cannot be explained by local hidden variable theories. Furthermore, the CHSH inequality provides a method to distinguish quantum systems from super-quantum correlations. The correlation between the outputs of the PR-box goes beyond any quantum entanglement. Though PR-boxes would have impressive consequences, as far as we know they are not physically realizable. However, by introducing PR-boxes to Minecraft as part of the redstone system, which simulates the electrical components for binary computing, we can experience the consequences of super-quantum correlations. For instance, Wim van Dam proved that two parties can use a sufficient number of PR-boxes to compute any Boolean function f(x,y) with only one bit of communication.

  15. Characterization of local fluid flow in 3D porous construct characterized by Fourier domain Doppler optical coherence tomography

    Science.gov (United States)

    Bagnaninchi, P. O.; Yang, Y.; El Haj, A.; Hinds, M. T.; Wang, R. K.

    2007-02-01

    In order to achieve functional tissue with the correct biomechanical properties it is critical to stimulate mechanically the cells. Perfusion bioreactor induces fluid shear stress that has been well characterized for two-dimensional culture where both simulation and experimental data are available. However these results can't be directly translated to tissue engineering that makes use of complex three-dimensional porous scaffold. Moreover, stimulated cells produce extensive extra-cellular matrix (ECM) that alter dramatically the micro-architecture of the constructs, changing the local flow dynamic. In this study a Fourier domain Doppler optical coherent tomography (FD-DOCT) system working at 1300nm with a bandwidth of 50nm has been used to determine the local flow rate inside different types of porous scaffolds used in tissue engineering. Local flow rates can then be linearly related, for Newtonian fluid, to the fluid shear stress occurring on the pores wall. Porous chitosan scaffolds (\\fgr 1.5mm x 3mm) with and without a central 250 μm microchannel have been produced by a freeze-drying technique. This techniques allow us to determine the actual shear stress applied to the cells and to optimise the input flow rate consequently, but also to relate the change of the flow distribution to the amount of ECM production allowing the monitoring of tissue formation.

  16. Image-domain full waveform inversion

    KAUST Repository

    Zhang, Sanzong

    2013-08-20

    The main difficulty with the data-domain full waveform inversion (FWI) is that it tends to get stuck in the local minima associated with the waveform misfit function. This is because the waveform misfit function is highly nonlinear with respect to changes in velocity model. To reduce this nonlinearity, we define the image-domain objective function to minimize the difference of the suboffset-domain common image gathers (CIGs) obtained by migrating the observed data and the calculated data. The derivation shows that the gradient of this new objective function is the combination of the gradient of the conventional FWI and the image-domain differential semblance optimization (DSO). Compared to the conventional FWI, the imagedomain FWI is immune to cycle skipping problems by smearing the nonzero suboffset images along wavepath. It also can avoid the edge effects and the gradient artifacts that are inherent in DSO due to the falsely over-penalized focused images. This is achieved by subtracting the focused image associated with the calculated data from the unfocused image associated with the observed data in the image-domain misfit function. The numerical results of the Marmousi model show that image-domain FWI is less sensitive the initial model than the conventional FWI. © 2013 SEG.

  17. Image-domain full waveform inversion

    KAUST Repository

    Zhang, Sanzong; Schuster, Gerard T.

    2013-01-01

    The main difficulty with the data-domain full waveform inversion (FWI) is that it tends to get stuck in the local minima associated with the waveform misfit function. This is because the waveform misfit function is highly nonlinear with respect to changes in velocity model. To reduce this nonlinearity, we define the image-domain objective function to minimize the difference of the suboffset-domain common image gathers (CIGs) obtained by migrating the observed data and the calculated data. The derivation shows that the gradient of this new objective function is the combination of the gradient of the conventional FWI and the image-domain differential semblance optimization (DSO). Compared to the conventional FWI, the imagedomain FWI is immune to cycle skipping problems by smearing the nonzero suboffset images along wavepath. It also can avoid the edge effects and the gradient artifacts that are inherent in DSO due to the falsely over-penalized focused images. This is achieved by subtracting the focused image associated with the calculated data from the unfocused image associated with the observed data in the image-domain misfit function. The numerical results of the Marmousi model show that image-domain FWI is less sensitive the initial model than the conventional FWI. © 2013 SEG.

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

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

  20. The BEACH Domain Protein SPIRRIG Is Essential for Arabidopsis Salt Stress Tolerance and Functions as a Regulator of Transcript Stabilization and Localization.

    Directory of Open Access Journals (Sweden)

    Alexandra Steffens

    2015-07-01

    Full Text Available Members of the highly conserved class of BEACH domain containing proteins (BDCPs have been established as broad facilitators of protein-protein interactions and membrane dynamics in the context of human diseases like albinism, bleeding diathesis, impaired cellular immunity, cancer predisposition, and neurological dysfunctions. Also, the Arabidopsis thaliana BDCP SPIRRIG (SPI is important for membrane integrity, as spi mutants exhibit split vacuoles. In this work, we report a novel molecular function of the BDCP SPI in ribonucleoprotein particle formation. We show that SPI interacts with the P-body core component DECAPPING PROTEIN 1 (DCP1, associates to mRNA processing bodies (P-bodies, and regulates their assembly upon salt stress. The finding that spi mutants exhibit salt hypersensitivity suggests that the local function of SPI at P-bodies is of biological relevance. Transcriptome-wide analysis revealed qualitative differences in the salt stress-regulated transcriptional response of Col-0 and spi. We show that SPI regulates the salt stress-dependent post-transcriptional stabilization, cytoplasmic agglomeration, and localization to P-bodies of a subset of salt stress-regulated mRNAs. Finally, we show that the PH-BEACH domains of SPI and its human homolog FAN (Factor Associated with Neutral sphingomyelinase activation interact with DCP1 isoforms from plants, mammals, and yeast, suggesting the evolutionary conservation of an association of BDCPs and P-bodies.

  1. A Novel Image Authentication with Tamper Localization and Self-Recovery in Encrypted Domain Based on Compressive Sensing

    Directory of Open Access Journals (Sweden)

    Rui Zhang

    2018-01-01

    Full Text Available This paper proposes a novel tamper detection, localization, and recovery scheme for encrypted images with Discrete Wavelet Transformation (DWT and Compressive Sensing (CS. The original image is first transformed into DWT domain and divided into important part, that is, low-frequency part, and unimportant part, that is, high-frequency part. For low-frequency part contains the main information of image, traditional chaotic encryption is employed. Then, high-frequency part is encrypted with CS to vacate space for watermark. The scheme takes the processed original image content as watermark, from which the characteristic digest values are generated. Comparing with the existing image authentication algorithms, the proposed scheme can realize not only tamper detection and localization but also tamper recovery. Moreover, tamper recovery is based on block division and the recovery accuracy varies with the contents that are possibly tampered. If either the watermark or low-frequency part is tampered, the recovery accuracy is 100%. The experimental results show that the scheme can not only distinguish the type of tamper and find the tampered blocks but also recover the main information of the original image. With great robustness and security, the scheme can adequately meet the need of secure image transmission under unreliable conditions.

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

  3. Comparison and combination of "direct" and fragment based local correlation methods: Cluster in molecules and domain based local pair natural orbital perturbation and coupled cluster theories

    Science.gov (United States)

    Guo, Yang; Becker, Ute; Neese, Frank

    2018-03-01

    Local correlation theories have been developed in two main flavors: (1) "direct" local correlation methods apply local approximation to the canonical equations and (2) fragment based methods reconstruct the correlation energy from a series of smaller calculations on subsystems. The present work serves two purposes. First, we investigate the relative efficiencies of the two approaches using the domain-based local pair natural orbital (DLPNO) approach as the "direct" method and the cluster in molecule (CIM) approach as the fragment based approach. Both approaches are applied in conjunction with second-order many-body perturbation theory (MP2) as well as coupled-cluster theory with single-, double- and perturbative triple excitations [CCSD(T)]. Second, we have investigated the possible merits of combining the two approaches by performing CIM calculations with DLPNO methods serving as the method of choice for performing the subsystem calculations. Our cluster-in-molecule approach is closely related to but slightly deviates from approaches in the literature since we have avoided real space cutoffs. Moreover, the neglected distant pair correlations in the previous CIM approach are considered approximately. Six very large molecules (503-2380 atoms) were studied. At both MP2 and CCSD(T) levels of theory, the CIM and DLPNO methods show similar efficiency. However, DLPNO methods are more accurate for 3-dimensional systems. While we have found only little incentive for the combination of CIM with DLPNO-MP2, the situation is different for CIM-DLPNO-CCSD(T). This combination is attractive because (1) the better parallelization opportunities offered by CIM; (2) the methodology is less memory intensive than the genuine DLPNO-CCSD(T) method and, hence, allows for large calculations on more modest hardware; and (3) the methodology is applicable and efficient in the frequently met cases, where the largest subsystem calculation is too large for the canonical CCSD(T) method.

  4. An endoplasmic reticulum-localized Coffea arabica BURP domain-containing protein affects the response of transgenic Arabidopsis plants to diverse abiotic stresses.

    Science.gov (United States)

    Dinh, Sy Nguyen; Kang, Hunseung

    2017-11-01

    The Coffea arabica BURP domain-containing gene plays an important role in the response of transgenic Arabidopsis plants to abiotic stresses via regulating the level of diverse proteins. Although the functions of plant-specific BURP domain-containing proteins (BDP) have been determined for a few plants, their roles in the growth, development, and stress responses of most plant species, including coffee plant (Coffea arabica), are largely unknown. In this study, the function of a C. arabica BDP, designated CaBDP1, was investigated in transgenic Arabidopsis plants. The expression of CaBDP1 was highly modulated in coffee plants subjected to drought, cold, salt, or ABA. Confocal analysis of CaBDP1-GFP fusion proteins revealed that CaBDP1 is localized in the endoplasmic reticulum. The ectopic expression of CaBDP1 in Arabidopsis resulted in delayed germination of the transgenic plants under abiotic stress and in the presence of ABA. Cotyledon greening and seedling growth of the transgenic plants were inhibited in the presence of ABA due to the upregulation of ABA signaling-related genes like ABI3, ABI4, and ABI5. Proteome analysis revealed that the levels of several proteins are modulated in CaBDP1-expressing transgenic plants. The results of this study underscore the importance of BURP domain proteins in plant responses to diverse abiotic stresses.

  5. Constraint programming for modelling and solving modal satisfiability

    NARCIS (Netherlands)

    Brand, S.; Gennari, R.; de Rijke, M.

    2003-01-01

    We explore to what extent and how efficiently constraint programmingcan be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfactionproblems with non-boolean domains, together with suitable constraints.Experiments show that the

  6. Action priors for learning domain invariances

    CSIR Research Space (South Africa)

    Rosman, Benjamin S

    2015-04-01

    Full Text Available behavioural invariances in the domain, by identifying actions to be prioritised in local contexts, invariant to task details. This information has the effect of greatly increasing the speed of solving new problems. We formalise this notion as action priors...

  7. Guanidine hydrochloride denaturation of human serum albumin originates by local unfolding of some stable loops in domain III.

    Science.gov (United States)

    Ahmad, Basir; Ahmed, Md Zulfazal; Haq, Soghra Khatun; Khan, Rizwan Hasan

    2005-06-15

    The effect of guanidine hydrochloride (GnHCl) on the global stability of human serum albumin (HSA) has been studied by fluorescence and circular dichroism spectroscopic measurements. The differential stability of native conformation of three HSA domains were explored by using domain-specific ligands, hemin (domain I), chloroform (domain II), bilirubin (at domain I/domain II interface) and diazepam (domain III). GnHCl induced unfolding transition curves as monitored by probes for secondary and tertiary structures were cooperative but noncoincidental. A strong ANS binding to the protein was observed around 1.8 M GnHCl, suggesting existence of intermediate states in the unfolding pathway of HSA. A gradual decrease (in the GnHCl concentration range 0.0-1.8 M) in the binding of diazepam indicates that domain III is the most labile to GnHCl denaturation. A significant increase in the binding of bilirubin up to 1.4 M GnHCl and decrease thereafter leading to complete abolishment of bilirubin binding at around 2.0 M GnHCl suggest favorable rearrangement and separation of domains I and II at 1.4 and 2.0 M GnHCl concentration, respectively. Above 1.6 M GnHCl, decrease of the binding of hemin, a ligand for domain I, chloroform, which binds in domain II and lone tryptophanyl fluorescence (Trp-214 located in domain II) indicate that at higher concentration of GnHCl domains I and II start unfolding simultaneously but the stability of domain I (7.4 Kcal/mol) is much more than domain II (4.3 Kcal/mol). A pictorial model for the unfolding of HSA domains, consistent with all these results, has been formulated, suggesting that domain III is the most labile followed by domain II while domain I is the most stable. A molten globule like state of domain III around 1.8 M GnHCl has also been identified and characterized.

  8. Performance Analysis of Fission and Surface Source Iteration Method for Domain Decomposed Monte Carlo Whole-Core Calculation

    International Nuclear Information System (INIS)

    Jo, Yu Gwon; Oh, Yoo Min; Park, Hyang Kyu; Park, Kang Soon; Cho, Nam Zin

    2016-01-01

    In this paper, two issues in the FSS iteration method, i.e., the waiting time for surface source data and the variance biases in local tallies are investigated for the domain decomposed, 3-D continuous-energy whole-core calculation. The fission sources are provided as usual, while the surface sources are provided by banking MC particles crossing local domain boundaries. The surface sources serve as boundary conditions for nonoverlapping local problems, so that each local problem can be solved independently. In this paper, two issues in the FSS iteration are investigated. One is quantifying the waiting time of processors to receive surface source data. By using nonblocking communication, 'time penalty' to wait for the arrival of the surface source data is reduced. The other important issue is underestimation of the sample variance of the tally because of additional inter-iteration correlations in surface sources. From the numerical results on a 3-D whole-core test problem, it is observed that the time penalty is negligible in the FSS iteration method and that the real variances of both pin powers and assembly powers are estimated by the HB method. For those purposes, three cases; Case 1 (1 local domain), Case 2 (4 local domains), Case 3 (16 local domains) are tested. For both Cases 2 and 3, the time penalties for waiting are negligible compared to the source-tracking times. However, for finer divisions of local domains, the loss of parallel efficiency caused by the different number of sources for local domains in symmetric locations becomes larger due to the stochastic errors in source distributions. For all test cases, the HB method very well estimates the real variances of local tallies. However, it is also noted that the real variances of local tallies estimated by the HB method show slightly smaller than the real variances obtained from 30 independent batch runs and the deviations become larger for finer divisions of local domains. The batch size used for the HB

  9. Interaction domains in high-performance NdFeB thick films

    Energy Technology Data Exchange (ETDEWEB)

    Woodcock, T.G. [IFW Dresden, Institute for Metallic Materials, P.O. Box 270116, D-01171 Dresden (Germany)], E-mail: t.woodcock@ifw-dresden.de; Khlopkov, K. [IFW Dresden, Institute for Metallic Materials, P.O. Box 270116, D-01171 Dresden (Germany); Walther, A. [Insitut Neel, CNRS-UJF, 25 avenue de Martyrs, 38042 Grenoble (France); CEA Leti - MINATEC, 17 rue des Martyrs, 38054 Grenoble (France); Dempsey, N.M.; Givord, D. [Insitut Neel, CNRS-UJF, 25 avenue de Martyrs, 38042 Grenoble (France); Schultz, L.; Gutfleisch, O. [IFW Dresden, Institute for Metallic Materials, P.O. Box 270116, D-01171 Dresden (Germany)

    2009-05-15

    The magnetic domain structure in sputtered NdFeB thick films has been imaged by magnetic force microscopy. The local texture of the films was investigated by electron backscatter diffraction. The average misorientation of the grains was shown to decrease with increasing substrate temperature during deposition. Interaction domains were observed and are discussed with reference (i) to the sample grain size compared to the single domain particle size and (ii) to sample texture.

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

  11. Configuration of ripple domains and their topological defects formed under local mechanical stress on hexagonal monolayer graphene.

    Science.gov (United States)

    Park, Yeonggu; Choi, Jin Sik; Choi, Taekjib; Lee, Mi Jung; Jia, Quanxi; Park, Minwoo; Lee, Hoonkyung; Park, Bae Ho

    2015-03-24

    Ripples in graphene are extensively investigated because they ensure the mechanical stability of two-dimensional graphene and affect its electronic properties. They arise from spontaneous symmetry breaking and are usually manifested in the form of domains with long-range order. It is expected that topological defects accompany a material exhibiting long-range order, whose functionality depends on characteristics of domains and topological defects. However, there remains a lack of understanding regarding ripple domains and their topological defects formed on monolayer graphene. Here we explore configuration of ripple domains and their topological defects in exfoliated monolayer graphenes on SiO2/Si substrates using transverse shear microscope. We observe three-color domains with three different ripple directions, which meet at a core. Furthermore, the closed domain is surrounded by an even number of cores connected together by domain boundaries, similar to topological vortex and anti-vortex pairs. In addition, we have found that axisymmetric three-color domains can be induced around nanoparticles underneath the graphene. This fascinating configuration of ripple domains may result from the intrinsic hexagonal symmetry of two-dimensional graphene, which is supported by theoretical simulation using molecular dynamics. Our findings are expected to play a key role in understanding of ripple physics in graphene and other two-dimensional materials.

  12. The C-terminal domain of the Bloom syndrome DNA helicase is essential for genomic stability

    Directory of Open Access Journals (Sweden)

    Noonan James P

    2001-07-01

    Full Text Available Abstract Background Bloom syndrome is a rare cancer-prone disorder in which the cells of affected persons have a high frequency of somatic mutation and genomic instability. Bloom syndrome cells have a distinctive high frequency of sister chromatid exchange and quadriradial formation. BLM, the protein altered in BS, is a member of the RecQ DNA helicase family, whose members share an average of 40% identity in the helicase domain and have divergent N-terminal and C-terminal flanking regions of variable lengths. The BLM DNA helicase has been shown to localize to the ND10 (nuclear domain 10 or PML (promyelocytic leukemia nuclear bodies, where it associates with TOPIIIα, and to the nucleolus. Results This report demonstrates that the N-terminal domain of BLM is responsible for localization of the protein to the nuclear bodies, while the C-terminal domain directs the protein to the nucleolus. Deletions of the N-terminal domain of BLM have little effect on sister chromatid exchange frequency and chromosome stability as compared to helicase and C-terminal mutations which can increase SCE frequency and chromosome abnormalities. Conclusion The helicase activity and the C-terminal domain of BLM are critical for maintaining genomic stability as measured by the sister chromatid exchange assay. The localization of BLM into the nucleolus by the C-terminal domain appears to be more important to genomic stability than localization in the nuclear bodies.

  13. Learning Local Components to Understand Large Bayesian Networks

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Xiang, Yanping; Cordero, Jorge

    2009-01-01

    (domain experts) to extract accurate information from a large Bayesian network due to dimensional difficulty. We define a formulation of local components and propose a clustering algorithm to learn such local components given complete data. The algorithm groups together most inter-relevant attributes......Bayesian networks are known for providing an intuitive and compact representation of probabilistic information and allowing the creation of models over a large and complex domain. Bayesian learning and reasoning are nontrivial for a large Bayesian network. In parallel, it is a tough job for users...... in a domain. We evaluate its performance on three benchmark Bayesian networks and provide results in support. We further show that the learned components may represent local knowledge more precisely in comparison to the full Bayesian networks when working with a small amount of data....

  14. Evidence of benzenoid domains in nanographenes.

    Science.gov (United States)

    Baldoni, Matteo; Mercuri, Francesco

    2015-01-21

    Calculations based on density functional theory demonstrate the occurrence of local deformations of the perfect honeycomb lattice in nanographenes to form arrangements, with triangular symmetry, composed of six-membered ring patterns. The formation of these locally regular superstructures, which can be considered as benzenoid-like domains on the 2D graphene lattice, is ascribed to the gain in resonance energy deriving from aromaticity. The relationship between the atomic morphology of nanographenes and details of the relaxed structure is rationalized in terms of Clar's theory of the aromatic sextet and by extending concepts borrowed from valence bond theory to 2D carbon nanostructures. Namely, two regular arrangements can be evidenced, defined as Clar (fully benzenoid) and Kekulé domains, which correspond to two different regular bond patterns in sets of adjacent six-membered rings. Our findings are compatible with recent experiments and have potentially relevant consequences in the development of novel electronic devices based on graphene materials.

  15. Restoration in multi-domain GMPLS-based networks

    DEFF Research Database (Denmark)

    Manolova, Anna; Ruepp, Sarah Renée; Dittmann, Lars

    2011-01-01

    In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introdu......In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms...... are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as...

  16. Polar and chemical domain structures of lead scandium tantalate (PST)

    International Nuclear Information System (INIS)

    Peng, J.L.; Bursill, L.A.

    1993-01-01

    The local structure of chemical and polar domains and domain walls is determined directly by atomic resolution high-resolution electron microscopy. Thus the Pb, Ta and Sc atomic positions may be located in the images of very thin crystals. Furthermore the Pb cation displacements away from the ideal perovskite A-site have been measured directly for the first time. Local variations in polarization direction may be mapped directly off the images, provided certain electron optical conditions are met. The results are relevant to recent theories of polar-glass behaviour in relaxor-type complex oxide functional ceramics. 17 refs., 9 figs

  17. Explicit logic circuits predict local properties of the neocortex's physiology and anatomy.

    Directory of Open Access Journals (Sweden)

    Lane Yoder

    Full Text Available BACKGROUND: Two previous articles proposed an explicit model of how the brain processes information by its organization of synaptic connections. The family of logic circuits was shown to generate neural correlates of complex psychophysical phenomena in different sensory systems. METHODOLOGY/PRINCIPAL FINDINGS: Here it is shown that the most cost-effective architectures for these networks produce correlates of electrophysiological brain phenomena and predict major aspects of the anatomical structure and physiological organization of the neocortex. The logic circuits are markedly efficient in several respects and provide the foundation for all of the brain's combinational processing of information. CONCLUSIONS/SIGNIFICANCE: At the local level, these networks account for much of the physical structure of the neocortex as well its organization of synaptic connections. Electronic implementations of the logic circuits may be more efficient than current electronic logic arrays in generating both Boolean and fuzzy logic.

  18. FH3, a domain found in formins, targets the fission yeast formin Fus1 to the projection tip during conjugation

    DEFF Research Database (Denmark)

    Petersen, J; Nielsen, O; Egel, R

    1998-01-01

    of the late G2 cells in a vegetatively growing population. Expression of both FH3-GFP fusions also affected cytokinesis. Overexpression of the spindle pole body component Sad1 altered the distribution of both Sad1 and the FH3-GFP domain. Together these data suggest that proteins at multiple sites can interact...... is required for conjugation, and is localized to the projection tip in cells of mating pairs. We replaced genomic fus1+ with green fluorescent protein (GFP)- tagged versions that lacked either the FH1, FH2, or FH3 domain. Deletion of any FH domain essentially abolished mating. FH3, but neither FH1 nor FH2......, was required for Fus1 localization. An FH3 domain-GFP fusion protein localized to the projection tips of mating pairs. Thus, the FH3 domain alone can direct protein localization. The FH3 domains of both Fus1 and the S. pombe cytokinesis formin Cdc12 were able to localize GFP to the spindle pole body in half...

  19. Frequency-domain waveform inversion using the unwrapped phase

    KAUST Repository

    Choi, Yun Seok

    2011-01-01

    Phase wrapping in the frequency-domain (or cycle skipping in the time-domain) is the major cause of the local minima problem in the waveform inversion. The unwrapped phase has the potential to provide us with a robust and reliable waveform inversion, with reduced local minima. We propose a waveform inversion algorithm using the unwrapped phase objective function in the frequency-domain. The unwrapped phase, or what we call the instantaneous traveltime, is given by the imaginary part of dividing the derivative of the wavefield with respect to the angular frequency by the wavefield itself. As a result, the objective function is given a traveltime-like function, which allows us to smooth it and reduce its nonlinearity. The gradient of the objective function is computed using the back-propagation algorithm based on the adjoint-state technique. We apply both our waveform inversion algorithm using the unwrapped phase and the conventional waveform inversion and show that our inversion algorithm gives better convergence to the true model than the conventional waveform inversion. © 2011 Society of Exploration Geophysicists.

  20. Nuclear Trafficking of the Rabies Virus Interferon Antagonist P-Protein Is Regulated by an Importin-Binding Nuclear Localization Sequence in the C-Terminal Domain.

    Directory of Open Access Journals (Sweden)

    Caitlin L Rowe

    Full Text Available Rabies virus P-protein is expressed as five isoforms (P1-P5 which undergo nucleocytoplasmic trafficking important to roles in immune evasion. Although nuclear import of P3 is known to be mediated by an importin (IMP-recognised nuclear localization sequence in the N-terminal region (N-NLS, the mechanisms underlying nuclear import of other P isoforms in which the N-NLS is inactive or has been deleted have remained unresolved. Based on the previous observation that mutation of basic residues K214/R260 of the P-protein C-terminal domain (P-CTD can result in nuclear exclusion of P3, we used live cell imaging, protein interaction analysis and in vitro nuclear transport assays to examine in detail the nuclear trafficking properties of this domain. We find that the effect of mutation of K214/R260 on P3 is largely dependent on nuclear export, suggesting that nuclear exclusion of mutated P3 involves the P-CTD-localized nuclear export sequence (C-NES. However, assays using cells in which nuclear export is pharmacologically inhibited indicate that these mutations significantly inhibit P3 nuclear accumulation and, importantly, prevent nuclear accumulation of P1, suggestive of effects on NLS-mediated import activity in these isoforms. Consistent with this, molecular binding and transport assays indicate that the P-CTD mediates IMPα2/IMPβ1-dependent nuclear import by conferring direct binding to the IMPα2/IMPβ1 heterodimer, as well as to a truncated form of IMPα2 lacking the IMPβ-binding autoinhibitory domain (ΔIBB-IMPα2, and IMPβ1 alone. These properties are all dependent on K214 and R260. This provides the first evidence that P-CTD contains a genuine IMP-binding NLS, and establishes the mechanism by which P-protein isoforms other than P3 can be imported to the nucleus. These data underpin a refined model for P-protein trafficking that involves the concerted action of multiple NESs and IMP-binding NLSs, and highlight the intricate regulation of P

  1. Dressed Domain Walls and holography

    International Nuclear Information System (INIS)

    Grisa, Luca; Pujolas, Oriol

    2008-01-01

    The cutoff version of the AdS/CFT correspondence states that the Randall Sundrum scenario is dual to a Conformal Field Theory (CFT) coupled to gravity in four dimensions. The gravitational field produced by relativistic Domain Walls can be exactly solved in both sides of the correspondence, and thus provides one further check of it. We show in the two sides that for the most symmetric case, the wall motion does not lead to particle production of the CFT fields. Still, there are nontrivial effects. Due to the trace anomaly, the CFT effectively renormalizes the Domain Wall tension. On the five dimensional side, the wall is a codimension 2 brane localized on the Randall-Sundrum brane, which pulls the wall in a uniform acceleration. This is perceived from the brane as a Domain Wall with a tension slightly larger than its bare value. In both cases, the deviation from General Relativity appears at nonlinear level in the source, and the leading corrections match to the numerical factors.

  2. Evaluation of the kinase domain of c-KIT in canine cutaneous mast cell tumors

    International Nuclear Information System (INIS)

    Webster, Joshua D; Kiupel, Matti; Yuzbasiyan-Gurkan, Vilma

    2006-01-01

    Mutations in the c-KIT proto-oncogene have been implicated in the progression of several neoplastic diseases, including gastrointestinal stromal tumors and mastocytosis in humans, and cutaneous mast cell tumors (MCTs) in canines. Mutations in human mastocytosis patients primarily occur in c-KIT exon 17, which encodes a portion of its kinase domain. In contrast, deletions and internal tandem duplication (ITD) mutations are found in the juxtamembrane domain of c-KIT in approximately 15% of canine MCTs. In addition, ITD c-KIT mutations are significantly associated with aberrant KIT protein localization in canine MCTs. However, some canine MCTs have aberrant KIT localization but lack ITD c-KIT mutations, suggesting that other mutations or other factors may be responsible for aberrant KIT localization in these tumors. In order to characterize the prevalence of mutations in the phospho-transferase portion of c-KIT's kinase domain in canine MCTs exons 16–20 of 33 canine MCTs from 33 dogs were amplified and sequenced. Additionally, in order to determine if mutations in c-KIT exon 17 are responsible for aberrant KIT localization in MCTs that lack juxtamembrane domain c-KIT mutations, c-KIT exon 17 was amplified and sequenced from 18 canine MCTs that showed an aberrant KIT localization pattern but did not have ITD c-KIT mutations. No mutations or polymorphisms were identified in exons 16–20 of any of the MCTs examined. In conclusion, mutations in the phospho-transferase portion of c-KIT's kinase domain do not play an important role in the progression of canine cutaneous MCTs, or in the aberrant localization of KIT in canine MCTs

  3. Toward a Blended Ontology: Applying Knowledge Systems to Compare Therapeutic and Toxicological Nanoscale Domains

    Directory of Open Access Journals (Sweden)

    Christopher M. Grulke

    2012-01-01

    Full Text Available Bionanomedicine and environmental research share need common terms and ontologies. This study applied knowledge systems, data mining, and bibliometrics used in nano-scale ADME research from 1991 to 2011. The prominence of nano-ADME in environmental research began to exceed the publication rate in medical research in 2006. That trend appears to continue as a result of the growing products in commerce using nanotechnology, that is, 5-fold growth in number of countries with nanomaterials research centers. Funding for this research virtually did not exist prior to 2002, whereas today both medical and environmental research is funded globally. Key nanoparticle research began with pharmacology and therapeutic drug-delivery and contrasting agents, but the advances have found utility in the environmental research community. As evidence ultrafine aerosols and aquatic colloids research increased 6-fold, indicating a new emphasis on environmental nanotoxicology. User-directed expert elicitation from the engineering and chemical/ADME domains can be combined with appropriate Boolean logic and queries to define the corpus of nanoparticle interest. The study combined pharmacological expertise and informatics to identify the corpus by building logical conclusions and observations. Publication records informatics can lead to an enhanced understanding the connectivity between fields, as well as overcoming the differences in ontology between the fields.

  4. All-in-all-out magnetic domain size in pyrochlore iridate thin films as probed by local magnetotransport

    Energy Technology Data Exchange (ETDEWEB)

    Fujita, T. C.; Uchida, M., E-mail: uchida@ap.t.u-tokyo.ac.jp; Kozuka, Y.; Ogawa, S. [Department of Applied Physics and Quantum-Phase Electronics Center (QPEC), University of Tokyo, Tokyo 113-8656 (Japan); Tsukazaki, A. [Institute for Materials Research, Tohoku University, Sendai 980-8577 (Japan); PRESTO, Japan Science and Technology Agency (JST), Tokyo 102-0075 (Japan); Arima, T. [Department of Advanced Materials Science, University of Tokyo, Kashiwa 277-8561 (Japan); RIKEN Center for Emergent Matter Science (CEMS), Wako 351-0198 (Japan); Kawasaki, M. [Department of Applied Physics and Quantum-Phase Electronics Center (QPEC), University of Tokyo, Tokyo 113-8656 (Japan); RIKEN Center for Emergent Matter Science (CEMS), Wako 351-0198 (Japan)

    2016-01-11

    Pyrochlore iridates have attracted growing attention because of a theoretical prediction of a possible topological semimetal phase originating from all-in-all-out spin ordering. Related to the topological band structure, recent findings of the magnetic domain wall conduction have stimulated investigations of magnetic domain distribution in this system. Here, we investigate the size of magnetic domains in Eu{sub 2}Ir{sub 2}O{sub 7} single crystalline thin films by magnetoresistance (MR) using microscale Hall bars. Two distinct magnetic domains of the all-in-all-out spin structure are known to exhibit linear MR but with opposite signs, which enables us to estimate the ratio of the two domains in the patterned channel. The linear MR for 80 × 60 μm{sup 2} channel is nearly zero after zero-field cooling, suggesting random distribution of domains smaller than the channel size. In contrast, the wide distribution of the value of the linear MR is detected in 2 × 2 μm{sup 2} channel, reflecting the detectable domain size depending on each cooling-cycle. Compared to simulation results, we estimate the average size of a single all-in-all-out magnetic domain as 1–2 μm.

  5. SH2 domains: modulators of nonreceptor tyrosine kinase activity.

    Science.gov (United States)

    Filippakopoulos, Panagis; Müller, Susanne; Knapp, Stefan

    2009-12-01

    The Src homology 2 (SH2) domain is a sequence-specific phosphotyrosine-binding module present in many signaling molecules. In cytoplasmic tyrosine kinases, the SH2 domain is located N-terminally to the catalytic kinase domain (SH1) where it mediates cellular localization, substrate recruitment, and regulation of kinase activity. Initially, structural studies established a role of the SH2 domain stabilizing the inactive state of Src family members. However, biochemical characterization showed that the presence of the SH2 domain is frequently required for catalytic activity, suggesting a crucial function stabilizing the active state of many nonreceptor tyrosine kinases. Recently, the structure of the SH2-kinase domain of Fes revealed that the SH2 domain stabilizes the active kinase conformation by direct interactions with the regulatory helix alphaC. Stabilizing interactions between the SH2 and the kinase domains have also been observed in the structures of active Csk and Abl. Interestingly, mutations in the SH2 domain found in human disease can be explained by SH2 domain destabilization or incorrect positioning of the SH2. Here we summarize our understanding of mechanisms that lead to tyrosine kinase activation by direct interactions mediated by the SH2 domain and discuss how mutations in the SH2 domain trigger kinase inactivation.

  6. Conduction at domain walls in oxide multiferroics

    Science.gov (United States)

    Seidel, J.; Martin, L. W.; He, Q.; Zhan, Q.; Chu, Y.-H.; Rother, A.; Hawkridge, M. E.; Maksymovych, P.; Yu, P.; Gajek, M.; Balke, N.; Kalinin, S. V.; Gemming, S.; Wang, F.; Catalan, G.; Scott, J. F.; Spaldin, N. A.; Orenstein, J.; Ramesh, R.

    2009-03-01

    Domain walls may play an important role in future electronic devices, given their small size as well as the fact that their location can be controlled. Here, we report the observation of room-temperature electronic conductivity at ferroelectric domain walls in the insulating multiferroic BiFeO3. The origin and nature of the observed conductivity are probed using a combination of conductive atomic force microscopy, high-resolution transmission electron microscopy and first-principles density functional computations. Our analyses indicate that the conductivity correlates with structurally driven changes in both the electrostatic potential and the local electronic structure, which shows a decrease in the bandgap at the domain wall. Additionally, we demonstrate the potential for device applications of such conducting nanoscale features.

  7. Histopathological Breast-Image Classification Using Local and Frequency Domains by Convolutional Neural Network

    Directory of Open Access Journals (Sweden)

    Abdullah-Al Nahid

    2018-01-01

    Full Text Available Identification of the malignancy of tissues from Histopathological images has always been an issue of concern to doctors and radiologists. This task is time-consuming, tedious and moreover very challenging. Success in finding malignancy from Histopathological images primarily depends on long-term experience, though sometimes experts disagree on their decisions. However, Computer Aided Diagnosis (CAD techniques help the radiologist to give a second opinion that can increase the reliability of the radiologist’s decision. Among the different image analysis techniques, classification of the images has always been a challenging task. Due to the intense complexity of biomedical images, it is always very challenging to provide a reliable decision about an image. The state-of-the-art Convolutional Neural Network (CNN technique has had great success in natural image classification. Utilizing advanced engineering techniques along with the CNN, in this paper, we have classified a set of Histopathological Breast-Cancer (BC images utilizing a state-of-the-art CNN model containing a residual block. Conventional CNN operation takes raw images as input and extracts the global features; however, the object oriented local features also contain significant information—for example, the Local Binary Pattern (LBP represents the effective textural information, Histogram represent the pixel strength distribution, Contourlet Transform (CT gives much detailed information about the smoothness about the edges, and Discrete Fourier Transform (DFT derives frequency-domain information from the image. Utilizing these advantages, along with our proposed novel CNN model, we have examined the performance of the novel CNN model as Histopathological image classifier. To do so, we have introduced five cases: (a Convolutional Neural Network Raw Image (CNN-I; (b Convolutional Neural Network CT Histogram (CNN-CH; (c Convolutional Neural Network CT LBP (CNN-CL; (d Convolutional

  8. Time-Domain Simulation of RF Couplers

    International Nuclear Information System (INIS)

    Smithe, David; Carlsson, Johan; Austin, Travis

    2009-01-01

    We have developed a finite-difference time-domain (FDTD) fluid-like approach to integrated plasma-and-coupler simulation [1], and show how it can be used to model LH and ICRF couplers in the MST and larger tokamaks.[2] This approach permits very accurate 3-D representation of coupler geometry, and easily includes non-axi-symmetry in vessel wall, magnetic equilibrium, and plasma density. The plasma is integrated with the FDTD Maxwell solver in an implicit solve that steps over electron time-scales, and permits tenuous plasma in the coupler itself, without any need to distinguish or interface between different regions of vacuum and/or plasma. The FDTD algorithm is also generalized to incorporate a time-domain sheath potential [3] on metal structures within the simulation, to look for situations where the sheath potential might generate local sputtering opportunities. Benchmarking of the time-domain sheath algorithm has been reported in the references. Finally, the time-domain software [4] permits the use of particles, either as field diagnostic (test particles) or to self-consistently compute plasma current from the applied RF power.

  9. Local anesthetics disrupt energetic coupling between the voltage-sensing segments of a sodium channel.

    Science.gov (United States)

    Muroi, Yukiko; Chanda, Baron

    2009-01-01

    Local anesthetics block sodium channels in a state-dependent fashion, binding with higher affinity to open and/or inactivated states. Gating current measurements show that local anesthetics immobilize a fraction of the gating charge, suggesting that the movement of voltage sensors is modified when a local anesthetic binds to the pore of the sodium channel. Here, using voltage clamp fluorescence measurements, we provide a quantitative description of the effect of local anesthetics on the steady-state behavior of the voltage-sensing segments of a sodium channel. Lidocaine and QX-314 shifted the midpoints of the fluorescence-voltage (F-V) curves of S4 domain III in the hyperpolarizing direction by 57 and 65 mV, respectively. A single mutation in the S6 of domain IV (F1579A), a site critical for local anesthetic block, abolished the effect of QX-314 on the voltage sensor of domain III. Both local anesthetics modestly shifted the F-V relationships of S4 domain IV toward hyperpolarized potentials. In contrast, the F-V curve of the S4 domain I was shifted by 11 mV in the depolarizing direction upon QX-314 binding. These antagonistic effects of the local anesthetic indicate that the drug modifies the coupling between the voltage-sensing domains of the sodium channel. Our findings suggest a novel role of local anesthetics in modulating the gating apparatus of the sodium channel.

  10. Domain walls dynamics in the amorphous ribbon with a helical magnetic anisotropy

    International Nuclear Information System (INIS)

    Zhmetko, D.N.; Savin, V.V.; Lemish, P.V.; Troschenkov, Y.N.

    2006-01-01

    The damping mechanism for motion of domain walls, which form the sandwich structure and move from the middle plane of the ribbon to opposite surfaces during the dynamic magnetization reversal, have been investigated. The difference between the real and ideal sandwich domain structure, the actual distribution of the anisotropy easy directions through the ribbon thickness and the M-bar s deviation from local easy directions under the action of applied magnetic field have been taken into account. It was revealed that the maximum of the total damping coefficient β tot (x) near the half-way of the domain wall run is due to the influence of the magnetic stray fields. These fields have a character of irregular oscillations and are directed approximately perpendicular to the local easy direction of the ribbon layer through which the domain wall propagates. The damping coefficient β e.c. (x) determined by eddy-currents has the maximal value close to the ribbon middle and decreases linearly to zero when the domain wall approaches the ribbon surface

  11. Measurement of the local muscular metabolism by time-domain near infrared spectroscopy during knee flex-extension induced by functional electrical stimulation

    Science.gov (United States)

    Contini, D.; Spinelli, L.; Torricelli, A.; Ferrante, S.; Pedrocchi, A.; Molteni, F.; Ferrigno, G.; Cubeddu, R.

    2009-02-01

    We present a preliminary study that combines functional electrical stimulation and time-domain near infrared spectroscopy for a quantitative measurement of the local muscular metabolism during rehabilitation of post-acute stroke patients. Seven healthy subjects and nine post-acute stroke patients underwent a protocol of knee flex-extension of the quadriceps induced by functional electrical stimulation. During the protocol time-domain near infrared spectroscopy measurement were performed on both left and right muscle. Hemodynamic parameters (concentration of oxy- and deoxy-genated hemoglobin) during baseline did not show any significant differences between healthy subject and patients, while functional performances (knee angle amplitude) were distinctly different. Nevertheless, even if their clinical histories were noticeably different, there was no differentiation among functional performances of patients. On the basis of the hemodynamic parameters measured during the recovery phase, instead, it was possible to identify two classes of patients showing a metabolic trend similar or very different to the one obtained by healthy subjects. The presented results suggest that the combination of functional and metabolic information can give an additional tool to the clinicians in the evaluation of the rehabilitation in post-acute stroke patients.

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

  13. Analytic energy derivatives for the calculation of the first-order molecular properties using the domain-based local pair-natural orbital coupled-cluster theory

    Science.gov (United States)

    Datta, Dipayan; Kossmann, Simone; Neese, Frank

    2016-09-01

    The domain-based local pair-natural orbital coupled-cluster (DLPNO-CC) theory has recently emerged as an efficient and powerful quantum-chemical method for the calculation of energies of molecules comprised of several hundred atoms. It has been demonstrated that the DLPNO-CC approach attains the accuracy of a standard canonical coupled-cluster calculation to about 99.9% of the basis set correlation energy while realizing linear scaling of the computational cost with respect to system size. This is achieved by combining (a) localized occupied orbitals, (b) large virtual orbital correlation domains spanned by the projected atomic orbitals (PAOs), and (c) compaction of the virtual space through a truncated pair natural orbital (PNO) basis. In this paper, we report on the implementation of an analytic scheme for the calculation of the first derivatives of the DLPNO-CC energy for basis set independent perturbations within the singles and doubles approximation (DLPNO-CCSD) for closed-shell molecules. Perturbation-independent one-particle density matrices have been implemented in order to account for the response of the CC wave function to the external perturbation. Orbital-relaxation effects due to external perturbation are not taken into account in the current implementation. We investigate in detail the dependence of the computed first-order electrical properties (e.g., dipole moment) on the three major truncation parameters used in a DLPNO-CC calculation, namely, the natural orbital occupation number cutoff used for the construction of the PNOs, the weak electron-pair cutoff, and the domain size cutoff. No additional truncation parameter has been introduced for property calculation. We present benchmark calculations on dipole moments for a set of 10 molecules consisting of 20-40 atoms. We demonstrate that 98%-99% accuracy relative to the canonical CCSD results can be consistently achieved in these calculations. However, this comes with the price of tightening the

  14. Domain structure in soft ferrites by the longitudinal Kerr effect

    International Nuclear Information System (INIS)

    Kaczmarek, R.; Dautain, M.; Barradi-Ismail, T.

    1992-01-01

    For the first time, the longitudinal Kerr effect has been used in order to observe magnetic domains and their development in power ferrites. Image subtraction and processing leads to a magnetic contrast being a quasi derivative of the domains. A kind of integration procedure applied to them permits a reconstruction of a local hysteresis which parameters closely approach the global hysteresis data. (orig.)

  15. Aspirin locally disrupts the liquid-ordered phase

    Science.gov (United States)

    Alsop, Richard J.; Himbert, Sebastian; Dhaliwal, Alexander; Schmalzl, Karin; Rheinstädter, Maikel C.

    2018-02-01

    Local structure and dynamics of lipid membranes play an important role in membrane function. The diffusion of small molecules, the curvature of lipids around a protein and the existence of cholesterol-rich lipid domains (rafts) are examples for the membrane to serve as a functional interface. The collective fluctuations of lipid tails, in particular, are relevant for diffusion of membrane constituents and small molecules in and across membranes, and for structure and formation of membrane domains. We studied the effect of aspirin (acetylsalicylic acid, ASA) on local structure and dynamics of membranes composed of dimyristoylphosphocholine (DMPC) and cholesterol. Aspirin is a common analgesic, but is also used in the treatment of cholesterol. Using coherent inelastic neutron scattering experiments and molecular dynamics (MD) simulations, we present evidence that ASA binds to liquid-ordered, raft-like domains and disturbs domain organization and dampens collective fluctuations. By hydrogen-bonding to lipid molecules, ASA forms `superfluid' complexes with lipid molecules that can organize laterally in superlattices and suppress cholesterol's ordering effect.

  16. Astrocyte mega-domain hypothesis of the autistic savantism.

    Science.gov (United States)

    Mitterauer, Bernhard J

    2013-01-01

    Individuals with autism who show high abilities are called savants. Whereas in their brains a disconnection in and between neural networks has been identified, savantism is yet poorly understood. Focusing on astrocyte domain organization, it is hypothesized that local astrocyte mega-organizations may be responsible for exerting high capabilities in brains of autistic savants. Astrocytes, the dominant glial cell type, modulate synaptic information transmission. Each astrocyte is organized in non-overlapping domains. Formally, each astrocyte contacting n-neurons with m-synapses via its processes generates dynamic domains of synaptic interactions based on qualitative computation criteria, and hereby it structures neuronal information processing. If the number of processes is genetically significantly increased, these astrocytes operate in a mega-domain with a higher complexitiy of computation. From this model savant abilities are deduced. Copyright © 2012 Elsevier Ltd. All rights reserved.

  17. Magnetic domains and magnetic stability of cohenite from the Morasko iron meteorite

    Energy Technology Data Exchange (ETDEWEB)

    Reznik, B. [Institute of Applied Geosciences, Karlsruhe Institute of Technology, Karlsruhe (Germany); Kontny, A., E-mail: agnes.kontny@kit.edu [Institute of Applied Geosciences, Karlsruhe Institute of Technology, Karlsruhe (Germany); Uehara, M.; Gattacceca, J. [CNRS, Aix Marseille Univ, IRD, Coll France, CEREGE, Aix-en-Provence (France); Solheid, P.; Jackson, M. [Institute for Rock Magnetism, University of Minnesota, Minneapolis, MN (United States)

    2017-03-15

    Magnetic properties, texture and microstructure of cohenite grains from Morasko iron meteorite have been investigated using electron backscattered diffraction, Bitter pattern technique, magneto-optical imaging method and magnetic force microscopy. Cohenite shows much stronger magnetic contrast compared to kamacite because it is magnetically harder than the Fe-Ni alloy, and thus causes higher stray fields. A surprising result is the high stability and reversibility of the global stripe-like magnetic domain structure in cohenite when applying high magnetic fields up to 1.5 T, and exposing it to high temperatures above the Curie temperature of about 220 °C. Heating up to 700 °C under atmosphere conditions has shown that cohenite remains stable and that the global magnetic domain structures mainly recover to its preheating state. This observation suggests that magnetic domains are strongly controlled by the crystal anisotropy of cohenite. Branching magnetic domain structures at the grain boundary to kamacite can be annealed, which indicates that they are very sensitive to record deformation. EBSD observations clearly demonstrate that increasing deviation from the easy [010] crystallographic axis and stress localization are the main factors controlling the distortion of Bitter patterns, and suggest a high sensitivity of the cohenite magnetic domain structure to local microstructural heterogeneities. The results of this study substantiate the theory that cohenite can be a good recorder of magnetic fields in planetary core material. - Highlights: • Magnetic domain structure of cohenite from the Morasko iron meteorite was investigated by Bitter pattern method, magneto-optical imaging and magnetic force microscopy. • Strong magnetocrystalline anisotropy explains high magnetic stability. • Magnetic domain structure shows high sensitivity to local microstructural heterogeneities. • Cohenite is probably a good recorder of magnetic fields in planetary core material.

  18. Magnetic domains and magnetic stability of cohenite from the Morasko iron meteorite

    International Nuclear Information System (INIS)

    Reznik, B.; Kontny, A.; Uehara, M.; Gattacceca, J.; Solheid, P.; Jackson, M.

    2017-01-01

    Magnetic properties, texture and microstructure of cohenite grains from Morasko iron meteorite have been investigated using electron backscattered diffraction, Bitter pattern technique, magneto-optical imaging method and magnetic force microscopy. Cohenite shows much stronger magnetic contrast compared to kamacite because it is magnetically harder than the Fe-Ni alloy, and thus causes higher stray fields. A surprising result is the high stability and reversibility of the global stripe-like magnetic domain structure in cohenite when applying high magnetic fields up to 1.5 T, and exposing it to high temperatures above the Curie temperature of about 220 °C. Heating up to 700 °C under atmosphere conditions has shown that cohenite remains stable and that the global magnetic domain structures mainly recover to its preheating state. This observation suggests that magnetic domains are strongly controlled by the crystal anisotropy of cohenite. Branching magnetic domain structures at the grain boundary to kamacite can be annealed, which indicates that they are very sensitive to record deformation. EBSD observations clearly demonstrate that increasing deviation from the easy [010] crystallographic axis and stress localization are the main factors controlling the distortion of Bitter patterns, and suggest a high sensitivity of the cohenite magnetic domain structure to local microstructural heterogeneities. The results of this study substantiate the theory that cohenite can be a good recorder of magnetic fields in planetary core material. - Highlights: • Magnetic domain structure of cohenite from the Morasko iron meteorite was investigated by Bitter pattern method, magneto-optical imaging and magnetic force microscopy. • Strong magnetocrystalline anisotropy explains high magnetic stability. • Magnetic domain structure shows high sensitivity to local microstructural heterogeneities. • Cohenite is probably a good recorder of magnetic fields in planetary core material.

  19. Multilevel domain decomposition for electronic structure calculations

    International Nuclear Information System (INIS)

    Barrault, M.; Cances, E.; Hager, W.W.; Le Bris, C.

    2007-01-01

    We introduce a new multilevel domain decomposition method (MDD) for electronic structure calculations within semi-empirical and density functional theory (DFT) frameworks. This method iterates between local fine solvers and global coarse solvers, in the spirit of domain decomposition methods. Using this approach, calculations have been successfully performed on several linear polymer chains containing up to 40,000 atoms and 200,000 atomic orbitals. Both the computational cost and the memory requirement scale linearly with the number of atoms. Additional speed-up can easily be obtained by parallelization. We show that this domain decomposition method outperforms the density matrix minimization (DMM) method for poor initial guesses. Our method provides an efficient preconditioner for DMM and other linear scaling methods, variational in nature, such as the orbital minimization (OM) procedure

  20. Virtual network embedding in cross-domain network based on topology and resource attributes

    Science.gov (United States)

    Zhu, Lei; Zhang, Zhizhong; Feng, Linlin; Liu, Lilan

    2018-03-01

    Aiming at the network architecture ossification and the diversity of access technologies issues, this paper researches the cross-domain virtual network embedding algorithm. By analysing the topological attribute from the local and global perspective of nodes in the virtual network and the physical network, combined with the local network resource property, we rank the embedding priority of the nodes with PCA and TOPSIS methods. Besides, the link load distribution is considered. Above all, We proposed an cross-domain virtual network embedding algorithm based on topology and resource attributes. The simulation results depicts that our algorithm increases the acceptance rate of multi-domain virtual network requests, compared with the existing virtual network embedding algorithm.

  1. Domain decomposition methods for core calculations using the MINOS solver

    International Nuclear Information System (INIS)

    Guerin, P.; Baudron, A. M.; Lautard, J. J.

    2007-01-01

    Cell by cell homogenized transport calculations of an entire nuclear reactor core are currently too expensive for industrial applications, even if a simplified transport (SPn) approximation is used. In order to take advantage of parallel computers, we propose here two domain decomposition methods using the mixed dual finite element solver MINOS. The first one is a modal synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second one is an iterative method based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the close sub-domains estimated at the previous iteration. For these two methods, we give numerical results which demonstrate their accuracy and their efficiency for the diffusion model on realistic 2D and 3D cores. (authors)

  2. Mesencephalic basolateral domain specification is dependent on Sonic Hedgehog

    Directory of Open Access Journals (Sweden)

    Jesus E. Martinez-Lopez

    2015-02-01

    Full Text Available In the study of central nervous system morphogenesis, the identification of new molecular markers allows us to identify domains along the antero-posterior and dorso-ventral axes. In the past years, the alar and basal plates of the midbrain have been divided into different domains. The precise location of the alar-basal boundary is still under discussion. We have identified Barhl1, Nhlh1 and Six3 as appropriate molecular markers to the adjacent domains of this transition. The description of their expression patterns and the contribution to the different mesencephalic populations corroborated their role in the specification of these domains. We studied the influence of Sonic Hedgehog on these markers and therefore on the specification of these territories. The lack of this morphogen produced severe alterations in the expression pattern of Barhl1 and Nhlh1 with consequent misspecification of the basolateral domain. Six3 expression was apparently unaffected, however its distribution changed leading to altered basal domains. In this study we confirmed the localization of the alar-basal boundary dorsal to the basolateral domain and demonstrated that the development of the basolateral domain highly depends on Shh.

  3. Mesencephalic basolateral domain specification is dependent on Sonic Hedgehog

    Science.gov (United States)

    Martinez-Lopez, Jesus E.; Moreno-Bravo, Juan A.; Madrigal, M. Pilar; Martinez, Salvador; Puelles, Eduardo

    2015-01-01

    In the study of central nervous system morphogenesis, the identification of new molecular markers allows us to identify domains along the antero-posterior and dorso-ventral (DV) axes. In the past years, the alar and basal plates of the midbrain have been divided into different domains. The precise location of the alar-basal boundary is still under discussion. We have identified Barhl1, Nhlh1 and Six3 as appropriate molecular markers to the adjacent domains of this transition. The description of their expression patterns and the contribution to the different mesencephalic populations corroborated their role in the specification of these domains. We studied the influence of Sonic Hedgehog on these markers and therefore on the specification of these territories. The lack of this morphogen produced severe alterations in the expression pattern of Barhl1 and Nhlh1 with consequent misspecification of the basolateral (BL) domain. Six3 expression was apparently unaffected, however its distribution changed leading to altered basal domains. In this study we confirmed the localization of the alar-basal boundary dorsal to the BL domain and demonstrated that the development of the BL domain highly depends on Shh. PMID:25741244

  4. Thermal domains in inhomogeneous current-carrying superconductors. Current-voltage characteriscs and dynamics of domain formation after current jumps

    International Nuclear Information System (INIS)

    Bezuglyj, A.I.; Shklovskij, V.A.

    1984-01-01

    The static and dynamic behavior of thermal domains in inhomogeneous superconducting films, where the inhomogeneity behaves like a portion of the film with a reduced critical current, have been studied theoretically within the framework of the phenomenological approach, using the heat balance equation and the dependence of the superconductor critical current on temperature. Depending on the size of the inhomogeneity (local or extended) and on the relative values of parameters of the homogeneous and inhomogeneous regions, different types of current-voltage characteristics are obtained. The nonstationary problem of thermal domain formation near the inhomogeneity after a current jump has been solved, and the domain boundary (kink) dynamics at a distance from the inhomogeneity has been analyzed. A combination of the results allows one to describe the whole process of normal phase formation and its spread throughout the superconducting film

  5. Simplified approaches to some nonoverlapping domain decomposition methods

    Energy Technology Data Exchange (ETDEWEB)

    Xu, Jinchao

    1996-12-31

    An attempt will be made in this talk to present various domain decomposition methods in a way that is intuitively clear and technically coherent and concise. The basic framework used for analysis is the {open_quotes}parallel subspace correction{close_quotes} or {open_quotes}additive Schwarz{close_quotes} method, and other simple technical tools include {open_quotes}local-global{close_quotes} and {open_quotes}global-local{close_quotes} techniques, the formal one is for constructing subspace preconditioner based on a preconditioner on the whole space whereas the later one for constructing preconditioner on the whole space based on a subspace preconditioner. The domain decomposition methods discussed in this talk fall into two major categories: one, based on local Dirichlet problems, is related to the {open_quotes}substructuring method{close_quotes} and the other, based on local Neumann problems, is related to the {open_quotes}Neumann-Neumann method{close_quotes} and {open_quotes}balancing method{close_quotes}. All these methods will be presented in a systematic and coherent manner and the analysis for both two and three dimensional cases are carried out simultaneously. In particular, some intimate relationship between these algorithms are observed and some new variants of the algorithms are obtained.

  6. The measles virus phosphoprotein interacts with the linker domain of STAT1

    International Nuclear Information System (INIS)

    Devaux, Patricia; Priniski, Lauren; Cattaneo, Roberto

    2013-01-01

    The measles virus (MV) phosphoprotein (P) and V proteins block the interferon (IFN) response by impeding phosphorylation of the signal transducer and activator of transcription 1 (STAT1) by the Janus kinase 1 (JAK1). We characterized how STAT1 mutants interact with P and JAK1 phosphorylation. Certain mutants of the linker, the Src-homology 2 domain (SH2), or the transactivation domain had reduced or abolished phosphorylation through JAK1 after IFN treatment. Other mutants, mainly localized in the linker, failed to interact with P as documented by the lack of interference with nuclear translocation. Thus the functional footprint of P on STAT1 localizes mainly to the linker domain; there is also some overlap with the STAT1 phosphorylation functional footprint on the SH2 domain. Based on these observations, we discuss how the MV-P might operate to inhibit the JAK/STAT pathway. - Highlights: • Residue in the linker and SH2 domains of STAT1 are important for MV-P interaction. • Residue in the linker and SH2 domains of STAT1 are important for STAT1 phosphorylation. • Residues interferring with both functions have similar location on STAT1. • The viral P and V proteins may operate in concert to inhibit the JAK/STAT pathway

  7. The measles virus phosphoprotein interacts with the linker domain of STAT1

    Energy Technology Data Exchange (ETDEWEB)

    Devaux, Patricia, E-mail: devaux.patricia@mayo.edu; Priniski, Lauren; Cattaneo, Roberto

    2013-09-15

    The measles virus (MV) phosphoprotein (P) and V proteins block the interferon (IFN) response by impeding phosphorylation of the signal transducer and activator of transcription 1 (STAT1) by the Janus kinase 1 (JAK1). We characterized how STAT1 mutants interact with P and JAK1 phosphorylation. Certain mutants of the linker, the Src-homology 2 domain (SH2), or the transactivation domain had reduced or abolished phosphorylation through JAK1 after IFN treatment. Other mutants, mainly localized in the linker, failed to interact with P as documented by the lack of interference with nuclear translocation. Thus the functional footprint of P on STAT1 localizes mainly to the linker domain; there is also some overlap with the STAT1 phosphorylation functional footprint on the SH2 domain. Based on these observations, we discuss how the MV-P might operate to inhibit the JAK/STAT pathway. - Highlights: • Residue in the linker and SH2 domains of STAT1 are important for MV-P interaction. • Residue in the linker and SH2 domains of STAT1 are important for STAT1 phosphorylation. • Residues interferring with both functions have similar location on STAT1. • The viral P and V proteins may operate in concert to inhibit the JAK/STAT pathway.

  8. The interaction of process and domain in prefrontal cortex during inductive reasoning.

    Science.gov (United States)

    Babcock, Laura; Vallesi, Antonino

    2015-01-01

    Inductive reasoning is an everyday process that allows us to make sense of the world by creating rules from a series of instances. Consistent with accounts of process-based fractionations of the prefrontal cortex (PFC) along the left-right axis, inductive reasoning has been reliably localized to left PFC. However, these results may be confounded by the task domain, which is typically verbal. Indeed, some studies show that right PFC activation is seen with spatial tasks. This study used fMRI to examine the effects of process and domain on the brain regions recruited during a novel pattern discovery task. Twenty healthy young adult participants were asked to discover the rule underlying the presentation of a series of letters in varied spatial locations. The rules were either verbal (pertaining to a single semantic category) or spatial (geometric figures). Bilateral ventrolateral PFC activations were seen for the spatial domain, while the verbal domain showed only left ventrolateral PFC. A conjunction analysis revealed that the two domains recruited a common region of left ventrolateral PFC. The data support a central role of left PFC in inductive reasoning. Importantly, they also suggest that both process and domain shape the localization of reasoning in the brain. Copyright © 2014 The Authors. Published by Elsevier Ltd.. All rights reserved.

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

  10. Kinase Associated-1 Domains Drive MARK/PAR1 Kinases to Membrane Targets by Binding Acidic Phospholipids

    Energy Technology Data Exchange (ETDEWEB)

    Moravcevic, Katarina; Mendrola, Jeannine M.; Schmitz, Karl R.; Wang, Yu-Hsiu; Slochower, David; Janmey, Paul A.; Lemmon, Mark A. (UPENN-MED)

    2011-09-28

    Phospholipid-binding modules such as PH, C1, and C2 domains play crucial roles in location-dependent regulation of many protein kinases. Here, we identify the KA1 domain (kinase associated-1 domain), found at the C terminus of yeast septin-associated kinases (Kcc4p, Gin4p, and Hsl1p) and human MARK/PAR1 kinases, as a membrane association domain that binds acidic phospholipids. Membrane localization of isolated KA1 domains depends on phosphatidylserine. Using X-ray crystallography, we identified a structurally conserved binding site for anionic phospholipids in KA1 domains from Kcc4p and MARK1. Mutating this site impairs membrane association of both KA1 domains and intact proteins and reveals the importance of phosphatidylserine for bud neck localization of yeast Kcc4p. Our data suggest that KA1 domains contribute to coincidence detection, allowing kinases to bind other regulators (such as septins) only at the membrane surface. These findings have important implications for understanding MARK/PAR1 kinases, which are implicated in Alzheimer's disease, cancer, and autism.

  11. Symmetric Logic Synthesis with Phase Assignment

    OpenAIRE

    Benschop, N. F.

    2001-01-01

    Decomposition of any Boolean Function BF_n of n binary inputs into an optimal inverter coupled network of Symmetric Boolean functions SF_k (k \\leq n) is described. Each SF component is implemented by Threshold Logic Cells, forming a complete and compact T-Cell Library. Optimal phase assignment of input polarities maximizes local symmetries. The "rank spectrum" is a new BF_n description independent of input ordering, obtained by mapping its minterms onto an othogonal n \\times n grid of (transi...

  12. Convectons in periodic and bounded domains

    International Nuclear Information System (INIS)

    Mercader, Isabel; Batiste, Oriol; Alonso, Arantxa; Knobloch, Edgar

    2010-01-01

    Numerical continuation is used to compute spatially localized convection in a binary fluid with no-slip laterally insulating boundary conditions and the results are compared with the corresponding ones for periodic boundary conditions (PBC). The change in the boundary conditions produces a dramatic change in the snaking bifurcation diagram that describes the organization of localized states with PBC: the snaking branches turn continuously into a large amplitude state that resembles periodic convection with defects at the sidewalls. Odd parity convectons are more affected by the boundary conditions since the sidewalls suppress the horizontal pumping action that accompanies these states in spatially periodic domains.

  13. Convectons in periodic and bounded domains

    Energy Technology Data Exchange (ETDEWEB)

    Mercader, Isabel; Batiste, Oriol; Alonso, Arantxa [Departament de Fisica Aplicada, Universitat Politecnica de Catalunya, Barcelona (Spain); Knobloch, Edgar [Department of Physics, University of California, Berkeley, CA 94720 (United States)

    2010-04-15

    Numerical continuation is used to compute spatially localized convection in a binary fluid with no-slip laterally insulating boundary conditions and the results are compared with the corresponding ones for periodic boundary conditions (PBC). The change in the boundary conditions produces a dramatic change in the snaking bifurcation diagram that describes the organization of localized states with PBC: the snaking branches turn continuously into a large amplitude state that resembles periodic convection with defects at the sidewalls. Odd parity convectons are more affected by the boundary conditions since the sidewalls suppress the horizontal pumping action that accompanies these states in spatially periodic domains.

  14. Hybrid meshes and domain decomposition for the modeling of oil reservoirs; Maillages hybrides et decomposition de domaine pour la modelisation des reservoirs petroliers

    Energy Technology Data Exchange (ETDEWEB)

    Gaiffe, St

    2000-03-23

    In this thesis, we are interested in the modeling of fluid flow through porous media with 2-D and 3-D unstructured meshes, and in the use of domain decomposition methods. The behavior of flow through porous media is strongly influenced by heterogeneities: either large-scale lithological discontinuities or quite localized phenomena such as fluid flow in the neighbourhood of wells. In these two typical cases, an accurate consideration of the singularities requires the use of adapted meshes. After having shown the limits of classic meshes we present the future prospects offered by hybrid and flexible meshes. Next, we consider the generalization possibilities of the numerical schemes traditionally used in reservoir simulation and we draw two available approaches: mixed finite elements and U-finite volumes. The investigated phenomena being also characterized by different time-scales, special treatments in terms of time discretization on various parts of the domain are required. We think that the combination of domain decomposition methods with operator splitting techniques may provide a promising approach to obtain high flexibility for a local tune-steps management. Consequently, we develop a new numerical scheme for linear parabolic equations which allows to get a higher flexibility in the local space and time steps management. To conclude, a priori estimates and error estimates on the two variables of interest, namely the pressure and the velocity are proposed. (author)

  15. Image-domain full waveform inversion: Field data example

    KAUST Repository

    Zhang, Sanzong

    2014-08-05

    The main difficulty with the data-domain full waveform inversion (FWI) is that it tends to get stuck in the local minima associated with the waveform misfit function. This is the result of cycle skipping which degrades the low-wavenumber update in the absence of low-frequencies and long-offset data. An image-domain objective function is defined as the normed difference between the predicted and observed common image gathers (CIGs) in the subsurface offset domain. This new objective function is not constrained by cycle skipping at the far subsurface offsets. To test the effectiveness of this method, we apply it to marine data recorded in the Gulf of Mexico. Results show that image-domain FWI is less sensitive to the initial model and the absence of low-frequency data compared with conventional FWI. The liability, however, is that it is almost an order of magnitude more expensive than standard FWI.

  16. Image-domain full waveform inversion: Field data example

    KAUST Repository

    Zhang, Sanzong; Schuster, Gerard T.

    2014-01-01

    The main difficulty with the data-domain full waveform inversion (FWI) is that it tends to get stuck in the local minima associated with the waveform misfit function. This is the result of cycle skipping which degrades the low-wavenumber update in the absence of low-frequencies and long-offset data. An image-domain objective function is defined as the normed difference between the predicted and observed common image gathers (CIGs) in the subsurface offset domain. This new objective function is not constrained by cycle skipping at the far subsurface offsets. To test the effectiveness of this method, we apply it to marine data recorded in the Gulf of Mexico. Results show that image-domain FWI is less sensitive to the initial model and the absence of low-frequency data compared with conventional FWI. The liability, however, is that it is almost an order of magnitude more expensive than standard FWI.

  17. GBNV encoded movement protein (NSm) remodels ER network via C-terminal coiled coil domain

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Pratibha; Savithri, H.S., E-mail: bchss@biochem.iisc.ernet.in

    2015-08-15

    Plant viruses exploit the host machinery for targeting the viral genome–movement protein complex to plasmodesmata (PD). The mechanism by which the non-structural protein m (NSm) of Groundnut bud necrosis virus (GBNV) is targeted to PD was investigated using Agrobacterium mediated transient expression of NSm and its fusion proteins in Nicotiana benthamiana. GFP:NSm formed punctuate structures that colocalized with mCherry:plasmodesmata localized protein 1a (PDLP 1a) confirming that GBNV NSm localizes to PD. Unlike in other movement proteins, the C-terminal coiled coil domain of GBNV NSm was shown to be involved in the localization of NSm to PD, as deletion of this domain resulted in the cytoplasmic localization of NSm. Treatment with Brefeldin A demonstrated the role of ER in targeting GFP NSm to PD. Furthermore, mCherry:NSm co-localized with ER–GFP (endoplasmic reticulum targeting peptide (HDEL peptide fused with GFP). Co-expression of NSm with ER–GFP showed that the ER-network was transformed into vesicles indicating that NSm interacts with ER and remodels it. Mutations in the conserved hydrophobic region of NSm (residues 130–138) did not abolish the formation of vesicles. Additionally, the conserved prolines at positions 140 and 142 were found to be essential for targeting the vesicles to the cell membrane. Further, systematic deletion of amino acid residues from N- and C-terminus demonstrated that N-terminal 203 amino acids are dispensable for the vesicle formation. On the other hand, the C-terminal coiled coil domain when expressed alone could also form vesicles. These results suggest that GBNV NSm remodels the ER network by forming vesicles via its interaction through the C-terminal coiled coil domain. Interestingly, NSm interacts with NP in vitro and coexpression of these two proteins in planta resulted in the relocalization of NP to PD and this relocalization was abolished when the N-terminal unfolded region of NSm was deleted. Thus, the NSm

  18. Three distinct domains contribute to nuclear transport of murine Foxp3.

    Directory of Open Access Journals (Sweden)

    Wayne W Hancock

    2009-11-01

    Full Text Available Foxp3, a 47-kDa transcription factor, is necessary for the function of CD4+CD25+ regulatory T cells (Tregs, with an essential role in the control of self-reactive T cells and in preventing autoimmunity. Activation of Tregs by TCR engagement results in upregulation of Foxp3 expression, followed by its rapid nuclear transport and binding to chromatin. Here, we identify three distinct Foxp3 domains that contribute to nuclear transport. The first domain (Domain 1 comprises the C-terminal 12 amino acids. The second domain (Domain 2 is located immediately N-terminal to the forkhead domain (FHD, recently reported to be a binding site for the runt-related transcription factor 1/acute myeloid leukemia 1 (Runx1/AML1. The third domain (Domain 3 is located within the N-terminal first 51 amino acids. Unlike the known nuclear localization signals (NLSs, none of these three regions are rich in basic residues and do not bear any similarity to known monopartite or bipartite NLSs that have one or more clusters of basic amino acids. The basic arginine-lysine-lysine-arginine (RKKR sequence, located 12-aa from the C-terminal end of Foxp3 was previously reported to be a nuclear localization signal (NLS for several proteins, including for a GFP-Foxp3 hybrid. Evidence is provided here that in the full-length native Foxp3 RKKR does not function as an NLS. The data reported in this study indicates that Foxp3 achieves nuclear transport by binding to other nuclear factors and co-transporting with them to the nucleus.

  19. Waggawagga-CLI: A command-line tool for predicting stable single α-helices (SAH-domains, and the SAH-domain distribution across eukaryotes.

    Directory of Open Access Journals (Sweden)

    Dominic Simm

    Full Text Available Stable single-alpha helices (SAH-domains function as rigid connectors and constant force springs between structural domains, and can provide contact surfaces for protein-protein and protein-RNA interactions. SAH-domains mainly consist of charged amino acids and are monomeric and stable in polar solutions, characteristics which distinguish them from coiled-coil domains and intrinsically disordered regions. Although the number of reported SAH-domains is steadily increasing, genome-wide analyses of SAH-domains in eukaryotic genomes are still missing. Here, we present Waggawagga-CLI, a command-line tool for predicting and analysing SAH-domains in protein sequence datasets. Using Waggawagga-CLI we predicted SAH-domains in 24 datasets from eukaryotes across the tree of life. SAH-domains were predicted in 0.5 to 3.5% of the protein-coding content per species. SAH-domains are particularly present in longer proteins supporting their function as structural building block in multi-domain proteins. In human, SAH-domains are mainly used as alternative building blocks not being present in all transcripts of a gene. Gene ontology analysis showed that yeast proteins with SAH-domains are particular enriched in macromolecular complex subunit organization, cellular component biogenesis and RNA metabolic processes, and that they have a strong nuclear and ribonucleoprotein complex localization and function in ribosome and nucleic acid binding. Human proteins with SAH-domains have roles in all types of RNA processing and cytoskeleton organization, and are predicted to function in RNA binding, protein binding involved in cell and cell-cell adhesion, and cytoskeletal protein binding. Waggawagga-CLI allows the user to adjust the stabilizing and destabilizing contribution of amino acid interactions in i,i+3 and i,i+4 spacings, and provides extensive flexibility for user-designed analyses.

  20. On the Equational Definition of the Least Prefixed Point

    DEFF Research Database (Denmark)

    Santocanale, Luigi

    2003-01-01

    We propose a method to axiomatize by equations the least prefixed point of an order preserving function. We discuss its domain of application and show that the Boolean modal μ-calculus has a complete equational axiomatization. The method relies on the existence of a “closed structure” and its rel...

  1. Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem; Methodes de decomposition de domaine pour la formulation mixte duale du probleme critique de la diffusion des neutrons

    Energy Technology Data Exchange (ETDEWEB)

    Guerin, P

    2007-12-15

    The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

  2. Nanoscopic studies of domain structure dynamics in ferroelectric La:HfO2 capacitors

    Science.gov (United States)

    Buragohain, P.; Richter, C.; Schenk, T.; Lu, H.; Mikolajick, T.; Schroeder, U.; Gruverman, A.

    2018-05-01

    Visualization of domain structure evolution under an electrical bias has been carried out in ferroelectric La:HfO2 capacitors by a combination of Piezoresponse Force Microscopy (PFM) and pulse switching techniques to study the nanoscopic mechanism of polarization reversal and the wake-up process. It has been directly shown that the main mechanism behind the transformation of the polarization hysteretic behavior and an increase in the remanent polarization value upon the alternating current cycling is electrically induced domain de-pinning. PFM imaging and local spectroscopy revealed asymmetric switching in the La:HfO2 capacitors due to a significant imprint likely caused by the different boundary conditions at the top and bottom interfaces. Domain switching kinetics can be well-described by the nucleation limited switching model characterized by a broad distribution of the local switching times. It has been found that the domain velocity varies significantly throughout the switching process indicating strong interaction with structural defects.

  3. Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; Gao, Xin

    2014-01-01

    Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.

  4. Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-02-01

    Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.

  5. Solving a discrete model of the lac operon using Z3

    Science.gov (United States)

    Gutierrez, Natalia A.

    2014-05-01

    A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

  6. Physics education students’ cognitive and affective domains toward ecological phenomena

    Science.gov (United States)

    Napitupulu, N. D.; Munandar, A.; Redjeki, S.; Tjasyono, B.

    2018-05-01

    Environmental education is become prominent in dealing with natural phenomena that occur nowadays. Studying environmental physics will lead students to have conceptual understanding which are importent in enhancing attitudes toward ecological phenomena that link directry to cognitive and affective domains. This research focused on the the relationship of cognitive and affective domains toward ecological phenomena. Thirty-seven Physics Education students participated in this study and validated sources of data were collected to eksplore students’ conceptual understanding as cognitive domain and to investigate students’ attitudes as affective domain. The percentage of cognitive outcome and affective outcome are explore. The features of such approaches to environmental learning are discussion through analysis of contribution of cognitive to develop the attitude ecological as affective outcome. The result shows that cognitive domains do not contribute significantly to affective domain toward ecological henomena as an issue trend in Central Sulawesi although students had passed Environmental Physics instruction for two semester. In fact, inferior knowledge in a way actually contributes to the attitude domain caused by the prior knowledge that students have as ombo as a Kaili local wisdom.

  7. Contribution of the LIM domain and nebulin-repeats to the interaction of Lasp-2 with actin filaments and focal adhesions.

    Directory of Open Access Journals (Sweden)

    Hiroyuki Nakagawa

    Full Text Available Lasp-2 binds to actin filaments and concentrates in the actin bundles of filopodia and lamellipodia in neural cells and focal adhesions in fibroblastic cells. Lasp-2 has three structural regions: a LIM domain, a nebulin-repeat region, and an SH3 domain; however, the region(s responsible for its interactions with actin filaments and focal adhesions are still unclear. In this study, we revealed that the N-terminal fragment from the LIM domain to the first nebulin-repeat module (LIM-n1 retained actin-binding activity and showed a similar subcellular localization to full-length lasp-2 in neural cells. The LIM domain fragment did not interact with actin filaments or localize to actin filament bundles. In contrast, LIM-n1 showed a clear subcellular localization to filopodial actin bundles. Although truncation of the LIM domain caused the loss of F-actin binding activity and the accumulation of filopodial actin bundles, these truncated fragments localized to focal adhesions. These results suggest that lasp-2 interactions with actin filaments are mediated through the cooperation of the LIM domain and the first nebulin-repeat module in vitro and in vivo. Actin filament binding activity may be a major contributor to the subcellular localization of lasp-2 to filopodia but is not crucial for lasp-2 recruitment to focal adhesions.

  8. Wavefield Extrapolation in Pseudo-depth Domain

    KAUST Repository

    Ma, Xuxin

    2011-12-11

    Wave-equation based seismic migration and inversion tools are widely used by the energy industry to explore hydrocarbon and mineral resources. By design, most of these techniques simulate wave propagation in a space domain with the vertical axis being depth measured from the surface. Vertical depth is popular because it is a straightforward mapping of the subsurface space. It is, however, not computationally cost-effective because the wavelength changes with local elastic wave velocity, which in general increases with depth in the Earth. As a result, the sampling per wavelength also increases with depth. To avoid spatial aliasing in deep fast media, the seismic wave is oversampled in shallow slow media and therefore increase the total computation cost. This issue is effectively tackled by using the vertical time axis instead of vertical depth. This is because in a vertical time representation, the "wavelength" is essentially time period for vertical rays. This thesis extends the vertical time axis to the pseudo-depth axis, which features distance unit while preserving the properties of the vertical time representation. To explore the potentials of doing wave-equation based imaging in the pseudo-depth domain, a Partial Differential Equation (PDE) is derived to describe acoustic wave in this new domain. This new PDE is inherently anisotropic because the use of a constant vertical velocity to convert between depth and vertical time. Such anisotropy results in lower reflection coefficients compared with conventional space domain modeling results. This feature is helpful to suppress the low wavenumber artifacts in reverse-time migration images, which are caused by the widely used cross-correlation imaging condition. This thesis illustrates modeling acoustic waves in both conventional space domain and pseudo-depth domain. The numerical tool used to model acoustic waves is built based on the lowrank approximation of Fourier integral operators. To investigate the potential

  9. Different domains are critical for oligomerization compatibility of different connexins

    Science.gov (United States)

    MARTÍNEZ, Agustín D.; MARIPILLÁN, Jaime; ACUÑA, Rodrigo; MINOGUE, Peter J.; BERTHOUD, Viviana M.; BEYER, Eric C.

    2011-01-01

    Oligomerization of connexins is a critical step in gap junction channel formation. Some members of the connexin family can oligomerize with other members and form functional heteromeric hemichannels [e.g. Cx43 (connexin 43) and Cx45], but others are incompatible (e.g. Cx43 and Cx26). To find connexin domains important for oligomerization, we constructed chimaeras between Cx43 and Cx26 and studied their ability to oligomerize with wild-type Cx43, Cx45 or Cx26. HeLa cells co-expressing Cx43, Cx45 or Cx26 and individual chimaeric constructs were analysed for interactions between the chimaeras and the wild-type connexins using cell biological (subcellular localization by immunofluorescence), functional (intercellular diffusion of microinjected Lucifer yellow) and biochemical (sedimentation velocity through sucrose gradients) assays. All of the chimaeras containing the third transmembrane domain of Cx43 interacted with wild-type Cx43 on the basis of co-localization, dominant-negative inhibition of intercellular communication, and altered sedimentation velocity. The same chimaeras also interacted with co-expressed Cx45. In contrast, immunofluorescence and intracellular diffusion of tracer suggested that other domains influenced oligomerization compatibility when chimaeras were co-expressed with Cx26. Taken together, these results suggest that amino acids in the third transmembrane domain are critical for oligomerization with Cx43 and Cx45. However, motifs in different domains may determine oligomerization compatibility in members of different connexin subfamilies. PMID:21348854

  10. Domain decomposition methods for the mixed dual formulation of the critical neutron diffusion problem

    International Nuclear Information System (INIS)

    Guerin, P.

    2007-12-01

    The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)

  11. Microprocessor-controlled time domain reflectometer for dynamic shock position measurements

    International Nuclear Information System (INIS)

    Virchow, C.F.; Conrad, G.E.; Holt, D.M.; Hodson, E.K.

    1980-01-01

    Time-domain reflectometry is used in a novel way to measure dynamically shock propagation in various media. The primary component in this measurement system is a digital time domain reflectometer, which uses local intelligence, a Motorola 6800 microprocessor, to make the unit adaptable and versatile. The recorder, its operating theory and its method of implementation are described and typical data are reviewed. Applications include nuclear explosion yield estimates and explosive energy flow measurements

  12. Decoding Reed-Muller Codes beyond Half the Minimum Distance

    DEFF Research Database (Denmark)

    Heydtmann, Agnes Eileen; Jakobsen, Thomas

    1999-01-01

    vanishing when evaluated at points in $\\ff^m_2$ joint with the corresponding received bits. To obtain a list of codewords closest to the received word we need to factor $Q$ considered as an element of the quotient ring of boolean polynomials which is not a unique factorization domain. Therefore we introduce...

  13. A Novel Transfer Learning Method Based on Common Space Mapping and Weighted Domain Matching

    KAUST Repository

    Liang, Ru-Ze; Xie, Wei; Li, Weizhi; Wang, Hongqi; Wang, Jim Jing-Yan; Taylor, Lisa

    2017-01-01

    In this paper, we propose a novel learning framework for the problem of domain transfer learning. We map the data of two domains to one single common space, and learn a classifier in this common space. Then we adapt the common classifier to the two domains by adding two adaptive functions to it respectively. In the common space, the target domain data points are weighted and matched to the target domain in term of distributions. The weighting terms of source domain data points and the target domain classification responses are also regularized by the local reconstruction coefficients. The novel transfer learning framework is evaluated over some benchmark cross-domain data sets, and it outperforms the existing state-of-the-art transfer learning methods.

  14. A Novel Transfer Learning Method Based on Common Space Mapping and Weighted Domain Matching

    KAUST Repository

    Liang, Ru-Ze

    2017-01-17

    In this paper, we propose a novel learning framework for the problem of domain transfer learning. We map the data of two domains to one single common space, and learn a classifier in this common space. Then we adapt the common classifier to the two domains by adding two adaptive functions to it respectively. In the common space, the target domain data points are weighted and matched to the target domain in term of distributions. The weighting terms of source domain data points and the target domain classification responses are also regularized by the local reconstruction coefficients. The novel transfer learning framework is evaluated over some benchmark cross-domain data sets, and it outperforms the existing state-of-the-art transfer learning methods.

  15. The Arf-GDP-regulated recruitment of GBF1 to Golgi membranes requires domains HDS1 and HDS2 and a Golgi-localized protein receptor.

    Science.gov (United States)

    Quilty, Douglas; Chan, Calvin J; Yurkiw, Katherine; Bain, Alexandra; Babolmorad, Ghazal; Melançon, Paul

    2018-04-19

    We previously proposed a novel mechanism by which the enzyme Golgi-specific Brefeldin A resistance factor 1 (GBF1) is recruited to the membranes of the cis -Golgi, based on in vivo experiments. Here, we extended our in vivo analysis on the production of regulatory Arf-GDP and observed that ArfGAP2 and ArfGAP3 do not play a role in GBF1 recruitment. We confirm that Arf-GDP localization is critical, as a TGN-localized Arf-GDP mutant protein fails to promote GBF1 recruitment. We also reported the establishment of an in vitro GBF1 recruitment assay that supports the regulation of GBF1 recruitment by Arf-GDP. This in vitro assay yielded further evidence for the requirement of a Golgi-localized protein because heat denaturation or protease treatment of Golgi membranes abrogated GBF1 recruitment. Finally, combined in vivo and in vitro measurements indicated that the recruitment to Golgi membranes via a putative receptor requires only the HDS1 and HDS2 domains in the C-terminal half of GBF1. © 2018. Published by The Company of Biologists Ltd.

  16. A cataract-causing connexin 50 mutant is mislocalized to the ER due to loss of the fourth transmembrane domain and cytoplasmic domain.

    Science.gov (United States)

    Somaraju Chalasani, Madhavi Latha; Muppirala, Madhavi; G Ponnam, Surya Prakash; Kannabiran, Chitra; Swarup, Ghanshyam

    2013-01-01

    Mutations in the eye lens gap junction protein connexin 50 cause cataract. Earlier we identified a frameshift mutant of connexin 50 (c.670insA; p.Thr203AsnfsX47) in a family with autosomal recessive cataract. The mutant protein is smaller and contains 46 aberrant amino acids at the C-terminus after amino acid 202. Here, we have analysed this frameshift mutant and observed that it localized to the endoplasmic reticulum (ER) but not in the plasma membrane. Moreover, overexpression of the mutant resulted in disintegration of the ER-Golgi intermediate compartment (ERGIC), reduction in the level of ERGIC-53 protein and breakdown of the Golgi in many cells. Overexpression of the frameshift mutant partially inhibited the transport of wild type connexin 50 to the plasma membrane. A deletion mutant lacking the aberrant sequence showed predominant localization in the ER and inhibited anterograde protein transport suggesting, therefore, that the aberrant sequence is not responsible for improper localization of the frameshift mutant. Further deletion analysis showed that the fourth transmembrane domain and a membrane proximal region (231-294 amino acids) of the cytoplasmic domain are needed for transport from the ER and localization to the plasma membrane. Our results show that a frameshift mutant of connexin 50 mislocalizes to the ER and causes disintegration of the ERGIC and Golgi. We have also identified a sequence of connexin 50 crucial for transport from the ER and localization to the plasma membrane.

  17. Multiple local feature representations and their fusion based on an SVR model for iris recognition using optimized Gabor filters

    Science.gov (United States)

    He, Fei; Liu, Yuanning; Zhu, Xiaodong; Huang, Chun; Han, Ye; Dong, Hongxing

    2014-12-01

    Gabor descriptors have been widely used in iris texture representations. However, fixed basic Gabor functions cannot match the changing nature of diverse iris datasets. Furthermore, a single form of iris feature cannot overcome difficulties in iris recognition, such as illumination variations, environmental conditions, and device variations. This paper provides multiple local feature representations and their fusion scheme based on a support vector regression (SVR) model for iris recognition using optimized Gabor filters. In our iris system, a particle swarm optimization (PSO)- and a Boolean particle swarm optimization (BPSO)-based algorithm is proposed to provide suitable Gabor filters for each involved test dataset without predefinition or manual modulation. Several comparative experiments on JLUBR-IRIS, CASIA-I, and CASIA-V4-Interval iris datasets are conducted, and the results show that our work can generate improved local Gabor features by using optimized Gabor filters for each dataset. In addition, our SVR fusion strategy may make full use of their discriminative ability to improve accuracy and reliability. Other comparative experiments show that our approach may outperform other popular iris systems.

  18. Magnetostatic coupling of 90 domain walls in FeNi/Cu/Co trilayers

    Energy Technology Data Exchange (ETDEWEB)

    Kurde, Julia; Miguel, Jorge; Kuch, Wolfgang [Freie Universitaet, Berlin (Germany); Bayer, Daniela; Aeschlimann, Martin [Technische Universitaet, Kaiserslautern (Germany); Sanchez-Barriga, Jaime; Kronast, Florian; Duerr, Herrmann A. [Helmholtz-Zentrum Berlin fuer Materialien und Energie (Germany)

    2011-07-01

    The magnetic interlayer coupling of FeNi/Cu/Co trilayered microstructures has been studied by means of X-ray magnetic circular dichroism in combination with photoelectron emission microscopy (XMCD-PEEM). We find that a parallel coupling between magnetic domains coexists with a non-parallel coupling between magnetic domain walls of each ferromagnetic layer. We attribute the non-parallel coupling of the two magnetic layers to local magnetic stray fields arising at domain walls in the magnetically harder Co layer. In the magnetically softer FeNi layer non-ordinary domain walls such as 270 and 90 domain walls with overshoot of the magnetization either inwards or outwards relative to the turning direction of the Co magnetization are identified. Micromagnetic simulations reveal that in the absence of magnetocrystalline anisotropy, both types of overshooting domain walls are energetically equivalent. However, if a uniaxial in-plane anisotropy is present, the relative orientation of the domain walls with respect to the anisotropy axis determines which of these domain walls is energetically favorable.

  19. PREFACE: Domain wall dynamics in nanostructures Domain wall dynamics in nanostructures

    Science.gov (United States)

    Marrows, C. H.; Meier, G.

    2012-01-01

    spin-transfer torque threshold current density in coupled vortex domain wallsS Lepadatu, A P Mihai, J S Claydon, F Maccherozzi, S S Dhesi, C J Kinane, S Langridge and C H Marrows Large RF susceptibility of transverse domain wallsO Rousseau, S Petit-Watelot and M Viret Expansion and relaxation of magnetic mirror domains in a Pt/Co/Pt/Co/Pt multilayer with antiferromagnetic interlayer couplingP J Metaxas, R L Stamps, J-P Jamet, J Ferré, V Baltz and B Rodmacq Current-induced domain wall motion and magnetization dynamics in CoFeB/Cu/Co nanostripesV Uhlíř, J Vogel, N Rougemaille, O Fruchart, Z Ishaque, V Cros, J Camarero, J C Cezar, F Sirotti and S Pizzini Roles of the magnetic field and electric current in thermally activated domain wall motion in a submicrometer magnetic strip with perpendicular magnetic anisotropySatoru Emori and Geoffrey S D Beach Electrical domain morphologies in compositionally graded ferroelectric filmsM B Okatan, A L Roytburd, V Nagarajan and S P Alpay Domain-wall pinning by local control of anisotropy in Pt/Co/Pt strips J H Franken, M Hoeijmakers, R Lavrijsen and H J M Swagten Experimental detection of domain wall propagation above the Walker field Kouta Kondou, Norikazu Ohshima, Daichi Chiba, Shinya Kasai, Kensuke Kobayashi and Teruo Ono Enhanced functionality in magnonics by domain walls and inhomogeneous spin configurationsG Duerr, R Huber and D Grundler Domain wall motion in perpendicular anisotropy nanowires with edge roughness Maximilian Albert, Matteo Franchin, Thomas Fischbacher, Guido Meier and Hans Fangohr Determination of the spin torque non-adiabaticity in perpendicularly magnetized nanowiresJ Heinen, D Hinzke, O Boulle, G Malinowski, H J M Swagten, B Koopmans, C Ulysse, G Faini, B Ocker, J Wrona and M Kläui Domain wall dynamics driven by spin transfer torque and the spin-orbit field Masamitsu Hayashi, Yoshinobu Nakatani, Shunsuke Fukami, Michihiko Yamanouchi, Seiji Mitani and Hideo Ohno Dynamic propagation and nucleation in domain

  20. General spectral flow formula for fixed maximal domain

    DEFF Research Database (Denmark)

    Booss-Bavnbek, Bernhelm; Zhu, Chaofeng

    2005-01-01

    and symplectic analysis and give a full (and surprisingly short) proof of our General Spectral Flow Formula for the case of fixed maximal domain. As a side result, we establish local stability of weak inner unique continuation property (UCP) and explain its role for parameter dependent spectral theory....... of the resulting continuous family of (unbounded) self-adjoint Fredholm operators in terms of the Maslov index of two related curves of Lagrangian spaces. One curve is given by the varying domains, the other by the Cauchy data spaces. We provide rigorous definitions of the underlying concepts of spectral theory...

  1. Multiscale Seismic Inversion in the Data and Image Domains

    KAUST Repository

    Zhang, Sanzong

    2015-12-01

    I present a general methodology for inverting seismic data in either the data or image domains. It partially overcomes one of the most serious problems with current waveform inversion methods, which is the tendency to converge to models far from the actual one. The key idea is to develop a multiscale misfit function that is composed of both a simplified version of the data and one associated with the complex part of the data. Misfit functions based on simple data are characterized by many fewer local minima so that a gradient optimization method can make quick progress in getting to the general vicinity of the actual model. Once we are near the actual model, we then use the gradient based on the more complex data. Below, we describe two implementations of this multiscale strategy: wave equation traveltime inversion in the data domain and generalized differential semblance optimization in the image domain. • Wave Equation Traveltime Inversion in the Data Domain (WT): The main difficulty with iterative waveform inversion is that it tends to get stuck in local minima associated with the waveform misfit function. To mitigate this problem and avoid the need to fit amplitudes in the data, we present a waveequation method that inverts the traveltimes of reflection events, and so is less prone to the local minima problem. Instead of a waveform misfit function, the penalty function is a crosscorrelation of the downgoing direct wave and the upgoing reflection wave at the trial image point. The time lag which maximizes the crosscorrelation amplitude represents the reflection-traveltime residual that is back-projected along the reflection wavepath to update the velocity. Shot- and angle-domain crosscorrelation functions are introduced to estimate the reflection-traveltime residual by semblance analysis and scanning. In theory, only the traveltime information is inverted and there is no need to precisely fit the amplitudes or assume a high-frequency approximation. Results

  2. Lipid dependence of ABC transporter localization and function

    NARCIS (Netherlands)

    Klappe, Karin; Hummel, Ina; Hoekstra, Dick; Kok, Jan Willem

    2009-01-01

    Lipid rafts have been implicated in many cellular functions, including protein and lipid transport and signal transduction. ATP-binding cassette (ABC) transporters have also been localized in these membrane domains. In this review the evidence for this specific localization will be evaluated and

  3. Structure of the C-terminal domain of lettuce necrotic yellows virus phosphoprotein.

    Science.gov (United States)

    Martinez, Nicolas; Ribeiro, Euripedes A; Leyrat, Cédric; Tarbouriech, Nicolas; Ruigrok, Rob W H; Jamin, Marc

    2013-09-01

    Lettuce necrotic yellows virus (LNYV) is a prototype of the plant-adapted cytorhabdoviruses. Through a meta-prediction of disorder, we localized a folded C-terminal domain in the amino acid sequence of its phosphoprotein. This domain consists of an autonomous folding unit that is monomeric in solution. Its structure, solved by X-ray crystallography, reveals a lollipop-shaped structure comprising five helices. The structure is different from that of the corresponding domains of other Rhabdoviridae, Filoviridae, and Paramyxovirinae; only the overall topology of the polypeptide chain seems to be conserved, suggesting that this domain evolved under weak selective pressure and varied in size by the acquisition or loss of functional modules.

  4. Intracellular localization of Arabidopsis sulfurtransferases.

    Science.gov (United States)

    Bauer, Michael; Dietrich, Christof; Nowak, Katharina; Sierralta, Walter D; Papenbrock, Jutta

    2004-06-01

    Sulfurtransferases (Str) comprise a group of enzymes widely distributed in archaea, eubacteria, and eukaryota which catalyze the transfer of a sulfur atom from suitable sulfur donors to nucleophilic sulfur acceptors. In all organisms analyzed to date, small gene families encoding Str proteins have been identified. The gene products were localized to different compartments of the cells. Our interest concerns the localization of Str proteins encoded in the nuclear genome of Arabidopsis. Computer-based prediction methods revealed localization in different compartments of the cell for six putative AtStrs. Several methods were used to determine the localization of the AtStr proteins experimentally. For AtStr1, a mitochondrial localization was demonstrated by immunodetection in the proteome of isolated mitochondria resolved by one- and two-dimensional gel electrophoresis and subsequent blotting. The respective mature AtStr1 protein was identified by mass spectrometry sequencing. The same result was obtained by transient expression of fusion constructs with the green fluorescent protein in Arabidopsis protoplasts, whereas AtStr2 was exclusively localized to the cytoplasm by this method. Three members of the single-domain AtStr were localized in the chloroplasts as demonstrated by transient expression of green fluorescent protein fusions in protoplasts and stomata, whereas the single-domain AtStr18 was shown to be cytoplasmic. The remarkable subcellular distribution of AtStr15 was additionally analyzed by transmission electron immunomicroscopy using a monospecific antibody against green fluorescent protein, indicating an attachment to the thylakoid membrane. The knowledge of the intracellular localization of the members of this multiprotein family will help elucidate their specific functions in the organism.

  5. Domains and domain loss

    DEFF Research Database (Denmark)

    Haberland, Hartmut

    2005-01-01

    politicians and in the media, especially in the discussion whether some languages undergo ‘domain loss’ vis-à-vis powerful international languages like English. An objection that has been raised here is that domains, as originally conceived, are parameters of language choice and not properties of languages...

  6. Improving the performance of DomainDiscovery of protein domain boundary assignment using inter-domain linker index

    Directory of Open Access Journals (Sweden)

    Zomaya Albert Y

    2006-12-01

    Full Text Available Abstract Background Knowledge of protein domain boundaries is critical for the characterisation and understanding of protein function. The ability to identify domains without the knowledge of the structure – by using sequence information only – is an essential step in many types of protein analyses. In this present study, we demonstrate that the performance of DomainDiscovery is improved significantly by including the inter-domain linker index value for domain identification from sequence-based information. Improved DomainDiscovery uses a Support Vector Machine (SVM approach and a unique training dataset built on the principle of consensus among experts in defining domains in protein structure. The SVM was trained using a PSSM (Position Specific Scoring Matrix, secondary structure, solvent accessibility information and inter-domain linker index to detect possible domain boundaries for a target sequence. Results Improved DomainDiscovery is compared with other methods by benchmarking against a structurally non-redundant dataset and also CASP5 targets. Improved DomainDiscovery achieves 70% accuracy for domain boundary identification in multi-domains proteins. Conclusion Improved DomainDiscovery compares favourably to the performance of other methods and excels in the identification of domain boundaries for multi-domain proteins as a result of introducing support vector machine with benchmark_2 dataset.

  7. Banach spaces of continuous functions as dual spaces

    CERN Document Server

    Dales, H G; Lau, A T -M; Strauss, D

    2016-01-01

    This book gives a coherent account of the theory of Banach spaces and Banach lattices, using the spaces C_0(K) of continuous functions on a locally compact space K as the main example. The study of C_0(K) has been an important area of functional analysis for many years. It gives several new constructions, some involving Boolean rings, of this space as well as many results on the Stonean space of Boolean rings. The book also discusses when Banach spaces of continuous functions are dual spaces and when they are bidual spaces.

  8. Flux mapping at 77 K and local measurement at lower temperature of thin-wall YBaCuO single-domain samples oxygenated under high pressure

    Energy Technology Data Exchange (ETDEWEB)

    Chaud, X., E-mail: Xavier.chaud@grenoble.cnrs.f [CRETA, CNRS, 25, Avenue des Martyrs, 38042 Grenoble Cedex 9 (France); Noudem, J. [CRISMAT/ENSICAEN, CNRS, 6 bd Marechal Juin, 14050 Caen (France); Prikhna, T.; Savchuk, Y. [ISM, National Acad. of Sciences of Ukraine, 2 Avtozavodskaya Street, Kiev, 04074 (Ukraine); Haanappel, E. [LNCMP, UMR 5147, 143 avenue de Rangueil, 31400 Toulouse (France); Diko, P. [IEP, Slovak Acad. of Sciences, Watsonova 47, 043 53, Kosice (Slovakia); Zhang, C.P. [SMRC, NIN, 96 Weiyang Road, Xi' an 710016 (China)

    2009-10-15

    YBCO single-domain samples are suitable for the production of high trapped fields in the range 20-77 K using a cryocooler or liquid nitrogen. But the oxygenation process required to actually transform the single domains into superconductors induces an extensive crack network that is limiting the material performances. Thin-wall geometry has been introduced to reduce the diffusion paths and to enable a progressive oxygenation strategy. As a consequence cracks are drastically reduced. In addition the use of a high oxygen pressure (16 MPa) speeds up further the process by displacing the oxygen-temperature equilibrium towards the higher temperature of the phase diagram. The advantage of thin-wall geometry is that such an annealing can be applied directly to a much larger sample. Remarkable results are obtained without any doping by the combination of thin walls and oxygen high pressure. While classical plain samples yield 300-400 mT, a trapped field of 840 mT has been measured at 77 K on a 16 mm diameter Y123 thin-wall single-domain sample with an annealing time as short as 3 days. Local measurements with a fixed Hall probe on top of the sample were performed at lower temperature after magnetization either in a static field or in a pulse field. The trapped field is significantly higher at lower temperature. Cryocoolers become the key to compromise between performances and cryogenic cost around 40 K.

  9. Harmonic Riemannian Maps on Locally Conformal Kaehler Manifolds

    Indian Academy of Sciences (India)

    We study harmonic Riemannian maps on locally conformal Kaehler manifolds ( l c K manifolds). We show that if a Riemannian holomorphic map between l c K manifolds is harmonic, then the Lee vector field of the domain belongs to the kernel of the Riemannian map under a condition. When the domain is Kaehler, we ...

  10. Epitope mapping of the domains of human angiotensin converting enzyme.

    Science.gov (United States)

    Kugaevskaya, Elena V; Kolesanova, Ekaterina F; Kozin, Sergey A; Veselovsky, Alexander V; Dedinsky, Ilya R; Elisseeva, Yulia E

    2006-06-01

    Somatic angiotensin converting enzyme (sACE), contains in its single chain two homologous domains (called N- and C-domains), each bearing a functional zinc-dependent active site. The present study aims to define the differences between two sACE domains and to localize experimentally revealed antigenic determinants (B-epitopes) in the recently determined three-dimensional structure of testicular tACE. The predicted linear antigenic determinants of human sACE were determined by peptide scanning ("PEPSCAN") approach. Essential difference was demonstrated between locations of the epitopes in the N- and C-domains. Comparison of arrangement of epitopes in the human domains with the corresponding sequences of some mammalian sACEs enabled to classify the revealed antigenic determinants as variable or conserved areas. The location of antigenic determinants with respect to various structural elements and to functionally important sites of the human sACE C-domain was estimated. The majority of antigenic sites of the C-domain were located at the irregular elements and at the boundaries of secondary structure elements. The data show structural differences between the sACE domains. The experimentally revealed antigenic determinants were in agreement with the recently determined crystal tACE structure. New potential applications are open to successfully produce mono-specific and group-specific antipeptide antibodies.

  11. Is the isolated ligand binding domain a good model of the domain in the native receptor?

    Science.gov (United States)

    Deming, Dustin; Cheng, Qing; Jayaraman, Vasanthi

    2003-05-16

    Numerous studies have used the atomic level structure of the isolated ligand binding domain of the glutamate receptor to elucidate the agonist-induced activation and desensitization processes in this group of proteins. However, no study has demonstrated the structural equivalence of the isolated ligand binding fragments and the protein in the native receptor. In this report, using visible absorption spectroscopy we show that the electronic environment of the antagonist 6-cyano-7-nitro-2,3-dihydroxyquinoxaline is identical for the isolated protein and the native glutamate receptors expressed in cells. Our results hence establish that the local structure of the ligand binding site is the same in the two proteins and validate the detailed structure-function relationships that have been developed based on a comparison of the structure of the isolated ligand binding domain and electrophysiological consequences in the native receptor.

  12. Structure of the C-Terminal Domain of Lettuce Necrotic Yellows Virus Phosphoprotein

    Science.gov (United States)

    Martinez, Nicolas; Ribeiro, Euripedes A.; Leyrat, Cédric; Tarbouriech, Nicolas; Ruigrok, Rob W. H.

    2013-01-01

    Lettuce necrotic yellows virus (LNYV) is a prototype of the plant-adapted cytorhabdoviruses. Through a meta-prediction of disorder, we localized a folded C-terminal domain in the amino acid sequence of its phosphoprotein. This domain consists of an autonomous folding unit that is monomeric in solution. Its structure, solved by X-ray crystallography, reveals a lollipop-shaped structure comprising five helices. The structure is different from that of the corresponding domains of other Rhabdoviridae, Filoviridae, and Paramyxovirinae; only the overall topology of the polypeptide chain seems to be conserved, suggesting that this domain evolved under weak selective pressure and varied in size by the acquisition or loss of functional modules. PMID:23785215

  13. Unconventional Cadherin Localization in Honey Bee Gonads Revealed Through Domain-Specific Apis mellifera E- and N-Cadherin Antibodies Indicates Alternative Functions

    Directory of Open Access Journals (Sweden)

    Klaus Hartfelder

    2012-11-01

    Full Text Available As key factors in intercellular adhesion processes, cadherins play important roles in a plethora of developmental processes, including gametogenesis. In a previous study on cadherin localization in the gonads of honey bees, performed with heterologous pan-cadherin antibodies, we detected these proteins as (i associated with cell membranes, (ii as homogeneously distributed throughout the cytoplasm, and (iii as nuclear foci in both somatic and germline cells, raising the possibility of alternative functions. To further investigate such unusual intracellular cadherin localization we produced specific antibodies against the N- and C-terminal domains of honey bee N- and E-cadherin. A 160 kDa protein was recognized by the E-cadherin antibodies as well as one of approximately 300 kDa from those raised against N-cadherin. In gonad preparations, both proteins were detected as dispersed throughout the cytoplasm and as nuclear foci in both germline and somatic cells of queen and worker ovarioles, as well as in the testioles of drones. This leads us to infer that cadherins may indeed be involved in certain signaling pathways and/or transcriptional regulation during gametogenesis. In late oogenesis stages, immunolabeling for both proteins was observed at the cell cortex, in conformity with a role in cell adhesion. In testioles, E-cadherin was seen in co-localization with fusomes, indicating a possible role in cyst organization. Taken together, the distribution of N- and E-cadherins in honey bee gonads is suggestive of alternative roles for cadherins in gametogenesis of both sexes.

  14. Perfectly matched layer method in the finite-difference time-domain and frequency-domain calculations

    DEFF Research Database (Denmark)

    Shyroki, Dzmitry; Lavrinenko, Andrei

    2007-01-01

    A complex-coordinate method known under the guise of the perfectly matched layer (PML) method for treating unbounded domains in computational electrodynamics is related to similar techniques in fluid dynamics and classical quantum theory. It may also find use in electronic-structure finite......-difference simulations. Straightforward transfer of the PML formulation to other fields does not seem feasible, however, since it is a unique feature of electrodynamics - the natural invariance - that allows analytic trick of complex coordinate scaling to be represented as pure modification of local material parameters...

  15. Two optical bistability domains in composites of metal nanoparticles with nonlinear dielectric core

    Energy Technology Data Exchange (ETDEWEB)

    Shewamare, Sisay, E-mail: sisayshewa20@yahoo.com [Department of Physics, Addis Ababa University, P.O. Box 1176, Addis Ababa (Ethiopia); Mal' nev, V.N., E-mail: vadimnmalnev@yahoo.com [Department of Physics, Addis Ababa University, P.O. Box 1176, Addis Ababa (Ethiopia)

    2012-12-15

    It is shown that the local field in metal spherical particles with a dielectric core in an external varying electric field has two maxima at two different frequencies. The second maximum becomes more important with an increment in the metal fraction. Due to the nonlinear dielectric function of the core, the composite of these inclusions may have two optically induced bistability domains at different frequencies. At rather high metal fraction, two bistability domains merge and form one entire bistability domain. The parameters of these domains are studied numerically. The paper focuses on the second bistability domain, which has not been discussed in the literature so far. This domain exists in a comparatively narrow frequency range and its onset fields are lower than those of the first bistability domain. The lowest bistability onset fields are obtained in the entire domain. This peculiarity of the optical induced bistability in the metal composite with small dielectric cores can be attractive for possible applications.

  16. Two optical bistability domains in composites of metal nanoparticles with nonlinear dielectric core

    International Nuclear Information System (INIS)

    Shewamare, Sisay; Mal'nev, V.N.

    2012-01-01

    It is shown that the local field in metal spherical particles with a dielectric core in an external varying electric field has two maxima at two different frequencies. The second maximum becomes more important with an increment in the metal fraction. Due to the nonlinear dielectric function of the core, the composite of these inclusions may have two optically induced bistability domains at different frequencies. At rather high metal fraction, two bistability domains merge and form one entire bistability domain. The parameters of these domains are studied numerically. The paper focuses on the second bistability domain, which has not been discussed in the literature so far. This domain exists in a comparatively narrow frequency range and its onset fields are lower than those of the first bistability domain. The lowest bistability onset fields are obtained in the entire domain. This peculiarity of the optical induced bistability in the metal composite with small dielectric cores can be attractive for possible applications.

  17. A plasma membrane localization signal in the HIV-1 envelope cytoplasmic domain prevents localization at sites of vesicular stomatitis virus budding and incorporation into VSV virions.

    Science.gov (United States)

    Johnson, J E; Rodgers, W; Rose, J K

    1998-11-25

    Previous studies showed that the HIV-1 envelope (Env) protein was not incorporated into vesicular stomatitis virus (VSV) virions unless its cytoplasmic tail was replaced with that of the VSV glycoprotein (G). To determine whether the G tail provided a positive incorporation signal for Env, or if sequences in the Env tail prevented incorporation, we generated mutants of Env with its 150-amino-acid tail shortened to 29, 10, or 3 amino acids (Envtr mutants). Cells infected with VSV recombinants expressing these proteins or an Env-G tail hybrid showed similar amounts of Env protein at the surface. The Env-G tail hybrid or the Envtr3 mutant were incorporated at the highest levels into budding VSV virions. In contrast, the Envtr29 or Envtr10 mutants were incorporated poorly. These results defined a signal preventing incorporation within the 10 membrane-proximal amino acids of the Env tail. Confocal microscopy revealed that this signal functioned by causing localization of human immunodeficiency virus type 1 Env to plasma membrane domains distinct from the VSV budding sites, where VSV proteins were concentrated. Copyright 1998 Academic Press.

  18. Control of domain wall pinning by localised focused Ga + ion irradiation on Au capped NiFe nanowires

    International Nuclear Information System (INIS)

    Burn, D. M.; Atkinson, D.

    2014-01-01

    Understanding domain wall pinning and propagation in nanowires are important for future spintronics and nanoparticle manipulation technologies. Here, the effects of microscopic local modification of the magnetic properties, induced by focused-ion-beam intermixing, in NiFe/Au bilayer nanowires on the pinning behavior of domain walls was investigated. The effects of irradiation dose and the length of the irradiated features were investigated experimentally. The results are considered in the context of detailed quasi-static micromagnetic simulations, where the ion-induced modification was represented as a local reduction of the saturation magnetization. Simulations show that domain wall pinning behavior depends on the magnitude of the magnetization change, the length of the modified region, and the domain wall structure. Comparative analysis indicates that reduced saturation magnetisation is not solely responsible for the experimentally observed pinning behavior.

  19. Approximate controllability of the Navier-Stokes system in unbounded domains

    International Nuclear Information System (INIS)

    Shorygin, P O

    2003-01-01

    The question of the approximate controllability for the 2- and the 3-dimensional Navier-Stokes system defined in the exterior of a bounded domain ω or in the entire space is studied. It is shown that one can find boundary controls or locally distributed controls (having support in a prescribed bounded domain) defined on the right-hand side of the system such that in prescribed time the solution of the Navier-Stokes system becomes arbitrarily close to an arbitrary prescribed divergence-free vector field

  20. Assessment of managed aquifer recharge potential using ensembles of local models.

    Science.gov (United States)

    Smith, Anthony J; Pollock, Daniel W

    2012-01-01

    A simple quantitative approach for assessing the artificial recharge potential of large regions using spatial ensembles of local models is proposed. The method extends existing qualitative approaches and enables rapid assessments within a programmable environment. Spatial discretization of a water resource region into continuous local domains allows simple local models to be applied independently in each domain using lumped parameters. The ensemble results can be analyzed directly or combined with other quantitative and thematic information and visualized as regional suitability maps. A case study considers the hydraulic potential for surface infiltration across a large water resource region using a published analytic model for basin recharge. The model solution was implemented within a geographic information system and evaluated independently in >21,000 local domains using lumped parameters derived from existing regional datasets. Computer execution times to run the whole ensemble and process the results were in the order of a few minutes. Relevant aspects of the case study results and general conclusions concerning the utility and limitations of the method are discussed. © 2011, CSIRO. Ground Water © 2011, National Ground Water Association.

  1. Finite-Difference Frequency-Domain Method in Nanophotonics

    DEFF Research Database (Denmark)

    Ivinskaya, Aliaksandra

    Optics and photonics are exciting, rapidly developing fields building their success largely on use of more and more elaborate artificially made, nanostructured materials. To further advance our understanding of light-matter interactions in these complicated artificial media, numerical modeling...... is often indispensable. This thesis presents the development of rigorous finite-difference method, a very general tool to solve Maxwell’s equations in arbitrary geometries in three dimensions, with an emphasis on the frequency-domain formulation. Enhanced performance of the perfectly matched layers...... is obtained through free space squeezing technique, and nonuniform orthogonal grids are built to greatly improve the accuracy of simulations of highly heterogeneous nanostructures. Examples of the use of the finite-difference frequency-domain method in this thesis range from simulating localized modes...

  2. The Effect of a Pulsed Magnetic Field on Domain Wall Resistance in Magnetic Nanowires

    Energy Technology Data Exchange (ETDEWEB)

    Majidi, R; Tehranchi, M M; Tabrizi, K Ghafoori [Department of Physics, G.C., Shahid Beheshti University, Evin, 19838-63113, Tehran (Iran, Islamic Republic of); Phirouznia, A, E-mail: Teranchi@cc.sbu.ac.ir [Department of Physics, Azarbaijan University of Tarbiat Moallem, 53714-161 Tabriz (Iran, Islamic Republic of)

    2011-04-01

    The effect of a pulsed magnetic field on domain wall magnetoresistance for an ideal one-dimensional magnetic nanowire with a domain wall has been investigated. The analysis has been based on the Boltzmann transport equation, within the relaxation time approximation. The results indicate that the domain wall resistance increase when enhancing the magnetic field. The evaluation of local magnetization has been considered in the presence of a pulsed magnetic field. The time evaluation of the magnetization also has an effect on the domain wall resistance. The resistance depends on the contribution of the Zeeman and exchange interactions.

  3. The Effect of a Pulsed Magnetic Field on Domain Wall Resistance in Magnetic Nanowires

    International Nuclear Information System (INIS)

    Majidi, R; Tehranchi, M M; Tabrizi, K Ghafoori; Phirouznia, A

    2011-01-01

    The effect of a pulsed magnetic field on domain wall magnetoresistance for an ideal one-dimensional magnetic nanowire with a domain wall has been investigated. The analysis has been based on the Boltzmann transport equation, within the relaxation time approximation. The results indicate that the domain wall resistance increase when enhancing the magnetic field. The evaluation of local magnetization has been considered in the presence of a pulsed magnetic field. The time evaluation of the magnetization also has an effect on the domain wall resistance. The resistance depends on the contribution of the Zeeman and exchange interactions.

  4. Intracellular Localization of Arabidopsis Sulfurtransferases1

    Science.gov (United States)

    Bauer, Michael; Dietrich, Christof; Nowak, Katharina; Sierralta, Walter D.; Papenbrock, Jutta

    2004-01-01

    Sulfurtransferases (Str) comprise a group of enzymes widely distributed in archaea, eubacteria, and eukaryota which catalyze the transfer of a sulfur atom from suitable sulfur donors to nucleophilic sulfur acceptors. In all organisms analyzed to date, small gene families encoding Str proteins have been identified. The gene products were localized to different compartments of the cells. Our interest concerns the localization of Str proteins encoded in the nuclear genome of Arabidopsis. Computer-based prediction methods revealed localization in different compartments of the cell for six putative AtStrs. Several methods were used to determine the localization of the AtStr proteins experimentally. For AtStr1, a mitochondrial localization was demonstrated by immunodetection in the proteome of isolated mitochondria resolved by one- and two-dimensional gel electrophoresis and subsequent blotting. The respective mature AtStr1 protein was identified by mass spectrometry sequencing. The same result was obtained by transient expression of fusion constructs with the green fluorescent protein in Arabidopsis protoplasts, whereas AtStr2 was exclusively localized to the cytoplasm by this method. Three members of the single-domain AtStr were localized in the chloroplasts as demonstrated by transient expression of green fluorescent protein fusions in protoplasts and stomata, whereas the single-domain AtStr18 was shown to be cytoplasmic. The remarkable subcellular distribution of AtStr15 was additionally analyzed by transmission electron immunomicroscopy using a monospecific antibody against green fluorescent protein, indicating an attachment to the thylakoid membrane. The knowledge of the intracellular localization of the members of this multiprotein family will help elucidate their specific functions in the organism. PMID:15181206

  5. Interaction of the superconducting domains induced by external electric field with electromagnetic waves

    International Nuclear Information System (INIS)

    Shapiro, B.Y.

    1992-01-01

    The behavior of a superconductor in time-independent electric field perpendicular to the surface and in the external electromagnetic wave is theoretically investigated. A new type of the resonance interaction between superconducting domains localized along the magnetic field (if the superconducting phase transition takes place in the external magnetic field perpendicular to the surface) and electromagnetic waves is predicted. The surface impedance of the superconductor with domains is calculated. It is shown that the real part of the impedance has a saturation if the skin length equals the domain size. (orig.)

  6. Localization of Point Sources for Poisson Equation using State Observers

    KAUST Repository

    Majeed, Muhammad Usman

    2016-08-09

    A method based On iterative observer design is presented to solve point source localization problem for Poisson equation with riven boundary data. The procedure involves solution of multiple boundary estimation sub problems using the available Dirichlet and Neumann data from different parts of the boundary. A weighted sum of these solution profiles of sub-problems localizes point sources inside the domain. Method to compute these weights is also provided. Numerical results are presented using finite differences in a rectangular domain. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

  7. Localization of Point Sources for Poisson Equation using State Observers

    KAUST Repository

    Majeed, Muhammad Usman; Laleg-Kirati, Taous-Meriem

    2016-01-01

    A method based On iterative observer design is presented to solve point source localization problem for Poisson equation with riven boundary data. The procedure involves solution of multiple boundary estimation sub problems using the available Dirichlet and Neumann data from different parts of the boundary. A weighted sum of these solution profiles of sub-problems localizes point sources inside the domain. Method to compute these weights is also provided. Numerical results are presented using finite differences in a rectangular domain. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

  8. Least-squares reverse time migration with local Radon-based preconditioning

    KAUST Repository

    Dutta, Gaurav

    2017-03-08

    Least-squares migration (LSM) can produce images with better balanced amplitudes and fewer artifacts than standard migration. The conventional objective function used for LSM minimizes the L2-norm of the data residual between the predicted and the observed data. However, for field-data applications in which the recorded data are noisy and undersampled, the conventional formulation of LSM fails to provide the desired uplift in the quality of the inverted image. We have developed a leastsquares reverse time migration (LSRTM) method using local Radon-based preconditioning to overcome the low signal-tonoise ratio (S/N) problem of noisy or severely undersampled data. A high-resolution local Radon transform of the reflectivity is used, and sparseness constraints are imposed on the inverted reflectivity in the local Radon domain. The sparseness constraint is that the inverted reflectivity is sparse in the Radon domain and each location of the subsurface is represented by a limited number of geologic dips. The forward and the inverse mapping of the reflectivity to the local Radon domain and vice versa is done through 3D Fourier-based discrete Radon transform operators. The weights for the preconditioning are chosen to be varying locally based on the relative amplitudes of the local dips or assigned using quantile measures. Numerical tests on synthetic and field data validate the effectiveness of our approach in producing images with good S/N and fewer aliasing artifacts when compared with standard RTM or standard LSRTM.

  9. MERTK interactions with SH2-domain proteins in the retinal pigment epithelium.

    Science.gov (United States)

    Shelby, Shameka J; Colwill, Karen; Dhe-Paganon, Sirano; Pawson, Tony; Thompson, Debra A

    2013-01-01

    The receptor tyrosine kinase MERTK plays an essential role in the phagocytic uptake of shed photoreceptor membranes by the retinal pigment epithelium (RPE). A fundamental aspect of signal transduction by receptor tyrosine kinases involves autophosphorylation of tyrosine residues that recruit Src-homology 2 (SH2)-domain proteins to the receptor intracellular domain. The goal of the current study was to evaluate the interactions of human MERTK with SH2-domain proteins present in the RPE. The MERTK intracellular domain was expressed as a 6xHis-fusion protein (6xHis-rMERTK(571-999)), purified and phosphorylated. Ni(2+)-NTA pull downs were performed using 6xHis-rMERTK(571-999) in incubations with recombinant phosphotyrosine-recognition sequences expressed as GST-fusion proteins. In addition, pull downs of native SH2-domain proteins were performed using 6xHis-rMERTK(571-999) and protein homogenates from rat RPE/choroid. For both recombinant and native proteins, western analysis detected MERTK interactions with GRB2, PIK3R1 (P85α), VAV3, and SRC. Immunohistochemical analysis localized each protein to mouse RPE. In cultured RPE-J cells incubated with rod outer segments (OS), siRNA knockdown of Grb2 had no effect on OS binding, but significantly reduced OS uptake. Pik3r1 localized to early phagosomes along with Rab5 and Eea1. Phosphorylation and activation of Src was detected downstream of phagocytosis and Mertk activation. These findings suggest that MERTK signaling in the RPE involves a cohort of SH2-domain proteins with the potential to regulate both cytoskeletal rearrangement and membrane movement. Identification of the SH2-domain signaling partners of MERTK is an important step toward further defining the mechanism of RPE phagocytosis that is central to the function and survival of the retina.

  10. MERTK interactions with SH2-domain proteins in the retinal pigment epithelium.

    Directory of Open Access Journals (Sweden)

    Shameka J Shelby

    Full Text Available The receptor tyrosine kinase MERTK plays an essential role in the phagocytic uptake of shed photoreceptor membranes by the retinal pigment epithelium (RPE. A fundamental aspect of signal transduction by receptor tyrosine kinases involves autophosphorylation of tyrosine residues that recruit Src-homology 2 (SH2-domain proteins to the receptor intracellular domain. The goal of the current study was to evaluate the interactions of human MERTK with SH2-domain proteins present in the RPE. The MERTK intracellular domain was expressed as a 6xHis-fusion protein (6xHis-rMERTK(571-999, purified and phosphorylated. Ni(2+-NTA pull downs were performed using 6xHis-rMERTK(571-999 in incubations with recombinant phosphotyrosine-recognition sequences expressed as GST-fusion proteins. In addition, pull downs of native SH2-domain proteins were performed using 6xHis-rMERTK(571-999 and protein homogenates from rat RPE/choroid. For both recombinant and native proteins, western analysis detected MERTK interactions with GRB2, PIK3R1 (P85α, VAV3, and SRC. Immunohistochemical analysis localized each protein to mouse RPE. In cultured RPE-J cells incubated with rod outer segments (OS, siRNA knockdown of Grb2 had no effect on OS binding, but significantly reduced OS uptake. Pik3r1 localized to early phagosomes along with Rab5 and Eea1. Phosphorylation and activation of Src was detected downstream of phagocytosis and Mertk activation. These findings suggest that MERTK signaling in the RPE involves a cohort of SH2-domain proteins with the potential to regulate both cytoskeletal rearrangement and membrane movement. Identification of the SH2-domain signaling partners of MERTK is an important step toward further defining the mechanism of RPE phagocytosis that is central to the function and survival of the retina.

  11. Quantifying water flow and retention in an unsaturated fracture-facial domain

    Science.gov (United States)

    Nimmo, John R.; Malek-Mohammadi, Siamak

    2015-01-01

    Hydrologically significant flow and storage of water occur in macropores and fractures that are only partially filled. To accommodate such processes in flow models, we propose a three-domain framework. Two of the domains correspond to water flow and water storage in a fracture-facial region, in addition to the third domain of matrix water. The fracture-facial region, typically within a fraction of a millimeter of the fracture wall, includes a flowing phase whose fullness is determined by the availability and flux of preferentially flowing water, and a static storage portion whose fullness is determined by the local matric potential. The flow domain can be modeled with the source-responsive preferential flow model, and the roughness-storage domain can be modeled with capillary relations applied on the fracture-facial area. The matrix domain is treated using traditional unsaturated flow theory. We tested the model with application to the hydrology of the Chalk formation in southern England, coherently linking hydrologic information including recharge estimates, streamflow, water table fluctuation, imaging by electron microscopy, and surface roughness. The quantitative consistency of the three-domain matrix-microcavity-film model with this body of diverse data supports the hypothesized distinctions and active mechanisms of the three domains and establishes the usefulness of this framework.

  12. InfoRoute: the CISMeF Context-specific Search Algorithm.

    Science.gov (United States)

    Merabti, Tayeb; Lelong, Romain; Darmoni, Stefan

    2015-01-01

    The aim of this paper was to present a practical InfoRoute algorithm and applications developed by CISMeF to perform a contextual information retrieval across multiple medical websites in different health domains. The algorithm was developed to treat multiple types of queries: natural, Boolean and advanced. The algorithm also generates multiple types of queries: Boolean query, PubMed query or Advanced query. Each query can be extended via an inter alignments relationship from UMLS and HeTOP portal. A web service and two web applications have been developed based on the InfoRoute algorithm to generate links-query across multiple websites, i.e.: "PubMed" or "ClinicalTrials.org". The InfoRoute algorithm is a useful tool to perform contextual information retrieval across multiple medical websites in both English and French.

  13. A hybrid time-domain discontinuous galerkin-boundary integral method for electromagnetic scattering analysis

    KAUST Repository

    Li, Ping; Shi, Yifei; Jiang, Lijun; Bagci, Hakan

    2014-01-01

    A scheme hybridizing discontinuous Galerkin time-domain (DGTD) and time-domain boundary integral (TDBI) methods for accurately analyzing transient electromagnetic scattering is proposed. Radiation condition is enforced using the numerical flux on the truncation boundary. The fields required by the flux are computed using the TDBI from equivalent currents introduced on a Huygens' surface enclosing the scatterer. The hybrid DGTDBI ensures that the radiation condition is mathematically exact and the resulting computation domain is as small as possible since the truncation boundary conforms to scatterer's shape and is located very close to its surface. Locally truncated domains can also be defined around each disconnected scatterer additionally reducing the size of the overall computation domain. Numerical examples demonstrating the accuracy and versatility of the proposed method are presented. © 2014 IEEE.

  14. A hybrid time-domain discontinuous galerkin-boundary integral method for electromagnetic scattering analysis

    KAUST Repository

    Li, Ping

    2014-05-01

    A scheme hybridizing discontinuous Galerkin time-domain (DGTD) and time-domain boundary integral (TDBI) methods for accurately analyzing transient electromagnetic scattering is proposed. Radiation condition is enforced using the numerical flux on the truncation boundary. The fields required by the flux are computed using the TDBI from equivalent currents introduced on a Huygens\\' surface enclosing the scatterer. The hybrid DGTDBI ensures that the radiation condition is mathematically exact and the resulting computation domain is as small as possible since the truncation boundary conforms to scatterer\\'s shape and is located very close to its surface. Locally truncated domains can also be defined around each disconnected scatterer additionally reducing the size of the overall computation domain. Numerical examples demonstrating the accuracy and versatility of the proposed method are presented. © 2014 IEEE.

  15. Correlation between local glaucomatous visual field defects and loss of nerve fiber layer thickness measured with polarimetry and spectral domain OCT.

    Science.gov (United States)

    Horn, Folkert K; Mardin, Christian Y; Laemmer, Robert; Baleanu, Delia; Juenemann, Anselm M; Kruse, Friedrich E; Tornow, Ralf P

    2009-05-01

    To study the correlation between local perimetric field defects and glaucoma-induced thickness reduction of the nerve layer measured in the peripapillary area with scanning laser polarimetry (SLP) and spectral domain optical coherence tomography (SOCT) and to compare the results with those of a theoretical model. The thickness of the retinal nerve fiber layer was determined in 32 sectors (11.25 degrees each) by using SLP with variable cornea compensation (GDxVCC; Laser Diagnostics, San Diego, CA) and the newly introduced high-resolution SOCT (Spectralis; Heidelberg Engineering, Heidelberg, Germany). Eighty-eight healthy subjects served as control subjects, to determine the thickness deviation in patients with glaucoma. The relationship between glaucomatous nerve fiber reduction and visual field losses was calculated in six nerve fiber bundle-related areas. Sixty-four patients at different stages of open-angle glaucoma and 26 patients with ocular hypertension underwent perimetry (Octopus G1; Haag-Streit, Köniz, Switzerland) and measurements with the two morphometric techniques. Sector-shaped analyses between local perimetric losses and reduction of the retinal nerve fiber layer thickness showed a significant association for corresponding areas except for the central visual field in SLP. Correlation coefficients were highest in the area of the nasal inferior visual field (SOCT, -0.81; SLP, -0.57). A linear model describes the association between structural and functional damage. Localized perimetric defects can be explained by reduced nerve fiber layer thickness. The data indicate that the present SOCT is useful for determining the functional-structural relationship in peripapillary areas and that association between perimetric defects and corresponding nerve fiber losses is stronger for SOCT than for the present SLP. (ClinicalTrials.gov number, NCT00494923.).

  16. Improvement in Protein Domain Identification Is Reached by Breaking Consensus, with the Agreement of Many Profiles and Domain Co-occurrence.

    Directory of Open Access Journals (Sweden)

    Juliana Bernardes

    2016-07-01

    Full Text Available Traditional protein annotation methods describe known domains with probabilistic models representing consensus among homologous domain sequences. However, when relevant signals become too weak to be identified by a global consensus, attempts for annotation fail. Here we address the fundamental question of domain identification for highly divergent proteins. By using high performance computing, we demonstrate that the limits of state-of-the-art annotation methods can be bypassed. We design a new strategy based on the observation that many structural and functional protein constraints are not globally conserved through all species but might be locally conserved in separate clades. We propose a novel exploitation of the large amount of data available: 1. for each known protein domain, several probabilistic clade-centered models are constructed from a large and differentiated panel of homologous sequences, 2. a decision-making protocol combines outcomes obtained from multiple models, 3. a multi-criteria optimization algorithm finds the most likely protein architecture. The method is evaluated for domain and architecture prediction over several datasets and statistical testing hypotheses. Its performance is compared against HMMScan and HHblits, two widely used search methods based on sequence-profile and profile-profile comparison. Due to their closeness to actual protein sequences, clade-centered models are shown to be more specific and functionally predictive than the broadly used consensus models. Based on them, we improved annotation of Plasmodium falciparum protein sequences on a scale not previously possible. We successfully predict at least one domain for 72% of P. falciparum proteins against 63% achieved previously, corresponding to 30% of improvement over the total number of Pfam domain predictions on the whole genome. The method is applicable to any genome and opens new avenues to tackle evolutionary questions such as the reconstruction of

  17. The BRCT domain is a phospho-protein binding domain.

    Science.gov (United States)

    Yu, Xiaochun; Chini, Claudia Christiano Silva; He, Miao; Mer, Georges; Chen, Junjie

    2003-10-24

    The carboxyl-terminal domain (BRCT) of the Breast Cancer Gene 1 (BRCA1) protein is an evolutionarily conserved module that exists in a large number of proteins from prokaryotes to eukaryotes. Although most BRCT domain-containing proteins participate in DNA-damage checkpoint or DNA-repair pathways, or both, the function of the BRCT domain is not fully understood. We show that the BRCA1 BRCT domain directly interacts with phosphorylated BRCA1-Associated Carboxyl-terminal Helicase (BACH1). This specific interaction between BRCA1 and phosphorylated BACH1 is cell cycle regulated and is required for DNA damage-induced checkpoint control during the transition from G2 to M phase of the cell cycle. Further, we show that two other BRCT domains interact with their respective physiological partners in a phosphorylation-dependent manner. Thirteen additional BRCT domains also preferentially bind phospho-peptides rather than nonphosphorylated control peptides. These data imply that the BRCT domain is a phospho-protein binding domain involved in cell cycle control.

  18. Substrate clamping effects on irreversible domain wall dynamics in lead zirconate titanate thin films.

    Science.gov (United States)

    Griggio, F; Jesse, S; Kumar, A; Ovchinnikov, O; Kim, H; Jackson, T N; Damjanovic, D; Kalinin, S V; Trolier-McKinstry, S

    2012-04-13

    The role of long-range strain interactions on domain wall dynamics is explored through macroscopic and local measurements of nonlinear behavior in mechanically clamped and released polycrystalline lead zirconate-titanate (PZT) films. Released films show a dramatic change in the global dielectric nonlinearity and its frequency dependence as a function of mechanical clamping. Furthermore, we observe a transition from strong clustering of the nonlinear response for the clamped case to almost uniform nonlinearity for the released film. This behavior is ascribed to increased mobility of domain walls. These results suggest the dominant role of collective strain interactions mediated by the local and global mechanical boundary conditions on the domain wall dynamics. The work presented in this Letter demonstrates that measurements on clamped films may considerably underestimate the piezoelectric coefficients and coupling constants of released structures used in microelectromechanical systems, energy harvesting systems, and microrobots.

  19. On (m, n)-absorbing ideals of commutative rings

    Indian Academy of Sciences (India)

    with respect to various ring theoretic constructions and study (m, n)-absorbing ideals in several commutative rings. For example, in a Bézout ring or a Boolean ring, an ideal is an (m, n)-absorbing ideal if and only if it is an n-absorbing ideal, and in an almost. Dedekind domain every (m, n)-absorbing ideal is a product of at ...

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

  1. G2E3 is a nucleo-cytoplasmic shuttling protein with DNA damage responsive localization

    International Nuclear Information System (INIS)

    Brooks, William S.; Banerjee, Sami; Crawford, David F.

    2007-01-01

    G2E3 was originally described as a G2/M-specific gene with DNA damage responsive expression. The presence of a conserved HECT domain within the carboxy-terminus of the protein indicated that it likely functions as a ubiquitin ligase or E3. Although HECT domains are known to function in this capacity for many proteins, we demonstrate that a portion of the HECT domain from G2E3 plays an important role in the dynamic subcellular localization of the protein. We have shown that G2E3 is a nucleo-cytoplasmic shuttling protein with nuclear export mediated by a novel nuclear export domain that functions independently of CRM1. In full-length G2E3, a separate region of the HECT domain suppresses the function of the NES. Additionally, G2E3 contains a nucleolar localization signal (NoLS) in its amino terminus. Localization of G2E3 to the nucleolus is a dynamic process, and the protein delocalizes from the nucleolus rapidly after DNA damage. Cell cycle phase-specific expression and highly regulated subcellular localization of G2E3 suggest a possible role in cell cycle regulation and the cellular response to DNA damage

  2. Supertube domain walls and elimination of closed timelike curves in string theory

    International Nuclear Information System (INIS)

    Drukker, Nadav

    2004-01-01

    We show that some novel physics of supertubes removes closed timelike curves from many supersymmetric spaces which naively suffer from this problem. The main claim is that supertubes naturally form domain walls, so while analytical continuation of the metric would lead to closed timelike curves, across the domain wall the metric is nondifferentiable, and the closed timelike curves are eliminated. In the examples we study, the metric inside the domain wall is always of the Goedel type, while outside the shell it looks like a localized rotating object, often a rotating black hole. Thus this mechanism prevents the appearance of closed timelike curves behind the horizons of certain rotating black holes

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

  4. Magnetization reversal of the transverse domain wall confined between two clusters of magnetic impurities in a ferromagnetic planar nanowire

    Energy Technology Data Exchange (ETDEWEB)

    Toscano, D., E-mail: danilotoscano@fisica.ufjf.br [Departamento de Física, Laboratório de Simulação Computacional, Universidade Federal de Juiz de Fora, Juiz de Fora, Minas Gerais 36036–330 (Brazil); Leonel, S.A., E-mail: sidiney@fisica.ufjf.br [Departamento de Física, Laboratório de Simulação Computacional, Universidade Federal de Juiz de Fora, Juiz de Fora, Minas Gerais 36036–330 (Brazil); Coura, P.Z., E-mail: pablo@fisica.ufjf.br [Departamento de Física, Laboratório de Simulação Computacional, Universidade Federal de Juiz de Fora, Juiz de Fora, Minas Gerais 36036–330 (Brazil); Sato, F., E-mail: sjfsato@fisica.ufjf.br [Departamento de Física, Laboratório de Simulação Computacional, Universidade Federal de Juiz de Fora, Juiz de Fora, Minas Gerais 36036–330 (Brazil); Costa, B.V., E-mail: bvc@fisica.ufmg.br [Departamento de Física, Laboratório de Simulação, Universidade Federal de Minas Gerais, Belo Horizonte, Minas Gerais 30123–970 (Brazil); Vázquez, M., E-mail: mvazquez@icmm.csic.es [Instituto de Ciencia de Materiales de Madrid, CSIC. 28049 Madrid (Spain)

    2016-12-01

    Numerical simulations have been used to investigate the polarity reversal of the transverse domain wall in rectangular magnetic nanowires and the stabilization of the domain wall position after occurring the polarity reversal. In order to control the wall position we have considered two clusters of magnetic impurities, identical and equidistant from the nanowire width axis. Traps of pinning and blocking for the transverse domain wall can be originated from magnetic impurities, consisting of a local variation of the exchange constant. Under suitable excitation amplitudes it is possible to switch the polarity of the transverse domain wall by applying a nanosecond axial magnetic field pulse in a fast and controllable way. - Highlights: • Traps for pinning and blocking transverse domain walls are proposed. • The traps consisting of localized modifications of the magnetic properties. • The wall polarity can be reversed in a fast and controllable way.

  5. A Method to Identify Nucleolus-Associated Chromatin Domains (NADs).

    Science.gov (United States)

    Carpentier, Marie-Christine; Picart-Picolo, Ariadna; Pontvianne, Frédéric

    2018-01-01

    The nuclear context needs to be taken into consideration to better understand the mechanisms shaping the epigenome and its organization, and therefore its impact on gene expression. For example, in Arabidopsis, heterochromatin is preferentially localized at the nuclear and the nucleolar periphery. Although chromatin domains associating with the nuclear periphery remain to be identified in plant cells, Nucleolus Associated chromatin Domains (NADs) can be identified thanks to a protocol allowing the isolation of pure nucleoli. We describe here the protocol enabling the identification of NADs in Arabidopsis. Providing the transfer of a nucleolus marker as described here in other crop species, this protocol is broadly applicable.

  6. Domain analysis

    DEFF Research Database (Denmark)

    Hjørland, Birger

    2017-01-01

    The domain-analytic approach to knowledge organization (KO) (and to the broader field of library and information science, LIS) is outlined. The article reviews the discussions and proposals on the definition of domains, and provides an example of a domain-analytic study in the field of art studies....... Varieties of domain analysis as well as criticism and controversies are presented and discussed....

  7. Antimicrobial activity of a novel hypervariable immunoglobulin domain-containing receptor Dscam in Cherax quadricarinatus.

    Science.gov (United States)

    Li, Dan; Yu, Ai-Qing; Li, Xue-Jie; Zhu, You-Ting; Jin, Xing-Kun; Li, Wei-Wei; Wang, Qun

    2015-12-01

    Down syndrome cell adhesion molecule (Dscam) mediates innate immunity against pathogens in arthropods. Here, a novel Dscam from red claw crayfish Cherax quadricarinatus (CqDscam) was isolated. The CqDscam protein contains one signal peptide, ten immunoglobulin domains, six fibronectin type III domains, one transmembrane domain and cytoplasmic tail. CqDscam phylogenetically clustered with other invertebrate Dscams. Variable regions of CqDscam in N-terminal halves of Ig2 and Ig3 domains, complete Ig7 domain and TM domain can be reshuffled after transcription to produce a deluge of >37,620 potential alternative splice forms. CqDscam was detected in all tissues tested and abundantly expressed in immune system and nerve system. Upon lipopolysaccharides (LPS) and b-1, 3-glucans (Glu) challenged, the expression of CqDscam was up-regulated, while no response in expression occurred after injection with peptidoglycans (PG). Membrane-bound and secreted types of CqDscam were separated on the protein level, and were both extensively induced post LPS challenge. Membrane-bound CqDscam protein was not detected in the serum, but localized to the hemocyte surface by immuno-localization assay. In the antimicrobial assays, the recombinant LPS-induced isoform of CqDscam protein displayed bacterial binding and growth inhibitory activities, especially with Escherichia coli. These results suggested that CqDscam, as one of pattern-recognition receptors (PRRs), involved in innate immune recognition and defense mechanisms in C. quadricarinatus, possibly through alternative splicing. Copyright © 2015 Elsevier Ltd. All rights reserved.

  8. Public-private partnerships (PPPs) in local services

    DEFF Research Database (Denmark)

    Carpintero, Samuel; Petersen, Ole Helby

    2016-01-01

    Local governments are increasingly utilising the public–private partnership (PPP) model as a means of organising service delivery in the public–private domain. This article examines the experiences with construction and operation of 131 PPP wastewater treatment plants in the region of Aragon, Spain...... to the complexity of implementing the projects. The findings contribute to the literature on local service delivery and provide insights regarding risk transfer in long-term PPP contracts for the delivery of local services in general and water services in particular....

  9. Hepatitis C virus NS4B carboxy terminal domain is a membrane binding domain

    Directory of Open Access Journals (Sweden)

    Spaan Willy JM

    2009-05-01

    Full Text Available Abstract Background Hepatitis C virus (HCV induces membrane rearrangements during replication. All HCV proteins are associated to membranes, pointing out the importance of membranes for HCV. Non structural protein 4B (NS4B has been reported to induce cellular membrane alterations like the membranous web. Four transmembrane segments in the middle of the protein anchor NS4B to membranes. An amphipatic helix at the amino-terminus attaches to membranes as well. The carboxy-terminal domain (CTD of NS4B is highly conserved in Hepaciviruses, though its function remains unknown. Results A cytosolic localization is predicted for the NS4B-CTD. However, using membrane floatation assays and immunofluorescence, we now show targeting of the NS4B-CTD to membranes. Furthermore, a profile-profile search, with an HCV NS4B-CTD multiple sequence alignment, indicates sequence similarity to the membrane binding domain of prokaryotic D-lactate dehydrogenase (d-LDH. The crystal structure of E. coli d-LDH suggests that the region similar to NS4B-CTD is located in the membrane binding domain (MBD of d-LDH, implying analogy in membrane association. Targeting of d-LDH to membranes occurs via electrostatic interactions of positive residues on the outside of the protein with negative head groups of lipids. To verify that anchorage of d-LDH MBD and NS4B-CTD is analogous, NS4B-CTD mutants were designed to disrupt these electrostatic interactions. Membrane association was confirmed by swopping the membrane contacting helix of d-LDH with the corresponding domain of the 4B-CTD. Furthermore, the functionality of these residues was tested in the HCV replicon system. Conclusion Together these data show that NS4B-CTD is associated to membranes, similar to the prokaryotic d-LDH MBD, and is important for replication.

  10. Inferring domain-domain interactions from protein-protein interactions with formal concept analysis.

    Directory of Open Access Journals (Sweden)

    Susan Khor

    Full Text Available Identifying reliable domain-domain interactions will increase our ability to predict novel protein-protein interactions, to unravel interactions in protein complexes, and thus gain more information about the function and behavior of genes. One of the challenges of identifying reliable domain-domain interactions is domain promiscuity. Promiscuous domains are domains that can occur in many domain architectures and are therefore found in many proteins. This becomes a problem for a method where the score of a domain-pair is the ratio between observed and expected frequencies because the protein-protein interaction network is sparse. As such, many protein-pairs will be non-interacting and domain-pairs with promiscuous domains will be penalized. This domain promiscuity challenge to the problem of inferring reliable domain-domain interactions from protein-protein interactions has been recognized, and a number of work-arounds have been proposed. This paper reports on an application of Formal Concept Analysis to this problem. It is found that the relationship between formal concepts provides a natural way for rare domains to elevate the rank of promiscuous domain-pairs and enrich highly ranked domain-pairs with reliable domain-domain interactions. This piggybacking of promiscuous domain-pairs onto less promiscuous domain-pairs is possible only with concept lattices whose attribute-labels are not reduced and is enhanced by the presence of proteins that comprise both promiscuous and rare domains.

  11. Inferring Domain-Domain Interactions from Protein-Protein Interactions with Formal Concept Analysis

    Science.gov (United States)

    Khor, Susan

    2014-01-01

    Identifying reliable domain-domain interactions will increase our ability to predict novel protein-protein interactions, to unravel interactions in protein complexes, and thus gain more information about the function and behavior of genes. One of the challenges of identifying reliable domain-domain interactions is domain promiscuity. Promiscuous domains are domains that can occur in many domain architectures and are therefore found in many proteins. This becomes a problem for a method where the score of a domain-pair is the ratio between observed and expected frequencies because the protein-protein interaction network is sparse. As such, many protein-pairs will be non-interacting and domain-pairs with promiscuous domains will be penalized. This domain promiscuity challenge to the problem of inferring reliable domain-domain interactions from protein-protein interactions has been recognized, and a number of work-arounds have been proposed. This paper reports on an application of Formal Concept Analysis to this problem. It is found that the relationship between formal concepts provides a natural way for rare domains to elevate the rank of promiscuous domain-pairs and enrich highly ranked domain-pairs with reliable domain-domain interactions. This piggybacking of promiscuous domain-pairs onto less promiscuous domain-pairs is possible only with concept lattices whose attribute-labels are not reduced and is enhanced by the presence of proteins that comprise both promiscuous and rare domains. PMID:24586450

  12. Improving pairwise comparison of protein sequences with domain co-occurrence

    Science.gov (United States)

    Gascuel, Olivier

    2018-01-01

    Comparing and aligning protein sequences is an essential task in bioinformatics. More specifically, local alignment tools like BLAST are widely used for identifying conserved protein sub-sequences, which likely correspond to protein domains or functional motifs. However, to limit the number of false positives, these tools are used with stringent sequence-similarity thresholds and hence can miss several hits, especially for species that are phylogenetically distant from reference organisms. A solution to this problem is then to integrate additional contextual information to the procedure. Here, we propose to use domain co-occurrence to increase the sensitivity of pairwise sequence comparisons. Domain co-occurrence is a strong feature of proteins, since most protein domains tend to appear with a limited number of other domains on the same protein. We propose a method to take this information into account in a typical BLAST analysis and to construct new domain families on the basis of these results. We used Plasmodium falciparum as a case study to evaluate our method. The experimental findings showed an increase of 14% of the number of significant BLAST hits and an increase of 25% of the proteome area that can be covered with a domain. Our method identified 2240 new domains for which, in most cases, no model of the Pfam database could be linked. Moreover, our study of the quality of the new domains in terms of alignment and physicochemical properties show that they are close to that of standard Pfam domains. Source code of the proposed approach and supplementary data are available at: https://gite.lirmm.fr/menichelli/pairwise-comparison-with-cooccurrence PMID:29293498

  13. Multi-material micro-electromechanical fibers with bendable functional domains

    Science.gov (United States)

    Nguyen-Dang, Tung; Page, Alexis G.; Qu, Yunpeng; Volpi, Marco; Yan, Wei; Sorin, Fabien

    2017-04-01

    The integration of increasingly complex functionalities within thermally drawn multi-material fibers is heralding a novel path towards advanced soft electronics and smart fabrics. Fibers capable of electronic, optoelectronic, piezoelectric or energy harvesting functions are created by assembling new materials in intimate contact within increasingly complex architectures. Thus far, however, the opportunities associated with the integration of cantilever-like structures with freely moving functional domains within multi-material fibers have not been explored. Used extensively in the micro-electromechanical system (MEMS) technology, electro-mechanical transductance from moving and bendable domains is used in a myriad of applications. In this article we demonstrate the thermal drawing of micro-electromechanical fibers (MEMF) that can detect and localize pressure with high accuracy along their entire length. This ability results from an original cantilever-like design where a freestanding electrically conductive polymer composite film bends under an applied pressure. As it comes into contact with another conducting domain, placed at a prescribed position in the fiber cross-section, an electrical signal is generated. We show that by a judicious choice of materials and electrical connectivity, this signal can be uniquely related to a position along the fiber axis. We establish a model that predicts the position of a local touch from the measurement of currents generated in the 1D MEMF device, and demonstrate an excellent agreement with the experimental data. This ability to detect and localize touch over large areas, curved surfaces and textiles holds significant opportunities in robotics and prosthetics, flexible electronic interfaces, and medical textiles. , which features invited work from the best early-career researchers working within the scope of J. Phys. D. This project is part of the Journal of Physics series’ 50th anniversary celebrations in 2017. Fabien Sorin

  14. Cooperative phosphoinositide and peptide binding by PSD-95/discs large/ZO-1 (PDZ) domain of polychaetoid, Drosophila zonulin.

    Science.gov (United States)

    Ivarsson, Ylva; Wawrzyniak, Anna Maria; Wuytens, Gunther; Kosloff, Mickey; Vermeiren, Elke; Raport, Marie; Zimmermann, Pascale

    2011-12-30

    PDZ domains are well known protein-protein interaction modules that, as part of multidomain proteins, assemble molecular complexes. Some PDZ domains have been reported to interact with membrane lipids, in particular phosphatidylinositol phosphates, but few studies have been aimed at elucidating the prevalence or the molecular details of such interactions. We screened 46 Drosophila PDZ domains for phosphoinositide-dependent cellular localization and discovered that the second PDZ domain of polychaetoid (Pyd PDZ2) interacts with phosphatidylinositol 4,5-bisphosphate (PtdIns(4,5)P(2)) at the plasma membrane. Surface plasmon resonance binding experiments with recombinant protein established that Pyd PDZ2 interacts with phosphatidylinositol phosphates with apparent affinities in the micromolar range. Electrostatic interactions involving an extended positively charged surface of Pyd PDZ2 are crucial for the PtdIns(4,5)P(2)-dependent membrane interactions as shown by a combination of three-dimensional modeling, mutagenesis, binding, and localization studies. In vivo localization studies further suggested that both lipid and peptide binding contribute to membrane localization. We identified the transmembrane protein Crumbs as a Pyd PDZ2 ligand and probed the relation between peptide and PtdIns(4,5)P(2) binding. Contrary to the prevalent view on PDZ/peptide/lipid binding, we did not find competition between peptide and lipid ligands. Instead, preloading the protein with the 10-mer Crb3 peptide increased the apparent affinity of Pyd PDZ2 for PtdIns(4,5)P(2) 6-fold. Our results suggest that membrane localization of Pyd PDZ2 may be driven by a combination of peptide and PtdIns(4,5)P(2) binding, which raises the intriguing possibility that the domain may coordinate protein- and phospholipid-mediated signals.

  15. 78 FR 6811 - Country Code Top-Level Domain (ccTLD) for the United States; Policies and Requirements; Comments...

    Science.gov (United States)

    2013-01-31

    ... delegated manager facilitates and manages domain name registrations using this locality name such as tourism...'' policies, see http://www.neustar.us/delegated-managers/ . For a definition and description of ``locality...

  16. Global versus local mechanisms of temperature sensing in ion channels.

    Science.gov (United States)

    Arrigoni, Cristina; Minor, Daniel L

    2018-05-01

    Ion channels turn diverse types of inputs, ranging from neurotransmitters to physical forces, into electrical signals. Channel responses to ligands generally rely on binding to discrete sensor domains that are coupled to the portion of the channel responsible for ion permeation. By contrast, sensing physical cues such as voltage, pressure, and temperature arises from more varied mechanisms. Voltage is commonly sensed by a local, domain-based strategy, whereas the predominant paradigm for pressure sensing employs a global response in channel structure to membrane tension changes. Temperature sensing has been the most challenging response to understand and whether discrete sensor domains exist for pressure and temperature has been the subject of much investigation and debate. Recent exciting advances have uncovered discrete sensor modules for pressure and temperature in force-sensitive and thermal-sensitive ion channels, respectively. In particular, characterization of bacterial voltage-gated sodium channel (BacNa V ) thermal responses has identified a coiled-coil thermosensor that controls channel function through a temperature-dependent unfolding event. This coiled-coil thermosensor blueprint recurs in other temperature sensitive ion channels and thermosensitive proteins. Together with the identification of ion channel pressure sensing domains, these examples demonstrate that "local" domain-based solutions for sensing force and temperature exist and highlight the diversity of both global and local strategies that channels use to sense physical inputs. The modular nature of these newly discovered physical signal sensors provides opportunities to engineer novel pressure-sensitive and thermosensitive proteins and raises new questions about how such modular sensors may have evolved and empowered ion channel pores with new sensibilities.

  17. Gravity localization on hybrid branes

    Directory of Open Access Journals (Sweden)

    D.F.S. Veras

    2016-03-01

    Full Text Available This work deals with gravity localization on codimension-1 brane worlds engendered by compacton-like kinks, the so-called hybrid branes. In such scenarios, the thin brane behavior is manifested when the extra dimension is outside the compact domain, where the energy density is non-trivial, instead of asymptotically as in the usual thick brane models. The zero mode is trapped in the brane, as required. The massive modes, although not localized in the brane, have important phenomenological implications such as corrections to the Newton's law. We study such corrections in the usual thick domain wall and in the hybrid brane scenarios. By means of suitable numerical methods, we attain the mass spectrum for the graviton and the corresponding wavefunctions. The spectra possess the usual linearly increasing behavior from the Kaluza–Klein theories. Further, we show that the 4D gravitational force is slightly increased at short distances. The first eigenstate contributes highly for the correction to the Newton's law. The subsequent normalized solutions have diminishing contributions. Moreover, we find out that the phenomenology of the hybrid brane is not different from the usual thick domain wall. The use of numerical techniques for solving the equations of the massive modes is useful for matching possible phenomenological measurements in the gravitational law as a probe to warped extra dimensions.

  18. Critical role of the FERM domain in Pyk2 stimulated glioma cell migration

    International Nuclear Information System (INIS)

    Lipinski, Christopher A.; Tran, Nhan L.; Dooley, Andrea; Pang, Yuan-Ping; Rohl, Carole; Kloss, Jean; Yang, Zhongbo; McDonough, Wendy; Craig, David; Berens, Michael E.; Loftus, Joseph C.

    2006-01-01

    The strong tendency of malignant glioma cells to invade locally into surrounding normal brain precludes effective surgical resection, reduces the efficacy of radiotherapy, and is associated with increased resistance to chemotherapy regimens. We report that the N-terminal FERM domain of Pyk2 regulates its promigratory function. A 3-dimensional model of the Pyk2 FERM domain was generated and mutagenesis studies identified residues essential for Pyk2 promigratory function. Model-based targeted mutations within the FERM domain decreased Pyk2 phosphorylation and reduced the capacity of Pyk2 to stimulate glioma cell migration but did not significantly alter the intracellular distribution of Pyk2. Expression of autonomous Pyk2 FERM domain fragments containing analogous mutations exhibited reduced capacity to inhibit glioma cell migration and Pyk2 phosphorylation relative to expression of an autonomous wild type FERM domain fragment. These results indicate that the FERM domain plays an important role in regulating the functional competency of Pyk2 as a promigratory factor in glioma

  19. Methodology for time-domain estimation of storm time geoelectric fields using the 3-D magnetotelluric response tensors

    Science.gov (United States)

    Kelbert, Anna; Balch, Christopher C.; Pulkkinen, Antti; Egbert, Gary D.; Love, Jeffrey J.; Rigler, E. Joshua; Fujii, Ikuko

    2017-07-01

    Geoelectric fields at the Earth's surface caused by magnetic storms constitute a hazard to the operation of electric power grids and related infrastructure. The ability to estimate these geoelectric fields in close to real time and provide local predictions would better equip the industry to mitigate negative impacts on their operations. Here we report progress toward this goal: development of robust algorithms that convolve a magnetic storm time series with a frequency domain impedance for a realistic three-dimensional (3-D) Earth, to estimate the local, storm time geoelectric field. Both frequency domain and time domain approaches are presented and validated against storm time geoelectric field data measured in Japan. The methods are then compared in the context of a real-time application.

  20. Magnetization dynamics of weak stripe domains in Fe-N thin films: a multi-technique complementary approach.

    Science.gov (United States)

    Camara, Ibrahima; Tacchi, Silvia; Garnier, Louis-Charles; Eddrief, Mahmoud; Fortuna, Franck; Carlotti, Giovanni; Marangolo, Massimiliano

    2017-09-26

    The resonant eigenmodes of a nitrogen-implanted iron α'-FeN characterized by weak stripe domains are investigated by Brillouin light scattering and broadband ferromagnetic resonance experiments, assisted by micromagnetic simulations. The spectrum of the dynamic eigenmodes in the presence of the weak stripes is very rich and two different families of modes can be selectively detected using different techniques or different experimental configurations. Attention is paid to the evolution of the mode frequencies and spatial profiles under the application of an external magnetic field, of variable intensity, in the direction parallel or transverse to the stripes. The different evolution of the modes with the external magnetic field is accompanied by a distinctive spatial localization in specific regions, such as the closure domains at the surface of the stripes and the bulk domains localized in the inner part of the stripes. The complementarity of BLS and FMR techniques, based on different selection rules, is found to be a fruitful tool for the study of the wealth of localized mag-netic excitations generally found in nanostructures. © 2017 IOP Publishing Ltd.

  1. Compliant ferroelastic domains in epitaxial Pb(Zr,Ti)O{sub 3} thin films

    Energy Technology Data Exchange (ETDEWEB)

    Feigl, L.; McGilly, L. J.; Sandu, C. S.; Setter, N. [Ceramics Laboratory, EPFL - Swiss Federal Institute of Technology, Lausanne CH-1015 (Switzerland)

    2014-04-28

    Ordered patterns of highly compliant ferroelastic domains have been created by use of tensile strained epitaxial Pb(Zr,Ti)O{sub 3} thin films, of very low defect density, grown on DyScO{sub 3} substrates. The effect of 180° switching on well-ordered a/c 90° domain patterns is investigated by a combination of transmission electron microscopy, piezoelectric force microscopy, and X-ray diffraction. It is shown that ferroelastic a-domains, having an in-plane polarization, can be created and completely removed on a local level by an out-of-plane electric field. The modifications of the ferroelastic domain pattern can be controlled by varying the parameters used during switching with a piezoresponse force microscope to produce the desired arrangement.

  2. High-Order Calderón Preconditioned Time Domain Integral Equation Solvers

    KAUST Repository

    Valdes, Felipe; Ghaffari-Miab, Mohsen; Andriulli, Francesco P.; Cools, Kristof; Michielssen,

    2013-01-01

    Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.

  3. High-Order Calderón Preconditioned Time Domain Integral Equation Solvers

    KAUST Repository

    Valdes, Felipe

    2013-05-01

    Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.

  4. Identification of the functional domains of ANT-1, a novel coactivator of the androgen receptor

    International Nuclear Information System (INIS)

    Fan Shuli; Goto, Kiminobu; Chen Guangchun; Morinaga, Hidetaka; Nomura, Masatoshi; Okabe, Taijiro; Nawata, Hajime; Yanase, Toshihiko

    2006-01-01

    Previously, we identified a transcriptional coactivator for the activation function-1 (AF-1) domain of the human androgen receptor (AR) and designated it androgen receptor N-terminal domain transactivating protein-1 (ANT-1). This coactivator, which contains multiple tetratricopeptide repeat (TPR) motifs from amino acid (aa) 294, is identical to a component of U5 small nuclear ribonucleoprotein particles and binds specifically to the AR or glucocorticoid receptor. Here, we identified four distinct functional domains. The AR-AF-1-binding domain, which bound to either aa 180-360 or 360-532 in AR-AF-1, clearly overlapped with TAU-1 and TAU-5. This domain and the subnuclear speckle formation domain in ANT-1 were assigned within the TPR motifs, while the transactivating and nuclear localization signal domains resided within the N-terminal sequence. The existence of these functional domains may further support the idea that ANT-1 can function as an AR-AF-1-specific coactivator while mediating a transcription-splicing coupling

  5. Local Atomic Structure and Discommensurations in the Charge Density Wave of CeTe3

    International Nuclear Information System (INIS)

    Kim, H.J.; Tomic, A.T.; Tessmer, S.H.; Billinge, S.J.L.; Malliakas, C.D.; Kanatzidis, M.G.

    2006-01-01

    The local structure of CeTe 3 in the incommensurate charge density wave (IC-CDW) state has been obtained using atomic pair distribution function analysis of x-ray diffraction data. Local atomic distortions in the Te nets due to the CDW are larger than observed crystallographically, resulting in distinct short and long Te-Te bonds. Observation of different distortion amplitudes in the local and average structures is explained by the discommensurated nature of the CDW, since the pair distribution function is sensitive to the local displacements within the commensurate regions, whereas the crystallographic result averages over many discommensurated domains. The result is supported by STM data. This is the first quantitative local structural study within the commensurate domains in an IC-CDW system

  6. On locally uniformly linearizable high breakdown location and scale functionals

    NARCIS (Netherlands)

    Davies, P.L.

    1998-01-01

    This article gives two constructions of a weighted mean which has a large domain, is affinely equivariant, has a locally high breakdown point and is locally uniformly linearizable. One construction is based on $M$-functionals with smooth defining $\\psi$- and $\\chi$ -functions which are used to

  7. The YARHG domain: an extracellular domain in search of a function.

    Directory of Open Access Journals (Sweden)

    Penny Coggill

    Full Text Available We have identified a new bacterial protein domain that we hypothesise binds to peptidoglycan. This domain is called the YARHG domain after the most highly conserved sequence-segment. The domain is found in the extracellular space and is likely to be composed of four alpha-helices. The domain is found associated with protein kinase domains, suggesting it is associated with signalling in some bacteria. The domain is also found associated with three different families of peptidases. The large number of different domains that are found associated with YARHG suggests that it is a useful functional module that nature has recombined multiple times.

  8. Configuration and local elastic interaction of ferroelectric domains and misfit dislocation in PbTiO3/SrTiO3 epitaxial thin films

    Directory of Open Access Journals (Sweden)

    Takanori Kiguchi, Kenta Aoyagi, Yoshitaka Ehara, Hiroshi Funakubo, Tomoaki Yamada, Noritaka Usami and Toyohiko J Konno

    2011-01-01

    Full Text Available We have studied the strain field around the 90° domains and misfit dislocations in PbTiO3/SrTiO3 (001 epitaxial thin films, at the nanoscale, using the geometric phase analysis (GPA combined with high-resolution transmission electron microscopy (HRTEM and high-angle annular dark field––scanning transmission electron microscopy (HAADF-STEM. The films typically contain a combination of a/c-mixed domains and misfit dislocations. The PbTiO3 layer was composed from the two types of the a-domain (90° domain: a typical a/c-mixed domain configuration where a-domains are 20–30 nm wide and nano sized domains with a width of about 3 nm. In the latter case, the nano sized a-domain does not contact the film/substrate interface; it remains far from the interface and stems from the misfit dislocation. Strain maps obtained from the GPA of HRTEM images show the elastic interaction between the a-domain and the dislocations. The normal strain field and lattice rotation match each other between them. Strain maps reveal that the a-domain nucleation takes place at the misfit dislocation. The lattice rotation around the misfit dislocation triggers the nucleation of the a-domain; the normal strains around the misfit dislocation relax the residual strain in a-domain; then, the a-domain growth takes place, accompanying the introduction of the additional dislocation perpendicular to the misfit dislocation and the dissociation of the dislocations into two pairs of partial dislocations with an APB, which is the bottom boundary of the a-domain. The novel mechanism of the nucleation and growth of 90° domain in PbTiO3/SrTiO3 epitaxial system has been proposed based on above the results.

  9. Frequency-domain waveform inversion using the phase derivative

    KAUST Repository

    Choi, Yun Seok

    2013-09-26

    Phase wrapping in the frequency domain or cycle skipping in the time domain is the major cause of the local minima problem in the waveform inversion when the starting model is far from the true model. Since the phase derivative does not suffer from the wrapping effect, its inversion has the potential of providing a robust and reliable inversion result. We propose a new waveform inversion algorithm using the phase derivative in the frequency domain along with the exponential damping term to attenuate reflections. We estimate the phase derivative, or what we refer to as the instantaneous traveltime, by taking the derivative of the Fourier-transformed wavefield with respect to the angular frequency, dividing it by the wavefield itself and taking the imaginary part. The objective function is constructed using the phase derivative and the gradient of the objective function is computed using the back-propagation algorithm. Numerical examples show that our inversion algorithm with a strong damping generates a tomographic result even for a high ‘single’ frequency, which can be a good initial model for full waveform inversion and migration.

  10. Local Peltier-effect-induced reversible metal–insulator transition in VO2 nanowires

    International Nuclear Information System (INIS)

    Takami, Hidefumi; Kanki, Teruo; Tanaka, Hidekazu

    2016-01-01

    We report anomalous resistance leaps and drops in VO 2 nanowires with operating current density and direction, showing reversible and nonvolatile switching. This event is associated with the metal–insulator phase transition (MIT) of local nanodomains with coexistence states of metallic and insulating phases induced by thermoelectric cooling and heating effects. Because the interface of metal and insulator domains has much different Peltier coefficient, it is possible that a significant Peltier effect would be a source of the local MIT. This operation can be realized by one-dimensional domain configuration in VO 2 nanowires because one straight current path through the electronic domain-interface enables theoretical control of thermoelectric effects. This result will open a new method of reversible control of electronic states in correlated electron materials.

  11. Imaging lipid domains in cell membranes: the advent of super-resolution fluorescence microscopy

    Directory of Open Access Journals (Sweden)

    Dylan Myers Owen

    2013-12-01

    Full Text Available The lipid bilayer of model membranes, liposomes reconstituted from cell lipids, and plasma membrane vesicles and spheres can separate into two distinct liquid phases to yield lipid domains with liquid-ordered and liquid-disordered properties. These observations are the basis of the lipid raft hypothesis that postulates the existence of cholesterol-enriched ordered-phase lipid domains in cell membranes that could regulate protein mobility, localization and interaction. Here we review the evidence that nano-scaled lipid complexes and meso-scaled lipid domains exist in cell membranes and how new fluorescence microscopy techniques that overcome the diffraction limit provide new insights into lipid organization in cell membranes.

  12. Same but not alike: Structure, flexibility and energetics of domains in multi-domain proteins are influenced by the presence of other domains.

    Science.gov (United States)

    Vishwanath, Sneha; de Brevern, Alexandre G; Srinivasan, Narayanaswamy

    2018-02-01

    The majority of the proteins encoded in the genomes of eukaryotes contain more than one domain. Reasons for high prevalence of multi-domain proteins in various organisms have been attributed to higher stability and functional and folding advantages over single-domain proteins. Despite these advantages, many proteins are composed of only one domain while their homologous domains are part of multi-domain proteins. In the study presented here, differences in the properties of protein domains in single-domain and multi-domain systems and their influence on functions are discussed. We studied 20 pairs of identical protein domains, which were crystallized in two forms (a) tethered to other proteins domains and (b) tethered to fewer protein domains than (a) or not tethered to any protein domain. Results suggest that tethering of domains in multi-domain proteins influences the structural, dynamic and energetic properties of the constituent protein domains. 50% of the protein domain pairs show significant structural deviations while 90% of the protein domain pairs show differences in dynamics and 12% of the residues show differences in the energetics. To gain further insights on the influence of tethering on the function of the domains, 4 pairs of homologous protein domains, where one of them is a full-length single-domain protein and the other protein domain is a part of a multi-domain protein, were studied. Analyses showed that identical and structurally equivalent functional residues show differential dynamics in homologous protein domains; though comparable dynamics between in-silico generated chimera protein and multi-domain proteins were observed. From these observations, the differences observed in the functions of homologous proteins could be attributed to the presence of tethered domain. Overall, we conclude that tethered domains in multi-domain proteins not only provide stability or folding advantages but also influence pathways resulting in differences in

  13. Identifying APT Malware Domain Based on Mobile DNS Logging

    Directory of Open Access Journals (Sweden)

    Weina Niu

    2017-01-01

    Full Text Available Advanced Persistent Threat (APT is a serious threat against sensitive information. Current detection approaches are time-consuming since they detect APT attack by in-depth analysis of massive amounts of data after data breaches. Specifically, APT attackers make use of DNS to locate their command and control (C&C servers and victims’ machines. In this paper, we propose an efficient approach to detect APT malware C&C domain with high accuracy by analyzing DNS logs. We first extract 15 features from DNS logs of mobile devices. According to Alexa ranking and the VirusTotal’s judgement result, we give each domain a score. Then, we select the most normal domains by the score metric. Finally, we utilize our anomaly detection algorithm, called Global Abnormal Forest (GAF, to identify malware C&C domains. We conduct a performance analysis to demonstrate that our approach is more efficient than other existing works in terms of calculation efficiency and recognition accuracy. Compared with Local Outlier Factor (LOF, k-Nearest Neighbor (KNN, and Isolation Forest (iForest, our approach obtains more than 99% F-M and R for the detection of C&C domains. Our approach not only can reduce data volume that needs to be recorded and analyzed but also can be applicable to unsupervised learning.

  14. Metric isomorphism of the classical ideal gas and its local perturbation

    International Nuclear Information System (INIS)

    Terletskij, Yu.A.

    1989-01-01

    The ergodic properties of the infinite-particles gas with local interaction defined in any finite number of nonintersecting bounded open convex domains Λ 1 , Λ 2 , Λ N are considered. To describe the pair interaction of particles x i and x j situated in some domain Λ m they the spherical-symmetric potential Φ(modul (x i -x j )) which is repulsive when modul(x i -x j ) is small and attractive when modul(x i -x j ) is large. The main result of the paper is the theorem of the metric isomorphism of the classical ideal gas and its local perturbation

  15. Yeast Ivy1p Is a Putative I-BAR-domain Protein with pH-sensitive Filament Forming Ability in vitro.

    Science.gov (United States)

    Itoh, Yuzuru; Kida, Kazuki; Hanawa-Suetsugu, Kyoko; Suetsugu, Shiro

    2016-01-01

    Bin-Amphiphysin-Rvs161/167 (BAR) domains mold lipid bilayer membranes into tubules, by forming a spiral polymer on the membrane. Most BAR domains are thought to be involved in forming membrane invaginations through their concave membrane binding surfaces, whereas some members have convex membrane binding surfaces, and thereby mold membranes into protrusions. The BAR domains with a convex surface form a subtype called the inverse BAR (I-BAR) domain or IRSp53-MIM-homology domain (IMD). Although the mammalian I-BAR domains have been studied, those from other organisms remain elusive. Here, we found putative I-BAR domains in Fungi and animal-like unicellular organisms. The fungal protein containing the putative I-BAR-domain is known as Ivy1p in yeast, and is reportedly localized in the vacuole. The phylogenetic analysis of the I-BAR domains revealed that the fungal I-BAR-domain containing proteins comprise a distinct group from those containing IRSp53 or MIM. Importantly, Ivy1p formed a polymer with a diameter of approximately 20 nm in vitro, without a lipid membrane. The filaments were formed at neutral pH, but disassembled when pH was reverted to basic. Moreover, Ivy1p and the I-BAR domain expressed in mammalian HeLa cells was localized at a vacuole-like structure as filaments as revealed by super-resolved microscopy. These data indicate the pH-sensitive polymer forming ability and the functional conservation of Ivy1p in eukaryotic cells.

  16. Rating the effectiveness of local tobacco policies for reducing youth smoking.

    Science.gov (United States)

    Lipperman-Kreda, Sharon; Friend, Karen B; Grube, Joel W

    2014-04-01

    Important questions remain regarding the effectiveness of local tobacco policies for preventing and reducing youth tobacco use and the relative importance of these policies. The aims of this paper are to: (1) compare policy effectiveness ratings provided by researchers and tobacco prevention specialists for individual local tobacco policies, and (2) develop and describe a systematic approach to score communities for locally-implemented tobacco policies. We reviewed municipal codes of 50 California communities to identify local tobacco regulations in five sub-domains. We then developed an instrument to rate the effectiveness of these policies and administered it to an expert panel of 40 tobacco researchers and specialists. We compared mean policy effectiveness ratings obtained from researchers and prevention specialists and used it to score the 50 communities. High inter-rater reliabilities obtained for each sub-domain indicated substantial agreement among the raters about relative policy effectiveness. Results showed that, although researchers and prevention specialists differed on the mean levels of policy ratings, their relative rank ordering of the effectiveness of policy sub-domains were very similar. While both researchers and prevention specialists viewed local outdoor clean air policies as least effective in preventing and reducing youth cigarette smoking, they rated tobacco sales policies and advertising and promotion as more effective than the other policies. Moreover, we found high correlations between community scores generated from researchers' and prevention specialists' ratings. This approach can be used to inform research on local policies and prevention efforts and help bridge the gap between research and practice.

  17. LOCAL DEVELOPMENT IN NORTHEST REGION THROUGH ACTIVITIES IN ITC DOMAIN

    Directory of Open Access Journals (Sweden)

    Daniela\tENACHESCU

    2015-06-01

    Full Text Available Economic areas with high technology are key drivers in sustainable regional development, including unemployment and consequently decreasing population migration in the region. Northeast Region is the largest development region of Romania in terms of number of inhabitants and the owned area. On 01/01/2014, according to balance employment, labor resources of the region were numbered 2,428,700, which represent 49.6% of employed population. The registered unemployment rate at 31 August 2014 was 6.5%, with 82 thousand unemployed registered. In terms of participation in the main economic activities, civilian employment in agriculture, forestry and fishing is predominant (40.1% while in service, civilian employment is 37.1%, while industry and construction is 22.8%. The paper aims to analyze the situation that the potential employment and development opportunities for the Northeast region through activities in the field of ITC domain. Unfortunately, this area was the worst in most indicators, the use of computers and the internet to the turnover of companies and investments in the IT & C and unfortunately in terms of employment population that is under 50%

  18. Fast damage imaging using the time-reversal technique in the frequency–wavenumber domain

    International Nuclear Information System (INIS)

    Zhu, R; Huang, G L; Yuan, F G

    2013-01-01

    The time-reversal technique has been successfully used in structural health monitoring (SHM) for quantitative imaging of damage. However, the technique is very time-consuming when it is implemented in the time domain. In this paper, we study the technique in the frequency–wavenumber (f–k) domain for fast real-time imaging of multiple damage sites in plates using scattered flexural plate waves. Based on Mindlin plate theory, the time reversibility of dispersive flexural waves in an isotropic plate is theoretically investigated in the f–k domain. A fast damage imaging technique is developed by using the cross-correlation between the back-propagated scattered wavefield and the incident wavefield in the frequency domain. Numerical simulations demonstrate that the proposed technique cannot only localize multiple damage sites but also potentially identify their sizes. Moreover, the time-reversal technique in the f–k domain is about two orders of magnitude faster than the method in the time domain. Finally, experimental testing of an on-line SHM system with a sparse piezoelectric sensor array is conducted for fast multiple damage identification using the proposed technique. (paper)

  19. Combination Across Domains: An MEG Investigation into the Relationship between Mathematical, Pictorial, and Linguistic Processing

    Science.gov (United States)

    Bemis, Douglas K.; Pylkkänen, Liina

    2013-01-01

    Debates surrounding the evolution of language often hinge upon its relationship to cognition more generally and many investigations have attempted to demark the boundary between the two. Though results from these studies suggest that language may recruit domain-general mechanisms during certain types of complex processing, the domain-generality of basic combinatorial mechanisms that lie at the core of linguistic processing is still unknown. Our previous work (Bemis and Pylkkänen, 2011, 2012) used magnetoencephalography to isolate neural activity associated with the simple composition of an adjective and a noun (“red boat”) and found increased activity during this processing localized to the left anterior temporal lobe (lATL), ventro-medial prefrontal cortex (vmPFC), and left angular gyrus (lAG). The present study explores the domain-generality of these effects and their associated combinatorial mechanisms through two parallel non-linguistic combinatorial tasks designed to be as minimal and natural as the linguistic paradigm. In the first task, we used pictures of colored shapes to elicit combinatorial conceptual processing similar to that evoked by the linguistic expressions and find increased activity again localized to the vmPFC during combinatorial processing. This result suggests that a domain-general semantic combinatorial mechanism operates during basic linguistic composition, and that activity generated by its processing localizes to the vmPFC. In the second task, we recorded neural activity as subjects performed simple addition between two small numerals. Consistent with a wide array of recent results, we find no effects related to basic addition that coincide with our linguistic effects and instead find increased activity localized to the intraparietal sulcus. This result suggests that the scope of the previously identified linguistic effects is restricted to compositional operations and does not extend generally to all tasks that are merely similar

  20. Integrating angle-frequency domain synchronous averaging technique with feature extraction for gear fault diagnosis

    Science.gov (United States)

    Zhang, Shengli; Tang, J.

    2018-01-01

    Gear fault diagnosis relies heavily on the scrutiny of vibration responses measured. In reality, gear vibration signals are noisy and dominated by meshing frequencies as well as their harmonics, which oftentimes overlay the fault related components. Moreover, many gear transmission systems, e.g., those in wind turbines, constantly operate under non-stationary conditions. To reduce the influences of non-synchronous components and noise, a fault signature enhancement method that is built upon angle-frequency domain synchronous averaging is developed in this paper. Instead of being averaged in the time domain, the signals are processed in the angle-frequency domain to solve the issue of phase shifts between signal segments due to uncertainties caused by clearances, input disturbances, and sampling errors, etc. The enhanced results are then analyzed through feature extraction algorithms to identify the most distinct features for fault classification and identification. Specifically, Kernel Principal Component Analysis (KPCA) targeting at nonlinearity, Multilinear Principal Component Analysis (MPCA) targeting at high dimensionality, and Locally Linear Embedding (LLE) targeting at local similarity among the enhanced data are employed and compared to yield insights. Numerical and experimental investigations are performed, and the results reveal the effectiveness of angle-frequency domain synchronous averaging in enabling feature extraction and classification.

  1. Local Atomic Structure and Discommensurations in the Charge Density Wave of CeTe{sub 3}

    Energy Technology Data Exchange (ETDEWEB)

    Kim, H J; Tomic, A T; Tessmer, S H; Billinge, S J.L. [Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824 (United States); Malliakas, C D; Kanatzidis, M G [Department of Chemistry, Michigan State University, East Lansing, Michigan 48824 (United States)

    2006-06-09

    The local structure of CeTe{sub 3} in the incommensurate charge density wave (IC-CDW) state has been obtained using atomic pair distribution function analysis of x-ray diffraction data. Local atomic distortions in the Te nets due to the CDW are larger than observed crystallographically, resulting in distinct short and long Te-Te bonds. Observation of different distortion amplitudes in the local and average structures is explained by the discommensurated nature of the CDW, since the pair distribution function is sensitive to the local displacements within the commensurate regions, whereas the crystallographic result averages over many discommensurated domains. The result is supported by STM data. This is the first quantitative local structural study within the commensurate domains in an IC-CDW system.

  2. The PDZ domain of the guanine nucleotide exchange factor PDZGEF directs binding to phosphatidic acid during brush border formation.

    Directory of Open Access Journals (Sweden)

    Sarah V Consonni

    Full Text Available PDZGEF is a guanine nucleotide exchange factor for the small G protein Rap. It was recently found that PDZGEF contributes to establishment of intestinal epithelial polarity downstream of the kinase Lkb1. By binding to phosphatidic acid enriched at the apical membrane, PDZGEF locally activates Rap2a resulting in induction of brush border formation via a pathway that includes the polarity players TNIK, Mst4 and Ezrin. Here we show that the PDZ domain of PDZGEF is essential and sufficient for targeting PDZGEF to the apical membrane of polarized intestinal epithelial cells. Inhibition of PLD and consequently production of phosphatidic acid inhibitis targeting of PDZGEF to the plasma membrane. Furthermore, localization requires specific positively charged residues within the PDZ domain. We conclude that local accumulation of PDZGEF at the apical membrane during establishment of epithelial polarity is mediated by electrostatic interactions between positively charged side chains in the PDZ domain and negatively charged phosphatidic acid.

  3. Domain-restricted mutation analysis to identify novel driver events in human cancer

    Directory of Open Access Journals (Sweden)

    Sanket Desai

    2017-10-01

    Full Text Available Analysis of mutational spectra across various cancer types has given valuable insights into tumorigenesis. Different approaches have been used to identify novel drivers from the set of somatic mutations, including the methods which use sequence conservation, geometric localization and pathway information. Recent computational methods suggest use of protein domain information for analysis and understanding of the functional consequence of non-synonymous mutations. Similarly, evidence suggests recurrence at specific position in proteins is robust indicators of its functional impact. Building on this, we performed a systematic analysis of TCGA exome derived somatic mutations across 6089 PFAM domains and significantly mutated domains were identified using randomization approach. Multiple alignment of individual domain allowed us to prioritize for conserved residues mutated at analogous positions across different proteins in a statistically disciplined manner. In addition to the known frequently mutated genes, this analysis independently identifies low frequency Meprin and TRAF-Homology (MATH domain in Speckle Type BTB/POZ (SPOP protein, in prostate adenocarcinoma. Results from this analysis will help generate hypotheses about the downstream molecular mechanism resulting in cancer phenotypes.

  4. The relationship between the local temperature and the local heat flux within a one-dimensional semi-infinite domain of heat wave propagation

    Directory of Open Access Journals (Sweden)

    Kulish Vladimir V.

    2003-01-01

    Full Text Available The relationship between the local temperature and the local heat flux has been established for the homogeneous hyperbolic heat equation. This relationship has been written in the form of a convolution integral involving the modified Bessel functions. The scale analysis of the hyperbolic energy equation has been performed and the dimensionless criterion for the mode of energy transport, similar to the Reynolds criterion for the flow regimes, has been proposed. Finally, the integral equation, relating the local temperature and the local heat flux, has been solved numerically for those processes of surface heating whose time scale is of the order of picoseconds.

  5. Functional Properties at Domain Walls in BiFeO3: Electrical, Magnetic, and Structural investigations

    Science.gov (United States)

    He, Qing; Yang, C.-H.; Yu, P.; Gajek, M.; Seidel, J.; Ramesh, R.; Wang, F.; Chu, Y.-H.; Martin, L. W.; Spaldin, N.; Rother, A.

    2009-03-01

    BiFeO3 (BFO) is a widely studied robust ferroelectric, antiferromagnetic multiferroic. Conducting-atomic force microscopy studies reveal the presence of enhanced conductivity at certain types of domain walls in BFO. We have completed detailed TEM studies of the physical structure at these domain walls as well as in-depth DFT calculations of the evolution of electronic structure at these domain walls. These studies reveal two major contributions to the observed conduction: the formation of an electrostatic potential at the domain walls as well as a structurally-driven change in the electronic structure (i.e., a lower band gap locally) at the domain walls. We will discuss the use of optical characterization techniques as a way of probing this change in electronic structure at domain walls as well as detailed IV characterization both in atmospheric and UHV environments. Finally, the evolution of magnetism at these domain walls has been studied through the use of photoemission measurements. Initial findings point to a significant change in the magnetic order at these domain walls in BFO.

  6. An Algebro-Topological Description of Protein Domain Structure

    Science.gov (United States)

    Penner, Robert Clark; Knudsen, Michael; Wiuf, Carsten; Andersen, Jørgen Ellegaard

    2011-01-01

    The space of possible protein structures appears vast and continuous, and the relationship between primary, secondary and tertiary structure levels is complex. Protein structure comparison and classification is therefore a difficult but important task since structure is a determinant for molecular interaction and function. We introduce a novel mathematical abstraction based on geometric topology to describe protein domain structure. Using the locations of the backbone atoms and the hydrogen bonds, we build a combinatorial object – a so-called fatgraph. The description is discrete yet gives rise to a 2-dimensional mathematical surface. Thus, each protein domain corresponds to a particular mathematical surface with characteristic topological invariants, such as the genus (number of holes) and the number of boundary components. Both invariants are global fatgraph features reflecting the interconnectivity of the domain by hydrogen bonds. We introduce the notion of robust variables, that is variables that are robust towards minor changes in the structure/fatgraph, and show that the genus and the number of boundary components are robust. Further, we invesigate the distribution of different fatgraph variables and show how only four variables are capable of distinguishing different folds. We use local (secondary) and global (tertiary) fatgraph features to describe domain structures and illustrate that they are useful for classification of domains in CATH. In addition, we combine our method with two other methods thereby using primary, secondary, and tertiary structure information, and show that we can identify a large percentage of new and unclassified structures in CATH. PMID:21629687

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

  8. CORAL: aligning conserved core regions across domain families.

    Science.gov (United States)

    Fong, Jessica H; Marchler-Bauer, Aron

    2009-08-01

    Homologous protein families share highly conserved sequence and structure regions that are frequent targets for comparative analysis of related proteins and families. Many protein families, such as the curated domain families in the Conserved Domain Database (CDD), exhibit similar structural cores. To improve accuracy in aligning such protein families, we propose a profile-profile method CORAL that aligns individual core regions as gap-free units. CORAL computes optimal local alignment of two profiles with heuristics to preserve continuity within core regions. We benchmarked its performance on curated domains in CDD, which have pre-defined core regions, against COMPASS, HHalign and PSI-BLAST, using structure superpositions and comprehensive curator-optimized alignments as standards of truth. CORAL improves alignment accuracy on core regions over general profile methods, returning a balanced score of 0.57 for over 80% of all domain families in CDD, compared with the highest balanced score of 0.45 from other methods. Further, CORAL provides E-values to aid in detecting homologous protein families and, by respecting block boundaries, produces alignments with improved 'readability' that facilitate manual refinement. CORAL will be included in future versions of the NCBI Cn3D/CDTree software, which can be downloaded at http://www.ncbi.nlm.nih.gov/Structure/cdtree/cdtree.shtml. Supplementary data are available at Bioinformatics online.

  9. Insulator function and topological domain border strength scale with architectural protein occupancy

    Science.gov (United States)

    2014-01-01

    Background Chromosome conformation capture studies suggest that eukaryotic genomes are organized into structures called topologically associating domains. The borders of these domains are highly enriched for architectural proteins with characterized roles in insulator function. However, a majority of architectural protein binding sites localize within topological domains, suggesting sites associated with domain borders represent a functionally different subclass of these regulatory elements. How topologically associating domains are established and what differentiates border-associated from non-border architectural protein binding sites remain unanswered questions. Results By mapping the genome-wide target sites for several Drosophila architectural proteins, including previously uncharacterized profiles for TFIIIC and SMC-containing condensin complexes, we uncover an extensive pattern of colocalization in which architectural proteins establish dense clusters at the borders of topological domains. Reporter-based enhancer-blocking insulator activity as well as endogenous domain border strength scale with the occupancy level of architectural protein binding sites, suggesting co-binding by architectural proteins underlies the functional potential of these loci. Analyses in mouse and human stem cells suggest that clustering of architectural proteins is a general feature of genome organization, and conserved architectural protein binding sites may underlie the tissue-invariant nature of topologically associating domains observed in mammals. Conclusions We identify a spectrum of architectural protein occupancy that scales with the topological structure of chromosomes and the regulatory potential of these elements. Whereas high occupancy architectural protein binding sites associate with robust partitioning of topologically associating domains and robust insulator function, low occupancy sites appear reserved for gene-specific regulation within topological domains. PMID

  10. Variational principles for locally variational forms

    International Nuclear Information System (INIS)

    Brajercik, J.; Krupka, D.

    2005-01-01

    We present the theory of higher order local variational principles in fibered manifolds, in which the fundamental global concept is a locally variational dynamical form. Any two Lepage forms, defining a local variational principle for this form, differ on intersection of their domains, by a variationally trivial form. In this sense, but in a different geometric setting, the local variational principles satisfy analogous properties as the variational functionals of the Chern-Simons type. The resulting theory of extremals and symmetries extends the first order theories of the Lagrange-Souriau form, presented by Grigore and Popp, and closed equivalents of the first order Euler-Lagrange forms of Hakova and Krupkova. Conceptually, our approach differs from Prieto, who uses the Poincare-Cartan forms, which do not have higher order global analogues

  11. Domain Engineering

    Science.gov (United States)

    Bjørner, Dines

    Before software can be designed we must know its requirements. Before requirements can be expressed we must understand the domain. So it follows, from our dogma, that we must first establish precise descriptions of domains; then, from such descriptions, “derive” at least domain and interface requirements; and from those and machine requirements design the software, or, more generally, the computing systems.

  12. ProteinSplit: splitting of multi-domain proteins using prediction of ordered and disordered regions in protein sequences for virtual structural genomics

    International Nuclear Information System (INIS)

    Wyrwicz, Lucjan S; Koczyk, Grzegorz; Rychlewski, Leszek; Plewczynski, Dariusz

    2007-01-01

    The annotation of protein folds within newly sequenced genomes is the main target for semi-automated protein structure prediction (virtual structural genomics). A large number of automated methods have been developed recently with very good results in the case of single-domain proteins. Unfortunately, most of these automated methods often fail to properly predict the distant homology between a given multi-domain protein query and structural templates. Therefore a multi-domain protein should be split into domains in order to overcome this limitation. ProteinSplit is designed to identify protein domain boundaries using a novel algorithm that predicts disordered regions in protein sequences. The software utilizes various sequence characteristics to assess the local propensity of a protein to be disordered or ordered in terms of local structure stability. These disordered parts of a protein are likely to create interdomain spacers. Because of its speed and portability, the method was successfully applied to several genome-wide fold annotation experiments. The user can run an automated analysis of sets of proteins or perform semi-automated multiple user projects (saving the results on the server). Additionally the sequences of predicted domains can be sent to the Bioinfo.PL Protein Structure Prediction Meta-Server for further protein three-dimensional structure and function prediction. The program is freely accessible as a web service at http://lucjan.bioinfo.pl/proteinsplit together with detailed benchmark results on the critical assessment of a fully automated structure prediction (CAFASP) set of sequences. The source code of the local version of protein domain boundary prediction is available upon request from the authors

  13. Phosphorylation of both nucleoplasmin domains is required for activation of its chromatin decondensation activity

    DEFF Research Database (Denmark)

    Bañuelos, Sonia; Omaetxebarria, Miren J; Ramos, Isbaal

    2007-01-01

    Nucleoplasmin (NP) is a histone chaperone involved in nucleosome assembly, chromatin decondensation at fertilization, and apoptosis. To carry out these activities NP has to interact with different types of histones, an interaction that is regulated by phosphorylation. Here we have identified...... are found at the tail domain, flanking the nuclear localization signal. Phosphorylation-mimicking mutations render a recombinant protein as active in chromatin decondensation as hyperphosphorylated NP isolated from Xenopus laevis eggs. Comparison of mutants in which the core and tail domains of the protein...... were independently or simultaneously "activated" indicates that activation or phosphorylation of both protein domains is required for NP to efficiently extract linker-type histones from chromatin....

  14. Magnetic stripes and holes: Complex domain patterns in perforated films with weak perpendicular anisotropy

    Directory of Open Access Journals (Sweden)

    F. Valdés-Bango

    2017-05-01

    Full Text Available Hexagonal antidot arrays have been patterned on weak perpendicular magnetic anisotropy NdCo films by e-beam lithography and lift off. Domain structure has been characterized by Magnetic Force Microscopy at remanence. On a local length scale, of the order of stripe pattern period, domain configuration is controlled by edge effects within the stripe pattern: stripe domains meet the hole boundary at either perpendicular or parallel orientation. On a longer length scale, in-plane magnetostatic effects dominate the system: clear superdomains are observed in the patterned film with average in-plane magnetization along the easy directions of the antidot array, correlated over several antidot array cells.

  15. Magnetic stripes and holes: Complex domain patterns in perforated films with weak perpendicular anisotropy

    Science.gov (United States)

    Valdés-Bango, F.; Vélez, M.; Alvarez-Prado, L. M.; Alameda, J. M.; Martín, J. I.

    2017-05-01

    Hexagonal antidot arrays have been patterned on weak perpendicular magnetic anisotropy NdCo films by e-beam lithography and lift off. Domain structure has been characterized by Magnetic Force Microscopy at remanence. On a local length scale, of the order of stripe pattern period, domain configuration is controlled by edge effects within the stripe pattern: stripe domains meet the hole boundary at either perpendicular or parallel orientation. On a longer length scale, in-plane magnetostatic effects dominate the system: clear superdomains are observed in the patterned film with average in-plane magnetization along the easy directions of the antidot array, correlated over several antidot array cells.

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

  17. General spectral flow formula for fixed maximal domain

    DEFF Research Database (Denmark)

    Booss-Bavnbek, Bernhelm; Zhu, Chaofeng

    2005-01-01

    of the resulting continuous family of (unbounded) self-adjoint Fredholm operators in terms of the Maslov index of two related curves of Lagrangian spaces. One curve is given by the varying domains, the other by the Cauchy data spaces. We provide rigorous definitions of the underlying concepts of spectral theory......We consider a continuous curve of linear elliptic formally self-adjoint differential operators of first order with smooth coefficients over a compact Riemannian manifold with boundary together with a continuous curve of global elliptic boundary value problems. We express the spectral flow...... and symplectic analysis and give a full (and surprisingly short) proof of our General Spectral Flow Formula for the case of fixed maximal domain. As a side result, we establish local stability of weak inner unique continuation property (UCP) and explain its role for parameter dependent spectral theory....

  18. Experimental detection of domain wall propagation above the Walker field

    International Nuclear Information System (INIS)

    Kondou, Kouta; Chiba, Daichi; Kobayashi, Kensuke; Ono, Teruo; Ohshima, Norikazu; Kasai, Shinya

    2012-01-01

    The domain wall (DW) velocity above the Walker field drops abruptly with increasing magnetic field, because of the so-called Walker breakdown, where the DW moves with a precessional mode. On applying the higher field, the DW velocity again starts to increase gradually. We report the DW propagation around this local minimum regime in detail, investigated through the time-resolved electrical detection technique, with a magnetic tunnel junction. Just above the Walker field, we succeeded in detecting the precessional motion of the DW in a real-time regime, while a different mode appeared around the local minimum of the DW velocity. (paper)

  19. Membrane association of the Arabidopsis ARF exchange factor GNOM involves interaction of conserved domains

    DEFF Research Database (Denmark)

    Anders, Nadine; Nielsen, Michael M.; Keicher, Jutta

    2008-01-01

    vesicle formation by activating ARF GTPases on specific membranes in animals, plants, and fungi. However, apart from the catalytic exchange activity of the SEC7 domain, the functional significance of other conserved domains is virtually unknown. Here, we show that a distinct N-terminal domain of GNOM......The GNOM protein plays a fundamental role in Arabidopsis thaliana development by regulating endosome-to-plasma membrane trafficking required for polar localization of the auxin efflux carrier PIN1. GNOM is a family member of large ARF guanine nucleotide exchange factors (ARF-GEFs), which regulate...... mediates dimerization and in addition interacts heterotypically with two other conserved domains in vivo. In contrast with N-terminal dimerization, the heterotypic interaction is essential for GNOM function, as mutations abolishing this interaction inactivate the GNOM protein and compromise its membrane...

  20. Solving Semantic Searches for Source Code

    Science.gov (United States)

    2012-11-01

    but of input and expected output pairs. In this domain, those inputs take the form of strings and outputs could be one of sev- eral datatypes ...for some relaxation of CPi that yields C ′ Pi . Encoding weakening is performed by systematically making the constraints on a particular datatype ...the datatypes that can hold concrete or symbolic values: integers, characters, booleans, and strings. The Java implementation uses all the data types