Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask
Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti
2012-01-01
Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.
Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Free Boolean Topological Groups
Directory of Open Access Journals (Sweden)
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
Solomon, Alan D
2012-01-01
REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean
International Nuclear Information System (INIS)
Korshunov, A D
2003-01-01
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years
Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne
1988-01-01
The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.
Interpolative Boolean Networks
Directory of Open Access Journals (Sweden)
Vladimir Dobrić
2017-01-01
Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.
Properties of Boolean orthoposets
Tkadlec, Josef
1993-10-01
A Boolean orthoposet is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0, then a ⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets. Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough and, on the other hand, enjoys some properties of Boolean algebras. In this paper we summarize results on Boolean orthoposets involving distributivity, set representation, properties of the state space, existence of Jauch-Piron states, and results concerning orthocompleteness and completion.
Hildreth, Charles R.
1983-01-01
This editorial addresses the issue of whether or not to provide free-text, keyword/boolean search capabilities in the information retrieval mechanisms of online public access catalogs and discusses online catalogs developed prior to 1980--keyword searching, phrase searching, and precoordination and postcoordination. (EJS)
Optimal stabilization of Boolean networks through collective influence
Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming
2018-03-01
Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.
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
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.
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
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.
Nonlinear threshold Boolean automata networks and phase transitions
Demongeot, Jacques; Sené, Sylvain
2010-01-01
In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...
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.
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
Geometric Operators on Boolean Functions
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
Computing preimages of Boolean networks.
Klotz, Johannes; Bossert, Martin; Schober, Steffen
2013-01-01
In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.
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)
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.
Boolean-Valued Belief Functions
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2002-01-01
Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002
Optical programmable Boolean logic unit.
Chattopadhyay, Tanay
2011-11-10
Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.
Boolean gates on actin filaments
International Nuclear Information System (INIS)
Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew
2016-01-01
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Boolean gates on actin filaments
Energy Technology Data Exchange (ETDEWEB)
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Reliable dynamics in Boolean and continuous networks
International Nuclear Information System (INIS)
Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P
2012-01-01
We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)
Quantum algorithms for testing Boolean functions
Directory of Open Access Journals (Sweden)
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
GLOBAL CONVERGENCE FOR THE XOR BOOLEAN NETWORKS
Ho, Juei-Ling
2009-01-01
Shih and Ho have proved a global convergent theorem for boolean network: if a map from $\\{0,1\\}^{n}$ to itself defines a boolean network has the conditions: (1) each column of the discrete Jacobian matrix of each element of $\\{0,1\\}^{n}$ is either a unit vector or a zero vector; (2) all the boolean eigenvalues of the discrete Jacobian matrix of this map evaluated at each element of $\\{0,1\\}^{n}$ are zero, then it has a unique fixed point and this boolean network is global convergent to the fi...
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.
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)
Boolean Operations with Prism Algebraic Patches
Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi
2009-01-01
In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262
Boolean integral calculus for digital systems
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1985-01-01
The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.
On Boolean functions with generalized cryptographic properties
Braeken, A.; Nikov, V.S.; Nikova, S.I.; Preneel, B.; Canteaut, A.; Viswanathan, K.
2004-01-01
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric.
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/.
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.
Stability of Boolean multilevel networks.
Cozzo, Emanuele; Arenas, Alex; Moreno, Yamir
2012-09-01
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.
The characterization of weighted local hardy spaces on domains and its application.
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.
A localized interaction surface for voltage-sensing domains on the pore domain of a K+ channel.
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.
Totally optimal decision trees for Boolean functions
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2016-01-01
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters
Random networks of Boolean cellular automata
Energy Technology Data Exchange (ETDEWEB)
Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).
Random networks of Boolean cellular automata
International Nuclear Information System (INIS)
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms
DPP6 domains responsible for its localization and function.
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.
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.
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.
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.
Complex network analysis of state spaces for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Shreim, Amer [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Berdahl, Andrew [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Sood, Vishal [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Grassberger, Peter [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada); Paczuski, Maya [Complexity Science Group, Department of Physics and Astronomy, University of Calgary, Calgary, AB, T2N 1N4 (Canada)
2008-01-15
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 {<=} K {<=} 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2{sup N}, for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two.
Complex network analysis of state spaces for random Boolean networks
International Nuclear Information System (INIS)
Shreim, Amer; Berdahl, Andrew; Sood, Vishal; Grassberger, Peter; Paczuski, Maya
2008-01-01
We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains N Boolean elements each with K inputs. A directed state space network (SSN) is constructed by linking each dynamical state, represented as a node, to its temporal successor. We study the heterogeneity of these SSNs at both local and global scales, as well as sample to-sample fluctuations within an ensemble of SSNs. We use in-degrees of nodes as a local topological measure, and the path diversity (Shreim A et al 2007 Phys. Rev. Lett. 98 198701) of an SSN as a global topological measure. RBNs with 2 ≤ K ≤ 5 exhibit non-trivial fluctuations at both local and global scales, while K = 2 exhibits the largest sample-to-sample (possibly non-self-averaging) fluctuations. We interpret the observed 'multi scale' fluctuations in the SSNs as indicative of the criticality and complexity of K = 2 RBNs. 'Garden of Eden' (GoE) states are nodes on an SSN that have in-degree zero. While in-degrees of non-GoE nodes for K > 1 SSNs can assume any integer value between 0 and 2 N , for K = 1 all the non-GoE nodes in a given SSN have the same in-degree which is always a power of two
Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications
Pan, Chenyun; Naeemi, Azad
2017-01-01
The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to interconnect-centric analyses and non-Boolean logic applications. In contrast to Boolean circuits, non-Bo...
A complexity theory based on Boolean algebra
DEFF Research Database (Denmark)
Skyum, Sven; Valiant, Leslie
1985-01-01
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...
Evolutionary Algorithms for Boolean Queries Optimization
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.
2006-01-01
Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics
Boolean Queries Optimization by Genetic Algorithms
Czech Academy of Sciences Publication Activity Database
Húsek, Dušan; Owais, S.S.J.; Krömer, P.; Snášel, Václav
2005-01-01
Roč. 15, - (2005), s. 395-409 ISSN 1210-0552 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * genetic programming * information retrieval * Boolean query Subject RIV: BB - Applied Statistics, Operational Research
Practical algorithms for linear boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
Practical algorithms for linear Boolean-width
ten Brinke, C.B.; van Houten, F.J.P.; Bodlaender, H.L.
2015-01-01
In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms. The experimental evaluation shows that significant improvements can be made with respect to running time without increasing the width of the
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
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%
Abnormal global and local event detection in compressive sensing domain
Wang, Tian; Qiao, Meina; Chen, Jie; Wang, Chuanyun; Zhang, Wenjia; Snoussi, Hichem
2018-05-01
Abnormal event detection, also known as anomaly detection, is one challenging task in security video surveillance. It is important to develop effective and robust movement representation models for global and local abnormal event detection to fight against factors such as occlusion and illumination change. In this paper, a new algorithm is proposed. It can locate the abnormal events on one frame, and detect the global abnormal frame. The proposed algorithm employs a sparse measurement matrix designed to represent the movement feature based on optical flow efficiently. Then, the abnormal detection mission is constructed as a one-class classification task via merely learning from the training normal samples. Experiments demonstrate that our algorithm performs well on the benchmark abnormal detection datasets against state-of-the-art methods.
Abnormal global and local event detection in compressive sensing domain
Directory of Open Access Journals (Sweden)
Tian Wang
2018-05-01
Full Text Available Abnormal event detection, also known as anomaly detection, is one challenging task in security video surveillance. It is important to develop effective and robust movement representation models for global and local abnormal event detection to fight against factors such as occlusion and illumination change. In this paper, a new algorithm is proposed. It can locate the abnormal events on one frame, and detect the global abnormal frame. The proposed algorithm employs a sparse measurement matrix designed to represent the movement feature based on optical flow efficiently. Then, the abnormal detection mission is constructed as a one-class classification task via merely learning from the training normal samples. Experiments demonstrate that our algorithm performs well on the benchmark abnormal detection datasets against state-of-the-art methods.
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...
Classical Boolean logic gates with quantum systems
International Nuclear Information System (INIS)
Renaud, N; Joachim, C
2011-01-01
An analytical method is proposed to implement any classical Boolean function in a small quantum system by taking the advantage of its electronic transport properties. The logical input, α = {α 1 , ..., α N }, is used to control well-identified parameters of the Hamiltonian of the system noted H 0 (α). The logical output is encoded in the tunneling current intensity passing through the quantum system when connected to conducting electrodes. It is demonstrated how to implement the six symmetric two-input/one-output Boolean functions in a quantum system. This system can be switched from one logic function to another by changing its structural parameters. The stability of the logic gates is discussed, perturbing the Hamiltonian with noise sources and studying the effect of decoherence.
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Membrane Localization is Critical for Activation of the PICK1 BAR Domain
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
Molecular basis of the specific subcellular localization of the C2-like domain of 5-lipoxygenase.
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.
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.
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.
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.
Documentation and localization of force-mediated filamin A domain perturbations in moving cells
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.
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.
Local coexpression domains of two to four genes in the genome of Arabidopsis
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
Strain localization at the margins of strong lithospheric domains: insights from analogue models
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
Vector Boolean Functions: applications in symmetric cryptography
Álvarez Cubero, José Antonio
2015-01-01
Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa...
Boolean Factor Analysis by Attractor Neural Network
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2007-01-01
Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007
The Boolean algebra and central Galois algebras
Directory of Open Access Journals (Sweden)
George Szeto
2001-01-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
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.
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Boolean orthoposets and two-valued states on them
Tkadlec, Josef
1992-06-01
A Boolean orthoposet (see e.g. [2]) is the orthoposet P fulfilling the following condition: If a, b ∈ P and a ∧ b = 0 then a⊥ b. This condition seems to be a sound generalization of distributivity in orthoposets (see e.g. [8]). Also, the class of (orthomodular) Boolean orthoposets may play an interesting role in quantum logic theory. This class is wide enough (see [4,3]) and on the other hand, enjoys some properties of Boolean algebras [4,8,5]. In quantum logic theory an important role is played by so-called Jauch-Piron states [1,6,7]. In this paper we clarify the connection between Boolean orthoposets and orthoposets with "enough" two-valued Jauch-Piron states. Further, we obtain a characterization of Boolean orthoposets in terms of two-valued states.
An adaptable Boolean net trainable to control a computing robot
International Nuclear Information System (INIS)
Lauria, F. E.; Prevete, R.; Milo, M.; Visco, S.
1999-01-01
We discuss a method to implement in a Boolean neural network a Hebbian rule so to obtain an adaptable universal control system. We start by presenting both the Boolean neural net and the Hebbian rule we have considered. Then we discuss, first, the problems arising when the latter is naively implemented in a Boolean neural net, second, the method consenting us to overcome them and the ensuing adaptable Boolean neural net paradigm. Next, we present the adaptable Boolean neural net as an intelligent control system, actually controlling a writing robot, and discuss how to train it in the execution of the elementary arithmetic operations on operands represented by numerals with an arbitrary number of digits
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
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.
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...
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)
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
Message passing for quantified Boolean formulas
International Nuclear Information System (INIS)
Zhang, Pan; Ramezanpour, Abolfazl; Zecchina, Riccardo; Zdeborová, Lenka
2012-01-01
We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis–Putnam–Logemann–Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers
Synthesizing biomolecule-based Boolean logic gates.
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2013-02-15
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, and hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications.
Multipath Detection Using Boolean Satisfiability Techniques
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
Synthesizing Biomolecule-based Boolean Logic Gates
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2012-01-01
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588
The Boolean algebra of Galois algebras
Directory of Open Access Journals (Sweden)
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
Optical reversible programmable Boolean logic unit.
Chattopadhyay, Tanay
2012-07-20
Computing with reversibility is the only way to avoid dissipation of energy associated with bit erase. So, a reversible microprocessor is required for future computing. In this paper, a design of a simple all-optical reversible programmable processor is proposed using a polarizing beam splitter, liquid crystal-phase spatial light modulators, a half-wave plate, and plane mirrors. This circuit can perform 16 logical operations according to three programming inputs. Also, inputs can be easily recovered from the outputs. It is named the "reversible programmable Boolean logic unit (RPBLU)." The logic unit is the basic building block of many complex computational operations. Hence the design is important in sense. Two orthogonally polarized lights are defined here as two logical states, respectively.
The identification of FANCD2 DNA binding domains reveals nuclear localization sequences.
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.
A transition calculus for Boolean functions. [logic circuit analysis
Tucker, J. H.; Bennett, A. W.
1974-01-01
A transition calculus is presented for analyzing the effect of input changes on the output of logic circuits. The method is closely related to the Boolean difference, but it is more powerful. Both differentiation and integration are considered.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
The C-terminal domain of TRPV4 is essential for plasma membrane localization.
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.
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.
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.
The effectivenes of science domain-based science learning integrated with local potency
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.
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
Protein Sub-Nuclear Localization Prediction Using SVM and Pfam Domain Information
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
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.
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)
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.
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.
An innovative application of time-domain spectroscopy on localized surface plasmon resonance sensing
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.
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.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...... similarities between the two circuits that are compared. These properties make BEDs suitable for verifying the equivalence of combinational circuits. BEDs can be seen as an intermediate representation between circuits (which are compact) and OBDDs (which are canonical).Based on a large number of combinational...
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.
Membrane Localization is Critical for Activation of the PICK1 BAR Domain
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...
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...
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....
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
On Kolmogorov's superpositions and Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-31
The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.
Optimization-Based Approaches to Control of Probabilistic Boolean Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2017-02-01
Full Text Available Control of gene regulatory networks is one of the fundamental topics in systems biology. In the last decade, control theory of Boolean networks (BNs, which is well known as a model of gene regulatory networks, has been widely studied. In this review paper, our previously proposed methods on optimal control of probabilistic Boolean networks (PBNs are introduced. First, the outline of PBNs is explained. Next, an optimal control method using polynomial optimization is explained. The finite-time optimal control problem is reduced to a polynomial optimization problem. Furthermore, another finite-time optimal control problem, which can be reduced to an integer programming problem, is also explained.
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.
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.
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.
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....
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
Confluence of an extension of combinatory logic by Boolean constants
DEFF Research Database (Denmark)
Czajka, Łukasz
2017-01-01
We show confluence of a conditional term rewriting system CL-pc1, which is an extension of Combinatory Logic by Boolean constants. This solves problem 15 from the RTA list of open problems. The proof has been fully formalized in the Coq proof assistant....
On the Road to Genetic Boolean Matrix Factorization
Czech Academy of Sciences Publication Activity Database
Snášel, V.; Platoš, J.; Krömer, P.; Húsek, Dušan; Frolov, A.
2007-01-01
Roč. 17, č. 6 (2007), s. 675-688 ISSN 1210-0552 Institutional research plan: CEZ:AV0Z10300504 Keywords : data mining * genetic algorithms * Boolean factorization * binary data * machine learning * feature extraction Subject RIV: IN - Informatics, Computer Science Impact factor: 0.280, year: 2007
Document Ranking in E-Extended Boolean Logic
Czech Academy of Sciences Publication Activity Database
Holub, M.; Húsek, Dušan; Pokorný, J.
1996-01-01
Roč. 4, č. 7 (1996), s. 3-17 ISSN 1310-0513. [Annual Colloquium on IR Research /19./. Aberdeen, 08.04.1997-09.04.1997] R&D Projects: GA ČR GA102/94/0728 Keywords : information retrieval * document ranking * extended Boolean logic
Free Boolean algebras over unions of two well orderings
Czech Academy of Sciences Publication Activity Database
Bonnet, R.; Faouzi, L.; Kubiś, Wieslaw
2009-01-01
Roč. 156, č. 7 (2009), s. 1177-1185 ISSN 0166-8641 Institutional research plan: CEZ:AV0Z10190503 Keywords : Well quasi orderings * Poset algebras * Superatomic Boolean algebras * Compact distributive lattices Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2009
Boolean comparative analysis of qualitative data : a methodological note
Romme, A.G.L.
1995-01-01
This paper explores the use of Boolean logic in the analysis of qualitative data, especially on the basis of so-called process theories. Process theories treat independent variables as necessary conditions which are binary rather than variable in nature, while the dependent variable is a final
Parallel object-oriented term rewriting : the booleans
Rodenburg, P.H.; Vrancken, J.L.M.
As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism
A Construction of Boolean Functions with Good Cryptographic Properties
2014-01-01
be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. 1. REPORT...2008, LNCS 5350, Springer–Verlag, 2008, pp. 425–440. [10] C. Carlet and K. Feng, “An Infinite Class of Balanced Vectorial Boolean Functions with Optimum
Time domain localization technique with sparsity constraint for imaging acoustic sources
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.
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
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.
On the number of different dynamics in Boolean networks with deterministic update schedules.
Aracena, J; Demongeot, J; Fanchon, E; Montalva, M
2013-04-01
Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.
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.
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.
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
Boolean Functions with a Simple Certificate for CNF Complexity
Czech Academy of Sciences Publication Activity Database
Čepek, O.; Kučera, P.; Savický, Petr
2012-01-01
Roč. 160, 4-5 (2012), s. 365-382 ISSN 0166-218X R&D Projects: GA MŠk(CZ) 1M0545 Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean functions * CNF representations Subject RIV: BA - General Mathematics Impact factor: 0.718, year: 2012
Elements of Boolean-Valued Dempster-Shafer Theory
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2000-01-01
Roč. 10, č. 5 (2000), s. 825-835 ISSN 1210-0552. [SOFSEM 2000 Workshop on Soft Computing. Milovy, 27.11.2000-28.11.2000] R&D Projects: GA ČR GA201/00/1489 Institutional research plan: AV0Z1030915 Keywords : Boolean algebra * belief function * Dempster-Shafer theory * Dempster combination rule * nonspecifity degree Subject RIV: BA - General Mathematics
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-29
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.
SETS, Boolean Manipulation for Network Analysis and Fault Tree Analysis
International Nuclear Information System (INIS)
Worrell, R.B.
1985-01-01
Description of problem or function - SETS is used for symbolic manipulation of set (or Boolean) equations, particularly the reduction of set equations by the application of set identities. It is a flexible and efficient tool for performing probabilistic risk analysis (PRA), vital area analysis, and common cause analysis. The equation manipulation capabilities of SETS can also be used to analyze non-coherent fault trees and determine prime implicants of Boolean functions, to verify circuit design implementation, to determine minimum cost fire protection requirements for nuclear reactor plants, to obtain solutions to combinatorial optimization problems with Boolean constraints, and to determine the susceptibility of a facility to unauthorized access through nullification of sensors in its protection system. 4. Method of solution - The SETS program is used to read, interpret, and execute the statements of a SETS user program which is an algorithm that specifies the particular manipulations to be performed and the order in which they are to occur. 5. Restrictions on the complexity of the problem - Any properly formed set equation involving the set operations of union, intersection, and complement is acceptable for processing by the SETS program. Restrictions on the size of a set equation that can be processed are not absolute but rather are related to the number of terms in the disjunctive normal form of the equation, the number of literals in the equation, etc. Nevertheless, set equations involving thousands and even hundreds of thousands of terms can be processed successfully
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
3D Boolean operations in virtual surgical planning.
Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun
2017-10-01
Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.
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
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α
On the Computation of Comprehensive Boolean Gröbner Bases
Inoue, Shutaro
We show that a comprehensive Boolean Gröbner basis of an ideal I in a Boolean polynomial ring B (bar A,bar X) with main variables bar X and parameters bar A can be obtained by simply computing a usual Boolean Gröbner basis of I regarding both bar X and bar A as variables with a certain block term order such that bar X ≫ bar A. The result together with a fact that a finite Boolean ring is isomorphic to a direct product of the Galois field mathbb{GF}_2 enables us to compute a comprehensive Boolean Gröbner basis by only computing corresponding Gröbner bases in a polynomial ring over mathbb{GF}_2. Our implementation in a computer algebra system Risa/Asir shows that our method is extremely efficient comparing with existing computation algorithms of comprehensive Boolean Gröbner bases.
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.
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.
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate
International Nuclear Information System (INIS)
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-01-01
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor. (paper)
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-08-28
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
Mikhailov, SE
2006-01-01
Copyright @ 2006 Tech Science Press A quasi-static mixed boundary value problem of elastic damage mechanics for a continuously inhomogeneous body is considered. Using the two-operator Green-Betti formula and the fundamental solution of an auxiliary homogeneous linear elasticity with frozen initial, secant or tangent elastic coe±cients, a boundary-domain integro-differential formulation of the elasto-plastic problem with respect to the displacement rates and their gradients is derived. Usin...
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2014-01-01
Roč. 130, 23 April (2014), s. 83-97 ISSN 0925-2312 R&D Projects: GA ČR GAP202/10/0262 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
A boolean optimization method for reloading a nuclear reactor
International Nuclear Information System (INIS)
Misse Nseke, Theophile.
1982-04-01
We attempt to solve the problem of optimal reloading of fuel assemblies in a PWR, without any assumption on the fuel nature. Any loading is marked by n 2 boolean variables usub(ij). The state of the reactor is characterized by his Ksub(eff) and the related power distribution. The resulting non-linear allocation problems are solved throught mathematical programming technics combining the simplex algorithm and an extension of the Balas-Geoffrion's one. Some optimal solutions are given for PWR with assemblies of different enrichment [fr
DEFF Research Database (Denmark)
von Huth, Sebastian; Moeller, Jesper B; Schlosser, Anders
2018-01-01
Fibrinogen C domain containing 1 (FIBCD1) is a transmembrane receptor that binds chitin and other acetylated compounds with high affinity. FIBCD1 has previously been shown to be present in the epithelium of the gastrointestinal tract. In the present study, we performed a detailed analysis...... high expression of FIBCD1 and also mesodermal-derived cells in the genitourinary system and ectodermal-derived epidermis and sebaceous glands cells expressed FIBCD1. In some columnar epithelial cells, for example, in the salivary gland and gall bladder, the FIBCD1 expression was clearly polarized...
Alternative splicing, gene localization, and binding of SH2-B to the insulin receptor kinase domain
Nelms, Keats; O'Neill, Thomas J.; Li, Shiqing; Hubbard, Stevan R.; Gustafson, Thomas A.; Paul, William E.
1999-01-01
. The SH2-B protein is an SH2-domain-containing molecule that interacts with a number of phosphorylated kinase and receptor molecules including the insulin receptor. Two isoforms of the SH2-B have been identified and have been proposed to arise through alternate splicing. Here we have identified a third isoform of the SH2-B protein, SH2-Bγ, that interacts specifically with the insulin receptor. This interaction required phosphorylation of residue Y1146 in the triple tyrosine motif within the ...
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)
Complexity classifications for different equivalence and audit problems for Boolean circuits
BÃ¶hler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning; Vollmer, Heribert
2010-01-01
We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.
BEAT: A Web-Based Boolean Expression Fault-Based Test Case Generation Tool
Chen, T. Y.; Grant, D. D.; Lau, M. F.; Ng, S. P.; Vasa, V. R.
2006-01-01
BEAT is a Web-based system that generates fault-based test cases from Boolean expressions. It is based on the integration of our several fault-based test case selection strategies. The generated test cases are considered to be fault-based, because they are aiming at the detection of particular faults. For example, when the Boolean expression is in…
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...
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.
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.
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
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.
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.
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.
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.
Detection of Local Temperature Change on HTS Cables via Time-Frequency Domain Reflectometry
Bang, Su Sik; Lee, Geon Seok; Kwon, Gu-Young; Lee, Yeong Ho; Ji, Gyeong Hwan; Sohn, Songho; Park, Kijun; Shin, Yong-June
2017-07-01
High temperature superconducting (HTS) cables are drawing attention as transmission and distribution cables in future grid, and related researches on HTS cables have been conducted actively. As HTS cables have come to the demonstration stage, failures of cooling systems inducing quench phenomenon of the HTS cables have become significant. Several diagnosis of the HTS cables have been developed but there are still some limitations of the experimental setup. In this paper, a non-destructive diagnostic technique for the detection of the local temperature change point is proposed. Also, a simulation model of HTS cables with a local temperature change point is suggested to verify the proposed diagnosis. The performance of the diagnosis is checked by comparative analysis between the proposed simulation results and experiment results of a real-world HTS cable. It is expected that the suggested simulation model and diagnosis will contribute to the commercialization of HTS cables in the power grid.
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.
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.
Local pH domains regulate NHE3-mediated Na+ reabsorption in the renal proximal tubule
Burford, James L.; McDonough, Alicia A.; Holstein-Rathlou, Niels-Henrik; Peti-Peterdi, Janos
2014-01-01
The proximal tubule Na+/H+ exchanger 3 (NHE3), located in the apical dense microvilli (brush border), plays a major role in the reabsorption of NaCl and water in the renal proximal tubule. In response to a rise in blood pressure NHE3 redistributes in the plane of the plasma membrane to the base of the brush border, where NHE3 activity is reduced. This NHE3 redistribution is assumed to provoke pressure natriuresis; however, it is unclear how NHE3 redistribution per se reduces NHE3 activity. To investigate if the distribution of NHE3 in the brush border can change the reabsorption rate, we constructed a spatiotemporal mathematical model of NHE3-mediated Na+ reabsorption across a proximal tubule cell and compared the model results with in vivo experiments in rats. The model predicts that when NHE3 is localized exclusively at the base of the brush border, it creates local pH microdomains that reduce NHE3 activity by >30%. We tested the model's prediction experimentally: the rat kidney cortex was loaded with the pH-sensitive fluorescent dye BCECF, and cells of the proximal tubule were imaged in vivo using confocal fluorescence microscopy before and after an increase of blood pressure by ∼50 mmHg. The experimental results supported the model by demonstrating that a rise of blood pressure induces the development of pH microdomains near the bottom of the brush border. These local changes in pH reduce NHE3 activity, which may explain the pressure natriuresis response to NHE3 redistribution. PMID:25298526
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.
Energy Technology Data Exchange (ETDEWEB)
Hu, Yi, E-mail: yihooyi@gmail.com; Ericsson, Ida, E-mail: ida.ericsson@ntnu.no; Doseth, Berit, E-mail: berit.doseth@ntnu.no; Liabakk, Nina B., E-mail: nina.beate.liabakk@ntnu.no; Krokan, Hans E., E-mail: hans.krokan@ntnu.no; Kavli, Bodil, E-mail: bodil.kavli@ntnu.no
2014-03-10
Activation-induced cytidine deaminase (AID) is the mutator enzyme in adaptive immunity. AID initiates the antibody diversification processes in activated B cells by deaminating cytosine to uracil in immunoglobulin genes. To some extent other genes are also targeted, which may lead to genome instability and B cell malignancy. Thus, it is crucial to understand its targeting and regulation mechanisms. AID is regulated at several levels including subcellular compartmentalization. However, the complex nuclear distribution and trafficking of AID has not been studied in detail previously. In this work, we examined the subnuclear localization of AID and its interaction partner CTNNBL1 and found that they associate with spliceosome-associated structures including Cajal bodies and nuclear speckles. Moreover, protein kinase A (PKA), which activates AID by phosphorylation at Ser38, is present together with AID in nuclear speckles. Importantly, we demonstrate that AID physically associates with the major spliceosome subunits (small nuclear ribonucleoproteins, snRNPs), as well as other essential splicing components, in addition to the transcription machinery. Based on our findings and the literature, we suggest a transcription-coupled splicing-associated model for AID targeting and activation. - Highlights: • AID and its interaction partner CTNNBL1 localize to Cajal bodies and nuclear speckles. • AID associates with its activating kinase PKA in nuclear speckles. • AID is linked to the splicing machinery in switching B-cells. • Our findings suggest a transcription-coupled splicing associated mechanism for AID targeting and activation.
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...
International Nuclear Information System (INIS)
Yang, Bingxin; Yuan, Min; Ma, Yide; Zhang, Jiuwen; Zhan, Kun
2015-01-01
Compressed sensing(CS) has been well applied to speed up imaging by exploring image sparsity over predefined basis functions or learnt dictionary. Firstly, the sparse representation is generally obtained in a single transform domain by using wavelet-like methods, which cannot produce optimal sparsity considering sparsity, data adaptivity and computational complexity. Secondly, most state-of-the-art reconstruction models seldom consider composite regularization upon the various structural features of images and transform coefficients sub-bands. Therefore, these two points lead to high sampling rates for reconstructing high-quality images. In this paper, an efficient composite sparsity structure is proposed. It learns adaptive dictionary from lowpass uniform discrete curvelet transform sub-band coefficients patches. Consistent with the sparsity structure, a novel composite regularization reconstruction model is developed to improve reconstruction results from highly undersampled k-space data. It is established via minimizing spatial image and lowpass sub-band coefficients total variation regularization, transform sub-bands coefficients l 1 sparse regularization and constraining k-space measurements fidelity. A new augmented Lagrangian method is then introduced to optimize the reconstruction model. It updates representation coefficients of lowpass sub-band coefficients over dictionary, transform sub-bands coefficients and k-space measurements upon the ideas of constrained split augmented Lagrangian shrinkage algorithm. Experimental results on in vivo data show that the proposed method obtains high-quality reconstructed images. The reconstructed images exhibit the least aliasing artifacts and reconstruction error among current CS MRI methods. The proposed sparsity structure can fit and provide hierarchical sparsity for magnetic resonance images simultaneously, bridging the gap between predefined sparse representation methods and explicit dictionary. The new augmented
Adapted Boolean network models for extracellular matrix formation
Directory of Open Access Journals (Sweden)
Wollbold Johannes
2009-07-01
Full Text Available Abstract Background Due to the rapid data accumulation on pathogenesis and progression of chronic inflammation, there is an increasing demand for approaches to analyse the underlying regulatory networks. For example, rheumatoid arthritis (RA is a chronic inflammatory disease, characterised by joint destruction and perpetuated by activated synovial fibroblasts (SFB. These abnormally express and/or secrete pro-inflammatory cytokines, collagens causing joint fibrosis, or tissue-degrading enzymes resulting in destruction of the extra-cellular matrix (ECM. We applied three methods to analyse ECM regulation: data discretisation to filter out noise and to reduce complexity, Boolean network construction to implement logic relationships, and formal concept analysis (FCA for the formation of minimal, but complete rule sets from the data. Results First, we extracted literature information to develop an interaction network containing 18 genes representing ECM formation and destruction. Subsequently, we constructed an asynchronous Boolean network with biologically plausible time intervals for mRNA and protein production, secretion, and inactivation. Experimental gene expression data was obtained from SFB stimulated by TGFβ1 or by TNFα and discretised thereafter. The Boolean functions of the initial network were improved iteratively by the comparison of the simulation runs to the experimental data and by exploitation of expert knowledge. This resulted in adapted networks for both cytokine stimulation conditions. The simulations were further analysed by the attribute exploration algorithm of FCA, integrating the observed time series in a fine-tuned and automated manner. The resulting temporal rules yielded new contributions to controversially discussed aspects of fibroblast biology (e.g., considerable expression of TNF and MMP9 by fibroblasts stimulation and corroborated previously known facts (e.g., co-expression of collagens and MMPs after TNF
Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles
Directory of Open Access Journals (Sweden)
Shah Imran
2011-07-01
Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our
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.
Boolean modeling in systems biology: an overview of methodology and applications
International Nuclear Information System (INIS)
Wang, Rui-Sheng; Albert, Réka; Saadatpour, Assieh
2012-01-01
Mathematical modeling of biological processes provides deep insights into complex cellular systems. While quantitative and continuous models such as differential equations have been widely used, their use is obstructed in systems wherein the knowledge of mechanistic details and kinetic parameters is scarce. On the other hand, a wealth of molecular level qualitative data on individual components and interactions can be obtained from the experimental literature and high-throughput technologies, making qualitative approaches such as Boolean network modeling extremely useful. In this paper, we build on our research to provide a methodology overview of Boolean modeling in systems biology, including Boolean dynamic modeling of cellular networks, attractor analysis of Boolean dynamic models, as well as inferring biological regulatory mechanisms from high-throughput data using Boolean models. We finally demonstrate how Boolean models can be applied to perform the structural analysis of cellular networks. This overview aims to acquaint life science researchers with the basic steps of Boolean modeling and its applications in several areas of systems biology. (paper)
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Directory of Open Access Journals (Sweden)
Stalin Muñoz
2018-03-01
Full Text Available Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.
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.
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.
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.
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.
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
Bohórquez-Hernández, A; Gratton, Enrico; Pacheco, Jonathan; Asanov, Alexander; Vaca, Luis
2017-12-01
Store Operated Calcium Entry (SOCE) is one of the most important mechanisms for calcium mobilization in to the cell. Two main proteins sustain SOCE: STIM1 that acts as the calcium sensor in the endoplasmic reticulum (ER) and Orai1 responsible for calcium influx upon depletion of ER. There are many studies indicating that SOCE is modulated by the cholesterol content of the plasma membrane (PM). However, a myriad of questions remain unanswered concerning the precise molecular mechanism by which cholesterol modulates SOCE. In the present study we found that reducing PM cholesterol results in the internalization of Orai1 channels, which can be prevented by overexpressing caveolin 1 (Cav1). Furthermore, Cav1 and Orai1 associate upon SOCE activation as revealed by FRET and coimmunoprecipitation assays. The effects of reducing cholesterol were not limited to an increased rate of Orai1 internalization, but also, affects the lateral movement of Orai1, inducing movement in a linear pattern (unobstructed diffusion) opposite to basal cholesterol conditions were most of Orai1 channels moves in a confined space, as assessed by Fluorescence Correlation Spectroscopy, Cav1 overexpression inhibited these alterations maintaining Orai1 into a confined and partially confined movement. These results not only highlight the complex effect of cholesterol regulation on SOCE, but also indicate a direct regulatory effect on Orai1 localization and compartmentalization by this lipid. Copyright © 2017 Elsevier B.V. All rights reserved.
Localization of the N-terminal domain of cauliflower mosaic virus coat protein precursor
International Nuclear Information System (INIS)
Champagne, Julie; Benhamou, Nicole; Leclerc, Denis
2004-01-01
Cauliflower mosaic virus (CaMV) open reading frame (ORF) IV encodes a coat protein precursor (pre-CP) harboring an N-terminal extension that is cleaved off by the CaMV-encoded protease. In transfected cells, pre-CP is present in the cytoplasm, while the processed form (p44) of CP is targeted to the nucleus, suggesting that the N-terminal extension might be involved in keeping the pre-CP in the cytoplasm for viral assembly. This study reports for the first time the intracellular localization of the N-terminal extension during CaMV infection in Brassica rapa. Immunogold-labeling electron microscopy using polyclonal antibodies directed to the N-terminal extension of the pre-CP revealed that this region is closely associated with viral particles present in small aggregates, which we called small bodies, adjacent to the main inclusion bodies typical of CaMV infection. Based on these results, we propose a model for viral assembly of CaMV
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
Minimum energy control and optimal-satisfactory control of Boolean control network
International Nuclear Information System (INIS)
Li, Fangfei; Lu, Xiwen
2013-01-01
In the literatures, to transfer the Boolean control network from the initial state to the desired state, the expenditure of energy has been rarely considered. Motivated by this, this Letter investigates the minimum energy control and optimal-satisfactory control of Boolean control network. Based on the semi-tensor product of matrices and Floyd's algorithm, minimum energy, constrained minimum energy and optimal-satisfactory control design for Boolean control network are given respectively. A numerical example is presented to illustrate the efficiency of the obtained results.
Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes
Institute of Scientific and Technical Information of China (English)
Hao CHEN; Liang MA; Jianhua LI
2011-01-01
Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1- 4, 7, 8, 10, 11, 16]). Kurosawa, Stoh [8] and Carlet [1]gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh's construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology.
Mori, Fumito; Mochizuki, Atsushi
2017-07-14
Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.
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.
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....
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.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization
Boolean and advanced searching for EDGAR data on www.sec.gov
Securities and Exchange Commission — This search allows users to enter complex boolean queries to access all but the most recent day's EDGAR filings on www.sec.gov. Filings are from 1994 to present.
Circulant Matrices and Affine Equivalence of Monomial Rotation Symmetric Boolean Functions
2015-01-01
degree of the MRS is, we have a similar result as [40, Theorem 1.1] for n = 4p (p prime), or squarefree integers n, which along with our Theorem 5.2...Boolean functions: Construction and analysis in terms of algebraic immunity, in: H. Gilbert, H. Handschuh (Eds.), Fast Software Encryption, in: LNCS...vol. 1403, Springer-Verlag, 1998, pp. 475–488. [20] J.E. Fuller, Analysis of affine equivalent Boolean functions for cryptography (Ph.D. thesis
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
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.
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.
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...
Graphene-based non-Boolean logic circuits
Liu, Guanxiong; Ahsan, Sonia; Khitun, Alexander G.; Lake, Roger K.; Balandin, Alexander A.
2013-10-01
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance experimentally observed in graphene field-effect transistors of "conventional" design allows for construction of viable non-Boolean computational architectures with the gapless graphene. The negative differential resistance—observed under certain biasing schemes—is an intrinsic property of graphene, resulting from its symmetric band structure. Our atomistic modeling shows that the negative differential resistance appears not only in the drift-diffusion regime but also in the ballistic regime at the nanometer-scale—although the physics changes. The obtained results present a conceptual change in graphene research and indicate an alternative route for graphene's applications in information processing.
Boolean network model of the Pseudomonas aeruginosa quorum sensing circuits.
Dallidis, Stylianos E; Karafyllidis, Ioannis G
2014-09-01
To coordinate their behavior and virulence and to synchronize attacks against their hosts, bacteria communicate by continuously producing signaling molecules (called autoinducers) and continuously monitoring the concentration of these molecules. This communication is controlled by biological circuits called quorum sensing (QS) circuits. Recently QS circuits and have been recognized as an alternative target for controlling bacterial virulence and infections without the use of antibiotics. Pseudomonas aeruginosa is a Gram-negative bacterium that infects insects, plants, animals and humans and can cause acute infections. This bacterium has three interconnected QS circuits that form a very complex and versatile QS system, the operation of which is still under investigation. Here we use Boolean networks to model the complete QS system of Pseudomonas aeruginosa and we simulate and analyze its operation in both synchronous and asynchronous modes. The state space of the QS system is constructed and it turned out to be very large, hierarchical, modular and scale-free. Furthermore, we developed a simulation tool that can simulate gene knock-outs and study their effect on the regulons controlled by the three QS circuits. The model and tools we developed will give to life scientists a deeper insight to this complex QS system.
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.
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...
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.
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.
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.
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
Goossens, Bart; Aelterman, Jan; Luong, Hiep; Pizurica, Aleksandra; Philips, Wilfried
2013-02-01
In digital cameras and mobile phones, there is an ongoing trend to increase the image resolution, decrease the sensor size and to use lower exposure times. Because smaller sensors inherently lead to more noise and a worse spatial resolution, digital post-processing techniques are required to resolve many of the artifacts. Color filter arrays (CFAs), which use alternating patterns of color filters, are very popular because of price and power consumption reasons. However, color filter arrays require the use of a post-processing technique such as demosaicing to recover full resolution RGB images. Recently, there has been some interest in techniques that jointly perform the demosaicing and denoising. This has the advantage that the demosaicing and denoising can be performed optimally (e.g. in the MSE sense) for the considered noise model, while avoiding artifacts introduced when using demosaicing and denoising sequentially. In this paper, we will continue the research line of the wavelet-based demosaicing techniques. These approaches are computationally simple and very suited for combination with denoising. Therefore, we will derive Bayesian Minimum Squared Error (MMSE) joint demosaicing and denoising rules in the complex wavelet packet domain, taking local adaptivity into account. As an image model, we will use Gaussian Scale Mixtures, thereby taking advantage of the directionality of the complex wavelets. Our results show that this technique is well capable of reconstructing fine details in the image, while removing all of the noise, at a relatively low computational cost. In particular, the complete reconstruction (including color correction, white balancing etc) of a 12 megapixel RAW image takes 3.5 sec on a recent mid-range GPU.
Directory of Open Access Journals (Sweden)
Tomoki Yagai
Full Text Available Cholangiocarcinoma (CC is a type of relatively rare neoplasm in adenocarcinoma. The characteristics of CCs as well as biliary epithelial cells are heterogeneous at the different portion of the biliary tree. There are two candidate stem/progenitor cells of the biliary tree, i.e., biliary tree stem/progenitor cell (BTSC at the peribiliary gland (PBG of large bile ducts and liver stem/progenitor cell (LPC at the canals of Hering of peripheral small bile duct. Although previous reports suggest that intrahepatic CC (ICC can arise from such stem/progenitor cells, the characteristic difference between BTSC and LPC in pathological process needs further investigation, and the etiology of CC remains poorly understood. Here we show that Sterile alpha motif domain containing 5 (SAMD5 is exclusively expressed in PBGs of large bile ducts in normal mice. Using a mouse model of cholestatic liver disease, we demonstrated that SAMD5 expression was upregulated in the large bile duct at the hepatic hilum, the extrahepatic bile duct and PBGs, but not in proliferating intrahepatic ductules, suggesting that SAMD5 is expressed in BTSC but not LPC. Intriguingly, human ICCs and extrahepatic CCs exhibited striking nuclear localization of SAMD5 while the normal hilar large bile duct displayed slight-to-moderate expression in cytoplasm. In vitro experiments using siRNA for SAMD5 revealed that SAMD5 expression was associated with the cell cycle regulation of CC cell lines.SAMD5 is a novel marker for PBG but not LPC in mice. In humans, the expression and location of SAMD5 could become a promising diagnostic marker for the cell type as well as malignancy of bile ducts and CCs.
Autonomous Modeling, Statistical Complexity and Semi-annealed Treatment of Boolean Networks
Gong, Xinwei
This dissertation presents three studies on Boolean networks. Boolean networks are a class of mathematical systems consisting of interacting elements with binary state variables. Each element is a node with a Boolean logic gate, and the presence of interactions between any two nodes is represented by directed links. Boolean networks that implement the logic structures of real systems are studied as coarse-grained models of the real systems. Large random Boolean networks are studied with mean field approximations and used to provide a baseline of possible behaviors of large real systems. This dissertation presents one study of the former type, concerning the stable oscillation of a yeast cell-cycle oscillator, and two studies of the latter type, respectively concerning the statistical complexity of large random Boolean networks and an extension of traditional mean field techniques that accounts for the presence of short loops. In the cell-cycle oscillator study, a novel autonomous update scheme is introduced to study the stability of oscillations in small networks. A motif that corrects pulse-growing perturbations and a motif that grows pulses are identified. A combination of the two motifs is capable of sustaining stable oscillations. Examining a Boolean model of the yeast cell-cycle oscillator using an autonomous update scheme yields evidence that it is endowed with such a combination. Random Boolean networks are classified as ordered, critical or disordered based on their response to small perturbations. In the second study, random Boolean networks are taken as prototypical cases for the evaluation of two measures of complexity based on a criterion for optimal statistical prediction. One measure, defined for homogeneous systems, does not distinguish between the static spatial inhomogeneity in the ordered phase and the dynamical inhomogeneity in the disordered phase. A modification in which complexities of individual nodes are calculated yields vanishing
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.
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.
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.
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.
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)
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)
Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S
2013-06-01
A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
International Nuclear Information System (INIS)
Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong
2015-01-01
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations
On the Boolean extension of the Birnbaum importance to non-coherent systems
International Nuclear Information System (INIS)
Aliee, Hananeh; Borgonovo, Emanuele; Glaß, Michael; Teich, Jürgen
2017-01-01
The Birnbaum importance measure plays a central role in reliability analysis. It has initially been introduced for coherent systems, where several of its properties hold and where its computation is straightforward. This work introduces a Boolean expression for the notion of criticality that allows the seamless extension of the Birnbaum importance to non-coherent systems. As a key feature, the novel definition makes the computation and encoding straightforward with well-established techniques such as Binary Decision Diagrams (BDDs) or Fault Trees (FTs). Several examples and a case study illustrate the findings. - Highlights: • We propose a Boolean expression for the notion of criticality in coherent and non-coherent systems. • The notion is connected with the Birnbaum importance measure. • The connection with Andrew's and Beeson extension is discussed. • The Boolean expression allows straightforward encoding in Binary Decision Diagrams.
Mechanical system reliability analysis using a combination of graph theory and Boolean function
International Nuclear Information System (INIS)
Tang, J.
2001-01-01
A new method based on graph theory and Boolean function for assessing reliability of mechanical systems is proposed. The procedure for this approach consists of two parts. By using the graph theory, the formula for the reliability of a mechanical system that considers the interrelations of subsystems or components is generated. Use of the Boolean function to examine the failure interactions of two particular elements of the system, followed with demonstrations of how to incorporate such failure dependencies into the analysis of larger systems, a constructive algorithm for quantifying the genuine interconnections between the subsystems or components is provided. The combination of graph theory and Boolean function provides an effective way to evaluate the reliability of a large, complex mechanical system. A numerical example demonstrates that this method an effective approaches in system reliability analysis
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
Improving the quantum cost of reversible Boolean functions using reorder algorithm
Ahmed, Taghreed; Younes, Ahmed; Elsayed, Ashraf
2018-05-01
This paper introduces a novel algorithm to synthesize a low-cost reversible circuits for any Boolean function with n inputs represented as a Positive Polarity Reed-Muller expansion. The proposed algorithm applies a predefined rules to reorder the terms in the function to minimize the multi-calculation of common parts of the Boolean function to decrease the quantum cost of the reversible circuit. The paper achieves a decrease in the quantum cost and/or the circuit length, on average, when compared with relevant work in the literature.
Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V
2017-04-01
We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
International Nuclear Information System (INIS)
Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.
2016-01-01
Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.
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
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
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.
International Nuclear Information System (INIS)
Hanada, R.; Sugawara, H.; Aoki, Y.; Sato, H.; Shigeto, K.; Shinjo, T.; Ono, T.; Miyajima, H.
2002-01-01
We have simultaneously measured the field dependences of voltages at multiple pairs of resistance and transverse voltage probes in ferromagnetic wires (with either magnetic or non-magnetic voltage probes). Both the resistive (through the giant magnetoresistance and anisotropic magnetoresistance) and transverse voltages (through the planar Hall effect) exhibit abrupt jumps, reflecting discrete motion of domain walls or rotations of magnetization. Voltage probes, even if non-magnetic, are found to affect the jump fields depending on the sample conditions. We demonstrate that the specific information on the domain (wall) motion along a thin ferromagnetic wire could be obtained from the jump fields. (author)
The Concept of the "Imploded Boolean Search": A Case Study with Undergraduate Chemistry Students
Tomaszewski, Robert
2016-01-01
Critical thinking and analytical problem-solving skills in research involves using different search strategies. A proposed concept for an "Imploded Boolean Search" combines three unique identifiable field types to perform a search: keyword(s), numerical value(s), and a chemical structure or reaction. The object of this type of search is…
Application of fuzzy logic to Boolean models for digital soil assessment
Gruijter, de J.J.; Walvoort, D.J.J.; Bragato, G.
2011-01-01
Boolean models based on expert knowledge are often used to classify soils into a limited number of classes of a difficult-to-measure soil attribute. Although the primary data used for these classifications contain information on whether the soil is a typical class member or a boundary case between
Boolean logic and character state identity: pitfalls of character coding in metazoan cladistics
Jenner, Ronald A.
2002-01-01
A critical study of the morphological data sets used for the most recent analyses of metazoan cladistics exposes a rather cavalier attitude towards character coding. Binary absence/presence coding is ubiquitous, but without any explicit justification. This uncompromising application of Boolean logic
A new separation algorithm for the Boolean quadric and cut polytopes
DEFF Research Database (Denmark)
Sørensen, Michael Malmros; Letchford, Adam N.
2014-01-01
A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero–one quadratic programming and the max-cut problem, respectively. We...
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Describing the What and Why of Students' Difficulties in Boolean Logic
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Boolean algebras * Maharam submeasure * weak distributivity * independent reals Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
Using Vector and Extended Boolean Matching in an Expert System for Selecting Foster Homes.
Fox, Edward A.; Winett, Sheila G.
1990-01-01
Describes FOCES (Foster Care Expert System), a prototype expert system for choosing foster care placements for children which integrates information retrieval techniques with artificial intelligence. The use of prototypes and queries in Prolog routines, extended Boolean matching, and vector correlation are explained, as well as evaluation by…
Characterization of Boolean Algebras in Terms of Certain States of Jauch-Piron Type
Matoušek, Milan; Pták, Pavel
2015-12-01
Suppose that L is an orthomodular lattice (a quantum logic). We show that L is Boolean exactly if L possesses a strongly unital set of weakly Jauch-Piron states, or if L possesses a unital set of weakly positive states. We also discuss some general properties of Jauch-Piron-like states.
Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes
International Nuclear Information System (INIS)
Liu, M; Bassler, K E
2011-01-01
Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2001-01-01
Roč. 5, č. 1 (2001), s. 45-57 ISSN 1432-7643 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : first-order predicate calculus * standard semantics * Boolean-like semantics * frequentistic semantics * completness theorems Subject RIV: BA - General Mathematics
User Practices in Keyword and Boolean Searching on an Online Public Access Catalog.
Ensor, Pat
1992-01-01
Discussion of keyword and Boolean searching techniques in online public access catalogs (OPACs) focuses on a study conducted at Indiana State University that examined users' attitudes toward searching on NOTIS (Northwestern Online Total Integrated System). Relevant literature is reviewed, and implications for library instruction are suggested. (17…
An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
Ostrowski, M; Paulevé, L; Schaub, T; Siegel, A; Guziolowski, C
2016-11-01
Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most efficient and scalable training methods focus on the comparison of two time-points and assume that the system has reached an early steady state. In this paper, we generalize such a learning procedure to take into account the time series traces of phosphoproteomics data in order to discriminate Boolean networks according to their transient dynamics. To that end, we identify a necessary condition that must be satisfied by the dynamics of a Boolean network to be consistent with a discretized time series trace. Based on this condition, we use Answer Set Programming to compute an over-approximation of the set of Boolean networks which fit best with experimental data and provide the corresponding encodings. Combined with model-checking approaches, we end up with a global learning algorithm. Our approach is able to learn logic models with a true positive rate higher than 78% in two case studies of mammalian signaling networks; for a larger case study, our method provides optimal answers after 7min of computation. We quantified the gain in our method predictions precision compared to learning approaches based on static data. Finally, as an application, our method proposes erroneous time-points in the time series data with respect to the optimal learned logic models. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Exact sampling from conditional Boolean models with applications to maximum likelihood inference
Lieshout, van M.N.M.; Zwet, van E.W.
2001-01-01
We are interested in estimating the intensity parameter of a Boolean model of discs (the bombing model) from a single realization. To do so, we derive the conditional distribution of the points (germs) of the underlying Poisson process. We demonstrate how to apply coupling from the past to generate
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.
Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard
2014-06-26
A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
Xie, Zhengwei; Qiu, Daowen; Cai, Guangya
2018-06-01
Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.
International Nuclear Information System (INIS)
Matsui, Hiroaki; Lefkowitz, R.J.; Caron, M.G.; Regan, J.W.
1989-01-01
The human platelet α 2 -adrenergic receptor is an integral membrane protein which binds epinephrine. The gene for this receptor has been cloned, and the primary structure is thus known. A model of its secondary structure predicts that the receptor has seven transmembrane spanning domains. By covalent labeling and peptide mapping, the authors have identified a region of the receptor that is directly involved with ligand binding. Partially purified preparations of the receptor were covalently radiolabeled with either of two specific photoaffinity ligands: [ 3 H]SKF 102229 (an antagonist) or p-azido[ 3 H]clonidine (an agonist). The radiolabeled receptors were then digested with specific endopeptidases, and peptides containing the covalently bound radioligands were identified. Lysylendopeptidase treatment of [ 3 H]SKF 102229 labeled receptor yielded one peptide of M r 2400 as the product of a complete digest. Endopeptidase Arg-C gave a labeled peptide of M r 4000, which was further digested to the M r 2400 peptide by additional treatment with lysylendopeptidase. Using p-azido[ 3 H]clonidine-labeled receptor, a similar M r 2400 peptide was obtained by lysylendopeptidase cleavage. This M r 2400 peptide corresponds to the fourth transmembrane spanning domain of the receptor. These data suggest that this region forms part of the ligand binding domain of the human platelet α 2 -adrenergic receptor
Directory of Open Access Journals (Sweden)
Metzger Kelsey J
2010-05-01
Full Text Available Abstract Background CC chemokine receptor proteins (CCR1 through CCR10 are seven-transmembrane G-protein coupled receptors whose signaling pathways are known for their important roles coordinating immune system responses through targeted trafficking of white blood cells. In addition, some of these receptors have been identified as fusion proteins for viral pathogens: for example, HIV-1 strains utilize CCR5, CCR2 and CCR3 proteins to obtain cellular entry in humans. The extracellular domains of these receptor proteins are involved in ligand-binding specificity as well as pathogen recognition interactions. In mammals, the majority of chemokine receptor genes are clustered together; in humans, seven of the ten genes are clustered in the 3p21-24 chromosome region. Gene conversion events, or exchange of DNA sequence between genes, have been reported in chemokine receptor paralogs in various mammalian lineages, especially between the cytogenetically closely located pairs CCR2/5 and CCR1/3. Datasets of mammalian orthologs for each gene were analyzed separately to minimize the potential confounding impact of analyzing highly similar sequences resulting from gene conversion events. Molecular evolution approaches and the software package Phylogenetic Analyses by Maximum Likelihood (PAML were utilized to investigate the signature of selection that has acted on the mammalian CC chemokine receptor (CCR gene family. The results of neutral vs. adaptive evolution (positive selection hypothesis testing using Site Models are reported. In general, positive selection is defined by a ratio of nonsynonymous/synonymous nucleotide changes (dN/dS, or ω >1. Results Of the ten mammalian CC motif chemokine receptor sequence datasets analyzed, only CCR2 and CCR3 contain amino acid codon sites that exhibit evidence of positive selection using site based hypothesis testing in PAML. Nineteen of the twenty codon sites putatively indentified as likely to be under positive
Tran, Erin E H; Simmons, James A; Bartesaghi, Alberto; Shoemaker, Charles J; Nelson, Elizabeth; White, Judith M; Subramaniam, Sriram
2014-09-01
The Ebola virus glycoprotein mucin-like domain (MLD) is implicated in Ebola virus cell entry and immune evasion. Using cryo-electron tomography of Ebola virus-like particles, we determined a three-dimensional structure for the full-length glycoprotein in a near-native state and compared it to that of a glycoprotein lacking the MLD. Our results, which show that the MLD is located at the apex and the sides of each glycoprotein monomer, provide a structural template for analysis of MLD function. Copyright © 2014, American Society for Microbiology. All Rights Reserved.
Tran, Erin E. H.; Simmons, James A.; Bartesaghi, Alberto; Shoemaker, Charles J.; Nelson, Elizabeth; White, Judith M.; Subramaniam, Sriram
2014-01-01
The Ebola virus glycoprotein mucin-like domain (MLD) is implicated in Ebola virus cell entry and immune evasion. Using cryo-electron tomography of Ebola virus-like particles, we determined a three-dimensional structure for the full-length glycoprotein in a near-native state and compared it to that of a glycoprotein lacking the MLD. Our results, which show that the MLD is located at the apex and the sides of each glycoprotein monomer, provide a structural template for analysis of MLD function.
Li-Smerin, Yingying; Swartz, Kenton J.
2000-01-01
Hanatoxin inhibits voltage-gated K+ channels by modifying the energetics of activation. We studied the molecular determinants and physical location of the Hanatoxin receptors on the drk1 voltage-gated K+ channel. First, we made multiple substitutions at three previously identified positions in the COOH terminus of S3 to examine whether these residues interact intimately with the toxin. We also examined a region encompassing S1–S3 using alanine-scanning mutagenesis to identify additional determinants of the toxin receptors. Finally, guided by the structure of the KcsA K+ channel, we explored whether the toxin interacts with the peripheral extracellular surface of the pore domain in the drk1 K+ channel. Our results argue for an intimate interaction between the toxin and the COOH terminus of S3 and suggest that the Hanatoxin receptors are confined within the voltage-sensing domains of the channel, at least 20–25 Å away from the central pore axis. PMID:10828242
Carr, Dawn C; King, Katherine; Matz-Costa, Christina
2015-04-01
Gaps in existing literature hinder our knowledge of how life stage-related identities (e.g., worker, parent, student, etc.) influence individuals' decisions about whether and how to get involved in community service. Interventions to increase volunteerism throughout the life course require a more nuanced understanding of this relationship. We use multinomial logistic models to analyze how life phase factors relate to involvement in different types of voluntary organizations across the adult life course in the Chicago Community Adult Health Study. Half of the adults did not volunteer. Those who did volunteer were categorized as charitable, youth-oriented, religious, civic, or multidomain volunteers. Age, employment, family structure, demographics, and self-rated health differentially predicted volunteering in specific domains. Findings from this study suggest that recruitment and retention efforts employed by different nonprofit organizations may be more effective if they take into consideration the life phase factors that enhance or detract from likelihood of engagement. © The Author(s) 2015.
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...
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.
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.
Directory of Open Access Journals (Sweden)
Abílio Amiguinho
2005-01-01
Full Text Available The process of socio-educational territorialisation in rural contexts is the topic of this text. The theme corresponds to a challenge to address it having as main axis of discussion either the problem of social exclusion or that of local development. The reasons to locate the discussion in this last field of analysis are discussed in the first part of the text. Theoretical and political reasons are there articulated because the question is about projects whose intentions and practices call for the political both in the theoretical debate and in the choices that anticipate intervention. From research conducted for several years, I use contributions that aim at discuss and enlighten how school can be a potential locus of local development. Its identification and recognition as local institution (either because of those that work and live in it or because of those that act in the surrounding context are crucial steps to progressively constitute school as a partner for development. The promotion of the local values and roots, the reconstruction of socio-personal and local identities, the production of sociabilities and the equation and solution of shared problems were the dimensions of a socio-educative intervention, markedly globalising. This scenario, as it is argued, was also, intentionally, one of transformation and of deliberate change of school and of the administration of the educative territoires.
A short Boolean derivation of mean failure frequency for any (also non-coherent) system
International Nuclear Information System (INIS)
Schneeweiss, Winfrid G.
2009-01-01
For stationary repairable systems it is shown that the probabilistic weights for the individual components' mean failure frequencies (MFFs) that can be added to yield the system's MFF are found easily from the first step of the Boolean fault tree function's Shannon decomposition. This way one finds a general theory of a system's MFF and the case of coherence covered in standard textbooks is shown to be a subcase. Unfortunately, elegant rules for calculating system MFF from any polynomial form of the fault tree's Boolean function are only known for the coherent case, but repeated here, because they are not yet found in many textbooks. An example known from literature is treated extensively with great care.
Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R
2017-01-01
Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.
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.
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.
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek
2015-08-07
The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM
Directory of Open Access Journals (Sweden)
A. A. Butov
2014-01-01
Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2009-01-01
Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009
Directory of Open Access Journals (Sweden)
Jens Christian Claussen
2017-06-01
Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.
Directory of Open Access Journals (Sweden)
Liam G Fearnley
Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.
Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.
Directory of Open Access Journals (Sweden)
Maria Simak
Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.
PARAMETER ESTIMATION IN NON-HOMOGENEOUS BOOLEAN MODELS: AN APPLICATION TO PLANT DEFENSE RESPONSE
Directory of Open Access Journals (Sweden)
Maria Angeles Gallego
2014-11-01
Full Text Available Many medical and biological problems require to extract information from microscopical images. Boolean models have been extensively used to analyze binary images of random clumps in many scientific fields. In this paper, a particular type of Boolean model with an underlying non-stationary point process is considered. The intensity of the underlying point process is formulated as a fixed function of the distance to a region of interest. A method to estimate the parameters of this Boolean model is introduced, and its performance is checked in two different settings. Firstly, a comparative study with other existent methods is done using simulated data. Secondly, the method is applied to analyze the longleaf data set, which is a very popular data set in the context of point processes included in the R package spatstat. Obtained results show that the new method provides as accurate estimates as those obtained with more complex methods developed for the general case. Finally, to illustrate the application of this model and this method, a particular type of phytopathological images are analyzed. These images show callose depositions in leaves of Arabidopsis plants. The analysis of callose depositions, is very popular in the phytopathological literature to quantify activity of plant immunity.
Ryo, Ikehata
Uniform energy and L2 decay of solutions for linear wave equations with localized dissipation will be given. In order to derive the L2-decay property of the solution, a useful device whose idea comes from Ikehata-Matsuyama (Sci. Math. Japon. 55 (2002) 33) is used. In fact, we shall show that the L2-norm and the total energy of solutions, respectively, decay like O(1/ t) and O(1/ t2) as t→+∞ for a kind of the weighted initial data.
Cizmecioglu, Onur; Warnke, Silke; Arnold, Marc; Duensing, Stefan; Hoffmann, Ingrid
2008-11-15
In mammalian cells, the centrosome consists of a pair of centrioles and amorphous pericentriolar material. The centrosome duplicates once per cell cycle. Polo like kinases (Plks) perform crucial functions in cell cycle progression and during mitosis. The polo-like kinase-2, Plk2, is activated near the G(1)/S phase transition, and plays an important role in the reproduction of centrosomes. In this study, we show that the polo-box of Plk2 is required both for association to the centrosome and centriole duplication. Mutation of critical sites in the Plk2 polo-box prevents centrosomal localization and impairs centriole duplication. Plk2 is localized to centrosomes during early G(1) phase where it only associates to the mother centriole and then distributes equally to both mother and daughter centrioles at the onset of S phase. Furthermore, our results imply that Plk2 mediated centriole duplication is dependent on Plk4 function. In addition, we find that siRNA-mediated downregulation of Plk2 leads to the formation of abnormal mitotic spindles confirming that Plk2 may have a function in the reproduction of centrioles.
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...
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
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.
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.
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
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Directory of Open Access Journals (Sweden)
Liang Jinghang
2012-08-01
Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a
Qubits and quantum Hamiltonian computing performances for operating a digital Boolean 1/2-adder
Dridi, Ghassen; Faizy Namarvar, Omid; Joachim, Christian
2018-04-01
Quantum Boolean (1 + 1) digits 1/2-adders are designed with 3 qubits for the quantum computing (Qubits) and 4 quantum states for the quantum Hamiltonian computing (QHC) approaches. Detailed analytical solutions are provided to analyse the time operation of those different 1/2-adder gates. QHC is more robust to noise than Qubits and requires about the same amount of energy for running its 1/2-adder logical operations. QHC is faster in time than Qubits but its logical output measurement takes longer.
2017-09-01
satisfying the strict avalanche criterion,” Discrete Math ., vol. 185, pp. 29–39, 1998. [2] R.C. Bose, “On some connections between the design of... Discrete Appl. Math ., vol. 149, pp. 73–86, 2005. [11] T.W. Cusick and P. Stănică, Cryptographic Boolean Functions and Applications, 2nd ed., San Diego...Stănică, “Bisecting binomial coefficients,” Discrete Appl. Math ., vol. 227, pp. 70–83, 2017. [28] T. Martinsen, W. Meidl, and P. Stănică, “Generalized
Construction of a fuzzy and all Boolean logic gates based on DNA
DEFF Research Database (Denmark)
M. Zadegan, Reza; Jepsen, Mette D E; Hildebrandt, Lasse
2015-01-01
to the operation of the six Boolean logic gates AND, NAND, OR, NOR, XOR, and XNOR. The logic gate complex is shown to work also when implemented in a three-dimensional DNA origami box structure, where it controlled the position of the lid in a closed or open position. Implementation of multiple microRNA sensitive...... DNA locks on one DNA origami box structure enabled fuzzy logical operation that allows biosensing of complex molecular signals. Integrating logic gates with DNA origami systems opens a vast avenue to applications in the fields of nanomedicine for diagnostics and therapeutics....
Variances as order parameter and complexity measure for random Boolean networks
International Nuclear Information System (INIS)
Luque, Bartolo; Ballesteros, Fernando J; Fernandez, Manuel
2005-01-01
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
International Nuclear Information System (INIS)
Zheng, Jinbin
2014-01-01
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software
Variances as order parameter and complexity measure for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)
2005-02-04
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
A quantum speedup in machine learning: finding an N-bit Boolean function for a classification
International Nuclear Information System (INIS)
Yoo, Seokwon; Lee, Jinhyoung; Bang, Jeongho; Lee, Changhyoup
2014-01-01
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of operations and control parameters, but only the quantum machines utilize the quantum coherence naturally induced by unitary operators. We show that quantum superposition enables quantum learning that is faster than classical learning by expanding the approximate solution regions, i.e., the acceptable regions. This is also demonstrated by means of numerical simulations with a standard feedback model, namely random search, and a practical model, namely differential evolution. (paper)
Assessment of Electronic Circuits Reliability Using Boolean Truth Table Modeling Method
International Nuclear Information System (INIS)
EI-Shanshoury, A.I.
2011-01-01
This paper explores the use of Boolean Truth Table modeling Method (BTTM) in the analysis of qualitative data. It is widely used in certain fields especially in the fields of electrical and electronic engineering. Our work focuses on the evaluation of power supply circuit reliability using (BTTM) which involves systematic attempts to falsify and identify hypotheses on the basis of truth tables constructed from qualitative data. Reliability parameters such as the system's failure rates for the power supply case study are estimated. All possible state combinations (operating and failed states) of the major components in the circuit were listed and their effects on overall system were studied
Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.
Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence
2012-08-29
Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential
Strahler, Alan H.; Jupp, David L. B.
1990-01-01
Geometric-optical discrete-element mathematical models for forest canopies have been developed using the Boolean logic and models of Serra. The geometric-optical approach is considered to be particularly well suited to describing the bidirectional reflectance of forest woodland canopies, where the concentration of leaf material within crowns and the resulting between-tree gaps make plane-parallel, radiative-transfer models inappropriate. The approach leads to invertible formulations, in which the spatial and directional variance provides the means for remote estimation of tree crown size, shape, and total cover from remotedly sensed imagery.
Security analysis of boolean algebra based on Zhang-Wang digital signature scheme
Energy Technology Data Exchange (ETDEWEB)
Zheng, Jinbin, E-mail: jbzheng518@163.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China)
2014-10-06
In 2005, Zhang and Wang proposed an improvement signature scheme without using one-way hash function and message redundancy. In this paper, we show that this scheme exits potential safety concerns through the analysis of boolean algebra, such as bitwise exclusive-or, and point out that mapping is not one to one between assembly instructions and machine code actually by means of the analysis of the result of the assembly program segment, and which possibly causes safety problems unknown to the software.
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.
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.).
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.
Boolean logic analysis for flow regime recognition of gas–liquid horizontal flow
International Nuclear Information System (INIS)
Ramskill, Nicholas P; Wang, Mi
2011-01-01
In order to develop a flowmeter for the accurate measurement of multiphase flows, it is of the utmost importance to correctly identify the flow regime present to enable the selection of the optimal method for metering. In this study, the horizontal flow of air and water in a pipeline was studied under a multitude of conditions using electrical resistance tomography but the flow regimes that are presented in this paper have been limited to plug and bubble air–water flows. This study proposes a novel method for recognition of the prevalent flow regime using only a fraction of the data, thus rendering the analysis more efficient. By considering the average conductivity of five zones along the central axis of the tomogram, key features can be identified, thus enabling the recognition of the prevalent flow regime. Boolean logic and frequency spectrum analysis has been applied for flow regime recognition. Visualization of the flow using the reconstructed images provides a qualitative comparison between different flow regimes. Application of the Boolean logic scheme enables a quantitative comparison of the flow patterns, thus reducing the subjectivity in the identification of the prevalent flow regime
Feedback topology and XOR-dynamics in Boolean networks with varying input structure
Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
Feedback topology and XOR-dynamics in Boolean networks with varying input structure.
Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M
2009-08-01
We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk
2015-11-01
We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Directory of Open Access Journals (Sweden)
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
Directory of Open Access Journals (Sweden)
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.
Energy Technology Data Exchange (ETDEWEB)
Venkitachalam, Srividya; Chueh, Fu-Yu [Department of Microbiology and Immunology, H. M. Bligh Cancer Research Laboratories, Chicago Medical School, Rosalind Franklin University of Medicine and Science, North Chicago, IL 60064 (United States); Yu, Chao-Lan, E-mail: chaolan.yu@rosalindfranklin.edu [Department of Microbiology and Immunology, H. M. Bligh Cancer Research Laboratories, Chicago Medical School, Rosalind Franklin University of Medicine and Science, North Chicago, IL 60064 (United States)
2012-01-20
Highlights: Black-Right-Pointing-Pointer Lmo2 expression is elevated in Lck-transformed cells. Black-Right-Pointing-Pointer Both endogenous and exogenous Lck localize in the nucleus. Black-Right-Pointing-Pointer Nuclear Lck is active in Lck-transformed cells. Black-Right-Pointing-Pointer Lck binds to the promoter region of Lmo2 gene in vivo. Black-Right-Pointing-Pointer In contrast to JAK2, Lck does not increase histone H3 phosphorylation on Tyr 41. -- Abstract: LIM domain only protein 2 (Lmo2) is a transcription factor that plays a critical role in the development of T-acute lymphoblastic leukemia (T-ALL). A previous report established a link between Lmo2 expression and the nuclear presence of oncogenic Janus kinase 2 (JAK2), a non-receptor protein tyrosine kinase. The oncogenic JAK2 kinase phosphorylates histone H3 on Tyr 41 that leads to the relief of Lmo2 promoter repression and subsequent gene expression. Similar to JAK2, constitutive activation of lymphocyte-specific protein tyrosine kinase (Lck) has been implicated in lymphoid malignancies. However, it is not known whether oncogenic Lck regulates Lmo2 expression through a similar mechanism. We show here that Lmo2 expression is significantly elevated in T cell leukemia LSTRA overexpressing active Lck kinase and in HEK 293 cells expressing oncogenic Y505FLck kinase. Nuclear localization of active Lck kinase was confirmed in both Lck-transformed cells by subcellular fractionation and immunofluorescence microscopy. More importantly, in contrast to oncogenic JAK2, oncogenic Lck kinase does not result in significant increase in histone H3 phosphorylation on Tyr 41. Instead, chromatin immunoprecipitation experiment shows that oncogenic Y505FLck kinase binds to the Lmo2 promoter in vivo. This result raises the possibility that oncogenic Lck may activate Lmo2 promoter through direct interaction.
Roberts, David W; Api, Anne Marie
2018-07-01
Prediction of skin sensitisation potential and potency by non-animal methods is the target of many active research programmes. Although the aim is to predict sensitisation potential and potency in humans, data from the murine local lymph node assay (LLNA) constitute much the largest source of quantitative data on in vivo skin sensitisation. The LLNA has been the preferred in vivo method for identification of skin sensitising chemicals and as such is potentially valuable as a benchmark for assessment of non-animal approaches. However, in common with all predictive test methods, the LLNA is subject to false positives and false negatives with an overall level of accuracy said variously to be approximately 80% or 90%. It is also necessary to consider the extent to which, for true positives, LLNA potency correlates with human potency. In this paper LLNA potency and human potency are compared so as to express quantitatively the correlation between them, and reasons for non-agreement between LLNA and human potency are analysed. This leads to a better definition of the applicability domain of the LLNA, within which LLNA data can be used confidently to predict human potency and as a benchmark to assess the performance of non-animal approaches. Copyright © 2018. Published by Elsevier Inc.
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.
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.
Lock, Antonia; Forfar, Rachel; Weston, Cathryn; Bowsher, Leo; Upton, Graham J G; Reynolds, Christopher A; Ladds, Graham; Dixon, Ann M
2014-12-01
G protein-coupled receptors (GPCRs) are the largest family of cell-surface receptors in mammals and facilitate a range of physiological responses triggered by a variety of ligands. GPCRs were thought to function as monomers, however it is now accepted that GPCR homo- and hetero-oligomers also exist and influence receptor properties. The Schizosaccharomyces pombe GPCR Mam2 is a pheromone-sensing receptor involved in mating and has previously been shown to form oligomers in vivo. The first transmembrane domain (TMD) of Mam2 contains a small-XXX-small motif, overrepresented in membrane proteins and well-known for promoting helix-helix interactions. An ortholog of Mam2 in Saccharomyces cerevisiae, Ste2, contains an analogous small-XXX-small motif which has been shown to contribute to receptor homo-oligomerization, localization and function. Here we have used experimental and computational techniques to characterize the role of the small-XXX-small motif in function and assembly of Mam2 for the first time. We find that disruption of the motif via mutagenesis leads to reduction of Mam2 TMD1 homo-oligomerization and pheromone-responsive cellular signaling of the full-length protein. It also impairs correct targeting to the plasma membrane. Mutation of the analogous motif in Ste2 yielded similar results, suggesting a conserved mechanism for assembly. Using co-expression of the two fungal receptors in conjunction with computational models, we demonstrate a functional change in G protein specificity and propose that this is brought about through hetero-dimeric interactions of Mam2 with Ste2 via the complementary small-XXX-small motifs. This highlights the potential of these motifs to affect a range of properties that can be investigated in other GPCRs. Copyright © 2014. Published by Elsevier B.V.
Guo, Yang
2018-01-04
In this communication, an improved perturbative triples correction (T) algorithm for domain based local pair-natural orbital singles and doubles coupled cluster (DLPNO-CCSD) theory is reported. In our previous implementation, the semi-canonical approximation was used and linear scaling was achieved for both the DLPNO-CCSD and (T) parts of the calculation. In this work, we refer to this previous method as DLPNO-CCSD(T0) to emphasize the semi-canonical approximation. It is well-established that the DLPNO-CCSD method can predict very accurate absolute and relative energies with respect to the parent canonical CCSD method. However, the (T0) approximation may introduce significant errors in absolute energies as the triples correction grows up in magnitude. In the majority of cases, the relative energies from (T0) are as accurate as the canonical (T) results of themselves. Unfortunately, in rare cases and in particular for small gap systems, the (T0) approximation breaks down and relative energies show large deviations from the parent canonical CCSD(T) results. To address this problem, an iterative (T) algorithm based on the previous DLPNO-CCSD(T0) algorithm has been implemented [abbreviated here as DLPNO-CCSD(T)]. Using triples natural orbitals to represent the virtual spaces for triples amplitudes, storage bottlenecks are avoided. Various carefully designed approximations ease the computational burden such that overall, the increase in the DLPNO-(T) calculation time over DLPNO-(T0) only amounts to a factor of about two (depending on the basis set). Benchmark calculations for the GMTKN30 database show that compared to DLPNO-CCSD(T0), the errors in absolute energies are greatly reduced and relative energies are moderately improved. The particularly problematic case of cumulene chains of increasing lengths is also successfully addressed by DLPNO-CCSD(T).
Guo, Yang; Riplinger, Christoph; Becker, Ute; Liakos, Dimitrios G.; Minenkov, Yury; Cavallo, Luigi; Neese, Frank
2018-01-01
In this communication, an improved perturbative triples correction (T) algorithm for domain based local pair-natural orbital singles and doubles coupled cluster (DLPNO-CCSD) theory is reported. In our previous implementation, the semi-canonical approximation was used and linear scaling was achieved for both the DLPNO-CCSD and (T) parts of the calculation. In this work, we refer to this previous method as DLPNO-CCSD(T0) to emphasize the semi-canonical approximation. It is well-established that the DLPNO-CCSD method can predict very accurate absolute and relative energies with respect to the parent canonical CCSD method. However, the (T0) approximation may introduce significant errors in absolute energies as the triples correction grows up in magnitude. In the majority of cases, the relative energies from (T0) are as accurate as the canonical (T) results of themselves. Unfortunately, in rare cases and in particular for small gap systems, the (T0) approximation breaks down and relative energies show large deviations from the parent canonical CCSD(T) results. To address this problem, an iterative (T) algorithm based on the previous DLPNO-CCSD(T0) algorithm has been implemented [abbreviated here as DLPNO-CCSD(T)]. Using triples natural orbitals to represent the virtual spaces for triples amplitudes, storage bottlenecks are avoided. Various carefully designed approximations ease the computational burden such that overall, the increase in the DLPNO-(T) calculation time over DLPNO-(T0) only amounts to a factor of about two (depending on the basis set). Benchmark calculations for the GMTKN30 database show that compared to DLPNO-CCSD(T0), the errors in absolute energies are greatly reduced and relative energies are moderately improved. The particularly problematic case of cumulene chains of increasing lengths is also successfully addressed by DLPNO-CCSD(T).
Super-transient scaling in time-delay autonomous Boolean network motifs
Energy Technology Data Exchange (ETDEWEB)
D' Huys, Otti, E-mail: otti.dhuys@phy.duke.edu; Haynes, Nicholas D. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Lohmann, Johannes [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstraße 36, 10623 Berlin (Germany); Gauthier, Daniel J. [Department of Physics, Duke University, Durham, North Carolina 27708 (United States); Department of Physics, The Ohio State University, Columbus, Ohio 43210 (United States)
2016-09-15
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
Fisher information at the edge of chaos in random Boolean networks.
Wang, X Rosalind; Lizier, Joseph T; Prokopenko, Mikhail
2011-01-01
We study the order-chaos phase transition in random Boolean networks (RBNs), which have been used as models of gene regulatory networks. In particular we seek to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity). Fisher information, which measures how much system dynamics can reveal about the control parameters, offers a natural interpretation of the phase diagram in RBNs. We report that this measure is maximized near the order-chaos phase transitions in RBNs, since this is the region where the system is most sensitive to its parameters. Furthermore, we use this study of RBNs to clarify the relationship between Shannon and Fisher information measures.
Quantum tests for the linearity and permutation invariance of Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Hillery, Mark [Department of Physics, Hunter College of the City University of New York, 695 Park Avenue, New York, New York 10021 (United States); Andersson, Erika [SUPA, School of Engineering and Physical Sciences, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom)
2011-12-15
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.
The pseudo-Boolean optimization approach to form the N-version software structure
Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.
2015-10-01
The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality. Some additional modifications of MVP have been made to solve the problem of N-version systems design. Those algorithms take into account the discovered specific features of the objective function. The practical experiments have shown the advantage of using these algorithm modifications because of reducing a search space.
Lima, Ricardo
2016-06-16
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Lima, Ricardo; Grossmann, Ignacio E.
2016-01-01
This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York
Directory of Open Access Journals (Sweden)
Chao Luo
Full Text Available A novel algebraic approach is proposed to study dynamics of asynchronous random Boolean networks where a random number of nodes can be updated at each time step (ARBNs. In this article, the logical equations of ARBNs are converted into the discrete-time linear representation and dynamical behaviors of systems are investigated. We provide a general formula of network transition matrices of ARBNs as well as a necessary and sufficient algebraic criterion to determine whether a group of given states compose an attractor of length[Formula: see text] in ARBNs. Consequently, algorithms are achieved to find all of the attractors and basins in ARBNs. Examples are showed to demonstrate the feasibility of the proposed scheme.
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.
Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions.
Qu, Xiangmeng; Wang, Shaopeng; Ge, Zhilei; Wang, Jianbang; Yao, Guangbao; Li, Jiang; Zuo, Xiaolei; Shi, Jiye; Song, Shiping; Wang, Lihua; Li, Li; Pei, Hao; Fan, Chunhai
2017-08-02
Programmable remodelling of cell surfaces enables high-precision regulation of cell behavior. In this work, we developed in vitro constructed DNA-based chemical reaction networks (CRNs) to program on-chip cell adhesion. We found that the RGD-functionalized DNA CRNs are entirely noninvasive when interfaced with the fluidic mosaic membrane of living cells. DNA toehold with different lengths could tunably alter the release kinetics of cells, which shows rapid release in minutes with the use of a 6-base toehold. We further demonstrated the realization of Boolean logic functions by using DNA strand displacement reactions, which include multi-input and sequential cell logic gates (AND, OR, XOR, and AND-OR). This study provides a highly generic tool for self-organization of biological systems.
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....
Recurrent-neural-network-based Boolean factor analysis and its application to word clustering.
Frolov, Alexander A; Husek, Dusan; Polyakov, Pavel Yu
2009-07-01
The objective of this paper is to introduce a neural-network-based algorithm for word clustering as an extension of the neural-network-based Boolean factor analysis algorithm (Frolov , 2007). It is shown that this extended algorithm supports even the more complex model of signals that are supposed to be related to textual documents. It is hypothesized that every topic in textual data is characterized by a set of words which coherently appear in documents dedicated to a given topic. The appearance of each word in a document is coded by the activity of a particular neuron. In accordance with the Hebbian learning rule implemented in the network, sets of coherently appearing words (treated as factors) create tightly connected groups of neurons, hence, revealing them as attractors of the network dynamics. The found factors are eliminated from the network memory by the Hebbian unlearning rule facilitating the search of other factors. Topics related to the found sets of words can be identified based on the words' semantics. To make the method complete, a special technique based on a Bayesian procedure has been developed for the following purposes: first, to provide a complete description of factors in terms of component probability, and second, to enhance the accuracy of classification of signals to determine whether it contains the factor. Since it is assumed that every word may possibly contribute to several topics, the proposed method might be related to the method of fuzzy clustering. In this paper, we show that the results of Boolean factor analysis and fuzzy clustering are not contradictory, but complementary. To demonstrate the capabilities of this attempt, the method is applied to two types of textual data on neural networks in two different languages. The obtained topics and corresponding words are at a good level of agreement despite the fact that identical topics in Russian and English conferences contain different sets of keywords.
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...
Directory of Open Access Journals (Sweden)
Luke Buchanan
2009-11-01
Full Text Available Eukaryotic genomes are repetitively packaged into chromatin by nucleosomes, however they are regulated by the differences between nucleosomes, which establish various chromatin states. Local chromatin cues direct the inheritance and propagation of chromatin status via self-reinforcing epigenetic mechanisms. Replication-independent histone exchange could potentially perturb chromatin status if histone exchange chaperones, such as Swr1C, loaded histone variants into wrong sites. Here we show that in Schizosaccharomyces pombe, like Saccharomyces cerevisiae, Swr1C is required for loading H2A.Z into specific sites, including the promoters of lowly expressed genes. However S. pombe Swr1C has an extra subunit, Msc1, which is a JumonjiC-domain protein of the Lid/Jarid1 family. Deletion of Msc1 did not disrupt the S. pombe Swr1C or its ability to bind and load H2A.Z into euchromatin, however H2A.Z was ectopically found in the inner centromere and in subtelomeric chromatin. Normally this subtelomeric region not only lacks H2A.Z but also shows uniformly lower levels of H3K4me2, H4K5, and K12 acetylation than euchromatin and disproportionately contains the most lowly expressed genes during vegetative growth, including many meiotic-specific genes. Genes within and adjacent to subtelomeric chromatin become overexpressed in the absence of either Msc1, Swr1, or paradoxically H2A.Z itself. We also show that H2A.Z is N-terminally acetylated before, and lysine acetylated after, loading into chromatin and that it physically associates with the Nap1 histone chaperone. However, we find a negative correlation between the genomic distributions of H2A.Z and Nap1/Hrp1/Hrp3, suggesting that the Nap1 chaperones remove H2A.Z from chromatin. These data describe H2A.Z action in S. pombe and identify a new mode of chromatin surveillance and maintenance based on negative regulation of histone variant misincorporation.
Kahn, G.; Plotkin, G.D.
1993-01-01
This paper introduces the theory of a particular kind of computation domains called concrete domains. The purpose of this theory is to find a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation.
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.
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2010-01-01
Roč. 73, č. 7-9 (2010), s. 1394-1404 ISSN 0925-2312 R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining Subject RIV: IN - Informatics, Computer Science Impact factor: 1.429, year: 2010
Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.
2013-03-01
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.
Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.
2014-02-01
We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.
Proposal for nanoscale cascaded plasmonic majority gates for non-Boolean computation.
Dutta, Sourav; Zografos, Odysseas; Gurunarayanan, Surya; Radu, Iuliana; Soree, Bart; Catthoor, Francky; Naeemi, Azad
2017-12-19
Surface-plasmon-polariton waves propagating at the interface between a metal and a dielectric, hold the key to future high-bandwidth, dense on-chip integrated logic circuits overcoming the diffraction limitation of photonics. While recent advances in plasmonic logic have witnessed the demonstration of basic and universal logic gates, these CMOS oriented digital logic gates cannot fully utilize the expressive power of this novel technology. Here, we aim at unraveling the true potential of plasmonics by exploiting an enhanced native functionality - the majority voter. Contrary to the state-of-the-art plasmonic logic devices, we use the phase of the wave instead of the intensity as the state or computational variable. We propose and demonstrate, via numerical simulations, a comprehensive scheme for building a nanoscale cascadable plasmonic majority logic gate along with a novel referencing scheme that can directly translate the information encoded in the amplitude and phase of the wave into electric field intensity at the output. Our MIM-based 3-input majority gate displays a highly improved overall area of only 0.636 μm 2 for a single-stage compared with previous works on plasmonic logic. The proposed device demonstrates non-Boolean computational capability and can find direct utility in highly parallel real-time signal processing applications like pattern recognition.
An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.
Jiang, Han; Li, Xue; Xu, Qiuliang
2016-12-01
The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
The boolean algebra with restricted variables as a tool for fault tree modularization
International Nuclear Information System (INIS)
Caldarola, L.; Wickenhaeuser, A.
1981-08-01
The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de
Attractor controllability of Boolean networks by flipping a subset of their nodes
Rafimanzelat, Mohammad Reza; Bahrami, Fariba
2018-04-01
The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.
Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.
Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S
2011-02-01
The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.
Neutral space analysis for a Boolean network model of the fission yeast cell cycle network
Directory of Open Access Journals (Sweden)
Gonzalo A Ruz
2014-01-01
Full Text Available BACKGROUND: Interactions between genes and their products give rise to complex circuits known as gene regulatory networks (GRN that enable cells to process information and respond to external stimuli. Several important processes for life, depend of an accurate and context-specific regulation of gene expression, such as the cell cycle, which can be analyzed through its GRN, where deregulation can lead to cancer in animals or a directed regulation could be applied for biotechnological processes using yeast. An approach to study the robustness of GRN is through the neutral space. In this paper, we explore the neutral space of a Schizosaccharomyces pombe (fission yeast cell cycle network through an evolution strategy to generate a neutral graph, composed of Boolean regulatory networks that share the same state sequences of the fission yeast cell cycle. RESULTS: Through simulations it was found that in the generated neutral graph, the functional networks that are not in the wildtype connected component have in general a Hamming distance more than 3 with the wildtype, and more than 10 between the other disconnected functional networks. Significant differences were found between the functional networks in the connected component of the wildtype network and the rest of the network, not only at a topological level, but also at the state space level, where significant differences in the distribution of the basin of attraction for the G1 fixed point was found for deterministic updating schemes. CONCLUSIONS: In general, functional networks in the wildtype network connected component, can mutate up to no more than 3 times, then they reach a point of no return where the networks leave the connected component of the wildtype. The proposed method to construct a neutral graph is general and can be used to explore the neutral space of other biologically interesting networks, and also formulate new biological hypotheses studying the functional networks in the
Coded diffraction system in X-ray crystallography using a boolean phase coded aperture approximation
Pinilla, Samuel; Poveda, Juan; Arguello, Henry
2018-03-01
Phase retrieval is a problem present in many applications such as optics, astronomical imaging, computational biology and X-ray crystallography. Recent work has shown that the phase can be better recovered when the acquisition architecture includes a coded aperture, which modulates the signal before diffraction, such that the underlying signal is recovered from coded diffraction patterns. Moreover, this type of modulation effect, before the diffraction operation, can be obtained using a phase coded aperture, just after the sample under study. However, a practical implementation of a phase coded aperture in an X-ray application is not feasible, because it is computationally modeled as a matrix with complex entries which requires changing the phase of the diffracted beams. In fact, changing the phase implies finding a material that allows to deviate the direction of an X-ray beam, which can considerably increase the implementation costs. Hence, this paper describes a low cost coded X-ray diffraction system based on block-unblock coded apertures that enables phase reconstruction. The proposed system approximates the phase coded aperture with a block-unblock coded aperture by using the detour-phase method. Moreover, the SAXS/WAXS X-ray crystallography software was used to simulate the diffraction patterns of a real crystal structure called Rhombic Dodecahedron. Additionally, several simulations were carried out to analyze the performance of block-unblock approximations in recovering the phase, using the simulated diffraction patterns. Furthermore, the quality of the reconstructions was measured in terms of the Peak Signal to Noise Ratio (PSNR). Results show that the performance of the block-unblock phase coded apertures approximation decreases at most 12.5% compared with the phase coded apertures. Moreover, the quality of the reconstructions using the boolean approximations is up to 2.5 dB of PSNR less with respect to the phase coded aperture reconstructions.
International Nuclear Information System (INIS)
Boulay, Francois
1983-01-01
The objectives of this research thesis were: to determine the intramolecular localisation of binding sites of atractyloside and adenine-nucleotides; to determine whether antibodies obtained against the ADP/ATP carrier protein and isolated from beef heart mitochondria possess a reactivity specific to the organ or the species, where antigenic determinants are localized and whether there is conservation of the antigenic structure from one species to the other; to study how to follow and interpret conformational changes of the protein under the effect of ADP and inhibitors (carboxy-atractyloside or bongkrekic acid), and where the SH group unmasked by ADP and bongkrekic acid is localized [fr
Peters, Katharina; Schweizer, Inga; Beilharz, Katrin; Stahlmann, Christoph; Veening, Jan-Willem; Hakenbeck, Regine; Denapaite, Dalia
The transpeptidase activity of the essential penicillin-binding protein 2x (PBP2x) of Streptococcus pneumoniae is believed to be important for murein biosynthesis required for cell division. To study the molecular mechanism driving localization of PBP2x in live cells, we constructed a set of
Bossi, Giulia; Marcato, Gianluca; Gottardi, Guido; Borgatti, Lisa
2016-04-01
When designing the geotechnical model of a landslide the information to define the soil profile within the slope is usually inferred from a small amount of data. This is particularly true for large landslides where the study area is vast and the variability of terrains is high. In this framework, a method allowing the best locations for further field investigation campaigns to be identified would be extremely useful. The Boolean Stochastic Generation method (BoSG), which randomly generates different soil distributions of two definite soil types in both 2D and 3D models, is a newly developed algorithm that can guide in this process. In this work the method has been applied to the Mortisa landslide case study, which is located in the Cortina d'Ampezzo valley (Veneto, Italy), part of the Dolomites UNESCO World Heritage list. The mudslide is 3.5 km long, stretching from 1750 to 1300 m a.s.l., and is located in a highly antrophized area where is damaging some buildings and a national road with its almost continuous movements. In fact, from year 2008, GNSS surveys recorded rates of displacements reaching 1.2 m/year in the most active parts of the landslide; the movements occur on a slip surfaces are located between 20 and 50 m below the surface. From the borecores some wooden samples were extracted allowing to reconstruct the sequence of events that led to the development of the present-day Mortisa slope. Interdigitated layers of gravel in a silty clay matrix originated from subsequent earth and debris flows events since the Lateglacial compose the landslide body, a condition that is particularly apt to be investigated with BoSG. A BoSG run for the Mortisa landslide was performed calculating 1200 soil configurations and using laboratory test parameters for the silty-clay matrix. The results were stacked in a tridimensional matrix in order to calculate the mean and the standard deviation (SD) of displacements for each element of the model mesh. In this way maps of the SD
Directory of Open Access Journals (Sweden)
Bjoern von Einem
Full Text Available Proteolytic processing of amyloid-β precursor protein (APP by beta-site APP cleaving enzyme 1 (BACE1 is the initial step in the production of amyloid beta (Aβ, which accumulates in senile plaques in Alzheimer's disease (AD. Essential for this cleavage is the transport and sorting of both proteins through endosomal/Golgi compartments. Golgi-localized γ-ear-containing ARF-binding (GGA proteins have striking cargo-sorting functions in these pathways. Recently, GGA1 and GGA3 were shown to interact with BACE1, to be expressed in neurons, and to be decreased in AD brain, whereas little is known about GGA2. Since GGA1 impacts Aβ generation by confining APP to the Golgi and perinuclear compartments, we tested whether all GGAs modulate BACE1 and APP transport and processing. We observed decreased levels of secreted APP alpha (sAPPα, sAPPβ, and Aβ upon GGA overexpression, which could be reverted by knockdown. GGA-BACE1 co-immunoprecipitation was impaired upon GGA-GAE but not VHS domain deletion. Autoinhibition of the GGA1-VHS domain was irrelevant for BACE1 interaction. Our data suggest that all three GGAs affect APP processing via the GGA-GAE domain.
Multifunctionalities driven by ferroic domains
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.
Pei, Zingway; Tsai, Hsing-Wang; Lai, Hsin-Cheng
2016-02-01
The organic material based thin film transistors (TFTs) are attractive for flexible optoelectronics applications due to the ability of lager area fabrication by solution and low temperature process on plastic substrate. Recently, the research of organic TFT focus on low operation voltage and high output current to achieve a low power organic logic circuit for optoelectronic device,such as e-paper or OLED displayer. To obtain low voltage and high output current, high gate capacitance and high channel mobility are key factors. The well-arranged polymer chain by a high temperature postannealing, leading enhancement conductivity of polymer film was a general method. However, the thermal annealing applying heat for all device on the substrate and may not applicable to plastic substrate. Therefore, in this work, the low operation voltage and high output current of polymer TFTs was demonstrated by locally electrical bias annealing. The poly(styrene-comethyl methacrylate) (PS-r-PMMA) with ultra-thin thickness is used as gate dielectric that the thickness is controlled by thermal treatment after spin coated on organic electrode. In electrical bias-annealing process, the PS-r- PMMA is acted a heating layer. After electrical bias-annealing, the polymer TFTs obtain high channel mobility at low voltage that lead high output current by a locally annealing of P3HT film. In the future, the locally electrical biasannealing method could be applied on plastic substrate for flexible optoelectronic application.
International Nuclear Information System (INIS)
Van Raad, V.
2004-01-01
Digital colposcopy is an emerging new technology, which can be used as adjunct to the conventional Pap test for staging of cervical cancer and it can improve the diagnostic accuracy of the test. Computer aided diagnosis (CAD) in digital colposcopy has as a goal to segment and outline abnormal areas on the cervix, one of which is an important anatomical landmark on the ectocervix - the transformation zone (TZ). In this paper we proposed a new method for estimation of the local spectrum features of cervical cancer in vivo. We used a 2D method to estimate the energy of the local frequency bands, using a geometric restriction (GR). In the current work we reported up to 12 dB difference between the local power spectral density content of the region of interest (ROI) and (ROI) C for the mid-frequency band. We devised a method to present pseudo-color visual maps of the cervical images, useful for CAD and successful ROI segmentation. (author)
Directory of Open Access Journals (Sweden)
Mahesh Chandra Patra
2018-01-01
Full Text Available The toll/interleukin 1 receptor (TIR domain-containing adaptor protein (TIRAP plays an important role in the toll-like receptor (TLR 2, TLR4, TLR7, and TLR9 signaling pathways. TIRAP anchors to phosphatidylinositol (PI 4,5-bisphosphate (PIP2 on the plasma membrane and PI (3,4,5-trisphosphate (PIP3 on the endosomal membrane and assists in recruitment of the myeloid differentiation primary response 88 protein to activated TLRs. To date, the structure and mechanism of TIRAP’s membrane association are only partially understood. Here, we modeled an all-residue TIRAP dimer using homology modeling, threading, and protein–protein docking strategies. Molecular dynamics simulations revealed that PIP2 creates a stable microdomain in a dipalmitoylphosphatidylcholine bilayer, providing TIRAP with its physiologically relevant orientation. Computed binding free energy values suggest that the affinity of PI-binding domain (PBD for PIP2 is stronger than that of TIRAP as a whole for PIP2 and that the short PI-binding motif (PBM contributes to the affinity between PBD and PIP2. Four PIP2 molecules can be accommodated by distinct lysine-rich surfaces on the dimeric PBM. Along with the known PI-binding residues (K15, K16, K31, and K32, additional positively charged residues (K34, K35, and R36 showed strong affinity toward PIP2. Lysine-to-alanine mutations at the PI-binding residues abolished TIRAP’s affinity for PIP2; however, K34, K35, and R36 consistently interacted with PIP2 headgroups through hydrogen bond (H-bond and electrostatic interactions. TIRAP exhibited a PIP2-analogous intermolecular contact and binding affinity toward PIP3, aided by an H-bond network involving K34, K35, and R36. The present study extends our understanding of TIRAP’s membrane association, which could be helpful in designing peptide decoys to block TLR2-, TLR4-, TLR7-, and TLR9-mediated autoimmune diseases.
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.
DEFF Research Database (Denmark)
Schraefel, M. C.; Rouncefield, Mark; Kellogg, Wendy
2012-01-01
In CSCW, how much do we need to know about another domain/culture before we observe, intersect and intervene with designs. What optimally would that other culture need to know about us? Is this a “how long is a piece of string” question, or an inquiry where we can consider a variety of contexts a...
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
Jin, Xin; Jiang, Qian; Yao, Shaowen; Zhou, Dongming; Nie, Rencan; Lee, Shin-Jye; He, Kangjian
2018-01-01
In order to promote the performance of infrared and visual image fusion and provide better visual effects, this paper proposes a hybrid fusion method for infrared and visual image by the combination of discrete stationary wavelet transform (DSWT), discrete cosine transform (DCT) and local spatial frequency (LSF). The proposed method has three key processing steps. Firstly, DSWT is employed to decompose the important features of the source image into a series of sub-images with different levels and spatial frequencies. Secondly, DCT is used to separate the significant details of the sub-images according to the energy of different frequencies. Thirdly, LSF is applied to enhance the regional features of DCT coefficients, and it can be helpful and useful for image feature extraction. Some frequently-used image fusion methods and evaluation metrics are employed to evaluate the validity of the proposed method. The experiments indicate that the proposed method can achieve good fusion effect, and it is more efficient than other conventional image fusion methods.
DEFF Research Database (Denmark)
Hjorth, Theis Solberg; Torbensen, Rune
2012-01-01
remote access via IP-based devices such as smartphones. The Trusted Domain platform fits existing legacy technologies by managing their interoperability and access controls, and it seeks to avoid the security issues of relying on third-party servers outside the home. It is a distributed system...... of wireless standards, limited resources of embedded systems, etc. Taking these challenges into account, we present a Trusted Domain home automation platform, which dynamically and securely connects heterogeneous networks of Short-Range Wireless devices via simple non-expert user. interactions, and allows......In the digital age of home automation and with the proliferation of mobile Internet access, the intelligent home and its devices should be accessible at any time from anywhere. There are many challenges such as security, privacy, ease of configuration, incompatible legacy devices, a wealth...
Cowan, A E; Myles, D G; Koppel, D E
1991-03-01
The redistribution of membrane proteins on the surface of cells is a prevalent feature of differentiation in a variety of cells. In most cases the mechanism responsible for such redistribution is poorly understood. Two potential mechanisms for the redistribution of surface proteins are: (1) passive diffusion coupled with trapping, and (2) active translocation. We have studied the process of membrane protein redistribution for the PH-20 protein of guinea pig sperm, a surface protein required for sperm binding to the egg zona pellucida (P. Primakoff, H. Hyatt, and D. G. Myles (1985). J. Cell Biol. 101, 2239-2244). PH-20 protein is localized to the posterior head plasma menbrane of the mature sperm cell. Following the exocytotic acrosome reaction, PH-20 protein moves into the newly incorporated inner acrosomal membrane (IAM), placing it in a position favorable for a role in binding sperm to the egg zona pellucida (D. G. Myles, and P. Primakoff (1984), J. Cell Biol. 99, 1634-1641). To analyze the mechanistic basis for this protein migration, we have used fluorescence microscopy and digital image processing to characterize PH-20 protein migration in individual cells. PH-20 protein was observed to move against a concentration gradient in the posterior head plasma membrane. This result argues strongly against a model of passive diffusion followed by trapping in the IAM, and instead suggests that an active process serves to concentrate PH-20 protein toward the boundary separating the posterior head and IAM regions. A transient gradient of PH-20 concentration observed in the IAM suggests that once PH-20 protein reaches the IAM, it is freely diffusing. Additionally, we observed that migration of PH-20 protein was calcium dependent.
Roberts, David W; Api, Anne Marie; Aptula, Aynur O
2016-10-01
The Local Lymph Node Assay (LLNA) is the most common in vivo regulatory toxicology test for skin sensitisation, quantifying potency as the EC3, the concentration of chemical giving a threefold increase in thymidine uptake in the local lymph node. Existing LLNA data can, along with clinical data, provide useful comparator information on the potency of sensitisers. Understanding of the biological variability of data from LLNA studies is important for those developing non-animal based risk assessment approaches for skin allergy. Here an existing set of 94 EC3 values for 12 chemicals, all tested at least three times in the same vehicle have been analysed by calculating standard deviations (SD) for logEC3 values. The SDs range from 0.08 to 0.22. The overall SD for the 94 logEC3 values is 0.147. Thus the 95% confidence limits (2xSD) for LLNA EC3 values are within a factor of 2, comparable to those for physico-chemical measurements such as partition coefficients and solubility. The residual SDs of Quantitative Mechanistic Models (QMMs) based on physical organic chemistry parameters are similar to the overall SD of the LLNA, indicating that QMMs of this type are unlikely to be bettered for predictive accuracy. Copyright © 2016 Elsevier Inc. All rights reserved.
Ari, Eszter; Ittzés, Péter; Podani, János; Thi, Quynh Chi Le; Jakó, Eena
2012-04-01
Boolean analysis (or BOOL-AN; Jakó et al., 2009. BOOL-AN: A method for comparative sequence analysis and phylogenetic reconstruction. Mol. Phylogenet. Evol. 52, 887-97.), a recently developed method for sequence comparison uses the Iterative Canonical Form of Boolean functions. It considers sequence information in a way entirely different from standard phylogenetic methods (i.e. Maximum Parsimony, Maximum-Likelihood, Neighbor-Joining, and Bayesian analysis). The performance and reliability of Boolean analysis were tested and compared with the standard phylogenetic methods, using artificially evolved - simulated - nucleotide sequences and the 22 mitochondrial tRNA genes of the great apes. At the outset, we assumed that the phylogeny of Hominidae is generally well established, and the guide tree of artificial sequence evolution can also be used as a benchmark. These offer a possibility to compare and test the performance of different phylogenetic methods. Trees were reconstructed by each method from 2500 simulated sequences and 22 mitochondrial tRNA sequences. We also introduced a special re-sampling method for Boolean analysis on permuted sequence sites, the P-BOOL-AN procedure. Considering the reliability values (branch support values of consensus trees and Robinson-Foulds distances) we used for simulated sequence trees produced by different phylogenetic methods, BOOL-AN appeared as the most reliable method. Although the mitochondrial tRNA sequences of great apes are relatively short (59-75 bases long) and the ratio of their constant characters is about 75%, BOOL-AN, P-BOOL-AN and the Bayesian approach produced the same tree-topology as the established phylogeny, while the outcomes of Maximum Parsimony, Maximum-Likelihood and Neighbor-Joining methods were equivocal. We conclude that Boolean analysis is a promising alternative to existing methods of sequence comparison for phylogenetic reconstruction and congruence analysis. Copyright Â© 2012 Elsevier Inc. All
Loke, Desmond; Skelton, Jonathan M; Chong, Tow-Chong; Elliott, Stephen R
2016-12-21
One of the requirements for achieving faster CMOS electronics is to mitigate the unacceptably large chip areas required to steer heat away from or, more recently, toward the critical nodes of state-of-the-art devices. Thermal-guiding (TG) structures can efficiently direct heat by "meta-materials" engineering; however, some key aspects of the behavior of these systems are not fully understood. Here, we demonstrate control of the thermal-diffusion properties of TG structures by using nanometer-scale, CMOS-integrable, graphene-on-silica stacked materials through finite-element-methods simulations. It has been shown that it is possible to implement novel, controllable, thermally based Boolean-logic and spike-timing-dependent plasticity operations for advanced (neuromorphic) computing applications using such thermal-guide architectures.
Szejka, Agnes; Drossel, Barbara
2010-02-01
We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.
Directory of Open Access Journals (Sweden)
Mikko Niilo-Rämä
2014-06-01
Full Text Available A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation of its variance is derived. The accuracies of the approximations are evaluated by means of simulation experiments. The novel method is compared to other methods and applied to real-world industrial data from nanocellulose crystalline.
Directory of Open Access Journals (Sweden)
Shohag Barman
Full Text Available Inferring a gene regulatory network from time-series gene expression data in systems biology is a challenging problem. Many methods have been suggested, most of which have a scalability limitation due to the combinatorial cost of searching a regulatory set of genes. In addition, they have focused on the accurate inference of a network structure only. Therefore, there is a pressing need to develop a network inference method to search regulatory genes efficiently and to predict the network dynamics accurately.In this study, we employed a Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and propose a novel mutual information-based Boolean network inference (MIBNI method. Given time-series gene expression data as an input, the method first identifies a set of initial regulatory genes using mutual information-based feature selection, and then improves the dynamics prediction accuracy by iteratively swapping a pair of genes between sets of the selected regulatory genes and the other genes. Through extensive simulations with artificial datasets, MIBNI showed consistently better performance than six well-known existing methods, REVEAL, Best-Fit, RelNet, CST, CLR, and BIBN in terms of both structural and dynamics prediction accuracy. We further tested the proposed method with two real gene expression datasets for an Escherichia coli gene regulatory network and a fission yeast cell cycle network, and also observed better results using MIBNI compared to the six other methods.Taken together, MIBNI is a promising tool for predicting both the structure and the dynamics of a gene regulatory network.
Local Stereo Matching Using Adaptive Local Segmentation
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
Directory of Open Access Journals (Sweden)
Clarissa Z. Y. Koh
2018-03-01
Full Text Available A Dual-Domain Carbonic Anhydrase (DDCA had been sequenced and characterized from the ctenidia (gills of the giant clam, Tridacna squamosa, which lives in symbiosis with zooxanthellae. DDCA was expressed predominantly in the ctenidium. The complete cDNA coding sequence of DDCA from T. squamosa comprised 1,803 bp, encoding a protein of 601 amino acids and 66.7 kDa. The deduced DDCA sequence contained two distinct α-CA domains, each with a specific catalytic site. It had a high sequence similarity with tgCA from Tridacna gigas. In T. squamosa, the DDCA was localized apically in certain epithelial cells near the base of the ctenidial filament and the epithelial cells surrounding the tertiary water channels. Due to the presence of two transmembrane regions in the DDCA, one of the Zn2+-containing active sites could be located externally and the other one inside the cell. These results denote that the ctenidial DDCA was positioned to dehydrate HCO3- to CO2 in seawater, and to hydrate the CO2 that had permeated the apical membrane back to HCO3- in the cytoplasm. During insolation, the host clam needs to increase the uptake of inorganic carbon from the ambient seawater to benefit the symbiotic zooxanthellae; only then, can the symbionts conduct photosynthesis and share the photosynthates with the host. Indeed, the transcript and protein levels of DDCA/DDCA in the ctenidium of T. squamosa increased significantly after 6 and 12 h of exposure to light, respectively, denoting that DDCA could participate in the light-enhanced uptake and assimilation of exogenous inorganic carbon.
International Nuclear Information System (INIS)
Park, Richard; Heston, Lee; Shedd, Duane; Delecluse, Henri-Jacques; Miller, George
2008-01-01
foci. The speckled appearance of R179A and Y180E was more regular and clearly defined in EBV-positive than in EBV-negative 293 cells. The Y180E late-mutant induced EA-D, but prevented EA-D from localizing to globular replication compartments. These results show that individual amino acids within the basic domain influence localization of the ZEBRA protein and its capacity to induce EA-D to become located in mature viral replication compartments. Furthermore, these mutant ZEBRA proteins delineate several stages in the processes of nuclear re-organization which accompany lytic EBV replication
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.)
Karg, Saskia R; Frey, Alexander D; Kallio, Pauli T
2010-03-01
Plant-specific N-glycosylation, such as the introduction of core alpha1,3-fucose and beta1,2-xylose residues, is a major obstacle to the utilization of plant cell- or plant-derived recombinant therapeutic proteins. The beta1,4-N-acetylglucosaminyltransferase III (GnTIII) introduces a bisecting GlcNAc residue into N-glycans, which exerts a high level of substrate mediated control over subsequent modifications, for example inhibiting mammalian core fucosylation. Based on similar findings in plants, we used Nicotianatabacum BY-2 cells to study the effects of localization and expression levels of GnTIII in the remodeling of the plant N-glycosylation pathway. The N-glycans produced by the cells expressing GnTIII were partially bisected and practically devoid of the paucimannosidic type which is typical for N-glycans produced by wildtype BY-2 suspension cultured cells. The proportion of human-compatible N-glycans devoid of fucose and xylose could be increased from an average of 4% on secreted protein from wildtype cells to as high as 59% in cells expressing chimeric GnTIII, named GnTIII(A.th.) replacing its native localization domain with the cytoplasmic tail, transmembrane, and stem region of Arabidopsis thaliana mannosidase II. The changes in N-glycosylation observed were dependent on the catalytic activity of GnTIII, as the expression of catalytically inactive GnTIII mutants did not show a significant effect on N-glycosylation. Copyright 2010 Elsevier B.V. All rights reserved.
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.
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....
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.
When Gravity Fails: Local Search Topology
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.
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.
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
Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory
Energy Technology Data Exchange (ETDEWEB)
Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S., E-mail: miaoxs@mail.hust.edu.cn [Wuhan National Laboratory for Optoelectronics (WNLO), Huazhong University of Science and Technology (HUST), Wuhan 430074 (China); School of Optical and Electronic Information, Huazhong University of Science and Technology, Wuhan 430074 (China)
2013-12-21
Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices.
Nonvolatile “AND,” “OR,” and “NOT” Boolean logic gates based on phase-change memory
International Nuclear Information System (INIS)
Li, Y.; Zhong, Y. P.; Deng, Y. F.; Zhou, Y. X.; Xu, L.; Miao, X. S.
2013-01-01
Electronic devices or circuits that can implement both logic and memory functions are regarded as the building blocks for future massive parallel computing beyond von Neumann architecture. Here we proposed phase-change memory (PCM)-based nonvolatile logic gates capable of AND, OR, and NOT Boolean logic operations verified in SPICE simulations and circuit experiments. The logic operations are parallel computing and results can be stored directly in the states of the logic gates, facilitating the combination of computing and memory in the same circuit. These results are encouraging for ultralow-power and high-speed nonvolatile logic circuit design based on novel memory devices
Domain-to-domain coupling in voltage-sensing phosphatase.
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.
Directory of Open Access Journals (Sweden)
Mahdieh Saadat Foomani
2017-01-01
Full Text Available Hazardous wastes include numerous kinds of discarded chemicals and other wastes generated from industrial, commercial, and institutional activities. These types of waste present immediate or long-term risks to humans, animals, plants, or the environment and therefore require special handling for safe disposal. Landfills that can accept hazardous wastes are excavated or engineered sites where these special types of waste can be disposed of securely. Since landfills are permanent sites, special attention must be afforded in selecting the location. This paper investigated the use of the Boolean theory and Fuzzy logic in combination with Analytic Hierarchy Process (AHP methods by applying GIS and IDRISI software for the selection of a hazardous waste landfill site in the Iranian province of Hormozgan. The best location was determined via the Fuzzy and the Boolean methodologies. By collating the area selected for the hazardous waste landfill, this study found that Fuzzy logic with an AND operator had the best options for this purpose. In the end, the most suitable area for a hazardous waste landfill was about 1.6 km2 which was obtained by employing Fuzzy in combination with AHP and by using an AND operator. In addition, all the fundamental criteria affecting the landfill location were considered.
Fusama, Mie; Miura, Yasushi; Yukioka, Kumiko; Kuroiwa, Takanori; Yukioka, Chikako; Inoue, Miyako; Nakanishi, Tae; Murata, Norikazu; Takai, Noriko; Higashi, Kayoko; Kuritani, Taro; Maeda, Keiji; Sano, Hajime; Yukioka, Masao; Nakahara, Hideko
2015-09-01
To evaluate whether the psychological state is related to the Boolean-based definition of patient global assessment (PGA) remission in patients with rheumatoid arthritis (RA). Patients with RA who met the criteria of swollen joint count (SJC) ≤ 1, tender joint count (TJC) ≤ 1 and C-reactive protein (CRP) ≤ 1 were divided into two groups, PGA remission group (PGA ≤ 1 cm) and non-remission group (PGA > 1 cm). Anxiety was evaluated utilizing the Hospital Anxiety and Depression Scale-Anxiety (HADS-A), while depression was evaluated with HADS-Depression (HADS-D) and the Center for Epidemiologic Studies Depression Scale (CES-D). Comparison analyses were done between the PGA remission and non-remission groups in HADS-A, HADS-D and CES-D. Seventy-eight patients met the criteria for SJC ≤ 1, TJC ≤ 1 and CRP ≤ 1. There were no significant differences between the PGA remission group (n = 45) and the non-remission group (n = 33) in age, sex, disease duration and Steinbrocker's class and stage. HADS-A, HADS-D and CES-D scores were significantly lower in the PGA remission group. Patients with RA who did not meet the PGA remission criteria despite good disease condition were in a poorer psychological state than those who satisfied the Boolean-based definition of clinical remission. Psychological support might be effective for improvement of PGA, resulting in the attainment of true remission.
Sato, Tatsuhiro; Akasu, Hitomi; Shimono, Wataru; Matsu, Chisa; Fujiwara, Yuki; Shibagaki, Yoshio; Heard, Jeffrey J.; Tamanoi, Fuyuhiko; Hattori, Seisuke
2015-01-01
Rheb small GTPases, which consist of Rheb1 and Rheb2 (also known as RhebL1) in mammalian cells, are unique members of the Ras superfamily and play central roles in regulating protein synthesis and cell growth by activating mTOR. To gain further insight into the function of Rheb, we carried out a search for Rheb-binding proteins and found that Rheb binds to CAD protein (carbamoyl-phosphate synthetase 2, aspartate transcarbamoylase, and dihydroorotase), a multifunctional enzyme required for the de novo synthesis of pyrimidine nucleotides. CAD binding is more pronounced with Rheb2 than with Rheb1. Rheb binds CAD in a GTP- and effector domain-dependent manner. The region of CAD where Rheb binds is located at the C-terminal region of the carbamoyl-phosphate synthetase domain and not in the dihydroorotase and aspartate transcarbamoylase domains. Rheb stimulated carbamoyl-phosphate synthetase activity of CAD in vitro. In addition, an elevated level of intracellular UTP pyrimidine nucleotide was observed in Tsc2-deficient cells, which was attenuated by knocking down of Rheb. Immunostaining analysis showed that expression of Rheb leads to increased accumulation of CAD on lysosomes. Both a farnesyltransferase inhibitor that blocks membrane association of Rheb and knockdown of Rheb mislocalized CAD. These results establish CAD as a downstream effector of Rheb and suggest a possible role of Rheb in regulating de novo pyrimidine nucleotide synthesis. PMID:25422319
Sato, Tatsuhiro; Akasu, Hitomi; Shimono, Wataru; Matsu, Chisa; Fujiwara, Yuki; Shibagaki, Yoshio; Heard, Jeffrey J; Tamanoi, Fuyuhiko; Hattori, Seisuke
2015-01-09
Rheb small GTPases, which consist of Rheb1 and Rheb2 (also known as RhebL1) in mammalian cells, are unique members of the Ras superfamily and play central roles in regulating protein synthesis and cell growth by activating mTOR. To gain further insight into the function of Rheb, we carried out a search for Rheb-binding proteins and found that Rheb binds to CAD protein (carbamoyl-phosphate synthetase 2, aspartate transcarbamoylase, and dihydroorotase), a multifunctional enzyme required for the de novo synthesis of pyrimidine nucleotides. CAD binding is more pronounced with Rheb2 than with Rheb1. Rheb binds CAD in a GTP- and effector domain-dependent manner. The region of CAD where Rheb binds is located at the C-terminal region of the carbamoyl-phosphate synthetase domain and not in the dihydroorotase and aspartate transcarbamoylase domains. Rheb stimulated carbamoyl-phosphate synthetase activity of CAD in vitro. In addition, an elevated level of intracellular UTP pyrimidine nucleotide was observed in Tsc2-deficient cells, which was attenuated by knocking down of Rheb. Immunostaining analysis showed that expression of Rheb leads to increased accumulation of CAD on lysosomes. Both a farnesyltransferase inhibitor that blocks membrane association of Rheb and knockdown of Rheb mislocalized CAD. These results establish CAD as a downstream effector of Rheb and suggest a possible role of Rheb in regulating de novo pyrimidine nucleotide synthesis. © 2015 by The American Society for Biochemistry and Molecular Biology, Inc.
Monks, P D D; Connor, J N L; Bouakline, F
2009-04-23
We investigate methods for filtering reaction mechanisms in the angular scattering of the state-to-state reaction, H + D(2)(v(i) = 0, j(i) = 0, m(i) = 0) --> HD(v(f) = 3, j(f) = 0, m(f) = 0) + D, where v(i), j(i), and m(i) and v(f), j(f), and m(f) are initial and final vibrational, rotational, and helicity quantum numbers, respectively. The input to our filtrations is a new set of accurate quantum scattering matrix elements for total energies in the range 1.52-2.50 eV (in steps of 0.01 eV) and for total angular momentum quantum numbers in the range, 0-40, in steps of unity. We filter reaction mechanisms in both the energy domain and the time domain. The time-domain calculations employ the plane wave packet formulation of time-dependent scattering. The theoretical tools used are nearside-farside (NF) analysis of partial wave series for scattering amplitudes, together with NF local angular momentum (LAM) theory. An energy-domain LAM analysis reveals the existence of an important dynamical feature in the N scattering, a "trench" which bisects the (energy, angle) plane. We use the location of this trench to approximately filter two reaction mechanisms. Transformation to the time domain demonstrates that the two reaction mechanisms correspond to direct and delayed (by about 25 fs) scattering. Further analysis, including filtration in the time domain, shows that the pronounced LAM trench arises from the interference of the energy-domain analogues of the time-direct and time-delayed scattering. Our theory and results provide the first successful demonstration of reaction mechanism filtering carried out directly in the (energy, angle) domain. The calculations and results in this paper extend and complement earlier research reported by Monks, Connor, and Althorpe (Monks, P. D. D.; Connor, J. N. L.; Althorpe, S. C. J. Phys. Chem. A 2006, 110, 741; J. Phys. Chem. A 2007, 111, 10302).
SH2 domains: modulators of nonreceptor tyrosine kinase activity
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 ...
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.
Bergshoeff, Eric A.; Kleinschmidt, Axel; Riccioni, Fabio
2012-01-01
We classify the half-supersymmetric "domain walls," i.e., branes of codimension one, in toroidally compactified IIA/IIB string theory and show to which gauged supergravity theory each of these domain walls belong. We use as input the requirement of supersymmetric Wess-Zumino terms, the properties of
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.
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.
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...
Conserved Domain Database (CDD)
U.S. Department of Health & Human Services — CDD is a protein annotation resource that consists of a collection of well-annotated multiple sequence alignment models for ancient domains and full-length proteins.
Roberts, David W; Schultz, Terry W; Api, Anne Marie
2016-10-01
The Local Lymph Node Assay (LLNA) is the gold standard regulatory toxicology test for skin sensitisation along with the guinea pig maximisation test (GPMT). Compared with the GPMT, LLNA uses fewer animals, it is quantitative, and it gives a numerical prediction of potency. However several concerns have been raised with this assay, mainly related to false positives and false negatives. Over the years, many authors, including the developers of the assay, have presented cases where there have been discrepancies between the GMPT and LLNA results. Several theories have been put forward for these discrepancies, the main one being the "over-sensitivity" of the GPMT. This paper analyses the data from a systematic study, published in three papers from 2008 to 2011, covering several classes of chemicals, in particular unsaturated fatty acids, sugar surfactants and ethoxylated alcohols, with many cases of chemicals testing positive in the LLNA being negative in the GPMT. Based on consideration of reaction chemistry and structural alerts, it is concluded that these discrepancies are not LLNA false positives, but can be rationalised in terms of the different protocols of the assays. Copyright © 2016 Elsevier Inc. All rights reserved.
Caglar, Mehmet Umut; Pal, Ranadip
2011-03-01
Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.
Frequency-domain waveform inversion using the phase derivative
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
Frequency-domain waveform inversion using the unwrapped phase
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
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.)
Image-domain full waveform inversion
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.
Image-domain full waveform inversion
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.
SH2 domains: modulators of nonreceptor tyrosine kinase activity.
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.
Oude Mulders, J.; Wadensjö, E.; Hasselhorn, H.M.; Apt, W.
This domain chapter is dedicated to summarize research on the effects of labour market contextual factors on labour market participation of older workers (aged 50+) and identify research gaps. While employment participation and the timing of (early) retirement is often modelled as an individual
Cellulose binding domain proteins
Shoseyov, Oded; Shpiegl, Itai; Goldstein, Marc; Doi, Roy
1998-01-01
A cellulose binding domain (CBD) having a high affinity for crystalline cellulose and chitin is disclosed, along with methods for the molecular cloning and recombinant production thereof. Fusion products comprising the CBD and a second protein are likewise described. A wide range of applications are contemplated for both the CBD and the fusion products, including drug delivery, affinity separations, and diagnostic techniques.
DEFF Research Database (Denmark)
Hessellund, Anders
the overall level of abstraction. It does, however, also introduce a new problem of coordinating multiple different languages in a single system. We call this problem the coordination problem. In this thesis, we present the coordination method for domain-specific multimodeling that explicitly targets...
DEFF Research Database (Denmark)
Joshi, Hiren J; Jørgensen, Anja; Schjoldager, Katrine T
2018-01-01
features, which enhances visibility and accessibility of the wealth of glycoproteomic data being generated. The GlycoDomainViewer enables visual exploration of glycoproteomic data, incorporating information from recent N- and O-glycoproteome studies on human and animal cell lines and some organs and body...
The framing of scientific domains
DEFF Research Database (Denmark)
Dam Christensen, Hans
2014-01-01
domains, and UNISIST helps understanding this navigation. Design/methodology/approach The UNISIST models are tentatively applied to the domain of art history at three stages, respectively two modern, partially overlapping domains, as well as an outline of an art historical domain anno c1820...
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
Conduction at domain walls in oxide multiferroics
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.
Target Control in Logical Models Using the Domain of Influence of Nodes.
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.
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.
Evidence of benzenoid domains in nanographenes.
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.
Bugs, Cristhian A; Librelotto, Giovani R; Mombach, José C M
2011-12-22
We introduce a method to analyze the states of regulatory Boolean models that identifies important network states and their biological influence on the global network dynamics. It consists in (1) finding the states of the network that are most frequently visited and (2) the identification of variable and frozen nodes of the network. The method, along with a simulation that includes random features, is applied to the study of stomata closure by abscisic acid (ABA) in A. thaliana proposed by Albert and coworkers. We find that for the case of study, that the dynamics of wild and mutant networks have just two states that are highly visited in their space of states and about a third of all nodes of the wild network are variable while the rest remain frozen in True or False states. This high number of frozen elements explains the low cardinality of the space of states of the wild network. Similar results are observed in the mutant networks. The application of the method allowed us to explain how wild and mutants behave dynamically in the SS and determined an essential feature of the activation of the closure node (representing stomata closure), i.e. its synchronization with the AnionEm node (representing anion efflux at the plasma membrane). The dynamics of this synchronization explains the efficiency reached by the wild and each of the mutant networks. For the biological problem analyzed, our method allows determining how wild and mutant networks differ 'phenotypically'. It shows that the different efficiencies of stomata closure reached among the simulated wild and mutant networks follow from a dynamical behavior of two nodes that are always synchronized. Additionally, we predict that the involvement of the anion efflux at the plasma membrane is crucial for the plant response to ABA. The algorithm used in the simulations is available upon request.
Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing
2017-09-19
The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.
Uezu, Tatsuya; Kiyokawa, Shuji
2016-06-01
We investigate the supervised batch learning of Boolean functions expressed by a two-layer perceptron with a tree-like structure. We adopt continuous weights (spherical model) and the Gibbs algorithm. We study the Parity and And machines and two types of noise, input and output noise, together with the noiseless case. We assume that only the teacher suffers from noise. By using the replica method, we derive the saddle point equations for order parameters under the replica symmetric (RS) ansatz. We study the critical value αC of the loading rate α above which the learning phase exists for cases with and without noise. We find that αC is nonzero for the Parity machine, while it is zero for the And machine. We derive the exponents barβ of order parameters expressed as (α - α C)bar{β} when α is near to αC. Furthermore, in the Parity machine, when noise exists, we find a spin glass solution, in which the overlap between the teacher and student vectors is zero but that between student vectors is nonzero. We perform Markov chain Monte Carlo simulations by simulated annealing and also by exchange Monte Carlo simulations in both machines. In the Parity machine, we study the de Almeida-Thouless stability, and by comparing theoretical and numerical results, we find that there exist parameter regions where the RS solution is unstable, and that the spin glass solution is metastable or unstable. We also study asymptotic learning behavior for large α and derive the exponents hat{β } of order parameters expressed as α - hat{β } when α is large in both machines. By simulated annealing simulations, we confirm these results and conclude that learning takes place for the input noise case with any noise amplitude and for the output noise case when the probability that the teacher's output is reversed is less than one-half.
2006-01-01
This is the version 1.1 of the TENCompetence Domain Model (version 1.0 released at 19-6-2006; version 1.1 at 9-11-2008). It contains several files: a) a pdf with the model description, b) three jpg files with class models (also in the pdf), c) a MagicDraw zip file with the model itself, d) a release
Buhs, Sophia; Nollau, Peter
2017-01-01
Among posttranslational modifications, the phosphorylation of tyrosine residues is a key modification in cell signaling. Because of its biological importance, characterization of the cellular state of tyrosine phosphorylation is of great interest. Based on the unique properties of endogenously expressed SH2 domains recognizing tyrosine phosphorylated signaling proteins with high specificity we have developed an alternative approach, coined SH2 profiling, enabling us to decipher complex patterns of tyrosine phosphorylation in various normal and cancerous tissues. So far, SH2 profiling has largely been applied for the analysis of protein extracts with the limitation that information on spatial distribution and intensity of tyrosine phosphorylation within a tissue is lost. Here, we describe a novel SH2 domain based strategy for differential characterization of the state of tyrosine phosphorylation in formaldehyde-fixed and paraffin-embedded tissues. This approach demonstrates that SH2 domains may serve as very valuable tools for the analysis of the differential state of tyrosine phosphorylation in primary tissues fixed and processed under conditions frequently applied by routine pathology laboratories.
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.
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.
Localization of self-interacting domains within betaretrovirus Gag polyproteins
Czech Academy of Sciences Publication Activity Database
Zábranský, Aleš; Sakalian, M.; Pichová, Iva
2005-01-01
Roč. 332, - (2005), s. 659-666 ISSN 0042-6822 R&D Projects: GA ČR(CZ) GP203/02/P020 Grant - others:NIH(US) R01AI43230 Institutional research plan: CEZ:AV0Z4055905 Keywords : MMTV * M-PMV * betaretrovirus Subject RIV: CE - Biochemistry Impact factor: 3.080, year: 2005
Domain decomposition method for solving elliptic problems in unbounded domains
International Nuclear Information System (INIS)
Khoromskij, B.N.; Mazurkevich, G.E.; Zhidkov, E.P.
1991-01-01
Computational aspects of the box domain decomposition (DD) method for solving boundary value problems in an unbounded domain are discussed. A new variant of the DD-method for elliptic problems in unbounded domains is suggested. It is based on the partitioning of an unbounded domain adapted to the given asymptotic decay of an unknown function at infinity. The comparison of computational expenditures is given for boundary integral method and the suggested DD-algorithm. 29 refs.; 2 figs.; 2 tabs
DEFF Research Database (Denmark)
Sundbo, Donna Isabella Caroline
2013-01-01
are identified and then categorised according to whether they pertain to the food product itself or the production methods and facilities and whether they describe physical or social properties of local food. From this a model with four categories is developed. It is found that properties of the product are more......Recently there has been more focus on food in general and local food in particular. But what is local food? And what are the perceptions of this concept according to theory and to providers and consumers of local food? This article first summarises and compares three different theoretical...... perspectives on local food, namely experience economy, local food systems and what is termed pro-industrialism. These have differing and sometimes opposite conceptualisations and aims for the concept of local food. Using the perspective of experience economy as theoretical background, the concept of local food...
Functional Domain Driven Design
Herrera Guzmán, Sergio
2016-01-01
Las tecnologías están en constante expansión y evolución, diseñando nuevas técnicas para cumplir con su fin. En el desarrollo de software, las herramientas y pautas para la elaboración de productos software constituyen una pieza en constante evolución, necesarias para la toma de decisiones sobre los proyectos a realizar. Uno de los arquetipos para el desarrollo de software es el denominado Domain Driven Design, donde es importante conocer ampliamente el negocio que se desea modelar en form...
Feature-level domain adaptation
DEFF Research Database (Denmark)
Kouw, Wouter M.; Van Der Maaten, Laurens J P; Krijthe, Jesse H.
2016-01-01
-level domain adaptation (flda), that models the dependence between the two domains by means of a feature-level transfer model that is trained to describe the transfer from source to target domain. Subsequently, we train a domain-adapted classifier by minimizing the expected loss under the resulting transfer...... modeled via a dropout distribution, which allows the classiffier to adapt to differences in the marginal probability of features in the source and the target domain. Our experiments on several real-world problems show that flda performs on par with state-of-the-art domainadaptation techniques.......Domain adaptation is the supervised learning setting in which the training and test data are sampled from different distributions: training data is sampled from a source domain, whilst test data is sampled from a target domain. This paper proposes and studies an approach, called feature...
Compensating for Incomplete Domain Knowledge
National Research Council Canada - National Science Library
Scott, Lynn M; Drezner, Steve; Rue, Rachel; Reyes, Jesse
2007-01-01
.... First, many senior leader positions require experience in more than one functional or operational domain, but it is difficult to develop a corps of senior leaders with all the required combinations of domain knowledge...
CSIR Research Space (South Africa)
Gibberd, Jeremy
2016-10-01
Full Text Available Local content refers to materials and products made in a country as opposed those that are imported. There is an increasing interest in the concept of local content as a means of supporting local economies and providing jobs (Belderbos & Sleuwaegen...
DEFF Research Database (Denmark)
Chi, Celestine N.; Bach, Anders; Strømgaard, Kristian
2012-01-01
, for example, are particularly rich in these domains. The general function of PDZ domains is to bring proteins together within the appropriate cellular compartment, thereby facilitating scaffolding, signaling, and trafficking events. The many functions of PDZ domains under normal physiological as well...... as pathological conditions have been reviewed recently. In this review, we focus on the molecular details of how PDZ domains bind their protein ligands and their potential as drug targets in this context....
Summarization by domain ontology navigation
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik
2013-01-01
of the subject. In between these two extremes, conceptual summaries encompass selected concepts derived using background knowledge. We address in this paper an approach where conceptual summaries are provided through a conceptualization as given by an ontology. The ontology guiding the summarization can...... be a simple taxonomy or a generative domain ontology. A domain ontology can be provided by a preanalysis of a domain corpus and can be used to condense improved summaries that better reflects the conceptualization of a given domain....
Wavefield Extrapolation in Pseudo-depth Domain
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
Expansion of protein domain repeats.
Directory of Open Access Journals (Sweden)
Asa K Björklund
2006-08-01
Full Text Available Many proteins, especially in eukaryotes, contain tandem repeats of several domains from the same family. These repeats have a variety of binding properties and are involved in protein-protein interactions as well as binding to other ligands such as DNA and RNA. The rapid expansion of protein domain repeats is assumed to have evolved through internal tandem duplications. However, the exact mechanisms behind these tandem duplications are not well-understood. Here, we have studied the evolution, function, protein structure, gene structure, and phylogenetic distribution of domain repeats. For this purpose we have assigned Pfam-A domain families to 24 proteomes with more sensitive domain assignments in the repeat regions. These assignments confirmed previous findings that eukaryotes, and in particular vertebrates, contain a much higher fraction of proteins with repeats compared with prokaryotes. The internal sequence similarity in each protein revealed that the domain repeats are often expanded through duplications of several domains at a time, while the duplication of one domain is less common. Many of the repeats appear to have been duplicated in the middle of the repeat region. This is in strong contrast to the evolution of other proteins that mainly works through additions of single domains at either terminus. Further, we found that some domain families show distinct duplication patterns, e.g., nebulin domains have mainly been expanded with a unit of seven domains at a time, while duplications of other domain families involve varying numbers of domains. Finally, no common mechanism for the expansion of all repeats could be detected. We found that the duplication patterns show no dependence on the size of the domains. Further, repeat expansion in some families can possibly be explained by shuffling of exons. However, exon shuffling could not have created all repeats.
Energy Technology Data Exchange (ETDEWEB)
Tanguy, B
2001-07-15
Ferritic steels present a transition of the rupture mode which goes progressively of a brittle rupture (cleavage) to a ductile rupture when the temperature increases. The following of the difference of the transition temperature of the PWR vessel steel by the establishment of toughness curves makes of the Charpy test an integrating part of the monitoring of the French PWR reactors. In spite of the advantages which are adapted to it in particular its cost, the Charpy test does not allow to obtain directly a variable which characterizes a crack propagation resistance as for instance the toughness used for qualifying the mechanical integrity of a structure. This work deals with the establishment of the through impact strength-toughness in the transition range of the vessel steel: 16MND5 from a non-empirical approach based on the local approach of the rupture. The brittle rupture is described by the Beremin model (1983), which allows to describe the dispersion inherent in this rupture mode. The description of the brittle fissure is carried out by the GTN model (1984) and by the Rousselier model (1986). This last model has been modified in order to obtain a realistic description of the brittle damage in the case of fast solicitations and of local heating. The method proposed to determine the parameters of the damage models depends only of tests on notched specimens and of the inclusion data of the material. The behaviour is described by an original formulation parametrized in temperature which allows to describe all the tests carried out in this study. Before using this methodology, an experimental study of the behaviour and of the rupture modes of the steel 16MND5 has been carried out. From the toughness tests carried out in quasi-static and dynamical conditions, it has been revealed that this steel does not present important unwedging of its toughness curve due to the velocity effect. In the transition range, local heating of about 150 C have been measured in the root
Energy Technology Data Exchange (ETDEWEB)
Tanguy, B
2001-07-15
Ferritic steels present a transition of the rupture mode which goes progressively of a brittle rupture (cleavage) to a ductile rupture when the temperature increases. The following of the difference of the transition temperature of the PWR vessel steel by the establishment of toughness curves makes of the Charpy test an integrating part of the monitoring of the French PWR reactors. In spite of the advantages which are adapted to it in particular its cost, the Charpy test does not allow to obtain directly a variable which characterizes a crack propagation resistance as for instance the toughness used for qualifying the mechanical integrity of a structure. This work deals with the establishment of the through impact strength-toughness in the transition range of the vessel steel: 16MND5 from a non-empirical approach based on the local approach of the rupture. The brittle rupture is described by the Beremin model (1983), which allows to describe the dispersion inherent in this rupture mode. The description of the brittle fissure is carried out by the GTN model (1984) and by the Rousselier model (1986). This last model has been modified in order to obtain a realistic description of the brittle damage in the case of fast solicitations and of local heating. The method proposed to determine the parameters of the damage models depends only of tests on notched specimens and of the inclusion data of the material. The behaviour is described by an original formulation parametrized in temperature which allows to describe all the tests carried out in this study. Before using this methodology, an experimental study of the behaviour and of the rupture modes of the steel 16MND5 has been carried out. From the toughness tests carried out in quasi-static and dynamical conditions, it has been revealed that this steel does not present important unwedging of its toughness curve due to the velocity effect. In the transition range, local heating of about 150 C have been measured in the root
Time Domain Induced Polarization
DEFF Research Database (Denmark)
Fiandaca, Gianluca; Auken, Esben; Christiansen, Anders Vest
2012-01-01
Time-domain-induced polarization has significantly broadened its field of reference during the last decade, from mineral exploration to environmental geophysics, e.g., for clay and peat identification and landfill characterization. Though, insufficient modeling tools have hitherto limited the use...... of time-domaininduced polarization for wider purposes. For these reasons, a new forward code and inversion algorithm have been developed using the full-time decay of the induced polarization response, together with an accurate description of the transmitter waveform and of the receiver transfer function......, to reconstruct the distribution of the Cole-Cole parameters of the earth. The accurate modeling of the transmitter waveform had a strong influence on the forward response, and we showed that the difference between a solution using a step response and a solution using the accurate modeling often is above 100...
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.
Domain architecture conservation in orthologs
2011-01-01
Background As orthologous proteins are expected to retain function more often than other homologs, they are often used for functional annotation transfer between species. However, ortholog identification methods do not take into account changes in domain architecture, which are likely to modify a protein's function. By domain architecture we refer to the sequential arrangement of domains along a protein sequence. To assess the level of domain architecture conservation among orthologs, we carried out a large-scale study of such events between human and 40 other species spanning the entire evolutionary range. We designed a score to measure domain architecture similarity and used it to analyze differences in domain architecture conservation between orthologs and paralogs relative to the conservation of primary sequence. We also statistically characterized the extents of different types of domain swapping events across pairs of orthologs and paralogs. Results The analysis shows that orthologs exhibit greater domain architecture conservation than paralogous homologs, even when differences in average sequence divergence are compensated for, for homologs that have diverged beyond a certain threshold. We interpret this as an indication of a stronger selective pressure on orthologs than paralogs to retain the domain architecture required for the proteins to perform a specific function. In general, orthologs as well as the closest paralogous homologs have very similar domain architectures, even at large evolutionary separation. The most common domain architecture changes observed in both ortholog and paralog pairs involved insertion/deletion of new domains, while domain shuffling and segment duplication/deletion were very infrequent. Conclusions On the whole, our results support the hypothesis that function conservation between orthologs demands higher domain architecture conservation than other types of homologs, relative to primary sequence conservation. This supports the
Protein domain organisation: adding order
Directory of Open Access Journals (Sweden)
Kummerfeld Sarah K
2009-01-01
Full Text Available Abstract Background Domains are the building blocks of proteins. During evolution, they have been duplicated, fused and recombined, to produce proteins with novel structures and functions. Structural and genome-scale studies have shown that pairs or groups of domains observed together in a protein are almost always found in only one N to C terminal order and are the result of a single recombination event that has been propagated by duplication of the multi-domain unit. Previous studies of domain organisation have used graph theory to represent the co-occurrence of domains within proteins. We build on this approach by adding directionality to the graphs and connecting nodes based on their relative order in the protein. Most of the time, the linear order of domains is conserved. However, using the directed graph representation we have identified non-linear features of domain organization that are over-represented in genomes. Recognising these patterns and unravelling how they have arisen may allow us to understand the functional relationships between domains and understand how the protein repertoire has evolved. Results We identify groups of domains that are not linearly conserved, but instead have been shuffled during evolution so that they occur in multiple different orders. We consider 192 genomes across all three kingdoms of life and use domain and protein annotation to understand their functional significance. To identify these features and assess their statistical significance, we represent the linear order of domains in proteins as a directed graph and apply graph theoretical methods. We describe two higher-order patterns of domain organisation: clusters and bi-directionally associated domain pairs and explore their functional importance and phylogenetic conservation. Conclusion Taking into account the order of domains, we have derived a novel picture of global protein organization. We found that all genomes have a higher than expected
Protein domain organisation: adding order.
Kummerfeld, Sarah K; Teichmann, Sarah A
2009-01-29
Domains are the building blocks of proteins. During evolution, they have been duplicated, fused and recombined, to produce proteins with novel structures and functions. Structural and genome-scale studies have shown that pairs or groups of domains observed together in a protein are almost always found in only one N to C terminal order and are the result of a single recombination event that has been propagated by duplication of the multi-domain unit. Previous studies of domain organisation have used graph theory to represent the co-occurrence of domains within proteins. We build on this approach by adding directionality to the graphs and connecting nodes based on their relative order in the protein. Most of the time, the linear order of domains is conserved. However, using the directed graph representation we have identified non-linear features of domain organization that are over-represented in genomes. Recognising these patterns and unravelling how they have arisen may allow us to understand the functional relationships between domains and understand how the protein repertoire has evolved. We identify groups of domains that are not linearly conserved, but instead have been shuffled during evolution so that they occur in multiple different orders. We consider 192 genomes across all three kingdoms of life and use domain and protein annotation to understand their functional significance. To identify these features and assess their statistical significance, we represent the linear order of domains in proteins as a directed graph and apply graph theoretical methods. We describe two higher-order patterns of domain organisation: clusters and bi-directionally associated domain pairs and explore their functional importance and phylogenetic conservation. Taking into account the order of domains, we have derived a novel picture of global protein organization. We found that all genomes have a higher than expected degree of clustering and more domain pairs in forward and
Prediction Reweighting for Domain Adaptation.
Shuang Li; Shiji Song; Gao Huang
2017-07-01
There are plenty of classification methods that perform well when training and testing data are drawn from the same distribution. However, in real applications, this condition may be violated, which causes degradation of classification accuracy. Domain adaptation is an effective approach to address this problem. In this paper, we propose a general domain adaptation framework from the perspective of prediction reweighting, from which a novel approach is derived. Different from the major domain adaptation methods, our idea is to reweight predictions of the training classifier on testing data according to their signed distance to the domain separator, which is a classifier that distinguishes training data (from source domain) and testing data (from target domain). We then propagate the labels of target instances with larger weights to ones with smaller weights by introducing a manifold regularization method. It can be proved that our reweighting scheme effectively brings the source and target domains closer to each other in an appropriate sense, such that classification in target domain becomes easier. The proposed method can be implemented efficiently by a simple two-stage algorithm, and the target classifier has a closed-form solution. The effectiveness of our approach is verified by the experiments on artificial datasets and two standard benchmarks, a visual object recognition task and a cross-domain sentiment analysis of text. Experimental results demonstrate that our method is competitive with the state-of-the-art domain adaptation algorithms.
Stochastic Pseudo-Boolean Optimization
2011-07-31
16 polyominoes. Given this notation, we provide the following nonlinear mixed integer programming (MIP) formulation of the exact tiling problem: PNL ...ri, cj ≥ 0 ∀ i, j, p, q, k. 8.3.3 Linear Set Partitioning Formulation We use value disjunctions to reformulate PNL as a linear MIP that can be
Generalized Boolean Functions as Combiners
2017-06-01
of large runs of ones [6]. The fifth test is the Binary Rank Matrix test. This test looks at the rank of disjoint sub- matrices of the entire sequence...matrices to be of size 32x32. The sub-matrices are filled in row by row from the original 17 sequence. The rank for each sub- matrix is then computed...amLeng t h : 57 #LFSRS 58 f o r i in range ( 0 , l en ( l f s r s ) ) : 59 x i = reduce ( lambda x , y : x^y , map ( lambda x : l f s r s [ i
Exploratory analysis regarding the domain definitions for computer based analytical models
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.
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.
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)
Domain engineering of the metastable domains in the 4f-uniaxial-ferromagnet CeRu2Ga2B
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.
Graham, Jesse; Nosek, Brian A.; Haidt, Jonathan; Iyer, Ravi; Koleva, Spassena; Ditto, Peter H.
2010-01-01
The moral domain is broader than the empathy and justice concerns assessed by existing measures of moral competence, and it is not just a subset of the values assessed by value inventories. To fill the need for reliable and theoretically-grounded measurement of the full range of moral concerns, we developed the Moral Foundations Questionnaire (MFQ) based on a theoretical model of five universally available (but variably developed) sets of moral intuitions: Harm/care, Fairness/reciprocity, Ingroup/loyalty, Authority/respect, and Purity/sanctity. We present evidence for the internal and external validity of the scale and the model, and in doing so present new findings about morality: 1. Comparative model fitting of confirmatory factor analyses provides empirical justification for a five-factor structure of moral concerns. 2. Convergent/discriminant validity evidence suggests that moral concerns predict personality features and social group attitudes not previously considered morally relevant. 3. We establish pragmatic validity of the measure in providing new knowledge and research opportunities concerning demographic and cultural differences in moral intuitions. These analyses provide evidence for the usefulness of Moral Foundations Theory in simultaneously increasing the scope and sharpening the resolution of psychological views of morality. PMID:21244182
Topological domain walls in helimagnets
Schoenherr, P.; Müller, J.; Köhler, L.; Rosch, A.; Kanazawa, N.; Tokura, Y.; Garst, M.; Meier, D.
2018-05-01
Domain walls naturally arise whenever a symmetry is spontaneously broken. They interconnect regions with different realizations of the broken symmetry, promoting structure formation from cosmological length scales to the atomic level1,2. In ferroelectric and ferromagnetic materials, domain walls with unique functionalities emerge, holding great promise for nanoelectronics and spintronics applications3-5. These walls are usually of Ising, Bloch or Néel type and separate homogeneously ordered domains. Here we demonstrate that a wide variety of new domain walls occurs in the presence of spatially modulated domain states. Using magnetic force microscopy and micromagnetic simulations, we show three fundamental classes of domain walls to arise in the near-room-temperature helimagnet iron germanium. In contrast to conventional ferroics, the domain walls exhibit a well-defined inner structure, which—analogous to cholesteric liquid crystals—consists of topological disclination and dislocation defects. Similar to the magnetic skyrmions that form in the same material6,7, the domain walls can carry a finite topological charge, permitting an efficient coupling to spin currents and contributions to a topological Hall effect. Our study establishes a new family of magnetic nano-objects with non-trivial topology, opening the door to innovative device concepts based on helimagnetic domain walls.
International Nuclear Information System (INIS)
Ma, M.; Lee, P.A.
1985-01-01
We study the effects of Anderson localization on superconductivity by using a Bardeen-Cooper-Schrieffer (BCS)-type trial wave function which pairs electrons in exact time-reversed eigenstates of the single-particle Hamiltonian. Within this approximation, and neglecting localization effects on the effective Coulomb repulsion and the electron-phonon coupling, we find that superconductivity persists below the mobility edge. In fact, Anderson's theorem is valid in the localized phase as long as rhoΔ 0 L/sup d/ > 1 (rho is the density of states averaged over +- Δ 0 of the Fermi energy, Δ 0 the BCS gap parameter, and L the localization length). Hence the gap order parameter Δ(r) remains uniform in space at the BCS value Δ 0 . The superfluid density and response to electromagnetic perturbations, however, show marked differences from the ''dirty superconductor'' regime. For rhoΔ 0 L/sup d/ < 1, Δ(r) fluctuates spatially and eventually drops to zero. In the limit when states are site localized, the system crosses over into the ''Anderson negative-U glass.'' Considerations beyond the trial wave-function approximation will speed up the destruction of superconductivity. The superconductor formed from localized states has the property that its quasiparticle excitations are also localized. Such excitations can be probed by observing the normal current in a tunneling junction
The BRCT domain is a phospho-protein binding domain.
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.
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
Mesencephalic basolateral domain specification is dependent on Sonic Hedgehog
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
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.
Epitope mapping of the domains of human angiotensin converting enzyme.
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.
... How Is Localized Scleroderma Diagnosed? Doctors who are familiar with scleroderma, or who are experts at examining ... systemic treatment with a medication or other treatment interventions (for example, ultraviolet light), are reserved for more ...
Resource Unavailability (RU) Per Domain Behavior
Karagiannis, Georgios; Westberg, L.; Bader, A.; Tschofenig, Hannes; Tschofenig, H.
2006-01-01
This draft specifies a Per Domain Behavior that provides the ability to Diffserv nodes located outside Diffserv domain(s), e.g., receiver or other Diffserv enabled router to detect when the resources provided by the Diffserv domain(s) are not available. The unavailability of resources in the domain
Taxonomies of Educational Objective Domain
Eman Ghanem Nayef; Nik Rosila Nik Yaacob; Hairul Nizam Ismail
2013-01-01
This paper highlights an effort to study the educational objective domain taxonomies including Bloom’s taxonomy, Lorin Anderson’s taxonomy, and Wilson’s taxonomy. In this study a comparison among these three taxonomies have been done. Results show that Bloom’s taxonomy is more suitable as an analysis tool to Educational Objective domain.
Texture of lipid bilayer domains
DEFF Research Database (Denmark)
Jensen, Uffe Bernchou; Brewer, Jonathan R.; Midtiby, Henrik Skov
2009-01-01
We investigate the texture of gel (g) domains in binary lipid membranes composed of the phospholipids DPPC and DOPC. Lateral organization of lipid bilayer membranes is a topic of fundamental and biological importance. Whereas questions related to size and composition of fluid membrane domain...... are well studied, the possibility of texture in gel domains has so far not been examined. When using polarized light for two-photon excitation of the fluorescent lipid probe Laurdan, the emission intensity is highly sensitive to the angle between the polarization and the tilt orientation of lipid acyl...... chains. By imaging the intensity variations as a function of the polarization angle, we map the lateral variations of the lipid tilt within domains. Results reveal that gel domains are composed of subdomains with different lipid tilt directions. We have applied a Fourier decomposition method...
Polar Domain Discovery with Sparkler
Duerr, R.; Khalsa, S. J. S.; Mattmann, C. A.; Ottilingam, N. K.; Singh, K.; Lopez, L. A.
2017-12-01
The scientific web is vast and ever growing. It encompasses millions of textual, scientific and multimedia documents describing research in a multitude of scientific streams. Most of these documents are hidden behind forms which require user action to retrieve and thus can't be directly accessed by content crawlers. These documents are hosted on web servers across the world, most often on outdated hardware and network infrastructure. Hence it is difficult and time-consuming to aggregate documents from the scientific web, especially those relevant to a specific domain. Thus generating meaningful domain-specific insights is currently difficult. We present an automated discovery system (Figure 1) using Sparkler, an open-source, extensible, horizontally scalable crawler which facilitates high throughput and focused crawling of documents pertinent to a particular domain such as information about polar regions. With this set of highly domain relevant documents, we show that it is possible to answer analytical questions about that domain. Our domain discovery algorithm leverages prior domain knowledge to reach out to commercial/scientific search engines to generate seed URLs. Subject matter experts then annotate these seed URLs manually on a scale from highly relevant to irrelevant. We leverage this annotated dataset to train a machine learning model which predicts the `domain relevance' of a given document. We extend Sparkler with this model to focus crawling on documents relevant to that domain. Sparkler avoids disruption of service by 1) partitioning URLs by hostname such that every node gets a different host to crawl and by 2) inserting delays between subsequent requests. With an NSF-funded supercomputer Wrangler, we scaled our domain discovery pipeline to crawl about 200k polar specific documents from the scientific web, within a day.
Domain shape instabilities and dendrite domain growth in uniaxial ferroelectrics
Shur, Vladimir Ya.; Akhmatkhanov, Andrey R.
2018-01-01
The effects of domain wall shape instabilities and the formation of nanodomains in front of moving walls obtained in various uniaxial ferroelectrics are discussed. Special attention is paid to the formation of self-assembled nanoscale and dendrite domain structures under highly non-equilibrium switching conditions. All obtained results are considered in the framework of the unified kinetic approach to domain structure evolution based on the analogy with first-order phase transformation. This article is part of the theme issue `From atomistic interfaces to dendritic patterns'.
Separated matter and antimatter domains with vanishing domain walls
Energy Technology Data Exchange (ETDEWEB)
Dolgov, A.D.; Godunov, S.I.; Rudenko, A.S.; Tkachev, I.I., E-mail: dolgov@fe.infn.it, E-mail: sgodunov@itep.ru, E-mail: a.s.rudenko@inp.nsk.su, E-mail: tkachev@ms2.inr.ac.ru [Physics Department and Laboratory of Cosmology and Elementary Particle Physics, Novosibirsk State University, Pirogova st. 2, Novosibirsk, 630090 (Russian Federation)
2015-10-01
We present a model of spontaneous (or dynamical) C and CP violation where it is possible to generate domains of matter and antimatter separated by cosmologically large distances. Such C(CP) violation existed only in the early universe and later it disappeared with the only trace of generated baryonic and/or antibaryonic domains. So the problem of domain walls in this model does not exist. These features are achieved through a postulated form of interaction between inflaton and a new scalar field, realizing short time C(CP) violation.
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.
Directory of Open Access Journals (Sweden)
Stephen Hastings-King
2010-03-01
Full Text Available A locals collection is a set of parameters that are used to delimit data-mining operations. This piece uses a collection of locals from around Essex Massachusetts to shape and delimit an interrogation of post-reality in contemporary America. It explores the notion of crisis, the possibility of a crisis of empire that may or may not emerge in a media-space that does not allow crisis of empire to be mentioned and relations this maybe-crisis to the various levels of economic dysfunction that have become evident since late 2008. But mostly this piece explores ways in which particular stories about particular people do and do not link/link to these larger-scale narratives. This is the first of a potential series of locals collections that will mine the American post-real.
Ferroelectric negative capacitance domain dynamics
Hoffmann, Michael; Khan, Asif Islam; Serrao, Claudy; Lu, Zhongyuan; Salahuddin, Sayeef; Pešić, Milan; Slesazeck, Stefan; Schroeder, Uwe; Mikolajick, Thomas
2018-05-01
Transient negative capacitance effects in epitaxial ferroelectric Pb(Zr0.2Ti0.8)O3 capacitors are investigated with a focus on the dynamical switching behavior governed by domain nucleation and growth. Voltage pulses are applied to a series connection of the ferroelectric capacitor and a resistor to directly measure the ferroelectric negative capacitance during switching. A time-dependent Ginzburg-Landau approach is used to investigate the underlying domain dynamics. The transient negative capacitance is shown to originate from reverse domain nucleation and unrestricted domain growth. However, with the onset of domain coalescence, the capacitance becomes positive again. The persistence of the negative capacitance state is therefore limited by the speed of domain wall motion. By changing the applied electric field, capacitor area or external resistance, this domain wall velocity can be varied predictably over several orders of magnitude. Additionally, detailed insights into the intrinsic material properties of the ferroelectric are obtainable through these measurements. A new method for reliable extraction of the average negative capacitance of the ferroelectric is presented. Furthermore, a simple analytical model is developed, which accurately describes the negative capacitance transient time as a function of the material properties and the experimental boundary conditions.
PREFACE: Domain wall dynamics in nanostructures Domain wall dynamics in nanostructures
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
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.
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.
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.
A Novel Transfer Learning Method Based on Common Space Mapping and Weighted Domain Matching
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.
A Novel Transfer Learning Method Based on Common Space Mapping and Weighted Domain Matching
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.
Wavefield extrapolation in pseudodepth domain
Ma, Xuxin
2013-02-01
Wavefields are commonly computed in the Cartesian coordinate frame. Its efficiency is inherently limited due to spatial oversampling in deep layers, where the velocity is high and wavelengths are long. To alleviate this computational waste due to uneven wavelength sampling, we convert the vertical axis of the conventional domain from depth to vertical time or pseudodepth. This creates a nonorthognal Riemannian coordinate system. Isotropic and anisotropic wavefields can be extrapolated in the new coordinate frame with improved efficiency and good consistency with Cartesian domain extrapolation results. Prestack depth migrations are also evaluated based on the wavefield extrapolation in the pseudodepth domain.© 2013 Society of Exploration Geophysicists. All rights reserved.
Astrocyte mega-domain hypothesis of the autistic savantism.
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.
Image-domain full waveform inversion: Field data example
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.
Image-domain full waveform inversion: Field data example
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.
Non-local boxes and their implementation in Minecraft
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.
Energy Technology Data Exchange (ETDEWEB)
Anon.
1984-12-15
From 3-6 September the First International Workshop on Local Equilibrium in Strong Interaction Physics took place in Bad-Honnef at the Physics Centre of the German Physical Society. A number of talks covered the experimental and theoretical investigation of the 'hotspots' effect, both in high energy particle physics and in intermediate energy nuclear physics.
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...
Physics education students’ cognitive and affective domains toward ecological phenomena
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.
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)
Topology Based Domain Search (TBDS)
National Research Council Canada - National Science Library
Manning, William
2002-01-01
This effort will explore radical changes in the way Domain Name System (DNS) is used by endpoints in a network to improve the resilience of the endpoint and its applications in the face of dynamically changing infrastructure topology...
Domain Discretization and Circle Packings
DEFF Research Database (Denmark)
Dias, Kealey
A circle packing is a configuration of circles which are tangent with one another in a prescribed pattern determined by a combinatorial triangulation, where the configuration fills a planar domain or a two-dimensional surface. The vertices in the triangulation correspond to centers of circles...... to domain discretization problems such as triangulation and unstructured mesh generation techniques. We wish to ask ourselves the question: given a cloud of points in the plane (we restrict ourselves to planar domains), is it possible to construct a circle packing preserving the positions of the vertices...... and constrained meshes having predefined vertices as constraints. A standard method of two-dimensional mesh generation involves conformal mapping of the surface or domain to standardized shapes, such as a disk. Since circle packing is a new technique for constructing discrete conformal mappings, it is possible...
Heliborne time domain electromagnetic system
International Nuclear Information System (INIS)
Bhattacharya, S.
2009-01-01
Atomic Minerals Directorate (AMD), are using heliborne and ground time domain electromagnetic (TDEM) system for the exploration of deep seated unconformity type uranium deposits. Uranium has been explored in various parts of the world like Athabasca basin using time domain electromagnetic system. AMD has identified some areas in India where such deposits are available. Apart from uranium exploration, the TDEM systems are used for the exploration of deep seated minerals like diamonds. Bhabha Atomic Research Centre (BARC) is involved in the indigenous design of the heliborne time domain system since this system is useful for DAE and also it has a scope of wide application. In this paper we discuss about the principle of time domain electromagnetic systems, their capabilities and the development and problems of such system for various other mineral exploration. (author)
Anisotropy of domain wall resistance
Viret; Samson; Warin; Marty; Ott; Sondergard; Klein; Fermon
2000-10-30
The resistive effect of domain walls in FePd films with perpendicular anisotropy was studied experimentally as a function of field and temperature. The films were grown directly on MgO substrates, which induces an unusual virgin magnetic configuration composed of 60 nm wide parallel stripe domains. This allowed us to carry out the first measurements of the anisotropy of domain wall resistivity in the two configurations of current perpendicular and parallel to the walls. At 18 K, we find 8.2% and 1.3% for the domain wall magnetoresistance normalized to the wall width (8 nm) in these two respective configurations. These values are consistent with the predictions of Levy and Zhang.
2016-05-26
Overload From the previous discussion, cognitive maneuver seeks to degrade the enemy’s capacity for...in all domains, the ability to maneuver from the air domain in the cognitive sense, comes primarily from air power’s unique ability to overload the... cognitive maneuver mechanisms developed in the 1980s as part of broader maneuver warfare theory. The result is a proposed definition of maneuver from
Ferroelectric Negative Capacitance Domain Dynamics
Hoffmann, Michael; Khan, Asif Islam; Serrao, Claudy; Lu, Zhongyuan; Salahuddin, Sayeef; Pešić, Milan; Slesazeck, Stefan; Schroeder, Uwe; Mikolajick, Thomas
2017-01-01
Transient negative capacitance effects in epitaxial ferroelectric Pb(Zr$_{0.2}$Ti$_{0.8}$)O$_3$ capacitors are investigated with a focus on the dynamical switching behavior governed by domain nucleation and growth. Voltage pulses are applied to a series connection of the ferroelectric capacitor and a resistor to directly measure the ferroelectric negative capacitance during switching. A time-dependent Ginzburg-Landau approach is used to investigate the underlying domain dynamics. The transien...
Gravity and domain wall problem
International Nuclear Information System (INIS)
Rai, B.; Senjanovic, G.
1992-11-01
It is well known that the spontaneous breaking of discrete symmetries may lead to conflict with big-bang cosmology. This is due to formation of domain walls which give unacceptable contribution to the energy density of the universe. On the other hand, it is expected that gravity breaks global symmetries explicitly. In this work we propose that this could provide a natural solution to the domain-wall problem. (author). 17 refs
Incompleteness in the finite domain
Czech Academy of Sciences Publication Activity Database
Pudlák, Pavel
2017-01-01
Roč. 23, č. 4 (2017), s. 405-441 ISSN 1079-8986 EU Projects: European Commission(XE) 339691 - FEALORA Institutional support: RVO:67985840 Keywords : finite domain Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.742, year: 2016 https://www.cambridge.org/core/journals/bulletin-of-symbolic-logic/article/incompleteness-in-the-finite-domain/D239B1761A73DCA534A4805A76D81C76
Is the isolated ligand binding domain a good model of the domain in the native receptor?
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.
DEFF Research Database (Denmark)
de Souza e Silva, Adriana Araujo; Gordon, Eric
Provides an introduction to the new theory of Net Locality and the profound effect on individuals and societies when everything is located or locatable. Describes net locality as an emerging form of location awareness central to all aspects of digital media, from mobile phones, to Google Maps......, to location-based social networks and games, such as Foursquare and facebook. Warns of the threats these technologies, such as data surveillance, present to our sense of privacy, while also outlining the opportunities for pro-social developments. Provides a theory of the web in the context of the history...... of emerging technologies, from GeoCities to GPS, Wi-Fi, Wiki Me, and Google Android....
International Nuclear Information System (INIS)
Merkulov, S.A.
1987-01-01
Geometry of local supertwistors is investigated. It is proved that the Yang-Mills equations for the introduced ansatz for supertwistor connection are equivalent to free bach equations, describing the dynamics of N=1 conformal supergravity. Analogous interpretation of the dynamics of N=1 conformal supergravity coupled to a vector superfield is proposed. It is proved that any complex conformally right or left flat superspace automatically satisfies the Bach equations
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
Intracellular localization of Arabidopsis sulfurtransferases.
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.
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan; Kolmbauer, Michael; Langer, Ulrich
2010-01-01
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan
2010-10-05
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Thermomagnetic Stability in Pseudo Single Domain Grains
Nagy, Lesleis; Williams, Wyn; Muxworthy, Adrian; Fabian, Karl; Conbhuí, Pádraig Ó.
2016-04-01
The reliability of paleomagnetic remanences are well understood for fine grains of magnetite that are single-domain (SD, uniformly magnetized). In particular Néel's theory [1] outlined the thermal energies required to block and unblock magnetic remanences. This lead to determination of thermal stability for magnetization in fine grains as outlined in Pullaiah et. al. [2] and a comprehensive understanding of SD paleomagnetic recordings. It has been known for some time that single domain magnetite is possible only in the grain size range 30 - 80nm, which may only account for a small fraction of the grain size distribution in any rock sample. Indeed rocks are often dominated by grains in the pseudo single domain (PSD) size range, at approximately 80 - 1000nm. Toward the top end of this range multi-domain features begin to dominate. In order to determine thermomagnetic stability in PSD grains we need to identify the energy barriers between all possible pairs of local energy minima (LEM) domain states as a function of both temperature and grain size. We have attempted to do this using the nudged elastic band (NEB) method [3] which searches for minimum energy paths between any given pair of LEM states. Using this technique we have determined, for the first time, complete thermomagnetic stability curves for PSD magnetite. The work presented is at a preliminary stage. However it can be shown that PSD grains of magnetite with simple geometries (e.g. cubes or cuboctahedra) have very few low energy transition paths and the stability is likely to be similar to that observed for SD grains (as expected form experimental observations). The results will provide a basis for a much more rigorous understanding of the fidelity of paleomagnetic signals in assemblages of PSD grains and their ability to retain ancient recordings of the geomagnetic field. References: [1] Néel, Louis. "Théorie du traînage magnétique des ferromagnétiques en grains fins avec applications aux terres
Different domains are critical for oligomerization compatibility of different connexins
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
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.
International Nuclear Information System (INIS)
Merkulov, S.A.
1987-01-01
The geometry of local supertwistors is investigated. An ansatz on the form of the supertwistor superconnection is introduced. Because of this restriction on the form of such a superconnection the Yang-Mills equations for the superconnection turn out to be equivalent to the free Bach equations describing the dynamics of simple conformal supergravity. It is shown that the equations of motion of conformal supergravity interacting with a vector superfield admit an analogous interpretation. It is proved that an arbitrary conformally right-flat or left-flat superspace is automatically a solution of the Bach equations
Domain walls at finite temperature
International Nuclear Information System (INIS)
Carvalho, C.A. de; Marques, G.C.; Silva, A.J. da; Ventura, I.
1983-08-01
It is suggested that the phase transition of lambda phi 4 theory as a function of temperature coincides with the spontaneous appearance of domain walls. Based on one-loop calculations, T sub(c) = 4M/√ lambda is estimated as the temperature for these domains to because energetically favored, to be compared with T sub(c) = 4.9M/√ lambda from effective potential calculations (which are performed directly in the broken phase). Domain walls, as well as other Types of fluctuations, disorder the system above T sub(c), leading to =0. The critical exponent for the specific heat above T sub(c) is computed; and α=2/3 + 0 (√ lambda) is obtained. (Author) [pt
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...
A Method to Identify Nucleolus-Associated Chromatin Domains (NADs).
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.
Domain similarity based orthology detection.
Bitard-Feildel, Tristan; Kemena, Carsten; Greenwood, Jenny M; Bornberg-Bauer, Erich
2015-05-13
Orthologous protein detection software mostly uses pairwise comparisons of amino-acid sequences to assert whether two proteins are orthologous or not. Accordingly, when the number of sequences for comparison increases, the number of comparisons to compute grows in a quadratic order. A current challenge of bioinformatic research, especially when taking into account the increasing number of sequenced organisms available, is to make this ever-growing number of comparisons computationally feasible in a reasonable amount of time. We propose to speed up the detection of orthologous proteins by using strings of domains to characterize the proteins. We present two new protein similarity measures, a cosine and a maximal weight matching score based on domain content similarity, and new software, named porthoDom. The qualities of the cosine and the maximal weight matching similarity measures are compared against curated datasets. The measures show that domain content similarities are able to correctly group proteins into their families. Accordingly, the cosine similarity measure is used inside porthoDom, the wrapper developed for proteinortho. porthoDom makes use of domain content similarity measures to group proteins together before searching for orthologs. By using domains instead of amino acid sequences, the reduction of the search space decreases the computational complexity of an all-against-all sequence comparison. We demonstrate that representing and comparing proteins as strings of discrete domains, i.e. as a concatenation of their unique identifiers, allows a drastic simplification of search space. porthoDom has the advantage of speeding up orthology detection while maintaining a degree of accuracy similar to proteinortho. The implementation of porthoDom is released using python and C++ languages and is available under the GNU GPL licence 3 at http://www.bornberglab.org/pages/porthoda .
DEFF Research Database (Denmark)
Cuadrado, Daniel Lázaro; Ravn, Anders Peter; Koch, Peter
2005-01-01
The purpose of the Distributed-SDF domain for Ptolemy II is to allow distributed simulation of SDF models. It builds on top of the existing SDF domain by extending it. From the user’s point of view, using the Distributed-SDF director is sufficient to run the distributed version. It provides optio...... distributed nature. First of all, known memory bounds of the JVM can be overcome. Second, it yields smaller simulation times, mainly for models with high degree of parallelism and granularity....
The time domain triple probe method
International Nuclear Information System (INIS)
Meier, M.A.; Hallock, G.A.; Tsui, H.Y.W.; Bengtson, R.D.
1994-01-01
A new Langmuir probe technique based on the triple probe method is being developed to provide simultaneous measurement of plasma temperature, potential, and density with the temporal and spatial resolution required to accurately characterize plasma turbulence. When the conventional triple probe method is used in an inhomogeneous plasma, local differences in the plasma measured at each probe introduce significant error in the estimation of turbulence parameters. The Time Domain Triple Probe method (TDTP) uses high speed switching of Langmuir probe potential, rather than spatially separated probes, to gather the triple probe information thus avoiding these errors. Analysis indicates that plasma response times and recent electronics technology meet the requirements to implement the TDTP method. Data reduction techniques of TDTP data are to include linear and higher order correlation analysis to estimate fluctuation induced particle and thermal transport, as well as energy relationships between temperature, density, and potential fluctuations
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.
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.
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.
Stress induced magnetic-domain evolution in magnetoelectric composites
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.
Learning processes across knowledge domains
DEFF Research Database (Denmark)
Hall-Andersen, Lene Bjerg; Broberg, Ole
2014-01-01
Purpose - The purpose of this paper is to shed light on the problematics of learning across knowledge boundaries in organizational settings. The paper specifically explores learning processes that emerge, when a new knowledge domain is introduced into an existing organizational practice with the ...
Ubiquitin domain proteins in disease
DEFF Research Database (Denmark)
Klausen, Louise Kjær; Schulze, Andrea; Seeger, Michael
2007-01-01
The human genome encodes several ubiquitin-like (UBL) domain proteins (UDPs). Members of this protein family are involved in a variety of cellular functions and many are connected to the ubiquitin proteasome system, an essential pathway for protein degradation in eukaryotic cells. Despite...... and cancer. Publication history: Republished from Current BioData's Targeted Proteins database (TPdb; http://www.targetedproteinsdb.com)....
Cellulose binding domain fusion proteins
Shoseyov, Oded; Shpiegl, Itai; Goldstein, Marc A.; Doi, Roy H.
1998-01-01
A cellulose binding domain (CBD) having a high affinity for crystalline cellulose and chitin is disclosed, along with methods for the molecular cloning and recombinant production thereof. Fusion products comprising the CBD and a second protein are likewise described. A wide range of applications are contemplated for both the CBD and the fusion products, including drug delivery, affinity separations, and diagnostic techniques.
Gradability in the nominal domain
Constantinescu, Camelia
2011-01-01
This dissertation investigates whether and how gradability is manifested in the nominal domain, as well as the implications this could have for theories of the representation of gradability. It is shown that the various gradability diagnostics proposed in the literature not only yield different
The theory of syntactic domains
Kracht, M.
In this essay we develop a mathematical theory of syntactic domains with special attention to the theory of government and binding. Starting from an intrinsic characterization of command relations as defined in [Ba 90] we determine the structure of the distributive lattice of command relations.
Impedance models in time domain
Rienstra, S.W.
2005-01-01
Necessary conditions for an impedance function are derived. Methods available in the literature are discussed. A format with recipe is proposed for an exact impedance condition in time domain on a time grid, based on the Helmholtz resonator model. An explicit solution is given of a pulse reflecting
Compiling Dictionaries Using Semantic Domains*
Directory of Open Access Journals (Sweden)
Ronald Moe
2011-10-01
Full Text Available
Abstract: The task of providing dictionaries for all the world's languages is prodigious, re-quiring efficient techniques. The text corpus method cannot be used for minority languages lacking texts. To meet the need, the author has constructed a list of 1 600 semantic domains, which he has successfully used to collect words. In a workshop setting, a group of speakers can collect as many as 17 000 words in ten days. This method results in a classified word list that can be efficiently expanded into a full dictionary. The method works because the mental lexicon is a giant web or-ganized around key concepts. A semantic domain can be defined as an important concept together with the words directly related to it by lexical relations. A person can utilize the mental web to quickly jump from word to word within a domain. The author is developing a template for each domain to aid in collecting words and in de-scribing their semantics. Investigating semantics within the context of a domain yields many in-sights. The method permits the production of both alphabetically and semantically organized dic-tionaries. The list of domains is intended to be universal in scope and applicability. Perhaps due to universals of human experience and universals of linguistic competence, there are striking simi-larities in various lists of semantic domains developed for languages around the world. Using a standardized list of domains to classify multiple dictionaries opens up possibilities for cross-lin-guistic research into semantic and lexical universals.
Keywords: SEMANTIC DOMAINS, SEMANTIC FIELDS, SEMANTIC CATEGORIES, LEX-ICAL RELATIONS, SEMANTIC PRIMITIVES, DOMAIN TEMPLATES, MENTAL LEXICON, SEMANTIC UNIVERSALS, MINORITY LANGUAGES, LEXICOGRAPHY
Opsomming: Samestelling van woordeboeke deur gebruikmaking van se-mantiese domeine. Die taak van die voorsiening van woordeboeke aan al die tale van die wêreld is geweldig en vereis doeltreffende tegnieke. Die
An ontological approach to domain engineering
Falbo, R.A.; Guizzardi, G.; Duarte, K.
2002-01-01
Domain engineering aims to support systematic reuse, focusing on modeling common knowledge in a problem domain. Ontologies have also been pointed as holding great promise for software reuse. In this paper, we present ODE (Ontology-based Domain Engineering), an ontological approach for domain
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.
Inferring Domain-Domain Interactions from Protein-Protein Interactions with Formal Concept Analysis
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