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...
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
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...
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
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.
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...
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.
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.
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
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
Boolean-Valued Belief Functions
Czech Academy of Sciences Publication Activity Database
Kramosil, Ivan
2002-01-01
Roč. 31, č. 2 (2002), s. 153-181 ISSN 0308-1079 R&D Projects: GA AV ČR IAA1030803 Institutional research plan: AV0Z1030915 Keywords : Dempster-Schafer theory * Boolean algebra Subject RIV: BA - General Mathematics Impact factor: 0.241, year: 2002
Information encryption systems based on Boolean functions
Directory of Open Access Journals (Sweden)
Aureliu Zgureanu
2011-02-01
Full Text Available An information encryption system based on Boolean functions is proposed. Information processing is done using multidimensional matrices, performing logical operations with these matrices. At the basis of ensuring high level security of the system the complexity of solving the problem of building systems of Boolean functions that depend on many variables (tens and hundreds is set. Such systems represent the private key. It varies both during the encryption and decryption of information, and during the transition from one message to another.
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.
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.
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.
Counting with symmetric functions
Mendes, Anthony
2015-01-01
This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas. The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuth algorithm and a method for proving Pólya’s enu...
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.
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
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.
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
Directory of Open Access Journals (Sweden)
Giuseppe Dattoli
1996-05-01
Full Text Available q analog of bessel functions, symmetric under the interchange of q and q^ −1 are introduced. The definition is based on the generating function realized as product of symmetric q-exponential functions with appropriate arguments. Symmetric q-Bessel function are shown to satisfy various identities as well as second-order q-differential equations, which in the limit q → 1 reproduce those obeyed by the usual cylindrical Bessel functions. A brief discussion on the possible algebraic setting for symmetric q-Bessel functions is also provided.
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.
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.
Interpolation of the discrete logarithm in a finite field of characteristic two by Boolean functions
DEFF Research Database (Denmark)
Brandstaetter, Nina; Lange, Tanja; Winterhof, Arne
2005-01-01
We obtain bounds on degree, weight, and the maximal Fourier coefficient of Boolean functions interpolating the discrete logarithm in finite fields of characteristic two. These bounds complement earlier results for finite fields of odd characteristic....
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization
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.
Symmetric functions and orthogonal polynomials
Macdonald, I G
1997-01-01
One of the most classical areas of algebra, the theory of symmetric functions and orthogonal polynomials has long been known to be connected to combinatorics, representation theory, and other branches of mathematics. Written by perhaps the most famous author on the topic, this volume explains some of the current developments regarding these connections. It is based on lectures presented by the author at Rutgers University. Specifically, he gives recent results on orthogonal polynomials associated with affine Hecke algebras, surveying the proofs of certain famous combinatorial conjectures.
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.
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.
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
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.
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.
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.
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.
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.
Further Results on Constructions of Generalized Bent Boolean Functions
2016-03-01
China; 2Naval Postgraduate School, Applied Mathematics Department, Monterey, CA 93943, USA; 3Science and Technology on Communication Security...in 1976 as an interesting combinatorial object with the important property of having op- timal nonlinearity [1]. Since bent functions have many...77–94 10 Zhao Y, Li H L. On bent functions with some symmet- ric properties. Discret Appl Math, 2006, 154: 2537– 2543
On bent and semi-bent quadratic Boolean functions
DEFF Research Database (Denmark)
Charpin, P.; Pasalic, Enes; Tavernier, C.
2005-01-01
correlation and high nonlinearity. We say that such a sequence is generated by a semi-bent function. Some new families of such function, represented by f(x) = Sigma(i=1)(n-1/2) c(i)Tr(x(2t+1)), n odd and c(i) is an element of F-2, have recently (2002) been introduced by Khoo et al. We first generalize......The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross...... their results to even n. We further investigate the conditions on the choice of ci for explicit definitions of new infinite families having three and four trace terms. Also, a class of nonpermutation polynomials whose composition with a quadratic function yields again a quadratic semi-bent function is specified...
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
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)
On the harmonic starlike functions with respect to symmetric ...
African Journals Online (AJOL)
In the present paper, we introduce the notions of functions harmonic starlike with respect to symmetric, conjugate and symmetric conjugate points. Such results as coefficient inequalities and structural formulae for these function classes are proved. Keywords: Harmonic functions, harmonic starlike functions, symmetric points, ...
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.
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.
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.
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.
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
first principles derivation of a stress function for axially symmetric
African Journals Online (AJOL)
HOD
governing partial differential equations of linear isotropic elasticity were reduced to the solution of the biharmonic ... The stress function was then applied to solve the axially symmetric ..... [1] Borg S.K.: Fundamentals of Engineering Elasticity,.
Invariant subspaces in some function spaces on symmetric spaces. II
International Nuclear Information System (INIS)
Platonov, S S
1998-01-01
Let G be a semisimple connected Lie group with finite centre, K a maximal compact subgroup of G, and M=G/K a Riemannian symmetric space of non-compact type. We study the problem of describing the structure of closed linear subspaces in various function spaces on M that are invariant under the quasiregular representation of the group G. We consider the case when M is a symplectic symmetric space of rank 1
(Anti)symmetric multivariate exponential functions and corresponding Fourier transforms
International Nuclear Information System (INIS)
Klimyk, A U; Patera, J
2007-01-01
We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are eigenfunctions of the Laplace operator on the corresponding fundamental domains satisfying certain boundary conditions. To symmetric and antisymmetric multivariate exponential functions there correspond Fourier transforms. There are three types of such Fourier transforms: expansions into the corresponding Fourier series, integral Fourier transforms and multivariate finite Fourier transforms. Eigenfunctions of the integral Fourier transforms are found
Symmetric Logic Synthesis with Phase Assignment
Benschop, N. F.
2001-01-01
Decomposition of any Boolean Function BF_n of n binary inputs into an optimal inverter coupled network of Symmetric Boolean functions SF_k (k \\leq n) is described. Each SF component is implemented by Threshold Logic Cells, forming a complete and compact T-Cell Library. Optimal phase assignment of input polarities maximizes local symmetries. The "rank spectrum" is a new BF_n description independent of input ordering, obtained by mapping its minterms onto an othogonal n \\times n grid of (transi...
A partition function approximation using elementary symmetric functions.
Directory of Open Access Journals (Sweden)
Ramu Anandakrishnan
Full Text Available In statistical mechanics, the canonical partition function [Formula: see text] can be used to compute equilibrium properties of a physical system. Calculating [Formula: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [Formula: see text] in the system. A commonly used method for approximating equilibrium properties, is the Monte Carlo (MC method. For some problems the MC method converges slowly, requiring a very large number of MC steps. For such problems the computational cost of the Monte Carlo method can be prohibitive. Presented here is a deterministic algorithm - the direct interaction algorithm (DIA - for approximating the canonical partition function [Formula: see text] in [Formula: see text] operations. The DIA approximates the partition function as a combinatorial sum of products known as elementary symmetric functions (ESFs, which can be computed in [Formula: see text] operations. The DIA was used to compute equilibrium properties for the isotropic 2D Ising model, and the accuracy of the DIA was compared to that of the basic Metropolis Monte Carlo method. Our results show that the DIA may be a practical alternative for some problems where the Monte Carlo method converge slowly, and computational speed is a critical constraint, such as for very large systems or web-based applications.
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.
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.
Whittaker Vector of Deformed Virasoro Algebra and Macdonald Symmetric Functions
Yanagida, Shintarou
2016-03-01
We give a proof of Awata and Yamada's conjecture for the explicit formula of Whittaker vector of the deformed Virasoro algebra realized in the Fock space. The formula is expressed as a summation over Macdonald symmetric functions with factored coefficients. In the proof, we fully use currents appearing in the Fock representation of Ding-Iohara-Miki quantum algebra.
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.
Nonstandard jump functions for radically symmetric shock waves
International Nuclear Information System (INIS)
Baty, Roy S.; Tucker, Don H.; Stanescu, Dan
2008-01-01
Nonstandard analysis is applied to derive generalized jump functions for radially symmetric, one-dimensional, magnetogasdynamic shock waves. It is assumed that the shock wave jumps occur on infinitesimal intervals and the jump functions for the physical parameters occur smoothly across these intervals. Locally integrable predistributions of the Heaviside function are used to model the flow variables across a shock wave. The equations of motion expressed in nonconservative form are then applied to derive unambiguous relationships between the jump functions for the physical parameters for two families of self-similar flows. It is shown that the microstructures for these families of radially symmetric, magnetogasdynamic shock waves coincide in a nonstandard sense for a specified density jump function.
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
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.
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.
Bent and bent(4) spectra of Boolean functions over finite fields
DEFF Research Database (Denmark)
Anbar Meidl, Nurdagül; Meidl, Wilfried
2017-01-01
For c is an element of F(2)n, a c-bent4 function f from the finite field F(2)n to F-2 is a function with a fiat spectrum with respect to the unitary transform V-f(c), which is designed to describe the component functions of modified planar functions. For c = 0 the transform V-f(c) reduces to the ...... a cubic monomial. We show that it is c-bent(4) only for c = 1, the function is then called negabent, which shows that non-quadratic functions exhibit a different behaviour. (C) 2017 Elsevier Inc. All rights reserved....
Steiner symmetrization and the initial coefficients of univalent functions
International Nuclear Information System (INIS)
Dubinin, Vladimir N
2010-01-01
We establish the inequality |a 1 | 2 -Rea 1 a -1 ≥|a 1 *| 2 -Rea 1 *a -1 * for the initial coefficients of any function f(z)=a 1 z+a 0 +a -1 /z+? meromorphic and univalent in the domain D={z:|z|>1}, where a 1 * and a -1 * are the corresponding coefficients in the expansion of the function f*(z) that maps the domain D conformally and univalently onto the exterior of the result of the Steiner symmetrization with respect to the real axis of the complement of the set f(D). The Polya-Szego inequality |a 1 |≥|a 1 *| is already known. We describe some applications of our inequality to functions of class Σ.
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)
Rings of continuous functions, symmetric products, and Frobenius algebras
International Nuclear Information System (INIS)
Buchstaber, Viktor M; Rees, E G
2004-01-01
A constructive proof is given for the classical theorem of Gel'fand and Kolmogorov (1939) characterising the image of the evaluation map from a compact Hausdorff space X into the linear space C(X)* dual to the ring C(X) of continuous functions on X. Our approach to the proof enabled us to obtain a more general result characterising the image of the evaluation map from the symmetric products Sym n (X) into C(X)*. A similar result holds if X=C m and leads to explicit equations for symmetric products of affine algebraic varieties as algebraic subvarieties in the linear space dual to the polynomial ring. This leads to a better understanding of the algebra of multisymmetric polynomials. The proof of all these results is based on a formula used by Frobenius in 1896 in defining higher characters of finite groups. This formula had no further applications for a long time; however, it has appeared in several independent contexts during the last fifteen years. It was used by A. Wiles and R.L. Taylor in studying representations and by H.-J. Hoehnke and K.W. Johnson and later by J. McKay in studying finite groups. It plays an important role in our work concerning multivalued groups. Several properties of this remarkable formula are described. It is also used to prove a theorem on the structure constants of Frobenius algebras, which have recently attracted attention due to constructions taken from topological field theory and singularity theory. This theorem develops a result of Hoehnke published in 1958. As a corollary, a direct self-contained proof is obtained for the fact that the 1-, 2-, and 3-characters of the regular representation determine a finite group up to isomorphism. This result was first published by Hoehnke and Johnson in 1992
Hypercyclic operators on algebra of symmetric snalytic functions on $\\ell_p$
Directory of Open Access Journals (Sweden)
Z. H. Mozhyrovska
2016-06-01
Full Text Available In the paper, it is proposed a method of construction of hypercyclic composition operators on $H(\\mathbb{C}^n$ using polynomial automorphisms of $\\mathbb{C}^n$ and symmetric analytic functions on $\\ell_p.$ In particular, we show that an ``symmetric translation'' operator is hypercyclic on a Frechet algebra of symmetric entire functions on $\\ell_p$ which are bounded on bounded subsets.
Characteristic function-based semiparametric inference for skew-symmetric models
Potgieter, Cornelis J.
2012-12-26
Skew-symmetric models offer a very flexible class of distributions for modelling data. These distributions can also be viewed as selection models for the symmetric component of the specified skew-symmetric distribution. The estimation of the location and scale parameters corresponding to the symmetric component is considered here, with the symmetric component known. Emphasis is placed on using the empirical characteristic function to estimate these parameters. This is made possible by an invariance property of the skew-symmetric family of distributions, namely that even transformations of random variables that are skew-symmetric have a distribution only depending on the symmetric density. A distance metric between the real components of the empirical and true characteristic functions is minimized to obtain the estimators. The method is semiparametric, in that the symmetric component is specified, but the skewing function is assumed unknown. Furthermore, the methodology is extended to hypothesis testing. Two tests for a hypothesis of specific parameter values are considered, as well as a test for the hypothesis that the symmetric component has a specific parametric form. A resampling algorithm is described for practical implementation of these tests. The outcomes of various numerical experiments are presented. © 2012 Board of the Foundation of the Scandinavian Journal of Statistics.
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
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...
Isomorphism and the #betta#-function of the non-linear sigma model in symmetric spaces
International Nuclear Information System (INIS)
Hikami, S.
1983-01-01
The renormalization group #betta#-function of the non-linear sigma model in symmetric spaces is discussed via the isomorphic relation and the reciprocal relation about a parameter α. The four-loop term is investigated and the symmetric properties of the #betta#-function are studied. The four-loop term in the #betta#-function is shown to be vanishing for the orthogonal Anderson localization problem. (orig.)
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.
Directory of Open Access Journals (Sweden)
Jean-Louis Dornstetter
2002-12-01
Full Text Available This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.
Jean-Louis Dornstetter; Daniel Krob; Jean-Yves Thibon; Ekaterina A. Vassilieva
2002-01-01
This paper is devoted to the presentation of a combinatorial approach, based on the theory of symmetric functions, for analyzing the performance of a family of demodulation methods used in mobile telecommunications.
International Nuclear Information System (INIS)
Uchajkin, V.V.
1977-01-01
The two-dimensional functional is used to show that the mathematical expectation of symmetrical functionals may be represented as a nonlinear functional obtained from the solution of the Boltzman equations (Green's function). For the highest moments of additive detector readings, which are a particular case of symmetrical functionals, a similar result was obtained by the author previously when he studied particles transport with and without multiplication. In physical terms such a concept is conditioned by the absence of moving particles with one another, the assumption of which is the basis of the linear transport theory
Group characters, symmetric functions, and the Hecke algebra
Goldschmidt, David M
1993-01-01
Directed at graduate students and mathematicians, this book covers an unusual set of interrelated topics, presenting a self-contained exposition of the algebra behind the Jones polynomial along with various excursions into related areas. The book is made up of lecture notes from a course taught by Goldschmidt at the University of California at Berkeley in 1989. The course was organized in three parts. Part I covers, among other things, Burnside's Theorem that groups of order p^aq^b are solvable, Frobenius' Theorem on the existence of Frobenius kernels, and Brauer's characterization of characters. Part II covers the classical character theory of the symmetric group and includes an algorithm for computing the character table of S^n ; a construction of the Specht modules; the "determinant form" for the irreducible characters; the hook-length formula of Frame, Robinson, and Thrall; and the Murnaghan-Nakayama formula. Part III covers the ordinary representation theory of the Hecke algebra, the construction of the ...
Completely X-symmetric S-matrices corresponding to theta functions
International Nuclear Information System (INIS)
Chudnovsky, D.V.
1981-01-01
We consider the realization of the classical Weyl commutation relations using THETA-functions. The representations of the Heisenberg group enable us to realize completely symmetric factorized S-matrices in terms of THETA-functions corresponding to the torsion subgroup of an abelian variety. (orig.)
A family of tridiagonal pairs and related symmetric functions
International Nuclear Information System (INIS)
Baseilhac, Pascal
2006-01-01
A family of tridiagonal pairs which appear in the context of quantum integrable systems is studied in detail. The corresponding eigenvalue sequences, eigenspaces and the block tridiagonal structure of their matrix realizations with respect the dual eigenbasis are described. The overlap functions between the two dual bases are shown to satisfy a coupled system of recurrence relations and a set of discrete second-order q-difference equations which generalize those associated with the Askey-Wilson orthogonal polynomials with a discrete argument. Normalizing the fundamental solution to unity, the hierarchies of solutions are rational functions of one discrete argument, explicitly derived in some simplest examples. The weight function which ensures the orthogonality of the system of rational functions defined on a discrete real support is given
A family of tridiagonal pairs and related symmetric functions
Energy Technology Data Exchange (ETDEWEB)
Baseilhac, Pascal [Laboratoire de Mathematiques et Physique Theorique CNRS/UMR 6083, Federation Denis Poisson, Universite de Tours, Parc de Grandmont, 37200 Tours (France)
2006-09-22
A family of tridiagonal pairs which appear in the context of quantum integrable systems is studied in detail. The corresponding eigenvalue sequences, eigenspaces and the block tridiagonal structure of their matrix realizations with respect the dual eigenbasis are described. The overlap functions between the two dual bases are shown to satisfy a coupled system of recurrence relations and a set of discrete second-order q-difference equations which generalize those associated with the Askey-Wilson orthogonal polynomials with a discrete argument. Normalizing the fundamental solution to unity, the hierarchies of solutions are rational functions of one discrete argument, explicitly derived in some simplest examples. The weight function which ensures the orthogonality of the system of rational functions defined on a discrete real support is given.
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...
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.
Elicited Bid Functions in a (a)Symmetric First-Price Auctions
Pezanis-Christou, P.; Sadrieh, A.
2003-01-01
We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders.To study the extent of strategic behavior, we use an experimental design that elicits bidders complete bid functions in each round (auction) of the
Kurukuri, Srihari; Worswick, Michael J.
2013-12-01
An alternative approach is proposed to utilize symmetric yield functions for modeling the tension-compression asymmetry commonly observed in hcp materials. In this work, the strength differential (SD) effect is modeled by choosing separate symmetric plane stress yield functions (for example, Barlat Yld 2000-2d) for the tension i.e., in the first quadrant of principal stress space, and compression i.e., third quadrant of principal stress space. In the second and fourth quadrants, the yield locus is constructed by adopting interpolating functions between uniaxial tensile and compressive stress states. In this work, different interpolating functions are chosen and the predictive capability of each approach is discussed. The main advantage of this proposed approach is that the yield locus parameters are deterministic and relatively easy to identify when compared to the Cazacu family of yield functions commonly used for modeling SD effect observed in hcp materials.
Interpolation of magnetic surface functions for an axi-symmetric plasma
International Nuclear Information System (INIS)
Yamaguchi, Taiki; Maeyama, Mitsuaki
2000-01-01
Informations of the magnetic surface functions of magnetically confined plasma are indispensable for equilibrium, stability and transport analyses. In this paper, in order to identify a realistic surface functions and compare those with ones which are introduced from Taylor's relaxation theory, we propose a code to interpolate these surface functions for an axi-symmetric plasma from experimentally measured data. To confirm our code, we used the date which were analyzed from known functions given as a measured data. As a result, we have developed a code which can derive surface functions I and P. Effects of measurement error on those functions are also examined. (author)
THE COVARIATION FUNCTION FOR SYMMETRIC &ALPHA;-STABLE RANDOM VARIABLES WITH FINITE FIRST MOMENTS
Directory of Open Access Journals (Sweden)
Dedi Rosadi
2012-05-01
Full Text Available In this paper, we discuss a generalized dependence measure which is designed to measure dependence of two symmetric α-stable random variables with finite mean(1<α<=2 and contains the covariance function as the special case (when α=2. Weshortly discuss some basic properties of the function and consider several methods to estimate the function and further investigate the numerical properties of the estimatorusing the simulated data. We show how to apply this function to measure dependence of some stock returns on the composite index LQ45 in Indonesia Stock Exchange.
A symmetric integral identity for Bessel functions with applications to integral geometry
Salman, Yehonatan
2017-12-01
In the article of Kunyansky (Inverse Probl 23(1):373-383, 2007) a symmetric integral identity for Bessel functions of the first and second kind was proved in order to obtain an explicit inversion formula for the spherical mean transform where our data is given on the unit sphere in Rn . The aim of this paper is to prove an analogous symmetric integral identity in case where our data for the spherical mean transform is given on an ellipse E in R2 . For this, we will use the recent results obtained by Cohl and Volkmer (J Phys A Math Theor 45:355204, 2012) for the expansions into eigenfunctions of Bessel functions of the first and second kind in elliptical coordinates.
Foundations of symmetric spaces of measurable functions Lorentz, Marcinkiewicz and Orlicz spaces
Rubshtein, Ben-Zion A; Muratov, Mustafa A; Pashkova, Yulia S
2016-01-01
Key definitions and results in symmetric spaces, particularly Lp, Lorentz, Marcinkiewicz and Orlicz spaces are emphasized in this textbook. A comprehensive overview of the Lorentz, Marcinkiewicz and Orlicz spaces is presented based on concepts and results of symmetric spaces. Scientists and researchers will find the application of linear operators, ergodic theory, harmonic analysis and mathematical physics noteworthy and useful. This book is intended for graduate students and researchers in mathematics and may be used as a general reference for the theory of functions, measure theory, and functional analysis. This self-contained text is presented in four parts totaling seventeen chapters to correspond with a one-semester lecture course. Each of the four parts begins with an overview and is subsequently divided into chapters, each of which concludes with exercises and notes. A chapter called “Complements” is included at the end of the text as supplementary material to assist students with independent work.
Mongelli, Pietro
2011-01-01
The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced in [6], [7]. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary and complete symmetric functions. We then study combinatorial interpretations of this specialization and obtain new combinatorial interpretations of the Jacobi-Stirling and Legendre-Stirling numbers.
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
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.
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.
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...
International Nuclear Information System (INIS)
Jung, Yousung; Shao, Yihan; Gordon, Mark S.; Doren, Douglas J.; Head-Gordon, Martin
2003-01-01
We report a spin-unrestricted density functional theory (DFT) solution at the symmetric dimer structure for cluster models of Si(100). With this solution, it is shown that the symmetric structure is a minimum on the DFT potential energy surface, although higher in energy than the buckled structure. In restricted DFT calculations the symmetric structure is a saddle point connecting the two buckled minima. To further assess the effects of electron correlation on the relative energies of symmetric versus buckled dimers on Si(100), multireference second order perturbation theory (MRMP2) calculations are performed on these DFT optimized minima. The symmetric structure is predicted to be lower in energy than the buckled structure via MRMP2, while the reverse order is found by DFT. The implications for recent experimental interpretations are discussed
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)
Efficient time-symmetric simulation of torqued rigid bodies using Jacobi elliptic functions
International Nuclear Information System (INIS)
Celledoni, E; Saefstroem, N
2006-01-01
If the three moments of inertia are distinct, the solution to the Euler equations for the free rigid body is given in terms of Jacobi elliptic functions. Using the arithmetic-geometric mean algorithm (Abramowitz and Stegun 1992 Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (New York: Dover)), these functions can be calculated efficiently and accurately. Compared to standard numerical ODE and Lie-Poisson solvers, the overall approach yields a faster and more accurate numerical solution to the Euler equations. This approach is designed for mass asymmetric rigid bodies. In the case of symmetric bodies, the exact solution is available in terms of trigonometric functions, see Dullweber et al (1997 J. Chem. Phys. 107 5840-51), Reich (1996 Fields Inst. Commun. 10 181-91) and Benettin et al (2001 SIAM J. Sci. Comp. 23 1189-203) for details. In this paper, we consider the case of asymmetric rigid bodies subject to external forces. We consider a strategy similar to the symplectic splitting method proposed in Reich (1996 Fields Inst. Commun. 10 181-91) and Dullweber et al (1997 J. Chem. Phys. 107 5840-51). The method proposed here is time-symmetric. We decompose the vector field of our problem into a free rigid body (FRB) problem and another completely integrable vector field. The FRB problem consists of the Euler equations and a differential equation for the 3 x 3 orientation matrix. The Euler equations are integrated exactly while the matrix equation is approximated using a truncated Magnus series. In our experiments, we observe that the overall numerical solution benefits greatly from the very accurate solution of the Euler equations. We apply the method to the heavy top and the simulation of artificial satellite attitude dynamics
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.
Energy Technology Data Exchange (ETDEWEB)
Ertem, S. Piril [Department of Polymer Science and Engineering, University of Massachusetts Amherst, 120 Governors Drive Amherst Massachusetts 01003; Caire, Benjamin R. [Department of Chemical and Biological Engineering, Colorado School of Mines, Golden Colorado 80401; Tsai, Tsung-Han [Department of Polymer Science and Engineering, University of Massachusetts Amherst, 120 Governors Drive Amherst Massachusetts 01003; Zeng, Di [Department of Polymer Science and Engineering, University of Massachusetts Amherst, 120 Governors Drive Amherst Massachusetts 01003; Vandiver, Melissa A. [Department of Chemical and Biological Engineering, Colorado School of Mines, Golden Colorado 80401; Kusoglu, Ahmet [Energy Conversion Group, Energy Technologies Area, Lawrence Berkeley National Laboratory, Berkeley California 94720; Seifert, Soenke [Energy Conversion Group, Energy Technologies Area, Lawrence Berkeley National Laboratory, Berkeley California 94720; Hayward, Ryan C. [Department of Polymer Science and Engineering, University of Massachusetts Amherst, 120 Governors Drive Amherst Massachusetts 01003; Weber, Adam Z. [Energy Conversion Group, Energy Technologies Area, Lawrence Berkeley National Laboratory, Berkeley California 94720; Herring, Andrew M. [Department of Chemical and Biological Engineering, Colorado School of Mines, Golden Colorado 80401; Coughlin, E. Bryan [Department of Polymer Science and Engineering, University of Massachusetts Amherst, 120 Governors Drive Amherst Massachusetts 01003; Liberatore, Matthew W. [Department of Chemical Engineering Department, University of Toledo, 2801 W Bancroft Street MS305 Toledo Ohio 43606
2017-02-07
Anion exchange membranes (AEMs) are a promising class of materials for applications that require selective ion transport, such as fuel cells, water purification, and electrolysis devices. Studies of structure–morphology–property relationships of ion-exchange membranes revealed that block copolymers exhibit improved ion conductivity and mechanical properties due to their microphase-separated morphologies with well-defined ionic domains. While most studies focused on symmetric diblock or triblock copolymers, here, the first example of a midblock quaternized pentablock AEM is presented. A symmetric ABCBA pentablock copolymer was functionalized to obtain a midblock brominated polymer. Solution cast films were then quaternized to obtain AEMs with resulting ion exchange capacities (IEC) ranging from 0.4 to 0.9 mmol/g. Despite the relatively low IEC, the polymers were highly conductive (up to 60 mS/cm Br2 at 90 8C and 95%RH) with low water absorption (<25 wt %) and maintained adequate mechanical properties in both dry and hydrated conditions. Xray scattering and transmission electron microscopy (TEM) revealed formation of cylindrical non-ionic domains in a connected ionic phase.
Olafsson, Gestur; Helgason, Sigurdur
1996-01-01
This book is intended to introduce researchers and graduate students to the concepts of causal symmetric spaces. To date, results of recent studies considered standard by specialists have not been widely published. This book seeks to bring this information to students and researchers in geometry and analysis on causal symmetric spaces.Includes the newest results in harmonic analysis including Spherical functions on ordered symmetric space and the holmorphic discrete series and Hardy spaces on compactly casual symmetric spacesDeals with the infinitesimal situation, coverings of symmetric spaces, classification of causal symmetric pairs and invariant cone fieldsPresents basic geometric properties of semi-simple symmetric spacesIncludes appendices on Lie algebras and Lie groups, Bounded symmetric domains (Cayley transforms), Antiholomorphic Involutions on Bounded Domains and Para-Hermitian Symmetric Spaces
Giner, Emmanuel; Tenti, Lorenzo; Angeli, Celestino; Malrieu, Jean-Paul
2016-09-28
The impact of the antisymmetrization is often addressed as a local property of the many-electron wave function, namely that the wave function should vanish when two electrons with parallel spins are in the same position in space. In this paper, we emphasize that this presentation is unduly restrictive: we illustrate the strong non-local character of the antisymmetrization principle, together with the fact that it is a matter of spin symmetry rather than spin parallelism. To this aim, we focus our attention on the simplest representation of various states of two-electron systems, both in atomic (helium atom) and molecular (H 2 and the π system of the ethylene molecule) cases. We discuss the non-local property of the nodal structure of some two-electron wave functions, both using analytical derivations and graphical representations of cuttings of the nodal hypersurfaces. The attention is then focussed on the impact of the antisymmetrization on the maxima of the two-body density, and we show that it introduces strong correlation effects (radial and/or angular) with a non-local character. These correlation effects are analyzed in terms of inflation and depletion zones, which are easily identifiable, thanks to the nodes of the orbitals composing the wave function. Also, we show that the correlation effects induced by the antisymmetrization occur also for anti-parallel spins since all M s components of a given spin state have the same N-body densities. Finally, we illustrate that these correlation effects occur also for the singlet states, but they have strictly opposite impacts: the inflation zones in the triplet become depletion zones in the singlet and vice versa.
Schur-Convexity for a Class of Symmetric Functions and Its Applications
Directory of Open Access Journals (Sweden)
Wei-Feng Xia
2009-01-01
Full Text Available For x=(x1,x2,…,xn∈R+n, the symmetric function ϕn(x,r is defined by ϕn(x,r=ϕn(x1,x2,…,xn;r=∏1≤i1
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.
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.
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
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/.
Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels
Directory of Open Access Journals (Sweden)
Majid Nasiri Khormuji
2012-12-01
Full Text Available Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF, partial DF and compress-and-forward (CF relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented. The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF or superior to those achieved by DF relaying. In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links.
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.
Characteristic function-based semiparametric inference for skew-symmetric models
Potgieter, Cornelis J.; Genton, Marc G.
2012-01-01
testing. Two tests for a hypothesis of specific parameter values are considered, as well as a test for the hypothesis that the symmetric component has a specific parametric form. A resampling algorithm is described for practical implementation
Symmetrized partial-wave method for density-functional cluster calculations
International Nuclear Information System (INIS)
Averill, F.W.; Painter, G.S.
1994-01-01
The computational advantage and accuracy of the Harris method is linked to the simplicity and adequacy of the reference-density model. In an earlier paper, we investigated one way the Harris functional could be extended to systems outside the limits of weakly interacting atoms by making the charge density of the interacting atoms self-consistent within the constraints of overlapping spherical atomic densities. In the present study, a method is presented for augmenting the interacting atom charge densities with symmetrized partial-wave expansions on each atomic site. The added variational freedom of the partial waves leads to a scheme capable of giving exact results within a given exchange-correlation approximation while maintaining many of the desirable convergence and stability properties of the original Harris method. Incorporation of the symmetry of the cluster in the partial-wave construction further reduces the level of computational effort. This partial-wave cluster method is illustrated by its application to the dimer C 2 , the hypothetical atomic cluster Fe 6 Al 8 , and the benzene molecule
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
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)
Cinar, Bahar; Sert, Ahmet; Gokmen, Zeynel; Aypar, Ebru; Aslan, Eyup; Odabas, Dursun
2015-02-01
Previous studies have demonstrated structural changes in the heart and cardiac dysfunction in foetuses with intrauterine growth restriction. There are no available data that evaluated left ventricular dimensions and mass in neonates with symmetric and asymmetric intrauterine growth restriction. Therefore, we aimed to evaluate left ventricular dimensions, systolic functions, and mass in neonates with symmetric and asymmetric intrauterine growth restriction. We also assessed associated maternal risk factors, and compared results with healthy appropriate for gestational age neonates. In all, 62 asymmetric intrauterine growth restriction neonates, 39 symmetric intrauterine growth restriction neonates, and 50 healthy appropriate for gestational age neonates were evaluated by transthoracic echocardiography. The asymmetric intrauterine growth restriction group had significantly lower left ventricular end-systolic and end-diastolic diameters and posterior wall diameter in systole and diastole than the control group. The symmetric intrauterine growth restriction group had significantly lower left ventricular end-diastolic diameter than the control group. All left ventricular dimensions were lower in the asymmetric intrauterine growth restriction neonates compared with symmetric intrauterine growth restriction neonates (p>0.05), but not statistically significant except left ventricular posterior wall diameter in diastole (3.08±0.83 mm versus 3.54 ±0.72 mm) (pintrauterine growth restriction groups had significantly lower relative posterior wall thickness (0.54±0.19 versus 0.48±0.13 versus 0.8±0.12), left ventricular mass (9.8±4.3 g versus 8.9±3.4 g versus 22.2±5.7 g), and left ventricular mass index (63.6±29.1 g/m2 versus 54.5±24.4 g/m2 versus 109±28.8 g/m2) when compared with the control group. Our study has demonstrated that although neonates with both symmetric and asymmetric intrauterine growth restriction had lower left ventricular dimensions, relative
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
Golden, Ryan; Cho, Ilwoo
2015-01-01
In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand generators of the algebras as perturbations. From such perturbations, define injective maps on generators, which induce algebra-monomorphisms (or embeddings) on the algebras. They provide inductive structure theorems on algebras of symmetric polynomials. As...
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.
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)
Jean-Pierre Costes
2018-03-01
Full Text Available The preparation of non-symmetric Schiff base ligands possessing one oxime function that is associated to a second function such as pyrrole or phenol function is first described. These ligands, which possess inner N4 or N3O coordination sites, allow formation of cationic or neutral non-symmetric CuII or NiII metallo-ligand complexes under their mono- or di-deprotonated forms. In presence of Lanthanide ions the neutral complexes do not coordinate to the LnIII ions, the oxygen atom of the oxime function being only hydrogen-bonded to a water molecule that is linked to the LnIII ion. This surprising behavior allows for the isolation of LnIII ions by non-interacting metal complexes. Reaction of cationic NiII complexes possessing a protonated oxime function with LnIII ions leads to the formation of original and dianionic (Gd(NO352− entities that are well separated from each other. This work highlights the preparation of well isolated mononuclear LnIII entities into a matrix of diamagnetic metal complexes. These new complexes complete our previous work dealing with the complexing ability of the oxime function toward Lanthanide ions. It could open the way to the synthesis of new entities with interesting properties, such as single-ion magnets for example.
Symmetric cryptographic protocols
Ramkumar, Mahalingam
2014-01-01
This book focuses on protocols and constructions that make good use of symmetric pseudo random functions (PRF) like block ciphers and hash functions - the building blocks for symmetric cryptography. Readers will benefit from detailed discussion of several strategies for utilizing symmetric PRFs. Coverage includes various key distribution strategies for unicast, broadcast and multicast security, and strategies for constructing efficient digests of dynamic databases using binary hash trees. • Provides detailed coverage of symmetric key protocols • Describes various applications of symmetric building blocks • Includes strategies for constructing compact and efficient digests of dynamic databases
Directory of Open Access Journals (Sweden)
Radović Sanja
2017-01-01
Full Text Available The Iris flower is a complex morphological structure composed of two trimerous whorls of functionally distinct petaloid organs (the falls and the standards, one whorl of the stamens and one tricarpellary gynoecium. The petal-like style arms of the carpels are banded over the basal part of the falls, forming three pollination tunnels, each of which is perceived by the Iris pollinators as a single bilaterally symmetrical flower. Apart from the stamens, all petaloid floral organs are preferentially involved in advertising rewards to potential pollinators. Here we used the methods of geometric morphometrics to explore the shape variation in falls, standards and style arms of the Iris pumila flowers and to disentangle the symmetric and the asymmetric component of the total shape variance. Our results show that symmetric variation contributes mostly to the total shape variance in each of the three floral organs. Fluctuating asymmetry (FA was the dominant component of the asymmetric shape variation in the falls and the standards, but appeared to be marginally significant in the style arms. The values of FA indexes for the shape of falls (insects’ landing platforms and for the shape of standards (long-distance reward signals were found to be two orders of magnitude greater compared to that of the style arms. Directional asymmetry appeared to be very low, but highly statistically significant for all analyzed floral organs. Because floral symmetry can reliably indicate the presence of floral rewards, an almost perfect symmetry recorded for the style arm shape might be the outcome of pollinator preferences for symmetrical pollination units. [Project of the Serbian Ministry of Education, Science and Technological Development, Grant no. 173007
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
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...
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
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.
International Nuclear Information System (INIS)
Ramond, P.
1993-01-01
The Wolfenstein parametrization is extended to the quark masses in the deep ultraviolet, and an algorithm to derive symmetric textures which are compatible with existing data is developed. It is found that there are only five such textures
Directory of Open Access Journals (Sweden)
Xiaoqiang Di
Full Text Available Both symmetric and asymmetric color image encryption have advantages and disadvantages. In order to combine their advantages and try to overcome their disadvantages, chaos synchronization is used to avoid the key transmission for the proposed semi-symmetric image encryption scheme. Our scheme is a hybrid chaotic encryption algorithm, and it consists of a scrambling stage and a diffusion stage. The control law and the update rule of function projective synchronization between the 3-cell quantum cellular neural networks (QCNN response system and the 6th-order cellular neural network (CNN drive system are formulated. Since the function projective synchronization is used to synchronize the response system and drive system, Alice and Bob got the key by two different chaotic systems independently and avoid the key transmission by some extra security links, which prevents security key leakage during the transmission. Both numerical simulations and security analyses such as information entropy analysis, differential attack are conducted to verify the feasibility, security, and efficiency of the proposed scheme.
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.
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
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...
Directory of Open Access Journals (Sweden)
T. V. Vasylyshyn
2017-07-01
Full Text Available It is known that the so-called elementary symmetric polynomials $R_n(x = \\int_{[0,1]}(x(t^n\\,dt$ form an algebraic basis in the algebra of all symmetric continuous polynomials on the complex Banach space $L_\\infty,$ which is dense in the Fr\\'{e}chet algebra $H_{bs}(L_\\infty$ of all entire symmetric functions of bounded type on $L_\\infty.$ Consequently, every continuous homomorphism $\\varphi: H_{bs}(L_\\infty \\to \\mathbb{C}$ is uniquely determined by the sequence $\\{\\varphi(R_n\\}_{n=1}^\\infty.$ By the continuity of the homomorphism $\\varphi,$ the sequence $\\{\\sqrt[n]{|\\varphi(R_n|}\\}_{n=1}^\\infty$ is bounded. On the other hand, for every sequence $\\{\\xi_n\\}_{n=1}^\\infty \\subset \\mathbb{C},$ such that the sequence $\\{\\sqrt[n]{|\\xi_n|}\\}_{n=1}^\\infty$ is bounded, there exists $x_\\xi \\in L_\\infty$ such that $R_n(x_\\xi = \\xi_n$ for every $n \\in \\mathbb{N}.$ Therefore, for the point-evaluation functional $\\delta_{x_\\xi}$ we have $\\delta_{x_\\xi}(R_n = \\xi_n$ for every $n \\in \\mathbb{N}.$ Thus, every continuous complex-valued homomorphism of $H_{bs}(L_\\infty$ is a point-evaluation functional at some point of $L_\\infty.$ Note that such a point is not unique. We can consider an equivalence relation on $L_\\infty,$ defined by $x\\sim y \\Leftrightarrow \\delta_x = \\delta_y.$ The spectrum (the set of all continuous complex-valued homomorphisms $M_{bs}$ of the algebra $H_{bs}(L_\\infty$ is one-to-one with the quotient set $L_\\infty/_\\sim.$ Consequently, $M_{bs}$ can be endowed with the quotient topology. On the other hand, it is naturally to identify $M_{bs}$ with the set of all sequences $\\{\\xi_n\\}_{n=1}^\\infty \\subset \\mathbb{C}$ such that the sequence $\\{\\sqrt[n]{|\\xi_n|}\\}_{n=1}^\\infty$ is bounded.We show that the quotient topology is Hausdorffand that $M_{bs}$ with the operation of coordinate-wise addition of sequences forms an abelian topological group.
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.
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.
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.
Wang, Kun; Schoonover, Robert W; Su, Richard; Oraevsky, Alexander; Anastasio, Mark A
2014-05-01
Optoacoustic tomography (OAT), also known as photoacoustic tomography, is an emerging computed biomedical imaging modality that exploits optical contrast and ultrasonic detection principles. Iterative image reconstruction algorithms that are based on discrete imaging models are actively being developed for OAT due to their ability to improve image quality by incorporating accurate models of the imaging physics, instrument response, and measurement noise. In this work, we investigate the use of discrete imaging models based on Kaiser-Bessel window functions for iterative image reconstruction in OAT. A closed-form expression for the pressure produced by a Kaiser-Bessel function is calculated, which facilitates accurate computation of the system matrix. Computer-simulation and experimental studies are employed to demonstrate the potential advantages of Kaiser-Bessel function-based iterative image reconstruction in OAT.
International Nuclear Information System (INIS)
Chudnovsky, D.V.; Chudnovsky, G.V.
1981-01-01
We consider general expressions of factorized S-matrices with Abelian symmetry expressed in terms of theta-functions. These expressions arise from representations of the Heisenberg group. New examples of factorized S-matrices lead to a large class of completely integrable models of statistical mechanics which generalize the XYZ-model of the eight-vertex model. (orig.)
International Nuclear Information System (INIS)
Haeggblom, H.
1968-08-01
The method of calculating the resonance interaction effect by series expansions has been studied. Starting from the assumption that the neutron flux in a homogeneous mixture is inversely proportional to the total cross section, the expression for the flux can be simplified by series expansions. Two types of expansions are investigated and it is shown that only one of them is generally applicable. It is also shown that this expansion gives sufficient accuracy if the approximate resonance line shape function is reasonably representative. An investigation is made of the approximation of the resonance shape function with a Gaussian function which in some cases has been used to calculate the interaction effect. It is shown that this approximation is not sufficiently accurate in all cases which can occur in practice. Then, a rational approximation is introduced which in the first order approximation gives the same order of accuracy as a practically exact shape function. The integrations can be made analytically in the complex plane and the method is therefore very fast compared to purely numerical integrations. The method can be applied both to statistically correlated and uncorrelated resonances
Energy Technology Data Exchange (ETDEWEB)
Haeggblom, H
1968-08-15
The method of calculating the resonance interaction effect by series expansions has been studied. Starting from the assumption that the neutron flux in a homogeneous mixture is inversely proportional to the total cross section, the expression for the flux can be simplified by series expansions. Two types of expansions are investigated and it is shown that only one of them is generally applicable. It is also shown that this expansion gives sufficient accuracy if the approximate resonance line shape function is reasonably representative. An investigation is made of the approximation of the resonance shape function with a Gaussian function which in some cases has been used to calculate the interaction effect. It is shown that this approximation is not sufficiently accurate in all cases which can occur in practice. Then, a rational approximation is introduced which in the first order approximation gives the same order of accuracy as a practically exact shape function. The integrations can be made analytically in the complex plane and the method is therefore very fast compared to purely numerical integrations. The method can be applied both to statistically correlated and uncorrelated resonances.
Large Sets in Boolean and Non-Boolean Groups and Topology
Directory of Open Access Journals (Sweden)
Ol’ga V. Sipacheva
2017-10-01
Full Text Available Various notions of large sets in groups, including the classical notions of thick, syndetic, and piecewise syndetic sets and the new notion of vast sets in groups, are studied with emphasis on the interplay between such sets in Boolean groups. Natural topologies closely related to vast sets are considered; as a byproduct, interesting relations between vast sets and ultrafilters are revealed.
Boolean 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.
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
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
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
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...
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
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
Molina-García, Angel; Campelo, José Carlos; Blanc, Sara; Serrano, Juan José; García-Sánchez, Tania; Bueso, María C.
2015-01-01
This paper proposes and assesses an integrated solution to monitor and diagnose photovoltaic (PV) solar modules based on a decentralized wireless sensor acquisition system. Both DC electrical variables and environmental data are collected at PV module level using low-cost and high-energy efficiency node sensors. Data is real-time processed locally and compared with expected PV module performances obtained by a PV module model based on symmetrized-shifted Gompertz functions (as previously developed and assessed by the authors). Sensor nodes send data to a centralized sink-computing module using a multi-hop wireless sensor network architecture. Such integration thus provides extensive analysis of PV installations, and avoids off-line tests or post-processing processes. In comparison with previous approaches, this solution is enhanced with a low-cost system and non-critical performance constraints, and it is suitable for extensive deployment in PV power plants. Moreover, it is easily implemented in existing PV installations, since no additional wiring is required. The system has been implemented and assessed in a Spanish PV power plant connected to the grid. Results and estimations of PV module performances are also included in the paper. PMID:26230694
Directory of Open Access Journals (Sweden)
Angel Molina-García
2015-07-01
Full Text Available This paper proposes and assesses an integrated solution to monitor and diagnose photovoltaic (PV solar modules based on a decentralized wireless sensor acquisition system. Both DC electrical variables and environmental data are collected at PV module level using low-cost and high-energy efficiency node sensors. Data is real-time processed locally and compared with expected PV module performances obtained by a PV module model based on symmetrized-shifted Gompertz functions (as previously developed and assessed by the authors. Sensor nodes send data to a centralized sink-computing module using a multi-hop wireless sensor network architecture. Such integration thus provides extensive analysis of PV installations, and avoids off-line tests or post-processing processes. In comparison with previous approaches, this solution is enhanced with a low-cost system and non-critical performance constraints, and it is suitable for extensive deployment in PV power plants. Moreover, it is easily implemented in existing PV installations, since no additional wiring is required. The system has been implemented and assessed in a Spanish PV power plant connected to the grid. Results and estimations of PV module performances are also included in the paper.
Molina-García, Angel; Campelo, José Carlos; Blanc, Sara; Serrano, Juan José; García-Sánchez, Tania; Bueso, María C
2015-07-29
This paper proposes and assesses an integrated solution to monitor and diagnose photovoltaic (PV) solar modules based on a decentralized wireless sensor acquisition system. Both DC electrical variables and environmental data are collected at PV module level using low-cost and high-energy efficiency node sensors. Data is real-time processed locally and compared with expected PV module performances obtained by a PV module model based on symmetrized-shifted Gompertz functions (as previously developed and assessed by the authors). Sensor nodes send data to a centralized sink-computing module using a multi-hop wireless sensor network architecture. Such integration thus provides extensive analysis of PV installations, and avoids off-line tests or post-processing processes. In comparison with previous approaches, this solution is enhanced with a low-cost system and non-critical performance constraints, and it is suitable for extensive deployment in PV power plants. Moreover, it is easily implemented in existing PV installations, since no additional wiring is required. The system has been implemented and assessed in a Spanish PV power plant connected to the grid. Results and estimations of PV module performances are also included in the paper.
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
Multipath Detection Using Boolean Satisfiability Techniques
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
The Boolean algebra of Galois algebras
Directory of Open Access Journals (Sweden)
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
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.
Boolean Operations with Prism Algebraic Patches
Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi
2009-01-01
In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262
A 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.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
Synchronization in an array of coupled Boolean networks
International Nuclear Information System (INIS)
Li, Rui; Chu, Tianguang
2012-01-01
This Letter presents an analytical study of synchronization in an array of coupled deterministic Boolean networks. A necessary and sufficient criterion for synchronization is established based on algebraic representations of logical dynamics in terms of the semi-tensor product of matrices. Some basic properties of a synchronized array of Boolean networks are then derived for the existence of transient states and the upper bound of the number of fixed points. Particularly, an interesting consequence indicates that a “large” mismatch between two coupled Boolean networks in the array may result in loss of synchrony in the entire system. Examples, including the Boolean model of coupled oscillations in the cell cycle, are given to illustrate the present results. -- Highlights: ► We analytically study synchronization in an array of coupled Boolean networks. ► The study is based on the algebraic representations of logical dynamics. ► A necessary and sufficient algebraic criterion for synchronization is established. ► It reveals some basic properties of a synchronized array of Boolean networks. ► A large mismatch between two coupled networks may result in the loss of synchrony.
Directory of Open Access Journals (Sweden)
Jens Christian Claussen
2017-06-01
Full Text Available The analysis of microbiome compositions in the human gut has gained increasing interest due to the broader availability of data and functional databases and substantial progress in data analysis methods, but also due to the high relevance of the microbiome in human health and disease. While most analyses infer interactions among highly abundant species, the large number of low-abundance species has received less attention. Here we present a novel analysis method based on Boolean operations applied to microbial co-occurrence patterns. We calibrate our approach with simulated data based on a dynamical Boolean network model from which we interpret the statistics of attractor states as a theoretical proxy for microbiome composition. We show that for given fractions of synergistic and competitive interactions in the model our Boolean abundance analysis can reliably detect these interactions. Analyzing a novel data set of 822 microbiome compositions of the human gut, we find a large number of highly significant synergistic interactions among these low-abundance species, forming a connected network, and a few isolated competitive interactions.
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling.
Directory of Open Access Journals (Sweden)
Liam G Fearnley
Full Text Available Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties. We present PATHLOGIC-S, a Boolean specification for a signalling model, with its associated GPL-licensed implementation using integer programming techniques. The PATHLOGIC-S specification has been designed to function on current desktop workstations, and is capable of providing analyses on some of the largest currently available datasets through use of Boolean modelling techniques to generate predictions of stable and semi-stable network states from data in community file formats. PATHLOGIC-S also addresses major problems associated with the presence and modelling of inhibition in Boolean systems, and reduces logical incoherence due to common inhibitory mechanisms in signalling systems. We apply this approach to signal transduction networks including Reactome and two pathways from the Panther Pathways database, and present the results of computations on each along with a discussion of execution time. A software implementation of the framework and model is freely available under a GPL license.
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.
Ramachary, Dhevalapally B; Venkaiah, Chintalapudi; Reddy, Y Vijayendar; Kishor, Mamillapalli
2009-05-21
In this paper we describe new multi-catalysis cascade (MCC) reactions for the one-pot synthesis of highly functionalized non-symmetrical malonates. These metal-free reactions are either five-step (olefination/hydrogenation/alkylation/ketenization/esterification) or six-step (olefination/hydrogenation/alkylation/ketenization/esterification/alkylation), and employ aldehydes/ketones, Meldrum's acid, 1,4-dihydropyridine/o-phenylenediamine, diazomethane, alcohols and active ethylene/acetylenes, and involve iminium-, self-, self-, self- and base-catalysis, respectively. Many of the products have direct application in agricultural and pharmaceutical chemistry.
International Nuclear Information System (INIS)
Mihalas, D.; Kunasz, P.B.; Hummer, D.G.
1976-01-01
A numerical method is presented of solving the radiative transfer equation in the comoving frame of a spherically symmetric expanding atmosphere in which both the line and the electron-scattering source function can depend on frequency (i.e., when there is partial frequency redistribution in the scattering process). This method is used to assess the adequacy of various assumptions regarding frequency redistribution in the comoving frame and to discuss the effects of electron scattering more accurately than previously possible. The methods developed here can be used in realistic model atmospheres to account for the (major) effects of electron scattering upon emergent flux profiles
Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.
Zhang, Jianming; Sclaroff, Stan
2016-05-01
We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.
A Boolean Approach to Airline Business Model Innovation
DEFF Research Database (Denmark)
Hvass, Kristian Anders
Research in business model innovation has identified its significance in creating a sustainable competitive advantage for a firm, yet there are few empirical studies identifying which combination of business model activities lead to success and therefore deserve innovative attention. This study...... analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...... innovation, introduce Boolean minimization methods to the field, and propose alternative business model activities to North American carriers striving for positive operating results....
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.
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.
Jiang, Haiyong
2016-04-11
We present an automatic algorithm for symmetrizing facade layouts. Our method symmetrizes a given facade layout while minimally modifying the original layout. Based on the principles of symmetry in urban design, we formulate the problem of facade layout symmetrization as an optimization problem. Our system further enhances the regularity of the final layout by redistributing and aligning boxes in the layout. We demonstrate that the proposed solution can generate symmetric facade layouts efficiently. © 2015 IEEE.
Symmetrization of Facade Layouts
Jiang, Haiyong; Yan, Dong-Ming; Dong, Weiming; Wu, Fuzhang; Nan, Liangliang; Zhang, Xiaopeng
2016-01-01
We present an automatic approach for symmetrizing urban facade layouts. Our method can generate a symmetric layout through minimally modifying the original input layout. Based on the principles of symmetry in urban design, we formulate facade layout symmetrization as an optimization problem. Our method further enhances the regularity of the final layout by redistributing and aligning elements in the layout. We demonstrate that the proposed solution can effectively generate symmetric facade layouts.
Jiang, Haiyong; Dong, Weiming; Yan, Dongming; Zhang, Xiaopeng
2016-01-01
We present an automatic algorithm for symmetrizing facade layouts. Our method symmetrizes a given facade layout while minimally modifying the original layout. Based on the principles of symmetry in urban design, we formulate the problem of facade layout symmetrization as an optimization problem. Our system further enhances the regularity of the final layout by redistributing and aligning boxes in the layout. We demonstrate that the proposed solution can generate symmetric facade layouts efficiently. © 2015 IEEE.
Symmetrization of Facade Layouts
Jiang, Haiyong
2016-02-26
We present an automatic approach for symmetrizing urban facade layouts. Our method can generate a symmetric layout through minimally modifying the original input layout. Based on the principles of symmetry in urban design, we formulate facade layout symmetrization as an optimization problem. Our method further enhances the regularity of the final layout by redistributing and aligning elements in the layout. We demonstrate that the proposed solution can effectively generate symmetric facade layouts.
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
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
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.
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
DEFF Research Database (Denmark)
Zobel, Emilie H; von Scholten, Bernt Johan; Reinhard, Henrik
2017-01-01
IDI). C statistic (area under the curve) quantifies the model's improved ability to discriminate events from non-events. rIDI quantifies the increase in separation of events and non-events on a relative scale. RESULTS: Higher SDMA was associated with increased risk of all three endpoints (unadjusted: p......BACKGROUND: To evaluate symmetric dimethylarginine (SDMA) and asymmetric dimethylarginine (ADMA) as risk markers of cardiovascular disease, all-cause mortality and deterioration in renal function in a well characterised type 2 diabetic population with microalbuminuria and without symptoms...... of coronary artery disease. METHODS: 200 participants followed for 6.1 years. SDMA and ADMA were measured at baseline. Endpoints included (1) composite cardiovascular endpoint (n = 40); (2) all-cause mortality (n = 26); and (3) decline in eGFR of >30% (n = 42). Cox models were unadjusted and adjusted...
Martínez, A; Patrykiejew, A; Sokolowski, S
2003-01-01
We investigate adsorption in slit-like pores of model symmetric binary mixtures exhibiting demixing in bulk phase, by using a density functional approach. Our focus is on the evaluation of the first-order phase transitions in adsorbed fluids and the lines separating mixed and demixed phases. The scenario for phase transitions is sensitive to the pore width and to the energy of adsorption. Both these parameters can change the phase diagrams of the confined fluid. In particular, for relatively wide pores and for strong wall-fluid interactions, the demixing line can precede the first-order transition. Moreover, a competition between layering transitions and demixing within particular layers also leads to further enrichment of the phase diagram.
Diagrams for symmetric product orbifolds
International Nuclear Information System (INIS)
Pakman, Ari; Rastelli, Leonardo; Razamat, Shlomo S.
2009-01-01
We develop a diagrammatic language for symmetric product orbifolds of two-dimensional conformal field theories. Correlation functions of twist operators are written as sums of diagrams: each diagram corresponds to a branched covering map from a surface where the fields are single-valued to the base sphere where twist operators are inserted. This diagrammatic language facilitates the study of the large N limit and makes more transparent the analogy between symmetric product orbifolds and free non-abelian gauge theories. We give a general algorithm to calculate the leading large N contribution to four-point correlators of twist fields.
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Directory of Open Access Journals (Sweden)
Liang Jinghang
2012-08-01
network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. Conclusions Stochastic Boolean networks (SBNs are proposed as an efficient approach to modelling gene regulatory networks (GRNs. The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.
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
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.
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
3D Boolean operations in virtual surgical planning.
Charton, Jerome; Laurentjoye, Mathieu; Kim, Youngjun
2017-10-01
Boolean operations in computer-aided design or computer graphics are a set of operations (e.g. intersection, union, subtraction) between two objects (e.g. a patient model and an implant model) that are important in performing accurate and reproducible virtual surgical planning. This requires accurate and robust techniques that can handle various types of data, such as a surface extracted from volumetric data, synthetic models, and 3D scan data. This article compares the performance of the proposed method (Boolean operations by a robust, exact, and simple method between two colliding shells (BORES)) and an existing method based on the Visualization Toolkit (VTK). In all tests presented in this article, BORES could handle complex configurations as well as report impossible configurations of the input. In contrast, the VTK implementations were unstable, do not deal with singular edges and coplanar collisions, and have created several defects. The proposed method of Boolean operations, BORES, is efficient and appropriate for virtual surgical planning. Moreover, it is simple and easy to implement. In future work, we will extend the proposed method to handle non-colliding components.
On the 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.
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.
Cendagorta, Joseph R; Bačić, Zlatko; Tuckerman, Mark E
2018-03-14
We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.
Cendagorta, Joseph R.; Bačić, Zlatko; Tuckerman, Mark E.
2018-03-01
We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.
Directory of Open Access Journals (Sweden)
Zhi-Ying Zheng
2013-01-01
Full Text Available Through embedding an in-house subroutine into FLUENT code by utilizing the functionalization of user-defined function provided by the software, a new numerical simulation methodology on viscoelastic fluid flows has been established. In order to benchmark this methodology, numerical simulations under different viscoelastic fluid solution concentrations (with solvent viscosity ratio varied from 0.2 to 0.9, extensibility parameters (100≤L2≤500, Reynolds numbers (0.1 ≤ Re ≤ 100, and Weissenberg numbers (0 ≤ Wi ≤ 20 are conducted on unsteady laminar flows through a symmetric planar sudden expansion with expansion ratio of 1: 3 for viscoelastic fluid flows. The constitutive model used to describe the viscoelastic effect of viscoelastic fluid flow is FENE-P (finitely extensive nonlinear elastic-Peterlin model. The numerical simulation results show that the influences of elasticity, inertia, and concentration on the flow bifurcation characteristics are more significant than those of extensibility. The present simulation results including the critical Reynolds number for which the flow becomes asymmetric, vortex size, bifurcation diagram, velocity distribution, streamline, and pressure loss show good agreements with some published results. That means the newly established method based on FLUENT software platform for simulating peculiar flow behaviors of viscoelastic fluid is credible and suitable for the study of viscoelastic fluid flows.
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.
Affine Equivalence and Constructions of Cryptographically Strong Boolean Functions
2013-09-01
Math. Dissertation Supervisor Jon T. Butler Distinguished Professor Department of Elec. and Comp. Eng. David R. Canright Associate Professor...Linear structures in blockciphers,” in Advances in Cryptology, EU- ROCRYPT’87, ser. Lecture Notes in Computer Science, D. Chaum and W. L. Price, Eds
Centrioles in Symmetric Spaces
Quast, Peter
2011-01-01
We describe all centrioles in irreducible simply connected pointed symmetric spaces of compact type in terms of the root system of the ambient space, and we study some geometric properties of centrioles.
Conformally symmetric traversable wormholes
International Nuclear Information System (INIS)
Boehmer, Christian G.; Harko, Tiberiu; Lobo, Francisco S. N.
2007-01-01
Exact solutions of traversable wormholes are found under the assumption of spherical symmetry and the existence of a nonstatic conformal symmetry, which presents a more systematic approach in searching for exact wormhole solutions. In this work, a wide variety of solutions are deduced by considering choices for the form function, a specific linear equation of state relating the energy density and the pressure anisotropy, and various phantom wormhole geometries are explored. A large class of solutions impose that the spatial distribution of the exotic matter is restricted to the throat neighborhood, with a cutoff of the stress-energy tensor at a finite junction interface, although asymptotically flat exact solutions are also found. Using the 'volume integral quantifier', it is found that the conformally symmetric phantom wormhole geometries may, in principle, be constructed by infinitesimally small amounts of averaged null energy condition violating matter. Considering the tidal acceleration traversability conditions for the phantom wormhole geometry, specific wormhole dimensions and the traversal velocity are also deduced
A symmetrical rail accelerator
International Nuclear Information System (INIS)
Igenbergs, E.
1991-01-01
This paper reports on the symmetrical rail accelerator that has four rails, which are arranged symmetrically around the bore. The opposite rails have the same polarity and the adjacent rails the opposite polarity. In this configuration the radial force acting upon the individual rails is significantly smaller than in a conventional 2-rail configuration and a plasma armature is focussed towards the axis of the barrel. Experimental results indicate a higher efficiency compared to a conventional rail accelerator
International Nuclear Information System (INIS)
Matsuki, Takayuki
1976-01-01
Symmetric eikonal expansion for the scattering amplitude is formulated for nonrelativistic and relativistic potential scatterings and also for the quantum field theory. The first approximations coincide with those of Levy and Sucher. The obtained scattering amplitudes are time reversal invariant for all cases and are crossing symmetric for the quantum field theory in each order of approximation. The improved eikonal phase introduced by Levy and Sucher is also derived from the different approximation scheme from the above. (auth.)
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
Linac design algorithm with symmetric segments
International Nuclear Information System (INIS)
Takeda, Harunori; Young, L.M.; Nath, S.; Billen, J.H.; Stovall, J.E.
1996-01-01
The cell lengths in linacs of traditional design are typically graded as a function of particle velocity. By making groups of cells and individual cells symmetric in both the CCDTL AND CCL, the cavity design as well as mechanical design and fabrication is simplified without compromising the performance. We have implemented a design algorithm in the PARMILA code in which cells and multi-cavity segments are made symmetric, significantly reducing the number of unique components. Using the symmetric algorithm, a sample linac design was generated and its performance compared with a similar one of conventional design
Parity-Time Symmetric Photonics
Zhao, Han
2018-01-17
The establishment of non-Hermitian quantum mechanics (such as parity-time (PT) symmetry) stimulates a paradigmatic shift for studying symmetries of complex potentials. Owing to the convenient manipulation of optical gain and loss in analogy to the complex quantum potentials, photonics provides an ideal platform for visualization of many conceptually striking predictions from the non-Hermitian quantum theory. A rapidly developing field has emerged, namely, PT symmetric photonics, demonstrating intriguing optical phenomena including eigenstate coalescence and spontaneous PT symmetry breaking. The advance of quantum physics, as the feedback, provides photonics with brand-new paradigms to explore the entire complex permittivity plane for novel optical functionalities. Here, we review recent exciting breakthroughs in PT symmetric photonics while systematically presenting their underlying principles guided by non-Hermitian symmetries. The potential device applications for optical communication and computing, bio-chemical sensing, and healthcare are also discussed.
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…
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.
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.
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.
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
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
Multiparty symmetric sum types
DEFF Research Database (Denmark)
Nielsen, Lasse; Yoshida, Nobuko; Honda, Kohei
2010-01-01
This paper introduces a new theory of multiparty session types based on symmetric sum types, by which we can type non-deterministic orchestration choice behaviours. While the original branching type in session types can represent a choice made by a single participant and accepted by others...... determining how the session proceeds, the symmetric sum type represents a choice made by agreement among all the participants of a session. Such behaviour can be found in many practical systems, including collaborative workflow in healthcare systems for clinical practice guidelines (CPGs). Processes...... with the symmetric sums can be embedded into the original branching types using conductor processes. We show that this type-driven embedding preserves typability, satisfies semantic soundness and completeness, and meets the encodability criteria adapted to the typed setting. The theory leads to an efficient...
Symmetric Tensor Decomposition
DEFF Research Database (Denmark)
Brachat, Jerome; Comon, Pierre; Mourrain, Bernard
2010-01-01
We present an algorithm for decomposing a symmetric tensor, of dimension n and order d, as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the decomposition of a homogeneous polynomial in n variables...... of polynomial equations of small degree in non-generic cases. We propose a new algorithm for symmetric tensor decomposition, based on this characterization and on linear algebra computations with Hankel matrices. The impact of this contribution is two-fold. First it permits an efficient computation...... of the decomposition of any tensor of sub-generic rank, as opposed to widely used iterative algorithms with unproved global convergence (e.g. Alternate Least Squares or gradient descents). Second, it gives tools for understanding uniqueness conditions and for detecting the rank....
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.
Distributed Searchable Symmetric Encryption
Bösch, C.T.; Peter, Andreas; Leenders, Bram; Lim, Hoon Wei; Tang, Qiang; Wang, Huaxiong; Hartel, Pieter H.; Jonker, Willem
Searchable Symmetric Encryption (SSE) allows a client to store encrypted data on a storage provider in such a way, that the client is able to search and retrieve the data selectively without the storage provider learning the contents of the data or the words being searched for. Practical SSE schemes
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.
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.
Chen, Yan; Feng, Huijuan; Ma, Jiayao; Peng, Rui; You, Zhong
2016-06-01
The traditional waterbomb origami, produced from a pattern consisting of a series of vertices where six creases meet, is one of the most widely used origami patterns. From a rigid origami viewpoint, it generally has multiple degrees of freedom, but when the pattern is folded symmetrically, the mobility reduces to one. This paper presents a thorough kinematic investigation on symmetric folding of the waterbomb pattern. It has been found that the pattern can have two folding paths under certain circumstance. Moreover, the pattern can be used to fold thick panels. Not only do the additional constraints imposed to fold the thick panels lead to single degree of freedom folding, but the folding process is also kinematically equivalent to the origami of zero-thickness sheets. The findings pave the way for the pattern being readily used to fold deployable structures ranging from flat roofs to large solar panels.
Rome, J.A.; Harris, J.H.
1984-01-01
A fusion reactor device is provided in which the magnetic fields for plasma confinement in a toroidal configuration is produced by a plurality of symmetrical modular coils arranged to form a symmetric modular torsatron referred to as a symmotron. Each of the identical modular coils is helically deformed and comprise one field period of the torsatron. Helical segments of each coil are connected by means of toroidally directed windbacks which may also provide part of the vertical field required for positioning the plasma. The stray fields of the windback segments may be compensated by toroidal coils. A variety of magnetic confinement flux surface configurations may be produced by proper modulation of the winding pitch of the helical segments of the coils, as in a conventional torsatron, winding the helix on a noncircular cross section and varying the poloidal and radial location of the windbacks and the compensating toroidal ring coils.
Symmetric vectors and algebraic classification
International Nuclear Information System (INIS)
Leibowitz, E.
1980-01-01
The concept of symmetric vector field in Riemannian manifolds, which arises in the study of relativistic cosmological models, is analyzed. Symmetric vectors are tied up with the algebraic properties of the manifold curvature. A procedure for generating a congruence of symmetric fields out of a given pair is outlined. The case of a three-dimensional manifold of constant curvature (''isotropic universe'') is studied in detail, with all its symmetric vector fields being explicitly constructed
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.
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.
Representations of locally symmetric spaces
International Nuclear Information System (INIS)
Rahman, M.S.
1995-09-01
Locally symmetric spaces in reference to globally and Hermitian symmetric Riemannian spaces are studied. Some relations between locally and globally symmetric spaces are exhibited. A lucid account of results on relevant spaces, motivated by fundamental problems, are formulated as theorems and propositions. (author). 10 refs
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
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.
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.
Weakly Interacting Symmetric and Anti-Symmetric States in the Bilayer Systems
Marchewka, M.; Sheregii, E. M.; Tralle, I.; Tomaka, G.; Ploch, D.
We have studied the parallel magneto-transport in DQW-structures of two different potential shapes: quasi-rectangular and quasi-triangular. The quantum beats effect was observed in Shubnikov-de Haas (SdH) oscillations for both types of the DQW structures in perpendicular magnetic filed arrangement. We developed a special scheme for the Landau levels energies calculation by means of which we carried out the necessary simulations of beating effect. In order to obtain the agreement between our experimental data and the results of simulations, we introduced two different quasi-Fermi levels which characterize symmetric and anti-symmetric states in DQWs. The existence of two different quasi Fermi-Levels simply means, that one can treat two sub-systems (charge carriers characterized by symmetric and anti-symmetric wave functions) as weakly interacting and having their own rate of establishing the equilibrium state.
Fourier inversion on a reductive symmetric space
Ban, E.P. van den
1999-01-01
Let X be a semisimple symmetric space. In previous papers, [8] and [9], we have dened an explicit Fourier transform for X and shown that this transform is injective on the space C 1 c (X) ofcompactly supported smooth functions on X. In the present paper, which is a continuation of these papers, we
The Axially Symmetric One-Monopole
International Nuclear Information System (INIS)
Wong, K.-M.; Teh, Rosy
2009-01-01
We present new classical generalized one-monopole solution of the SU(2) Yang-Mills-Higgs theory with the Higgs field in the adjoint representation. We show that this solution with θ-winding number m = 1 and φ-winding number n = 1 is an axially symmetric generalization of the 't Hooft-Polyakov one-monopole. We construct this axially symmetric one-monopole solution by generalizing the large distance asymptotic solutions of the 't Hooft-Polyakov one-monopole to the Jacobi elliptic functions and solving the second order equations of motion numerically when the Higgs potential is vanishing. This solution is a non-BPS solution.
Holographic Spherically Symmetric Metrics
Petri, Michael
The holographic principle (HP) conjectures, that the maximum number of degrees of freedom of any realistic physical system is proportional to the system's boundary area. The HP has its roots in the study of black holes. It has recently been applied to cosmological solutions. In this article we apply the HP to spherically symmetric static space-times. We find that any regular spherically symmetric object saturating the HP is subject to tight constraints on the (interior) metric, energy-density, temperature and entropy-density. Whenever gravity can be described by a metric theory, gravity is macroscopically scale invariant and the laws of thermodynamics hold locally and globally, the (interior) metric of a regular holographic object is uniquely determined up to a constant factor and the interior matter-state must follow well defined scaling relations. When the metric theory of gravity is general relativity, the interior matter has an overall string equation of state (EOS) and a unique total energy-density. Thus the holographic metric derived in this article can serve as simple interior 4D realization of Mathur's string fuzzball proposal. Some properties of the holographic metric and its possible experimental verification are discussed. The geodesics of the holographic metric describe an isotropically expanding (or contracting) universe with a nearly homogeneous matter-distribution within the local Hubble volume. Due to the overall string EOS the active gravitational mass-density is zero, resulting in a coasting expansion with Ht = 1, which is compatible with the recent GRB-data.
Path integral representation of the symmetric Rosen-Morse potential
International Nuclear Information System (INIS)
Duru, I.H.
1983-09-01
An integral formula for the Green's function of symmetric Rosen-Morse potential is obtained by solving path integrals. The correctly normalized wave functions and bound state energy spectrum are derived. (author)
Symmetric extendibility of quantum states
Nowakowski, Marcin L.
2015-01-01
Studies on symmetric extendibility of quantum states become especially important in a context of analysis of one-way quantum measures of entanglement, distilabillity and security of quantum protocols. In this paper we analyse composite systems containing a symmetric extendible part with a particular attention devoted to one-way security of such systems. Further, we introduce a new one-way monotone based on the best symmetric approximation of quantum state. We underpin those results with geome...
International Nuclear Information System (INIS)
Burtraw, Dallas; Palmer, Karen; Kahn, Danny
2010-01-01
How to set policy in the presence of uncertainty has been central in debates over climate policy. Concern about costs has motivated the proposal for a cap-and-trade program for carbon dioxide, with a 'safety valve' that would mitigate against spikes in the cost of emission reductions by introducing additional emission allowances into the market when marginal costs rise above the specified allowance price level. We find two significant problems, both stemming from the asymmetry of an instrument that mitigates only against a price increase. One is that most important examples of price volatility in cap-and-trade programs have occurred not when prices spiked, but instead when allowance prices collapsed. Second, a single-sided safety valve may have unintended consequences for investment. We illustrate that a symmetric safety valve provides environmental and welfare improvements relative to the conventional one-sided approach.
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
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.
Directory of Open Access Journals (Sweden)
Mikko Niilo-Rämä
2014-06-01
Full Text Available A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation of its variance is derived. The accuracies of the approximations are evaluated by means of simulation experiments. The novel method is compared to other methods and applied to real-world industrial data from nanocellulose crystalline.
The 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.
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
Exact axially symmetric galactic dynamos
Henriksen, R. N.; Woodfinden, A.; Irwin, J. A.
2018-05-01
We give a selection of exact dynamos in axial symmetry on a galactic scale. These include some steady examples, at least one of which is wholly analytic in terms of simple functions and has been discussed elsewhere. Most solutions are found in terms of special functions, such as associated Lagrange or hypergeometric functions. They may be considered exact in the sense that they are known to any desired accuracy in principle. The new aspect developed here is to present scale-invariant solutions with zero resistivity that are self-similar in time. The time dependence is either a power law or an exponential factor, but since the geometry of the solution is self-similar in time we do not need to fix a time to study it. Several examples are discussed. Our results demonstrate (without the need to invoke any other mechanisms) X-shaped magnetic fields and (axially symmetric) magnetic spiral arms (both of which are well observed and documented) and predict reversing rotation measures in galaxy haloes (now observed in the CHANG-ES sample) as well as the fact that planar magnetic spirals are lifted into the galactic halo.
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.
Bent functions results and applications to cryptography
Tokareva, Natalia
2015-01-01
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced
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.
Super-symmetric informationally complete measurements
Energy Technology Data Exchange (ETDEWEB)
Zhu, Huangjun, E-mail: hzhu@pitp.ca
2015-11-15
Symmetric informationally complete measurements (SICs in short) are highly symmetric structures in the Hilbert space. They possess many nice properties which render them an ideal candidate for fiducial measurements. The symmetry of SICs is intimately connected with the geometry of the quantum state space and also has profound implications for foundational studies. Here we explore those SICs that are most symmetric according to a natural criterion and show that all of them are covariant with respect to the Heisenberg–Weyl groups, which are characterized by the discrete analog of the canonical commutation relation. Moreover, their symmetry groups are subgroups of the Clifford groups. In particular, we prove that the SIC in dimension 2, the Hesse SIC in dimension 3, and the set of Hoggar lines in dimension 8 are the only three SICs up to unitary equivalence whose symmetry groups act transitively on pairs of SIC projectors. Our work not only provides valuable insight about SICs, Heisenberg–Weyl groups, and Clifford groups, but also offers a new approach and perspective for studying many other discrete symmetric structures behind finite state quantum mechanics, such as mutually unbiased bases and discrete Wigner functions.
A Paley-Wiener theorem for reductive symmetric spaces
Ban, E.P. van den; Schlichtkrull, H.
2006-01-01
Let X = G/H be a reductive symmetric space and K a maximal compact subgroup of G. The image under the Fourier transform of the space of K-finite compactly supported smooth functions on X is characterized.
Mesotherapy for benign symmetric lipomatosis.
Hasegawa, Toshio; Matsukura, Tomoyuki; Ikeda, Shigaku
2010-04-01
Benign symmetric lipomatosis, also known as Madelung disease, is a rare disorder characterized by fat distribution around the shoulders, arms, and neck in the context of chronic alcoholism. Complete excision of nonencapsulated lipomas is difficult. However, reports describing conservative therapeutic measures for lipomatosis are rare. The authors present the case of a 42-year-old man with a diagnosis of benign symmetric lipomatosis who had multiple, large, symmetrical masses in his neck. Multiple phosphatidylcholine injections in the neck were administered 4 weeks apart, a total of seven times to achieve lipolysis. The patient's lipomatosis improved in response to the injections, and he achieved good cosmetic results. Intralesional injection, termed mesotherapy, using phosphatidylcholine is a potentially effective therapy for benign symmetric lipomatosis that should be reconsidered as a therapeutic option for this disease.
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...
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.
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…
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
Spherically symmetric charged compact stars
Energy Technology Data Exchange (ETDEWEB)
Maurya, S.K. [University of Nizwa, Department of Mathematical and Physical Sciences, College of Arts and Science, Nizwa (Oman); Gupta, Y.K. [Jaypee Institute of Information Technology University, Department of Mathematics, Noida, Uttar Pradesh (India); Ray, Saibal [Government College of Engineering and Ceramic Technology, Department of Physics, Kolkata, West Bengal (India); Chowdhury, Sourav Roy [Seth Anandaram Jaipuria College, Department of Physics, Kolkata, West Bengal (India)
2015-08-15
In this article we consider the static spherically symmetric metric of embedding class 1. When solving the Einstein-Maxwell field equations we take into account the presence of ordinary baryonic matter together with the electric charge. Specific new charged stellar models are obtained where the solutions are entirely dependent on the electromagnetic field, such that the physical parameters, like density, pressure etc. do vanish for the vanishing charge. We systematically analyze altogether the three sets of Solutions I, II, and III of the stellar models for a suitable functional relation of ν(r). However, it is observed that only the Solution I provides a physically valid and well-behaved situation, whereas the Solutions II and III are not well behaved and hence not included in the study. Thereafter it is exclusively shown that the Solution I can pass through several standard physical tests performed by us. To validate the solution set presented here a comparison has also been made with that of the compact stars, like RX J 1856 - 37, Her X - 1, PSR 1937+21, PSRJ 1614-2230, and PSRJ 0348+0432, and we have shown the feasibility of the models. (orig.)
Looking for symmetric Bell inequalities
Bancal, Jean-Daniel; Gisin, Nicolas; Pironio, Stefano
2010-01-01
Finding all Bell inequalities for a given number of parties, measurement settings and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found by examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238 885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell e...
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
International Nuclear Information System (INIS)
Miller, William H.; Cotton, Stephen J.
2016-01-01
It is pointed out that the classical phase space distribution in action-angle (a-a) variables obtained from a Wigner function depends on how the calculation is carried out: if one computes the standard Wigner function in Cartesian variables (p, x), and then replaces p and x by their expressions in terms of a-a variables, one obtains a different result than if the Wigner function is computed directly in terms of the a-a variables. Furthermore, the latter procedure gives a result more consistent with classical and semiclassical theory—e.g., by incorporating the Bohr-Sommerfeld quantization condition (quantum states defined by integer values of the action variable) as well as the Heisenberg correspondence principle for matrix elements of an operator between such states—and has also been shown to be more accurate when applied to electronically non-adiabatic applications as implemented within the recently developed symmetrical quasi-classical (SQC) Meyer-Miller (MM) approach. Moreover, use of the Wigner function (obtained directly) in a-a variables shows how our standard SQC/MM approach can be used to obtain off-diagonal elements of the electronic density matrix by processing in a different way the same set of trajectories already used (in the SQC/MM methodology) to obtain the diagonal elements.
Miller, William H; Cotton, Stephen J
2016-08-28
It is pointed out that the classical phase space distribution in action-angle (a-a) variables obtained from a Wigner function depends on how the calculation is carried out: if one computes the standard Wigner function in Cartesian variables (p, x), and then replaces p and x by their expressions in terms of a-a variables, one obtains a different result than if the Wigner function is computed directly in terms of the a-a variables. Furthermore, the latter procedure gives a result more consistent with classical and semiclassical theory-e.g., by incorporating the Bohr-Sommerfeld quantization condition (quantum states defined by integer values of the action variable) as well as the Heisenberg correspondence principle for matrix elements of an operator between such states-and has also been shown to be more accurate when applied to electronically non-adiabatic applications as implemented within the recently developed symmetrical quasi-classical (SQC) Meyer-Miller (MM) approach. Moreover, use of the Wigner function (obtained directly) in a-a variables shows how our standard SQC/MM approach can be used to obtain off-diagonal elements of the electronic density matrix by processing in a different way the same set of trajectories already used (in the SQC/MM methodology) to obtain the diagonal elements.
Energy Technology Data Exchange (ETDEWEB)
Miller, William H., E-mail: millerwh@berkeley.edu; Cotton, Stephen J., E-mail: StephenJCotton47@gmail.com [Department of Chemistry and Kenneth S. Pitzer Center for Theoretical Chemistry, University of California, and Chemical Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States)
2016-08-28
It is pointed out that the classical phase space distribution in action-angle (a-a) variables obtained from a Wigner function depends on how the calculation is carried out: if one computes the standard Wigner function in Cartesian variables (p, x), and then replaces p and x by their expressions in terms of a-a variables, one obtains a different result than if the Wigner function is computed directly in terms of the a-a variables. Furthermore, the latter procedure gives a result more consistent with classical and semiclassical theory—e.g., by incorporating the Bohr-Sommerfeld quantization condition (quantum states defined by integer values of the action variable) as well as the Heisenberg correspondence principle for matrix elements of an operator between such states—and has also been shown to be more accurate when applied to electronically non-adiabatic applications as implemented within the recently developed symmetrical quasi-classical (SQC) Meyer-Miller (MM) approach. Moreover, use of the Wigner function (obtained directly) in a-a variables shows how our standard SQC/MM approach can be used to obtain off-diagonal elements of the electronic density matrix by processing in a different way the same set of trajectories already used (in the SQC/MM methodology) to obtain the diagonal elements.
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
Ma, Q.; Boulet, C.; Tipping, R. H.
2014-01-01
The refinement of the Robert-Bonamy (RB) formalism by considering the line coupling for isotropic Raman Q lines of linear molecules developed in our previous study [Q. Ma, C. Boulet, and R. H. Tipping, J. Chem. Phys. 139, 034305 (2013)] has been extended to infrared P and R lines. In these calculations, the main task is to derive diagonal and off-diagonal matrix elements of the Liouville operator iS1 - S2 introduced in the formalism. When one considers the line coupling for isotropic Raman Q lines where their initial and final rotational quantum numbers are identical, the derivations of off-diagonal elements do not require extra correlation functions of the ^S operator and their Fourier transforms except for those used in deriving diagonal elements. In contrast, the derivations for infrared P and R lines become more difficult because they require a lot of new correlation functions and their Fourier transforms. By introducing two dimensional correlation functions labeled by two tensor ranks and making variable changes to become even functions, the derivations only require the latters' two dimensional Fourier transforms evaluated at two modulation frequencies characterizing the averaged energy gap and the frequency detuning between the two coupled transitions. With the coordinate representation, it is easy to accurately derive these two dimensional correlation functions. Meanwhile, by using the sampling theory one is able to effectively evaluate their two dimensional Fourier transforms. Thus, the obstacles in considering the line coupling for P and R lines have been overcome. Numerical calculations have been carried out for the half-widths of both the isotropic Raman Q lines and the infrared P and R lines of C2H2 broadened by N2. In comparison with values derived from the RB formalism, new calculated values are significantly reduced and become closer to measurements.
symmetrically deformed integrable systems
Indian Academy of Sciences (India)
plex Liouville theory, a rigorous proof for the reality of the spectrum was found by Faddeev and .... to use non-rational potentials? Can one have more .... The freedom in the choice of the functions R(ϵ),I(ϵ) may then be used to satisfy the ...
Harmonic analysis on symmetric spaces
Terras, Audrey
This text explores the geometry and analysis of higher rank analogues of the symmetric spaces introduced in volume one. To illuminate both the parallels and differences of the higher rank theory, the space of positive matrices is treated in a manner mirroring that of the upper-half space in volume one. This concrete example furnishes motivation for the general theory of noncompact symmetric spaces, which is outlined in the final chapter. The book emphasizes motivation and comprehensibility, concrete examples and explicit computations (by pen and paper, and by computer), history, and, above all, applications in mathematics, statistics, physics, and engineering. The second edition includes new sections on Donald St. P. Richards’s central limit theorem for O(n)-invariant random variables on the symmetric space of GL(n, R), on random matrix theory, and on advances in the theory of automorphic forms on arithmetic groups.
Symmetric spaces and the Kashiwara-Vergne method
Rouvière, François
2014-01-01
Gathering and updating results scattered in journal articles over thirty years, this self-contained monograph gives a comprehensive introduction to the subject. Its goal is to: - motivate and explain the method for general Lie groups, reducing the proof of deep results in invariant analysis to the verification of two formal Lie bracket identities related to the Campbell-Hausdorff formula (the "Kashiwara-Vergne conjecture"); - give a detailed proof of the conjecture for quadratic and solvable Lie algebras, which is relatively elementary; - extend the method to symmetric spaces; here an obstruction appears, embodied in a single remarkable object called an "e-function"; - explain the role of this function in invariant analysis on symmetric spaces, its relation to invariant differential operators, mean value operators and spherical functions; - give an explicit e-function for rank one spaces (the hyperbolic spaces); - construct an e-function for general symmetric spaces, in the spirit of Kashiwara and Vergne's or...
Looking for symmetric Bell inequalities
International Nuclear Information System (INIS)
Bancal, Jean-Daniel; Gisin, Nicolas; Pironio, Stefano
2010-01-01
Finding all Bell inequalities for a given number of parties, measurement settings and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found by examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238 885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell experiments involving two parties and two measurement settings that are not of the Collins-Gisin-Linden-Massar-Popescu type.
Symmetric normalisation for intuitionistic logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Straßburger, Lutz
2014-01-01
We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus......, but using a non-local rewriting. The second system is the symmetric completion of the first, as normally given in deep inference for logics with a DeMorgan duality: all inference rules have duals, as cut is dual to the identity axiom. We prove a generalisation of cut elimination, that we call symmetric...
Looking for symmetric Bell inequalities
Energy Technology Data Exchange (ETDEWEB)
Bancal, Jean-Daniel; Gisin, Nicolas [Group of Applied Physics, University of Geneva, 20 rue de l' Ecole-de Medecine, CH-1211 Geneva 4 (Switzerland); Pironio, Stefano, E-mail: jean-daniel.bancal@unige.c [Laboratoire d' Information Quantique, Universite Libre de Bruxelles (Belgium)
2010-09-24
Finding all Bell inequalities for a given number of parties, measurement settings and measurement outcomes is in general a computationally hard task. We show that all Bell inequalities which are symmetric under the exchange of parties can be found by examining a symmetrized polytope which is simpler than the full Bell polytope. As an illustration of our method, we generate 238 885 new Bell inequalities and 1085 new Svetlichny inequalities. We find, in particular, facet inequalities for Bell experiments involving two parties and two measurement settings that are not of the Collins-Gisin-Linden-Massar-Popescu type.
Symmetric autocompensating quantum key distribution
Walton, Zachary D.; Sergienko, Alexander V.; Levitin, Lev B.; Saleh, Bahaa E. A.; Teich, Malvin C.
2004-08-01
We present quantum key distribution schemes which are autocompensating (require no alignment) and symmetric (Alice and Bob receive photons from a central source) for both polarization and time-bin qubits. The primary benefit of the symmetric configuration is that both Alice and Bob may have passive setups (neither Alice nor Bob is required to make active changes for each run of the protocol). We show that both the polarization and the time-bin schemes may be implemented with existing technology. The new schemes are related to previously described schemes by the concept of advanced waves.
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...
Ansari, Mohd Asif; Mandal, Abhishek; Paretzki, Alexa; Beyer, Katharina; Fiedler, Jan; Kaim, Wolfgang; Lahiri, Goutam Kumar
2016-06-06
The dinuclear complexes {(μ-H2L)[Ru(bpy)2]2}(ClO4)2 ([3](ClO4)2), {(μ-H2L)[Ru(pap)2]2}(ClO4)2 ([4](ClO4)2), and the asymmetric [(bpy)2Ru(μ-H2L)Ru(pap)2](ClO4)2 ([5](ClO4)2) were synthesized via the mononuclear species [Ru(H3L)(bpy)2]ClO4 ([1]ClO4) and [Ru(H3L)(pap)2]ClO4 ([2]ClO4), where H4L is the centrosymmetric 1,5-diamino-9,10-anthraquinone, bpy is 2,2'-bipyridine, and pap is 2-phenylazopyridine. Electrochemistry of the structurally characterized [1]ClO4, [2]ClO4, [3](ClO4)2, [4](ClO4)2, and [5](ClO4)2 reveals multistep oxidation and reduction processes, which were analyzed by electron paramagnetic resonance (EPR) of paramagnetic intermediates and by UV-vis-NIR spectro-electrochemistry. With support by time-dependent density functional theory (DFT) calculations the redox processes could be assigned. Significant results include the dimetal/bridging ligand mixed spin distribution in 3(3+) versus largely bridge-centered spin in 4(3+)-a result of the presence of Ru(II)-stabilizig pap coligands. In addition to the metal/ligand alternative for electron transfer and spin location, the dinuclear systems allow for the observation of ligand/ligand and metal/metal site differentiation within the multistep redox series. DFT-supported EPR and NIR absorption spectroscopy of the latter case revealed class II mixed-valence behavior of the oxidized asymmetric system 5(3+) with about equal contributions from a radical bridge formulation. In comparison to the analogues with the deprotonated 1,4-diaminoanthraquinone isomer the centrosymmetric H2L(2-) bridge shows anodically shifted redox potentials and weaker electronic coupling between the chelate sites.
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.
Bound states for non-symmetric evolution Schroedinger potentials
Energy Technology Data Exchange (ETDEWEB)
Corona, Gulmaro Corona [Area de Analisis Matematico y sus Aplicaciones, Universidad Autonoma Metropolitana-Azcapotalco, Atzcapotzalco, DF (Mexico)). E-mail: ccg@correo.azc.uam.mx
2001-09-14
We consider the spectral problem associated with the evolution Schroedinger equation, (D{sup 2}+ k{sup 2}){phi}=u{phi}, where u is a matrix-square-valued function, with entries in the Schwartz class defined on the real line. The solution {phi}, called the wavefunction, consists of a function of one real variable, matrix-square-valued with entries in the Schwartz class. This problem has been dealt for symmetric potentials u. We found for the present case that the bound states are localized similarly to the scalar and symmetric cases, but by the zeroes of an analytic matrix-valued function. If we add an extra condition to the potential u, we can determine these states by an analytic scalar function. We do this by generalizing the scalar and symmetric cases but without using the fact that the Wronskian of a pair of wavefunction is constant. (author)
Symmetric relations of finite negativity
Kaltenbaeck, M.; Winkler, H.; Woracek, H.; Forster, KH; Jonas, P; Langer, H
2006-01-01
We construct and investigate a space which is related to a symmetric linear relation S of finite negativity on an almost Pontryagin space. This space is the indefinite generalization of the completion of dom S with respect to (S.,.) for a strictly positive S on a Hilbert space.
Tilting-connected symmetric algebras
Aihara, Takuma
2010-01-01
The notion of silting mutation was introduced by Iyama and the author. In this paper we mainly study silting mutation for self-injective algebras and prove that any representation-finite symmetric algebra is tilting-connected. Moreover we give some sufficient conditions for a Bongartz-type Lemma to hold for silting objects.
Symmetric group representations and Z
Adve, Anshul; Yong, Alexander
2017-01-01
We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as a Littlewood-Richardson coefficient and as a Kronecker coefficient.
Symmetric Key Authentication Services Revisited
Crispo, B.; Popescu, B.C.; Tanenbaum, A.S.
2004-01-01
Most of the symmetric key authentication schemes deployed today are based on principles introduced by Needham and Schroeder [15] more than twenty years ago. However, since then, the computing environment has evolved from a LAN-based client-server world to include new paradigms, including wide area
Quantum systems and symmetric spaces
International Nuclear Information System (INIS)
Olshanetsky, M.A.; Perelomov, A.M.
1978-01-01
Certain class of quantum systems with Hamiltonians related to invariant operators on symmetric spaces has been investigated. A number of physical facts have been derived as a consequence. In the classical limit completely integrable systems related to root systems are obtained
The symmetric longest queue system
van Houtum, Geert-Jan; Adan, Ivo; van der Wal, Jan
1997-01-01
We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue
Realization of a quantum Hamiltonian Boolean logic gate on the Si(001):H surface.
Kolmer, Marek; Zuzak, Rafal; Dridi, Ghassen; Godlewski, Szymon; Joachim, Christian; Szymonski, Marek
2015-08-07
The design and construction of the first prototypical QHC (Quantum Hamiltonian Computing) atomic scale Boolean logic gate is reported using scanning tunnelling microscope (STM) tip-induced atom manipulation on an Si(001):H surface. The NOR/OR gate truth table was confirmed by dI/dU STS (Scanning Tunnelling Spectroscopy) tracking how the surface states of the QHC quantum circuit on the Si(001):H surface are shifted according to the input logical status.
Web-page Prediction for Domain Specific Web-search using Boolean Bit Mask
Sinha, Sukanta; Duttagupta, Rana; Mukhopadhyay, Debajyoti
2012-01-01
Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize their time using an efficient search engine. To improve the performance of the search engine, we are introducing a unique mechanism which will give Web searchers more prominent search results. In this paper, we are going to discuss a domain specific Web search prototype which will generate the predicted Web-page list for user given search string using Boolean bit mask.
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
Complete CCC Boolean Algebras, the order Sequential Topology, and a Problem of von Neumann
Czech Academy of Sciences Publication Activity Database
Balcar, Bohuslav; Jech, Thomas; Pazák, Tomáš
2005-01-01
Roč. 37, č. 6 (2005), s. 885-898 ISSN 0024-6093 R&D Projects: GA ČR(CZ) GA201/02/0857; GA ČR(CZ) GA201/03/0933 Institutional research plan: CEZ:AV0Z10190503 Keywords : Boolean algebra * Maharam submeasure * weak distributivity Subject RIV: BA - General Mathematics Impact factor: 0.477, year: 2005
THE METHOD OF CONSTRUCTING A BOOLEAN FORMULA OF A POLYGON IN THE DISJUNCTIVE NORMAL FORM
Directory of Open Access Journals (Sweden)
A. A. Butov
2014-01-01
Full Text Available The paper focuses on finalizing the method of finding a polygon Boolean formula in disjunctive normal form, described in the previous article [1]. An improved method eliminates the drawback asso-ciated with the existence of a class of problems for which the solution is only approximate. The pro-posed method always allows to find an exact solution. The method can be used, in particular, in the systems of computer-aided design of integrated circuits topology.
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.
2009-01-01
Roč. 20, č. 7 (2009), s. 1073-1086 ISSN 1045-9227 R&D Projects: GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.889, year: 2009
Symmetric imaging findings in neuroradiology
International Nuclear Information System (INIS)
Zlatareva, D.
2015-01-01
Full text: Learning objectives: to make a list of diseases and syndromes which manifest as bilateral symmetric findings on computed tomography and magnetic resonance imaging; to discuss the clinical and radiological differential diagnosis for these diseases; to explain which of these conditions necessitates urgent therapy and when additional studies and laboratory can precise diagnosis. There is symmetry in human body and quite often we compare the affected side to the normal one but in neuroradiology we might have bilateral findings which affected pair structures or corresponding anatomic areas. It is very rare when clinical data prompt diagnosis. Usually clinicians suspect such an involvement but Ct and MRI can reveal symmetric changes and are one of the leading diagnostic tool. The most common location of bilateral findings is basal ganglia and thalamus. There are a number of diseases affecting these structures symmetrically: metabolic and systemic diseases, intoxication, neurodegeneration and vascular conditions, toxoplasmosis, tumors and some infections. Malformations of cortical development and especially bilateral perisylvian polymicrogyria requires not only exact report on the most affected parts but in some cases genetic tests or combination with other clinical symptoms. In the case of herpes simplex encephalitis bilateral temporal involvement is common and this finding very often prompt therapy even before laboratory results. Posterior reversible encephalopathy syndrome (PReS) and some forms of hypoxic ischemic encephalopathy can lead to symmetric changes. In these acute conditions MR plays a crucial role not only in diagnosis but also in monitoring of the therapeutic effect. Patients with neurofibromatosis type 1 or type 2 can demonstrate bilateral optic glioma combined with spinal neurofibroma and bilateral acoustic schwanoma respectively. Mirror-image aneurysm affecting both internal carotid or middle cerebral arteries is an example of symmetry in
Pietanza, L D; Colonna, G; Laporta, V; Celiberto, R; D'Ammando, G; Laricchiuta, A; Capitelli, M
2016-05-05
A new set of electron-vibrational (e-V) processes linking the first 10 vibrational levels of the symmetric mode of CO2 is derived by using a decoupled vibrational model and inserted in the Boltzmann equation for the electron energy distribution function (eedf). The new eedf and dissociation rates are in satisfactory agreement with the corresponding ones obtained by using the e-V cross sections reported in the database of Hake and Phelps (H-P). Large differences are, on the contrary, found when the experimental dissociation cross sections of Cosby and Helm are inserted in the Boltzman equation. Comparison of the corresponding rates with those obtained by using the low-energy threshold energy, reported in the H-P database, shows differences up to orders of magnitude, which decrease with the increasing of the reduced electric field. In all cases, we show the importance of superelastic vibrational collisions in affecting eedf and dissociation rates either in the direct electron impact mechanism or in the pure vibrational mechanism.
Canonical quantization of static spherically symmetric geometries
International Nuclear Information System (INIS)
Christodoulakis, T; Dimakis, N; Terzis, P A; Doulis, G; Grammenos, Th; Melas, E; Spanou, A
2013-01-01
The conditional symmetries of the reduced Einstein–Hilbert action emerging from a static, spherically symmetric geometry are used as supplementary conditions on the wave function. Based on their integrability conditions, only one of the three existing symmetries can be consistently imposed, while the unique Casimir invariant, being the product of the remaining two symmetries, is calculated as the only possible second condition on the wave function. This quadratic integral of motion is identified with the reparametrization generator, as an implication of the uniqueness of the dynamical evolution, by fixing a suitable parametrization of the r-lapse function. In this parametrization, the determinant of the supermetric plays the role of the mesure. The combined Wheeler – DeWitt and linear conditional symmetry equations are analytically solved. The solutions obtained depend on the product of the two ''scale factors''
Homotheties of cylindrically symmetric static spacetimes
International Nuclear Information System (INIS)
Qadir, A.; Ziad, M.; Sharif, M.
1998-08-01
In this note we consider the homotheties of cylindrically symmetric static spacetimes. We find that we can provide a complete list of all metrics that admit non-trivial homothetic motions and are cylindrically symmetric static. (author)
Maximally Symmetric Composite Higgs Models.
Csáki, Csaba; Ma, Teng; Shu, Jing
2017-09-29
Maximal symmetry is a novel tool for composite pseudo Goldstone boson Higgs models: it is a remnant of an enhanced global symmetry of the composite fermion sector involving a twisting with the Higgs field. Maximal symmetry has far-reaching consequences: it ensures that the Higgs potential is finite and fully calculable, and also minimizes the tuning. We present a detailed analysis of the maximally symmetric SO(5)/SO(4) model and comment on its observational consequences.
Characterization of Generalized Young Measures Generated by Symmetric Gradients
De Philippis, Guido; Rindler, Filip
2017-06-01
This work establishes a characterization theorem for (generalized) Young measures generated by symmetric derivatives of functions of bounded deformation (BD) in the spirit of the classical Kinderlehrer-Pedregal theorem. Our result places such Young measures in duality with symmetric-quasiconvex functions with linear growth. The "local" proof strategy combines blow-up arguments with the singular structure theorem in BD (the analogue of Alberti's rank-one theorem in BV), which was recently proved by the authors. As an application of our characterization theorem we show how an atomic part in a BD-Young measure can be split off in generating sequences.
On symmetric structures of order two
Directory of Open Access Journals (Sweden)
Michel Bousquet
2008-04-01
Full Text Available Let (ω n 0 < n be the sequence known as Integer Sequence A047749 http://www.research.att.com/ njas/sequences/A047749 In this paper, we show that the integer ω n enumerates various kinds of symmetric structures of order two. We first consider ternary trees having a reflexive symmetry and we relate all symmetric combinatorial objects by means of bijection. We then generalize the symmetric structures and correspondences to an infinite family of symmetric objects.
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.
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
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...
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
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.
Baryon symmetric big bang cosmology
International Nuclear Information System (INIS)
Stecker, F.W.
1978-01-01
It is stated that the framework of baryon symmetric big bang (BSBB) cosmology offers our greatest potential for deducting the evolution of the Universe because its physical laws and processes have the minimum number of arbitrary assumptions about initial conditions in the big-bang. In addition, it offers the possibility of explaining the photon-baryon ratio in the Universe and how galaxies and galaxy clusters are formed. BSBB cosmology also provides the only acceptable explanation at present for the origin of the cosmic γ-ray background radiation. (author)
Immanant Conversion on Symmetric Matrices
Directory of Open Access Journals (Sweden)
Purificação Coelho M.
2014-01-01
Full Text Available Letr Σn(C denote the space of all n χ n symmetric matrices over the complex field C. The main objective of this paper is to prove that the maps Φ : Σn(C -> Σn (C satisfying for any fixed irre- ducible characters X, X' -SC the condition dx(A +aB = dχ·(Φ(Α + αΦ(Β for all matrices A,В ε Σ„(С and all scalars a ε C are automatically linear and bijective. As a corollary of the above result we characterize all such maps Φ acting on ΣИ(С.
The inverse spatial Laplacian of spherically symmetric spacetimes
International Nuclear Information System (INIS)
Fernandes, Karan; Lahiri, Amitabha
2017-01-01
We derive the inverse spatial Laplacian for static, spherically symmetric backgrounds by solving Poisson’s equation for a point source. This is different from the electrostatic Green function, which is defined on the four dimensional static spacetime, while the equation we consider is defined on the spatial hypersurface of such spacetimes. This Green function is relevant in the Hamiltonian dynamics of theories defined on spherically symmetric backgrounds, and closed form expressions for the solutions we find are absent in the literature. We derive an expression in terms of elementary functions for the Schwarzschild spacetime, and comment on the relation of this solution with the known Green function of the spacetime Laplacian operator. We also find an expression for the Green function on the static pure de-Sitter space in terms of hypergeometric functions. We conclude with a discussion of the constraints of the electromagnetic field. (paper)
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.
Extensions of the Hardy-Littlewood inequalities for Schwarz symmetrization
Directory of Open Access Journals (Sweden)
H. Hajaiej
2004-01-01
Full Text Available For a class of functions H:(0,∞×ℝ+2→ℝ, including discontinuous functions of Carathéodory type, we establish that ∫ℝNH(|x|,u(x,v(xdx≤∫ℝNH(|x|,u*(x,v*(xdx, where u*(x and v*(x denote the Schwarz symmetrizations of nonnegative functions u and v.
On the axially symmetric equilibrium of a magnetically confined plasma
International Nuclear Information System (INIS)
Lehnert, B.
1975-01-01
The axially symmetric equilibrium of a magnetically confined plasma is reconsidered, with the special purpose of studying high-beta schemes with a purely poloidal magnetic field. A number of special solutions of the pressure and magnetic flux functions are shown to exist, the obtained results may form starting-points in a further analysis of physically relevant configurations. (Auth.)
Symmetric structures of coherent states in superfluid helium-4
International Nuclear Information System (INIS)
Ahmad, M.
1981-02-01
Coherent States in superfluid helium-4 are discussed and symmetric structures are assigned to these states. Discrete and continuous series functions are exhibited for such states. Coherent State structure has been assigned to oscillating condensed bosons and their inter-relations and their effects on the superfluid system are analysed. (author)
Integrability and symmetric spaces. II- The coset spaces
International Nuclear Information System (INIS)
Ferreira, L.A.
1987-01-01
It shown that a sufficient condition for a model describing the motion of a particle on a coset space to possess a fundamental Poisson bracket relation, and consequently charges involution, is that it must be a symmetric space. The conditions a hamiltonian, or any function of the canonical variables, has to satisfy in order to commute with these charges are studied. It is shown that, for the case of non compact symmetric space, these conditions lead to an algebraic structure which plays an important role in the construction of conserved quantities. (author) [pt
On the symmetric α-stable distribution with application to symbol error rate calculations
Soury, Hamza; Alouini, Mohamed-Slim
2016-01-01
The probability density function (PDF) of the symmetric α-stable distribution is investigated using the inverse Fourier transform of its characteristic function. For general values of the stable parameter α, it is shown that the PDF
Solution of generalized shifted linear systems with complex symmetric matrices
International Nuclear Information System (INIS)
Sogabe, Tomohiro; Hoshi, Takeo; Zhang, Shao-Liang; Fujiwara, Takeo
2012-01-01
We develop the shifted COCG method [R. Takayama, T. Hoshi, T. Sogabe, S.-L. Zhang, T. Fujiwara, Linear algebraic calculation of Green’s function for large-scale electronic structure theory, Phys. Rev. B 73 (165108) (2006) 1–9] and the shifted WQMR method [T. Sogabe, T. Hoshi, S.-L. Zhang, T. Fujiwara, On a weighted quasi-residual minimization strategy of the QMR method for solving complex symmetric shifted linear systems, Electron. Trans. Numer. Anal. 31 (2008) 126–140] for solving generalized shifted linear systems with complex symmetric matrices that arise from the electronic structure theory. The complex symmetric Lanczos process with a suitable bilinear form plays an important role in the development of the methods. The numerical examples indicate that the methods are highly attractive when the inner linear systems can efficiently be solved.
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.
Tailoring Spectral Properties of Binary PT-Symmetric Gratings by Duty-Cycle Methods
DEFF Research Database (Denmark)
Lupu, Anatole T.; Benisty, Henri; Lavrinenko, Andrei
2016-01-01
We explore the frequency selective functionalities of a nonuniform PT-symmetric Bragg grating with modulated complex index profile. We start by assessing the possibility to achieve an efficient apodization of the PT-symmetric Bragg grating spectral response by using direct adaptations of the conv...
Probabilistic cloning of three symmetric states
International Nuclear Information System (INIS)
Jimenez, O.; Bergou, J.; Delgado, A.
2010-01-01
We study the probabilistic cloning of three symmetric states. These states are defined by a single complex quantity, the inner product among them. We show that three different probabilistic cloning machines are necessary to optimally clone all possible families of three symmetric states. We also show that the optimal cloning probability of generating M copies out of one original can be cast as the quotient between the success probability of unambiguously discriminating one and M copies of symmetric states.
Classification of symmetric toroidal orbifolds
Energy Technology Data Exchange (ETDEWEB)
Fischer, Maximilian; Ratz, Michael; Torrado, Jesus [Technische Univ. Muenchen, Garching (Germany). Physik-Department; Vaudrevange, Patrick K.S. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)
2012-09-15
We provide a complete classification of six-dimensional symmetric toroidal orbifolds which yield N{>=}1 supersymmetry in 4D for the heterotic string. Our strategy is based on a classification of crystallographic space groups in six dimensions. We find in total 520 inequivalent toroidal orbifolds, 162 of them with Abelian point groups such as Z{sub 3}, Z{sub 4}, Z{sub 6}-I etc. and 358 with non-Abelian point groups such as S{sub 3}, D{sub 4}, A{sub 4} etc. We also briefly explore the properties of some orbifolds with Abelian point groups and N=1, i.e. specify the Hodge numbers and comment on the possible mechanisms (local or non-local) of gauge symmetry breaking.
Nonlinear PT-symmetric plaquettes
International Nuclear Information System (INIS)
Li Kai; Kevrekidis, P G; Malomed, Boris A; Günther, Uwe
2012-01-01
We introduce four basic two-dimensional (2D) plaquette configurations with onsite cubic nonlinearities, which may be used as building blocks for 2D PT-symmetric lattices. For each configuration, we develop a dynamical model and examine its PTsymmetry. The corresponding nonlinear modes are analyzed starting from the Hamiltonian limit, with zero value of the gain–loss coefficient, γ. Once the relevant waveforms have been identified (chiefly, in an analytical form), their stability is examined by means of linearization in the vicinity of stationary points. This reveals diverse and, occasionally, fairly complex bifurcations. The evolution of unstable modes is explored by means of direct simulations. In particular, stable localized modes are found in these systems, although the majority of identified solutions are unstable. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Quantum physics with non-Hermitian operators’. (paper)
Relativistic fluids in spherically symmetric space
International Nuclear Information System (INIS)
Dipankar, R.
1977-12-01
Some of McVittie and Wiltshire's (1977) solutions of Walker's (1935) isotropy conditions for relativistic perfect fluid spheres are generalized. Solutions are spherically symmetric and conformally flat
FFLP problem with symmetric trapezoidal fuzzy numbers
Directory of Open Access Journals (Sweden)
Reza Daneshrad
2015-04-01
Full Text Available The most popular approach for solving fully fuzzy linear programming (FFLP problems is to convert them into the corresponding deterministic linear programs. Khan et al. (2013 [Khan, I. U., Ahmad, T., & Maan, N. (2013. A simplified novel technique for solving fully fuzzy linear programming problems. Journal of Optimization Theory and Applications, 159(2, 536-546.] claimed that there had been no method in the literature to find the fuzzy optimal solution of a FFLP problem without converting it into crisp linear programming problem, and proposed a technique for the same. Others showed that the fuzzy arithmetic operation used by Khan et al. (2013 had some problems in subtraction and division operations, which could lead to misleading results. Recently, Ezzati et al. (2014 [Ezzati, R., Khorram, E., & Enayati, R. (2014. A particular simplex algorithm to solve fuzzy lexicographic multi-objective linear programming problems and their sensitivity analysis on the priority of the fuzzy objective functions. Journal of Intelligent and Fuzzy Systems, 26(5, 2333-2358.] defined a new operation on symmetric trapezoidal fuzzy numbers and proposed a new algorithm to find directly a lexicographic/preemptive fuzzy optimal solution of a fuzzy lexicographic multi-objective linear programming problem by using new fuzzy arithmetic operations, but their model was not fully fuzzy optimization. In this paper, a new method, by using Ezzati et al. (2014’s fuzzy arithmetic operation and a fuzzy version of simplex algorithm, is proposed for solving FFLP problem whose parameters are represented by symmetric trapezoidal fuzzy number without converting the given problem into crisp equivalent problem. By using the proposed method, the fuzzy optimal solution of FFLP problem can be easily obtained. A numerical example is provided to illustrate the proposed method.
Comprehensive asynchronous symmetric rendezvous algorithm in ...
Indian Academy of Sciences (India)
Meenu Chawla
2017-11-10
Nov 10, 2017 ... Simulation results affirm that CASR algorithm performs better in terms of average time-to-rendezvous as compared ... process; neighbour discovery; symmetric rendezvous algorithm. 1. .... dezvous in finite time under the symmetric model. The CH ..... CASR algorithm in Matlab 7.11 and performed several.
Symmetric splitting of very light systems
International Nuclear Information System (INIS)
Grotowski, K.; Majka, Z.; Planeta, R.
1985-01-01
Fission reactions that produce fragments close to one half the mass of the composite system are traditionally observed in heavy nuclei. In light systems, symmetric splitting is rarely observed and poorly understood. It would be interesting to verify the existence of the symmetric splitting of compound nuclei with A 12 C + 40 Ca, 141 MeV 9 Be + 40 Ca and 153 MeV 6 Li + 40 Ca. The out-of-plane correlation of symmetric products was also measured for the reaction 186 MeV 12 C + 40 Ca. The coincidence measurements of the 12 C + 40 Ca system demonstrated that essentially all of the inclusive yield of symmetric products around 40 0 results from a binary decay. To characterize the dependence of the symmetric splitting process on the excitation energy of the 12 C + 40 C system, inclusive measurements were made at bombarding energies of 74, 132, 162, and 185 MeV
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.
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.
Baryon symmetric big bang cosmology
Stecker, F. W.
1978-01-01
Both the quantum theory and Einsteins theory of special relativity lead to the supposition that matter and antimatter were produced in equal quantities during the big bang. It is noted that local matter/antimatter asymmetries may be reconciled with universal symmetry by assuming (1) a slight imbalance of matter over antimatter in the early universe, annihilation, and a subsequent remainder of matter; (2) localized regions of excess for one or the other type of matter as an initial condition; and (3) an extremely dense, high temperature state with zero net baryon number; i.e., matter/antimatter symmetry. Attention is given to the third assumption, which is the simplest and the most in keeping with current knowledge of the cosmos, especially as pertains the universality of 3 K background radiation. Mechanisms of galaxy formation are discussed, whereby matter and antimatter might have collided and annihilated each other, or have coexisted (and continue to coexist) at vast distances. It is pointed out that baryon symmetric big bang cosmology could probably be proved if an antinucleus could be detected in cosmic radiation.
Substring-Searchable Symmetric Encryption
Directory of Open Access Journals (Sweden)
Chase Melissa
2015-06-01
Full Text Available In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE and structured encryption. Then, we construct a queryable encryption scheme for substring queries. Our construction uses suffix trees and achieves asymptotic efficiency comparable to that of unencrypted suffix trees. Encryption of a string of length n takes O(λn time and produces a ciphertext of size O(λn, and querying for a substring of length m that occurs k times takes O(λm+k time and three rounds of communication. Our security definition guarantees correctness of query results and privacy of data and queries against a malicious adversary. Following the line of work started by Curtmola et al. (ACM CCS 2006, in order to construct more efficient schemes we allow the query protocol to leak some limited information that is captured precisely in the definition. We prove security of our substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.
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.
Beig, Robert; Siddiqui, Azad A.
2007-11-01
It is known that spherically symmetric static spacetimes admit a foliation by flat hypersurfaces. Such foliations have explicitly been constructed for some spacetimes, using different approaches, but none of them have proved or even discussed the uniqueness of these foliations. The issue of uniqueness becomes more important due to suitability of flat foliations for studying black hole physics. Here, flat spherically symmetric spacelike hypersurfaces are obtained by a direct method. It is found that spherically symmetric static spacetimes admit flat spherically symmetric hypersurfaces, and that these hypersurfaces are unique up to translation under the timelike Killing vector. This result guarantees the uniqueness of flat spherically symmetric foliations for such spacetimes.
Computing the Algebraic Immunity of Boolean Functions on the SRC-6 Reconfigurable Computer
2012-03-01
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE...BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR...additional amount of logic and delay is negligible for a four-input transeunt triangle, the increases become overwhelming for significantly larger
Confining but chirally symmetric dense and cold matter
International Nuclear Information System (INIS)
Glozman, L. Ya.
2012-01-01
The possibility for existence of cold, dense chirally symmetric matter with confinement is reviewed. The answer to this question crucially depends on the mechanism of mass generation in QCD and interconnection of confinement and chiral symmetry breaking. This question can be clarified from spectroscopy of hadrons and their axial properties. Almost systematical parity doubling of highly excited hadrons suggests that their mass is not related to chiral symmetry breaking in the vacuum and is approximately chirally symmetric. Then there is a possibility for existence of confining but chirally symmetric matter. We clarify a possible mechanism underlying such a phase at low temperatures and large density. Namely, at large density the Pauli blocking prevents the gap equation to generate a solution with broken chiral symmetry. However, the chirally symmetric part of the quark Green function as well as all color non-singlet quantities are still infrared divergent, meaning that the system is with confinement. A possible phase transition to such a matter is most probably of the first order. This is because there are no chiral partners to the lowest lying hadrons.
Exact quantum solution for some symmetrical two-well potentials
International Nuclear Information System (INIS)
Ley-Koo, E.
1985-01-01
We construct the solutions of the Schroedinger equation for the rectangular-well, harmonic-oscillator and symmetric-linear potentials with a delta-function potential superimposed in their central positions. The odd-parity states are not affected by the presence of the delta-function potential. The even-parity states are determined by the condition that their wave functions have in the central position a fixed logarithmic derivative, which is proportional to the intensity the delta-function potential. (author)
On the axially symmetric non-rotating vacuum solutions of Rosen's equations
International Nuclear Information System (INIS)
Bozhkov, Y.
1990-10-01
It is shown that all axially symmetric nonrotating solutions of Rosen's field equations can be expressed in terms of two harmonic functions. It is also shown that the total energy of Rosen's metric is Mc 2 . (author). 8 refs
The symmetric extendibility of quantum states
International Nuclear Information System (INIS)
Nowakowski, Marcin L
2016-01-01
Studies on the symmetric extendibility of quantum states have become particularly important in the context of the analysis of one-way quantum measures of entanglement, and the distillability and security of quantum protocols. In this paper we analyze composite systems containing a symmetric extendible part, with particular attention devoted to the one-way security of such systems. Further, we introduce a new one-way entanglement monotone based on the best symmetric approximation of a quantum state and the extendible number of a quantum state. We underpin these results with geometric observations about the structures of multi-party settings which posses substantial symmetric extendible components in their subspaces. The impossibility of reducing the maximal symmetric extendibility by means of the one-way local operations and classical communication method is pointed out on multiple copies. Finally, we state a conjecture linking symmetric extendibility with the one-way distillability and security of all quantum states, analyzing the behavior of a private key in the neighborhood of symmetric extendible states. (paper)
Averaging in spherically symmetric cosmology
International Nuclear Information System (INIS)
Coley, A. A.; Pelavas, N.
2007-01-01
The averaging problem in cosmology is of fundamental importance. When applied to study cosmological evolution, the theory of macroscopic gravity (MG) can be regarded as a long-distance modification of general relativity. In the MG approach to the averaging problem in cosmology, the Einstein field equations on cosmological scales are modified by appropriate gravitational correlation terms. We study the averaging problem within the class of spherically symmetric cosmological models. That is, we shall take the microscopic equations and effect the averaging procedure to determine the precise form of the correlation tensor in this case. In particular, by working in volume-preserving coordinates, we calculate the form of the correlation tensor under some reasonable assumptions on the form for the inhomogeneous gravitational field and matter distribution. We find that the correlation tensor in a Friedmann-Lemaitre-Robertson-Walker (FLRW) background must be of the form of a spatial curvature. Inhomogeneities and spatial averaging, through this spatial curvature correction term, can have a very significant dynamical effect on the dynamics of the Universe and cosmological observations; in particular, we discuss whether spatial averaging might lead to a more conservative explanation of the observed acceleration of the Universe (without the introduction of exotic dark matter fields). We also find that the correlation tensor for a non-FLRW background can be interpreted as the sum of a spatial curvature and an anisotropic fluid. This may lead to interesting effects of averaging on astrophysical scales. We also discuss the results of averaging an inhomogeneous Lemaitre-Tolman-Bondi solution as well as calculations of linear perturbations (that is, the backreaction) in an FLRW background, which support the main conclusions of the analysis
Biophysical information in asymmetric and symmetric diurnal bidirectional canopy reflectance
Vanderbilt, Vern C.; Caldwell, William F.; Pettigrew, Rita E.; Ustin, Susan L.; Martens, Scott N.; Rousseau, Robert A.; Berger, Kevin M.; Ganapol, B. D.; Kasischke, Eric S.; Clark, Jenny A.
1991-01-01
The authors present a theory for partitioning the information content in diurnal bidirectional reflectance measurements in order to detect differences potentially related to biophysical variables. The theory, which divides the canopy reflectance into asymmetric and symmetric functions of solar azimuth angle, attributes asymmetric variation to diurnal changes in the canopy biphysical properties. The symmetric function is attributed to the effects of sunlight interacting with a hypothetical average canopy which would display the average diurnal properties of the actual canopy. The authors analyzed radiometer data collected diurnally in the Thematic Mapper wavelength bands from two walnut canopies that received differing irrigation treatments. The reflectance of the canopies varied with sun and view angles and across seven bands in the visible, near-infrared, and middle infrared wavelength regions. Although one of the canopies was permanently water stressed and the other was stressed in mid-afternoon each day, no water stress signature was unambiguously evident in the reflectance data.
Communication: Symmetrical quasi-classical analysis of linear optical spectroscopy
Provazza, Justin; Coker, David F.
2018-05-01
The symmetrical quasi-classical approach for propagation of a many degree of freedom density matrix is explored in the context of computing linear spectra. Calculations on a simple two state model for which exact results are available suggest that the approach gives a qualitative description of peak positions, relative amplitudes, and line broadening. Short time details in the computed dipole autocorrelation function result in exaggerated tails in the spectrum.
Dp spaces on bounded symmetric domains of Cn
International Nuclear Information System (INIS)
Shi Jihuai.
1989-06-01
In this paper, the space D p (Ω) of functions holomorphic on bounded symmetric domain of C m is defined. We prove that H p (Ω) is contained in D p (Ω) if 0 p (Ω) is contained in H p (Ω) if p ≥2, and both inclusions are proper. Further we find that some theorems on H p (Ω) can be extended to the wider class D p (Ω) for 0 < p ≤ 2. (author). 12 refs
Symmetric nuclear matter with Skyrme interaction
International Nuclear Information System (INIS)
Manisa, K.; Bicer, A.; Atav, U.
2010-01-01
The equation of state (EOS) and some properties of symmetric nuclear matter, such as the saturation density, saturation energy and incompressibility, are obtained by using Skyrme's density-dependent effective nucleon-nucleon interaction.
Performance limitations of translationally symmetric nonimaging devices
Bortz, John C.; Shatz, Narkis E.; Winston, Roland
2001-11-01
The component of the optical direction vector along the symmetry axis is conserved for all rays propagated through a translationally symmetric optical device. This quality, referred to herein as the translational skew invariant, is analogous to the conventional skew invariant, which is conserved in rotationally symmetric optical systems. The invariance of both of these quantities is a consequence of Noether's theorem. We show how performance limits for translationally symmetric nonimaging optical devices can be derived from the distributions of the translational skew invariant for the optical source and for the target to which flux is to be transferred. Examples of computed performance limits are provided. In addition, we show that a numerically optimized non-tracking solar concentrator utilizing symmetry-breaking surface microstructure can overcome the performance limits associated with translational symmetry. The optimized design provides a 47.4% increase in efficiency and concentration relative to an ideal translationally symmetric concentrator.
Symmetrical parahiliar infiltrated, cough and dyspnoea
International Nuclear Information System (INIS)
Giraldo Estrada, Horacio; Escalante, Hector
2004-01-01
It is the case a patient to who is diagnosed symmetrical parahiliar infiltrated; initially she is diagnosed lymphoma Hodgkin, treaty with radiotherapy and chemotherapy, but the X rays of the thorax demonstrated parahiliars and paramediastinals infiltrated
Introduction to left-right symmetric models
International Nuclear Information System (INIS)
Grimus, W.
1993-01-01
We motivate left-right symmetric models by the possibility of spontaneous parity breaking. Then we describe the multiplets and the Lagrangian of such models. Finally we discuss lower bounds on the right-handed scale. (author)
A cosmological problem for maximally symmetric supergravity
International Nuclear Information System (INIS)
German, G.; Ross, G.G.
1986-01-01
Under very general considerations it is shown that inflationary models of the universe based on maximally symmetric supergravity with flat potentials are unable to resolve the cosmological energy density (Polonyi) problem. (orig.)
Theorem on axially symmetric gravitational vacuum configurations
Energy Technology Data Exchange (ETDEWEB)
Papadopoulos, A; Le Denmat, G [Paris-6 Univ., 75 (France). Inst. Henri Poincare
1977-01-24
A theorem is proved which asserts the non-existence of axially symmetric gravitational vacuum configurations with non-stationary rotation only. The eventual consequences in black-hole physics are suggested.
Elliptic Genera of Symmetric Products and Second Quantized Strings
Dijkgraaf, R; Verlinde, Erik; Verlinde, Herman L
1997-01-01
In this note we prove an identity that equates the elliptic genus partition function of a supersymmetric sigma model on the $N$-fold symmetric product $M^N/S_N$ of a manifold $M$ to the partition function of a second quantized string theory on the space $M \\times S^1$. The generating function of these elliptic genera is shown to be (almost) an automorphic form for $O(3,2,\\Z)$. In the context of D-brane dynamics, this result gives a precise computation of the free energy of a gas of D-strings inside a higher-dimensional brane.
Symmetric Imidazolium-Based Paramagnetic Ionic Liquids
2017-11-29
Charts N/A Unclassified Unclassified Unclassified SAR 14 Kamran Ghiassi N/A 1 Symmetric Imidazolium-Based Paramagnetic Ionic Liquids Kevin T. Greeson...NUMBER (Include area code) 29 November 2017 Briefing Charts 01 November 2017 - 30 November 2017 Symmetric Imidazolium-Based Paramagnetic Ionic ... Liquids K. Greeson, K. Ghiassi, J. Alston, N. Redeker, J. Marcischak, L. Gilmore, A. Guenthner Air Force Research Laboratory (AFMC) AFRL/RQRP 9 Antares
The Symmetric Rudin-Shapiro Transform
DEFF Research Database (Denmark)
Harbo, Anders La-Cour
2003-01-01
A method for constructing spread spectrum sequences is presented. The method is based on a linear, orthogonal, and symmetric transform given as the Rudin-Shapiro transform (RST), which is in many respects quite similar to the Haar wavelet packet transform. The RST provides the means for generatin...... large sets of spread spectrum signals. This presentation provides a simple definition of the symmetric RST that leads to a fast N log(N) and numerically stable implementation of the transform....
The Symmetric Rudin-Shapiro Transform
DEFF Research Database (Denmark)
Harbo, Anders La-Cour
2003-01-01
A method for constructing spread spectrum sequences is presented. The method is based on a linear, orthogonal, symmetric transform, the Rudin-Shapiro transform (RST), which is in many respects quite similar to the Haar wavelet packet transform. The RST provides the means for generating large sets...... of spread spectrum signals. This presentation provides a simple definition of the symmetric RST that leads to a fast N log(N) and numerically stable implementation of the transform....
Pion condensation in symmetric nuclear matter
International Nuclear Information System (INIS)
Kabir, K.; Saha, S.; Nath, L.M.
1987-09-01
Using a model which is based essentially on the chiral SU(2)xSU(2) symmetry of the pion-nucleon interaction, we examine the possibility of pion condensation in symmetric nucleon matter. We find that the pion condensation is not likely to occur in symmetric nuclear matter for any finite value of the nuclear density. Consequently, no critical opalescence phenomenon is expected to be seen in the pion-nucleus interaction. (author). 20 refs
Pion condensation in symmetric nuclear matter
Kabir, K.; Saha, S.; Nath, L. M.
1988-01-01
Using a model which is based essentially on the chiral SU(2)×SU(2) symmetry of the pion-nucleon interaction, we examine the possibility of pion condensation in symmetric nucleon matter. We find that the pion condensation is not likely to occur in symmetric nuclear matter for any finite value of the nuclear density. Consequently, no critical opalescence phenomenom is expected to be seen in the pion-nucleus interaction.
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
PT-symmetric planar devices for field transformation and imaging
International Nuclear Information System (INIS)
Valagiannopoulos, C A; Monticone, F; Alù, A
2016-01-01
The powerful tools of transformation optics (TO) allow an effective distortion of a region of space by carefully engineering the material inhomogeneity and anisotropy, and have been successfully applied in recent years to control electromagnetic fields in many different scenarios, e.g., to realize invisibility cloaks and planar lenses. For various field transformations, it is not necessary to use volumetric inhomogeneous materials, and suitably designed ultrathin metasurfaces with tailored spatial or spectral responses may be able to realize similar functionalities within smaller footprints and more robust mechanisms. Here, inspired by the concept of metamaterial TO lenses, we discuss field transformations enabled by parity-time (PT) symmetric metasurfaces, which can emulate negative refraction. We first analyze a simple realization based on homogeneous and local metasurfaces to achieve negative refraction and imaging, and we then extend our results to arbitrary PT-symmetric two-port networks to realize aberration-free planar imaging. (paper)
Maximal slicing of D-dimensional spherically symmetric vacuum spacetime
International Nuclear Information System (INIS)
Nakao, Ken-ichi; Abe, Hiroyuki; Yoshino, Hirotaka; Shibata, Masaru
2009-01-01
We study the foliation of a D-dimensional spherically symmetric black-hole spacetime with D≥5 by two kinds of one-parameter families of maximal hypersurfaces: a reflection-symmetric foliation with respect to the wormhole slot and a stationary foliation that has an infinitely long trumpetlike shape. As in the four-dimensional case, the foliations by the maximal hypersurfaces avoid the singularity irrespective of the dimensionality. This indicates that the maximal slicing condition will be useful for simulating higher-dimensional black-hole spacetimes in numerical relativity. For the case of D=5, we present analytic solutions of the intrinsic metric, the extrinsic curvature, the lapse function, and the shift vector for the foliation by the stationary maximal hypersurfaces. These data will be useful for checking five-dimensional numerical-relativity codes based on the moving puncture approach.
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.
Damage Spreading in Spatial and Small-world Random Boolean Networks
Energy Technology Data Exchange (ETDEWEB)
Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.
2014-02-18
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.
An Improvement to a Multi-Client Searchable Encryption Scheme for Boolean Queries.
Jiang, Han; Li, Xue; Xu, Qiuliang
2016-12-01
The migration of e-health systems to the cloud computing brings huge benefits, as same as some security risks. Searchable Encryption(SE) is a cryptography encryption scheme that can protect the confidentiality of data and utilize the encrypted data at the same time. The SE scheme proposed by Cash et al. in Crypto2013 and its follow-up work in CCS2013 are most practical SE Scheme that support Boolean queries at present. In their scheme, the data user has to generate the search tokens by the counter number one by one and interact with server repeatedly, until he meets the correct one, or goes through plenty of tokens to illustrate that there is no search result. In this paper, we make an improvement to their scheme. We allow server to send back some information and help the user to generate exact search token in the search phase. In our scheme, there are only two round interaction between server and user, and the search token has [Formula: see text] elements, where n is the keywords number in query expression, and [Formula: see text] is the minimum documents number that contains one of keyword in query expression, and the computation cost of server is [Formula: see text] modular exponentiation operation.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
The boolean algebra with restricted variables as a tool for fault tree modularization
International Nuclear Information System (INIS)
Caldarola, L.; Wickenhaeuser, A.
1981-08-01
The number of minimal cut sets (m.c.s.) of very complex and highly interconnected fault trees can become extremely large (e.g. more than 10 7 ). In this case the usual analytical approach of dissecting the fault tree TOP variable into m.c.s. is not only computationally prohibitively expensive, but also meaningless because it does not offer any synthetic overview of system behavior. The method proposed in this paper overcomes the deficiencies of the analytical method. It is shown that, by applying boolean algebra with restricted variables (b.a.w.r.v.), the concept of fault tree modularization can be straightforwardly extended from a single gate to a set of gates. Thus, large fault trees are divided into smaller fault trees (modules), which are connected to each other according to a simple scheme. This scheme is represented by a block diagram in which each block is a module. The modules are analyzed separately by the m.c.s. method, and the results are combined according of the TOP event. The method allows the calculation of very large fault trees in a short time and offers a synthetic overview of systems behavior through the block diagram. Numerical examples are also included. Calculations have been carried out by using the computer code MUSTAMO, which is based on the theory developed in this paper. (orig.) [de
Attractor controllability of Boolean networks by flipping a subset of their nodes
Rafimanzelat, Mohammad Reza; Bahrami, Fariba
2018-04-01
The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.
Prescribed burning impact on forest soil properties--a Fuzzy Boolean Nets approach.
Castro, Ana C Meira; Paulo Carvalho, Joao; Ribeiro, S
2011-02-01
The Portuguese northern forests are often and severely affected by wildfires during the Summer season. These occurrences significantly affect and negatively impact all ecosystems, namely soil, fauna and flora. In order to reduce the occurrences of natural wildfires, some measures to control the availability of fuel mass are regularly implemented. Those preventive actions concern mainly prescribed burnings and vegetation pruning. This work reports on the impact of a prescribed burning on several forest soil properties, namely pH, soil moisture, organic matter content and iron content, by monitoring the soil self-recovery capabilities during a one year span. The experiments were carried out in soil cover over a natural site of Andaluzitic schist, in Gramelas, Caminha, Portugal, which was kept intact from prescribed burnings during a period of four years. Soil samples were collected from five plots at three different layers (0-3, 3-6 and 6-18) 1 day before prescribed fire and at regular intervals after the prescribed fire. This paper presents an approach where Fuzzy Boolean Nets (FBN) and Fuzzy reasoning are used to extract qualitative knowledge regarding the effect of prescribed fire burning on soil properties. FBN were chosen due to the scarcity on available quantitative data. The results showed that soil properties were affected by prescribed burning practice and were unable to recover their initial values after one year. Copyright © 2010 Elsevier Inc. All rights reserved.
International Nuclear Information System (INIS)
Martin Sanchez, A.; Vera Tome, F.; Caceres Marzal, D.; Bland, C.J.
1994-01-01
A pulse-height spectrum of alpha-particle emissions at discrete energies can be fitted by the peak-shape functions generated by combining asymmetric truncated exponential functions with a symmetric Gaussian distribution. These functions have been applied successfully by several workers. A correlation was previously found between the variance of the symmetric Gaussian portion of the fitting function, and the parameter characterising the principal exponential tailing function. The results of a more detailed experimental study are reported, which involve varying the angle and the distance between the source and the detector. This analysis shows that the parameters of the symmetric and asymmetric parts of the fitted functions seem to depend on either the detector or the source. These parameters are influenced by the energy loss suffered by the alpha-particles as well as by the efficiency of charge collection in the solid-state detector. (orig.)
Dispersion in a bent-solenoid channel with symmetric focusing
Energy Technology Data Exchange (ETDEWEB)
Wang, Chun-xi [Argonne National Lab. (ANL), Argonne, IL (United States)
2001-08-21
Longitudinal ionization cooling of a muon beam is essential for muon colliders and will be useful for neutrino factories. Bent-solenoid channels with symmetric focusing has been considered for beam focusing and for generating the required dispersion in the ``emittance exchange'' scheme of longitudinal cooling. In this paper, we derive the Hamiltonian that governs the linear beam dynamics of a bent-solenoid channel, solve the single-particle dynamics, and give equations for determining the lattice functions, in particular, the dispersion functions.
A Derandomized Algorithm for RP-ADMM with Symmetric Gauss-Seidel Method
Xu, Jinchao; Xu, Kailai; Ye, Yinyu
2017-01-01
For multi-block alternating direction method of multipliers(ADMM), where the objective function can be decomposed into multiple block components, we show that with block symmetric Gauss-Seidel iteration, the algorithm will converge quickly. The method will apply a block symmetric Gauss-Seidel iteration in the primal update and a linear correction that can be derived in view of Richard iteration. We also establish the linear convergence rate for linear systems.
Energy Technology Data Exchange (ETDEWEB)
Faryad, Muhammad, E-mail: muhammad.faryad@lums.edu.pk [Department of Physics, Lahore University of Management Sciences, Lahore 54792 (Pakistan); Lakhtakia, Akhlesh [Department of Engineering Science and Mechanics, The Pennsylvania State University, University Park, PA 16802 (United States)
2017-02-19
Mathematical statements of the Huygens principle relate the electric and magnetic field phasors at an arbitrary location in a source-free region enclosed by a surface to the tangential components of the electric and magnetic field phasors over that surface, via the dyadic Green functions applicable to the linear homogeneous medium occupying that region. We have mathematically formulated the Huygens principle for the electric and magnetic field phasors when the permittivity and permeability dyadics of the medium are symmetric, the symmetric parts of the two magnetoelectric dyadics of the medium are negative of each other, and both magnetoelectric dyadics also contain anti-symmetric terms. We have also formulated the Huygens principle for the electric (resp. magnetic) field phasor in a medium whose permittivity (resp. permeability) is scalar, the permeability (resp. permittivity) is symmetric, the symmetric parts of the two magnetoelectric dyadics reduce to dissimilar scalars, and anti-symmetric parts of the two magnetoelectric dyadics are identical. - Highlights: • The Huygens principle was formulated for bianistropic mediums when the permittivity and permeability dyadics of the medium are symmetric. • The formulation covers isotropic, biisotropic, and gyrotropic-like uniaxial mediums for which the Huygens principle is already available. • The formulation also covers new mediums like biaxial, chiro-omega, pseudo chiral, gyrotropic-like biaxial, and Lorentz reciprocal mediums.
Survival and transmission of symmetrical chromosomal aberrations
International Nuclear Information System (INIS)
Savage, J.R.K.
1979-01-01
The interaction between the lesions to produce chromosomal structural changes may be either asymmetrical (A) or symmetrical (S). In A, one or more acentric fragments are always produced, and there may also be the mechanical separation problems resulting from bridges at anaphase, while S-changes never produce fragment, and pose no mechanical problem in cell division. If A and S events occur with equal frequency, it might be an indication that they are truly the alternative modes of lesion interaction. Unstimulated lymphocytes were irradiated with 2.68 Gy 250 kV X-ray, and metaphases were sampled at 50 h after the stimulation. Preparations were complete diploid cells, and any obvious second division cells were rejected. So far as dermal repair and fibroblast functions are concerned, aberration burden seems to have little consequence from the view-point of the long-term survival in vivo. Large numbers of aberrations (mainly S translocation and terminal deletion) were found in the samples taken up to 60 years after therapy. Skin biopsies were removed 1 day and 6 months after irradiation and cultured. In irradiated cells, reciprocal translocations dominated, followed by terminal deletions, then inversions, while no chromosome-type aberration was seen in the control cells. a) The relative occurrence of A : S changes, b) long-term survival in vivo, c) the possibility of in vivo repair, and d) some unusual features of translocation found in Syrian hamsters are reviewed. The relevance or importance of major S events is clearly dependent upon the cells, the tissues or the organisms in which they occur. (Yamashita, S.)
Crossing-symmetric solutions to low equations
International Nuclear Information System (INIS)
McLeod, R.J.; Ernst, D.J.
1985-01-01
Crossing symmetric models of the pion-nucleon interaction in which crossing symmetry is kept to lowest order in msub(π)/msub(N) are investigated. Two iterative techniques are developed to solve the crossing-symmetric Low equation. The techniques are used to solve the original Chew-Low equations and their generalizations to include the coupling to the pion-production channels. Small changes are found in comparison with earlier results which used an iterative technique proposed by Chew and Low and which did not produce crossing-symmetric results. The iterative technique of Chew and Low is shown to fail because of its inability to produce zeroes in the amplitude at complex energies while physical solutions to the model require such zeroes. We also prove that, within the class of solutions such that phase shifts approach zero for infinite energy, the solution to the Low equation is unique. (orig.)
Revisiting the Optical PT-Symmetric Dimer
Directory of Open Access Journals (Sweden)
José Delfino Huerta Morales
2016-08-01
Full Text Available Optics has proved a fertile ground for the experimental simulation of quantum mechanics. Most recently, optical realizations of PT -symmetric quantum mechanics have been shown, both theoretically and experimentally, opening the door to international efforts aiming at the design of practical optical devices exploiting this symmetry. Here, we focus on the optical PT -symmetric dimer, a two-waveguide coupler where the materials show symmetric effective gain and loss, and provide a review of the linear and nonlinear optical realizations from a symmetry-based point of view. We go beyond a simple review of the literature and show that the dimer is just the smallest of a class of planar N-waveguide couplers that are the optical realization of the Lorentz group in 2 + 1 dimensions. Furthermore, we provide a formulation to describe light propagation through waveguide couplers described by non-Hermitian mode coupling matrices based on a non-Hermitian generalization of the Ehrenfest theorem.
PT symmetric Aubry–Andre model
International Nuclear Information System (INIS)
Yuce, C.
2014-01-01
PT symmetric Aubry–Andre model describes an array of N coupled optical waveguides with position-dependent gain and loss. We show that the reality of the spectrum depends sensitively on the degree of quasi-periodicity for small number of lattice sites. We obtain the Hofstadter butterfly spectrum and discuss the existence of the phase transition from extended to localized states. We show that rapidly changing periodical gain/loss materials almost conserve the total intensity. - Highlights: • We show that PT symmetric Aubry–Andre model may have real spectrum. • We show that the reality of the spectrum depends sensitively on the degree of disorder. • We obtain the Hofstadter butterfly spectrum for PT symmetric Aubry–Andre model. • We discuss that phase transition from extended to localized states exists
PT symmetric Aubry–Andre model
Energy Technology Data Exchange (ETDEWEB)
Yuce, C., E-mail: cyuce@anadolu.edu.tr
2014-06-13
PT symmetric Aubry–Andre model describes an array of N coupled optical waveguides with position-dependent gain and loss. We show that the reality of the spectrum depends sensitively on the degree of quasi-periodicity for small number of lattice sites. We obtain the Hofstadter butterfly spectrum and discuss the existence of the phase transition from extended to localized states. We show that rapidly changing periodical gain/loss materials almost conserve the total intensity. - Highlights: • We show that PT symmetric Aubry–Andre model may have real spectrum. • We show that the reality of the spectrum depends sensitively on the degree of disorder. • We obtain the Hofstadter butterfly spectrum for PT symmetric Aubry–Andre model. • We discuss that phase transition from extended to localized states exists.
All-optical symmetric ternary logic gate
Chattopadhyay, Tanay
2010-09-01
Symmetric ternary number (radix=3) has three logical states (1¯, 0, 1). It is very much useful in carry free arithmetical operation. Beside this, the logical operation using this type of number system is also effective in high speed computation and communication in multi-valued logic. In this literature all-optical circuits for three basic symmetrical ternary logical operations (inversion, MIN and MAX) are proposed and described. Numerical simulation verifies the theoretical model. In this present scheme the different ternary logical states are represented by different polarized state of light. Terahertz optical asymmetric demultiplexer (TOAD) based interferometric switch has been used categorically in this manuscript.
Symmetry theorems via the continuous steiner symmetrization
Directory of Open Access Journals (Sweden)
L. Ragoub
2000-06-01
Full Text Available Using a new approach due to F. Brock called the Steiner symmetrization, we show first that if $u$ is a solution of an overdetermined problem in the divergence form satisfying the Neumann and non-constant Dirichlet boundary conditions, then $Omega$ is an N-ball. In addition, we show that we can relax the condition on the value of the Dirichlet boundary condition in the case of superharmonicity. Finally, we give an application to positive solutions of some semilinear elliptic problems in symmetric domains for the divergence case.
Symmetric splitting of very light systems
International Nuclear Information System (INIS)
Grotowski, K.; Majka, Z.; Planeta, R.
1984-01-01
Inclusive and coincidence measurements have been performed to study symmetric products from the reactions 74--186 MeV 12 C+ 40 Ca, 141 MeV 9 Be+ 40 Ca, and 153 MeV 6 Li+ 40 Ca. The binary decay of the composite system has been verified. Energy spectra, angular distributions, and fragment correlations are presented. The total kinetic energies for the symmetric products from these very light composite systems are compared to liquid drop model calculations and fission systematics
Banach spaces of continuous functions as dual spaces
Dales, H G; Lau, A T -M; Strauss, D
2016-01-01
This book gives a coherent account of the theory of Banach spaces and Banach lattices, using the spaces C_0(K) of continuous functions on a locally compact space K as the main example. The study of C_0(K) has been an important area of functional analysis for many years. It gives several new constructions, some involving Boolean rings, of this space as well as many results on the Stonean space of Boolean rings. The book also discusses when Banach spaces of continuous functions are dual spaces and when they are bidual spaces.
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.
Small diameter symmetric networks from linear groups
Campbell, Lowell; Carlsson, Gunnar E.; Dinneen, Michael J.; Faber, Vance; Fellows, Michael R.; Langston, Michael A.; Moore, James W.; Multihaupt, Andrew P.; Sexton, Harlan B.
1992-01-01
In this note is reported a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation.
Sobolev spaces on bounded symmetric domains
Czech Academy of Sciences Publication Activity Database
Engliš, Miroslav
Roč. 60, č. 12 ( 2015 ), s. 1712-1726 ISSN 1747-6933 Institutional support: RVO:67985840 Keywords : bounded symmetric domain * Sobolev space * Bergman space Subject RIV: BA - General Mathematics Impact factor: 0.466, year: 2015 http://www.tandfonline.com/doi/abs/10.1080/17476933. 2015 .1043910
Cuspidal discrete series for semisimple symmetric spaces
DEFF Research Database (Denmark)
Andersen, Nils Byrial; Flensted-Jensen, Mogens; Schlichtkrull, Henrik
2012-01-01
We propose a notion of cusp forms on semisimple symmetric spaces. We then study the real hyperbolic spaces in detail, and show that there exists both cuspidal and non-cuspidal discrete series. In particular, we show that all the spherical discrete series are non-cuspidal. (C) 2012 Elsevier Inc. All...
Exact solutions of the spherically symmetric multidimensional ...
African Journals Online (AJOL)
The complete orthonormalised energy eigenfunctions and the energy eigenvalues of the spherically symmetric isotropic harmonic oscillator in N dimensions, are obtained through the methods of separation of variables. Also, the degeneracy of the energy levels are examined. KEY WORDS: - Schrödinger Equation, Isotropic ...
Harmonic maps of the bounded symmetric domains
International Nuclear Information System (INIS)
Xin, Y.L.
1994-06-01
A shrinking property of harmonic maps into R IV (2) is proved which is used to classify complete spacelike surfaces of the parallel mean curvature in R 4 2 with a reasonable condition on the Gauss image. Liouville-type theorems of harmonic maps from the higher dimensional bounded symmetric domains are also established. (author). 25 refs
On isotropic cylindrically symmetric stellar models
International Nuclear Information System (INIS)
Nolan, Brien C; Nolan, Louise V
2004-01-01
We attempt to match the most general cylindrically symmetric vacuum spacetime with a Robertson-Walker interior. The matching conditions show that the interior must be dust filled and that the boundary must be comoving. Further, we show that the vacuum region must be polarized. Imposing the condition that there are no trapped cylinders on an initial time slice, we can apply a result of Thorne's and show that trapped cylinders never evolve. This results in a simplified line element which we prove to be incompatible with the dust interior. This result demonstrates the impossibility of the existence of an isotropic cylindrically symmetric star (or even a star which has a cylindrically symmetric portion). We investigate the problem from a different perspective by looking at the expansion scalars of invariant null geodesic congruences and, applying to the cylindrical case, the result that the product of the signs of the expansion scalars must be continuous across the boundary. The result may also be understood in relation to recent results about the impossibility of the static axially symmetric analogue of the Einstein-Straus model
The Mathematics of Symmetrical Factorial Designs
Indian Academy of Sciences (India)
The Mathematics of Symmetrical Factorial Designs. Mausumi Bose (nee Sen) obtained her MSc degree in. Statistics from the Calcutta. University and PhD degree from the Indian Statistical. Institute. She is on the faculty of the Indian. Statistical Institute. Her main field of research interest is design and analysis of experiments.
Symmetric intersections of Rauzy fractals | Sellami | Quaestiones ...
African Journals Online (AJOL)
In this article we study symmetric subsets of Rauzy fractals of unimodular irreducible Pisot substitutions. The symmetry considered is re ection through the origin. Given an unimodular irreducible Pisot substitution, we consider the intersection of its Rauzy fractal with the Rauzy fractal of the reverse substitution. This set is ...
A viewpoint on nearly conformally symmetric manifold
International Nuclear Information System (INIS)
Rahman, M.S.
1990-06-01
Some observations, with definition, on Nearly Conformally Symmetric (NCS) manifold are made. A number of theorems concerning conformal change of metric and parallel tensors on NCS manifolds are presented. It is illustrated that a manifold M = R n-1 x R + 1 , endowed with a special metric, is NCS but not of harmonic curvature. (author). 8 refs
Harmonic analysis on reductive symmetric spaces
Ban, E.P. van den; Schlichtkrull, H.
2000-01-01
We give a relatively non-technical survey of some recent advances in the Fourier theory for semisimple symmetric spaces. There are three major results: An inversion formula for the Fourier transform, a Palley-Wiener theorem, which describes the Fourier image of the space of completely supported
Fourier transforms on a semisimple symmetric space
Ban, E.P. van den; Schlichtkrull, H.
1994-01-01
Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation
Fourier transforms on a semisimple symmetric space
Ban, E.P. van den; Carmona, J.; Delorme, P.
1997-01-01
Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation
Spherically symmetric static spacetimes in vacuum f(T) gravity
International Nuclear Information System (INIS)
Ferraro, Rafael; Fiorini, Franco
2011-01-01
We show that Schwarzschild geometry remains as a vacuum solution for those four-dimensional f(T) gravitational theories behaving as ultraviolet deformations of general relativity. In the gentler context of three-dimensional gravity, we also find that the infrared-deformed f(T) gravities, like the ones used to describe the late cosmic speed up of the Universe, have as the circularly symmetric vacuum solution a Deser-de Sitter or a Banados, Teitelboim and Zanelli-like spacetime with an effective cosmological constant depending on the infrared scale present in the function f(T).
All spherically symmetric charged anisotropic solutions for compact stars
Energy Technology Data Exchange (ETDEWEB)
Maurya, S.K. [University of Nizwa, Department of Mathematical and Physical Sciences, College of Arts and Science, Nizwa (Oman); Gupta, Y.K. [Raj Kumar Goel Institute of Technology, Department of Mathematics, Ghaziabad, UP (India); Ray, Saibal [Government College of Engineering and Ceramic Technology, Department of Physics, Kolkata, West Bengal (India)
2017-06-15
In the present paper we develop an algorithm for all spherically symmetric anisotropic charged fluid distributions. Considering a new source function ν(r) we find a set of solutions which is physically well behaved and represents compact stellar models. A detailed study specifically shows that the models actually correspond to strange stars in terms of their mass and radius. In this connection we investigate several physical properties like energy conditions, stability, mass-radius ratio, electric charge content, anisotropic nature and surface redshift through graphical plots and mathematical calculations. All the features from these studies are in excellent agreement with the already available evidence in theory as well as observations. (orig.)
Helically symmetric equilibria with pressure anisotropy and incompressible plasma flow
Evangelias, A.; Kuiroukidis, A.; Throumoulopoulos, G. N.
2018-02-01
We derive a generalized Grad-Shafranov equation governing helically symmetric equilibria with pressure anisotropy and incompressible flow of arbitrary direction. Through the most general linearizing ansatz for the various free surface functions involved therein, we construct equilibrium solutions and study their properties. It turns out that pressure anisotropy can act either paramegnetically or diamagnetically, the parallel flow has a paramagnetic effect, while the non-parallel component of the flow associated with the electric field has a diamagnetic one. Also, pressure anisotropy and flow affect noticeably the helical current density.
Realization of logical functions by vector programs
Energy Technology Data Exchange (ETDEWEB)
Lapkin, L Ya
1983-03-01
Recent computing and control applications often require program realization of finite automata in general and of an important particular class of memoryless automata specified by systems of Boolean functions. Logical control and computing machines which receive sequences of discrete signals on the input and convert them into sequences of discrete output signals using finite memory may be described by a finite automation model. However, in distinction from the circuit interpretation of finite automata, the automaton algorithm represents the structure of the automaton program and not the structure of the machine itself. Therefore, the complexity of the computer realization of an automaton is the complexity of the computer program, and not the complexity of the hardware. Two classes of programs currently used to evalute boolean functions are operator programs and binary programs. However, computing machines, including microcomputers, are equipped with additional possibilities for evaluation of Boolean functions, which are not utilized in programs of these two basic classes. In this article, we consider the design of vector programs for program realization of systems of Boolean functions. 3 references.
A differential equation for Lerch's transcendent and associated symmetric operators in Hilbert space
International Nuclear Information System (INIS)
Kaplitskii, V M
2014-01-01
The function Ψ(x,y,s)=e iy Φ(−e iy ,s,x), where Φ(z,s,v) is Lerch's transcendent, satisfies the following two-dimensional formally self-adjoint second-order hyperbolic differential equation, where s=1/2+iλ. The corresponding differential expression determines a densely defined symmetric operator (the minimal operator) on the Hilbert space L 2 (Π), where Π=(0,1)×(0,2π). We obtain a description of the domains of definition of some symmetric extensions of the minimal operator. We show that formal solutions of the eigenvalue problem for these symmetric extensions are represented by functional series whose structure resembles that of the Fourier series of Ψ(x,y,s). We discuss sufficient conditions for these formal solutions to be eigenfunctions of the resulting symmetric differential operators. We also demonstrate a close relationship between the spectral properties of these symmetric differential operators and the distribution of the zeros of some special analytic functions analogous to the Riemann zeta function. Bibliography: 15 titles
Marginal Stability Diagrams for Infinite-n Ballooning Modes in Quasi-symmetric Stellarators
International Nuclear Information System (INIS)
Hudson, S.R.; Hegna, C.C.; Torasso, R.; Ware, A.
2003-01-01
By perturbing the pressure and rotational-transform profiles at a selected surface in a given equilibrium, and by inducing a coordinate variation such that the perturbed state is in equilibrium, a family of magnetohydrodynamic equilibria local to the surface and parameterized by the pressure gradient and shear is constructed for arbitrary stellarator geometry. The geometry of the surface is not changed. The perturbed equilibria are analyzed for infinite-n ballooning stability and marginal stability diagrams are constructed that are analogous to the (s; alpha) diagrams constructed for axi-symmetric configurations. The method describes how pressure and rotational-transform gradients influence the local shear, which in turn influences the ballooning stability. Stability diagrams for the quasi-axially-symmetric NCSX (National Compact Stellarator Experiment), a quasi-poloidally-symmetric configuration and the quasi-helically-symmetric HSX (Helically Symmetric Experiment) are presented. Regions of second-stability are observed in both NCSX and the quasi-poloidal configuration, whereas no second stable region is observed for the quasi-helically symmetric device. To explain the different regions of stability, the curvature and local shear of the quasi-poloidal configuration are analyzed. The results are seemingly consistent with the simple explanation: ballooning instability results when the local shear is small in regions of bad curvature. Examples will be given that show that the structure, and stability, of the ballooning mode is determined by the structure of the potential function arising in the Schroedinger form of the ballooning equation
Symmetric Double Quantum Dot Energy States in a High Magnetic Field
International Nuclear Information System (INIS)
Morgenstern Horing, Norman J; Sawamura, Makoto
2011-01-01
The dynamical Green's function and energy spectrum of a 2D symmetric quantum double-dot system on a planar host in a normal magnetic field are analyzed here, representing the two dots by Dirac delta function potentials. The proliferation of energy levels due to Landau quantization is examined in detail.
Analytical results for non-Hermitian parity–time-symmetric and ...
Indian Academy of Sciences (India)
Abstract. We investigate both the non-Hermitian parity–time-(PT-)symmetric and Hermitian asymmetric volcano potentials, and present the analytical solution in terms of the confluent Heun function. Under certain special conditions, the confluent Heun function can be terminated as a polynomial, thereby leading to certain ...
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.
Representations of the infinite symmetric group
Borodin, Alexei
2016-01-01
Representation theory of big groups is an important and quickly developing part of modern mathematics, giving rise to a variety of important applications in probability and mathematical physics. This book provides the first concise and self-contained introduction to the theory on the simplest yet very nontrivial example of the infinite symmetric group, focusing on its deep connections to probability, mathematical physics, and algebraic combinatorics. Following a discussion of the classical Thoma's theorem which describes the characters of the infinite symmetric group, the authors describe explicit constructions of an important class of representations, including both the irreducible and generalized ones. Complete with detailed proofs, as well as numerous examples and exercises which help to summarize recent developments in the field, this book will enable graduates to enhance their understanding of the topic, while also aiding lecturers and researchers in related areas.
Symmetric, discrete fractional splines and Gabor systems
DEFF Research Database (Denmark)
Søndergaard, Peter Lempel
2006-01-01
In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing the continu......In this paper we consider fractional splines as windows for Gabor frames. We introduce two new types of symmetric, fractional splines in addition to one found by Unser and Blu. For the finite, discrete case we present two families of splines: One is created by sampling and periodizing...... the continuous splines, and one is a truly finite, discrete construction. We discuss the properties of these splines and their usefulness as windows for Gabor frames and Wilson bases....
Symmetric configurations highlighted by collective quantum coherence
Energy Technology Data Exchange (ETDEWEB)
Obster, Dennis [Radboud University, Institute for Mathematics, Astrophysics and Particle Physics, Nijmegen (Netherlands); Kyoto University, Yukawa Institute for Theoretical Physics, Kyoto (Japan); Sasakura, Naoki [Kyoto University, Yukawa Institute for Theoretical Physics, Kyoto (Japan)
2017-11-15
Recent developments in quantum gravity have shown the Lorentzian treatment to be a fruitful approach towards the emergence of macroscopic space-times. In this paper, we discuss another related aspect of the Lorentzian treatment: we argue that collective quantum coherence may provide a simple mechanism for highlighting symmetric configurations over generic non-symmetric ones. After presenting the general framework of the mechanism, we show the phenomenon in some concrete simple examples in the randomly connected tensor network, which is tightly related to a certain model of quantum gravity, i.e., the canonical tensor model. We find large peaks at configurations invariant under Lie-group symmetries as well as a preference for charge quantization, even in the Abelian case. In future study, this simple mechanism may provide a way to analyze the emergence of macroscopic space-times with global symmetries as well as various other symmetries existing in nature, which are usually postulated. (orig.)
Overlap-free symmetric D 0 Lwords
Directory of Open Access Journals (Sweden)
Anna Frid
2001-12-01
Full Text Available A D0L word on an alphabet Σ={0,1,…,q-1} is called symmetric if it is a fixed point w=φ(w of a morphism φ:Σ * → Σ * defined by φ(i= t 1 + i t 2 + i … t m + i for some word t 1 t 2 … t m (equal to φ(0 and every i ∈ Σ; here a means a mod q. We prove a result conjectured by J. Shallit: if all the symbols in φ(0 are distinct (i.e., if t i ≠ t j for i ≠ j, then the symmetric D0L word w is overlap-free, i.e., contains no factor of the form axaxa for any x ∈ Σ * and a ∈ Σ.
Young—Capelli symmetrizers in superalgebras†
Brini, Andrea; Teolis, Antonio G. B.
1989-01-01
Let Supern[U [unk] V] be the nth homogeneous subspace of the supersymmetric algebra of U [unk] V, where U and V are Z2-graded vector spaces over a field K of characteristic zero. The actions of the general linear Lie superalgebras pl(U) and pl(V) span two finite-dimensional K-subalgebras B and [unk] of EndK(Supern[U [unk] V]) that are the centralizers of each other. Young—Capelli symmetrizers and Young—Capelli *-symmetrizers give rise to K-linear bases of B and [unk] containing orthogonal systems of idempotents; thus they yield complete decompositions of B and [unk] into minimal left and right ideals, respectively. PMID:16594014
Factored Facade Acquisition using Symmetric Line Arrangements
Ceylan, Duygu
2012-05-01
We introduce a novel framework for image-based 3D reconstruction of urban buildings based on symmetry priors. Starting from image-level edges, we generate a sparse and approximate set of consistent 3D lines. These lines are then used to simultaneously detect symmetric line arrangements while refining the estimated 3D model. Operating both on 2D image data and intermediate 3D feature representations, we perform iterative feature consolidation and effective outlier pruning, thus eliminating reconstruction artifacts arising from ambiguous or wrong stereo matches. We exploit non-local coherence of symmetric elements to generate precise model reconstructions, even in the presence of a significant amount of outlier image-edges arising from reflections, shadows, outlier objects, etc. We evaluate our algorithm on several challenging test scenarios, both synthetic and real. Beyond reconstruction, the extracted symmetry patterns are useful towards interactive and intuitive model manipulations.
Commutative curvature operators over four-dimensional generalized symmetric
Directory of Open Access Journals (Sweden)
Ali Haji-Badali
2014-12-01
Full Text Available Commutative properties of four-dimensional generalized symmetric pseudo-Riemannian manifolds were considered. Specially, in this paper, we studied Skew-Tsankov and Jacobi-Tsankov conditions in 4-dimensional pseudo-Riemannian generalized symmetric manifolds.
Irreducible complexity of iterated symmetric bimodal maps
Directory of Open Access Journals (Sweden)
J. P. Lampreia
2005-01-01
Full Text Available We introduce a tree structure for the iterates of symmetric bimodal maps and identify a subset which we prove to be isomorphic to the family of unimodal maps. This subset is used as a second factor for a ∗-product that we define in the space of bimodal kneading sequences. Finally, we give some properties for this product and study the ∗-product induced on the associated Markov shifts.
A symmetric Roos bound for linear codes
Duursma, I.M.; Pellikaan, G.R.
2006-01-01
The van Lint–Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound
Symmetric voltage-controlled variable resistance
Vanelli, J. C.
1978-01-01
Feedback network makes resistance of field-effect transistor (FET) same for current flowing in either direction. It combines control voltage with source and load voltages to give symmetric current/voltage characteristics. Since circuit produces same magnitude output voltage for current flowing in either direction, it introduces no offset in presense of altering polarity signals. It is therefore ideal for sensor and effector circuits in servocontrol systems.
Resistor Networks based on Symmetrical Polytopes
Directory of Open Access Journals (Sweden)
Jeremy Moody
2015-03-01
Full Text Available This paper shows how a method developed by Van Steenwijk can be generalized to calculate the resistance between any two vertices of a symmetrical polytope all of whose edges are identical resistors. The method is applied to a number of cases that have not been studied earlier such as the Archimedean polyhedra and their duals in three dimensions, the regular polytopes in four dimensions and the hypercube in any number of dimensions.
Symmetric vs. asymmetric punishment regimes for bribery
Engel, Christoph; Goerg, Sebastian J.; Yu, Gaoneng
2012-01-01
In major legal orders such as UK, the U.S., Germany, and France, bribers and recipients face equally severe criminal sanctions. In contrast, countries like China, Russia, and Japan treat the briber more mildly. Given these differences between symmetric and asymmetric punishment regimes for bribery, one may wonder which punishment strategy is more effective in curbing corruption. For this purpose, we designed and ran a lab experiment in Bonn (Germany) and Shanghai (China) with exactly the same...
Markov Jump Processes Approximating a Non-Symmetric Generalized Diffusion
International Nuclear Information System (INIS)
Limić, Nedžad
2011-01-01
Consider a non-symmetric generalized diffusion X(⋅) in ℝ d determined by the differential operator A(x) = -Σ ij ∂ i a ij (x)∂ j + Σ i b i (x)∂ i . In this paper the diffusion process is approximated by Markov jump processes X n (⋅), in homogeneous and isotropic grids G n ⊂ℝ d , which converge in distribution in the Skorokhod space D([0,∞),ℝ d ) to the diffusion X(⋅). The generators of X n (⋅) are constructed explicitly. Due to the homogeneity and isotropy of grids, the proposed method for d≥3 can be applied to processes for which the diffusion tensor {a ij (x)} 11 dd fulfills an additional condition. The proposed construction offers a simple method for simulation of sample paths of non-symmetric generalized diffusion. Simulations are carried out in terms of jump processes X n (⋅). For piece-wise constant functions a ij on ℝ d and piece-wise continuous functions a ij on ℝ 2 the construction and principal algorithm are described enabling an easy implementation into a computer code.
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.
Symmetric scrolled packings of multilayered carbon nanoribbons
Savin, A. V.; Korznikova, E. A.; Lobzenko, I. P.; Baimova, Yu. A.; Dmitriev, S. V.
2016-06-01
Scrolled packings of single-layer and multilayer graphene can be used for the creation of supercapacitors, nanopumps, nanofilters, and other nanodevices. The full atomistic simulation of graphene scrolls is restricted to consideration of relatively small systems in small time intervals. To overcome this difficulty, a two-dimensional chain model making possible an efficient calculation of static and dynamic characteristics of nanoribbon scrolls with allowance for the longitudinal and bending stiffness of nanoribbons is proposed. The model is extended to the case of scrolls of multilayer graphene. Possible equilibrium states of symmetric scrolls of multilayer carbon nanotribbons rolled up so that all nanoribbons in the scroll are equivalent are found. Dependences of the number of coils, the inner and outer radii, lowest vibrational eigenfrequencies of rolled packages on the length L of nanoribbons are obtained. It is shown that the lowest vibrational eigenfrequency of a symmetric scroll decreases with a nanoribbon length proportionally to L -1. It is energetically unfavorable for too short nanoribbons to roll up, and their ground state is a stack of plane nanoribbons. With an increasing number k of layers, the nanoribbon length L necessary for creation of symmetric scrolls increases. For a sufficiently small number of layers k and a sufficiently large nanoribbon length L, the scrolled packing has the lowest energy as compared to that of stack of plane nanoribbons and folded structures. The results can be used for development of nanomaterials and nanodevices on the basis of graphene scrolled packings.
Is the Universe matter-antimatter symmetric
International Nuclear Information System (INIS)
Alfven, H.
1976-09-01
According to the symmetric cosmology there should be antimatter regions in space which are equally as large as the matter regions. The regions of different kind are separated by Leidenfrost layers, which may be very thin and not observable from a distance. This view has met resistance which in part is based on the old view that the dilute interstellar and intergalactic medium is more or less homogeneous. However, through space research in the magnetosphere and interplanetary space we know that thin layers, dividing space into regions of different magnetisation, exist and based on this it is concluded that space in general has a cellular structure. This result may break down the psychological resistance to the symmetric theory. The possibility that every second star in our galaxy consists of antimatter is discussed, and it is shown that this view is not in conflict with any observations. As most stars are likely to be surrounded by solar systems of a structure like our own, it is concluded that collisions between comets and antistars (or anticomets and stars) would be rather frequent. Such collisions would result in phenomena of the same type as the observed cosmic γ-ray bursts. Another support for the symmetric cosmology is the continuous X-ray background radiation. Also many of the observed large energy releases in cosmos are likely to be due to annihilation
Time-invariant PT product and phase locking in PT -symmetric lattice models
Joglekar, Yogesh N.; Onanga, Franck Assogba; Harter, Andrew K.
2018-01-01
Over the past decade, non-Hermitian, PT -symmetric Hamiltonians have been investigated as candidates for both a fundamental, unitary, quantum theory and open systems with a nonunitary time evolution. In this paper, we investigate the implications of the former approach in the context of the latter. Motivated by the invariance of the PT (inner) product under time evolution, we discuss the dynamics of wave-function phases in a wide range of PT -symmetric lattice models. In particular, we numerically show that, starting with a random initial state, a universal, gain-site location dependent locking between wave-function phases at adjacent sites occurs in the PT -symmetry-broken region. Our results pave the way towards understanding the physically observable implications of time invariants in the nonunitary dynamics produced by PT -symmetric Hamiltonians.
Dual formulation of covariant nonlinear duality-symmetric action of kappa-symmetric D3-brane
Vanichchapongjaroen, Pichet
2018-02-01
We study the construction of covariant nonlinear duality-symmetric actions in dual formulation. Essentially, the construction is the PST-covariantisation and nonlinearisation of Zwanziger action. The covariantisation made use of three auxiliary scalar fields. Apart from these, the construction proceed in a similar way to that of the standard formulation. For example, the theories can be extended to include interactions with external fields, and that the theories possess two local PST symmetries. We then explicitly demonstrate the construction of covariant nonlinear duality-symmetric actions in dual formulation of DBI theory, and D3-brane. For each of these theories, the twisted selfduality condition obtained from duality-symmetric actions are explicitly shown to match with the duality relation between field strength and its dual from the one-potential actions. Their on-shell actions between the duality-symmetric and the one-potential versions are also shown to match. We also explicitly prove kappa-symmetry of the covariant nonlinear duality-symmetric D3-brane action in dual formulation.
Critical properties of symmetric nanoscale metal-ferroelectric-metal capacitors
International Nuclear Information System (INIS)
Zheng Yue; Cai, M.Q.; Woo, C.H.
2010-01-01
The size, surface and interface effects on the magnitude and stability of spontaneous polarization in a symmetric nanoscale ferroelectric capacitor were studied by analyzing its evolutionary trajectory based on a thermodynamic model. Analytic expressions of the Curie temperature, spontaneous polarization, critical thickness and the Curie-Weiss relation were derived, taking into account the effects of the depolarization field, built-in electric field, interfaces and surfaces. Our results show that the critical properties are not only functions of the ambient temperature, misfit strain and electromechanical boundary conditions, but also depend on the characteristics of electrodes, surfaces and interfaces, through the incomplete charge compensation, near-surface variation of polarization and work function steps of ferroelectric-electrode interfaces, which are adjustable.
Energy Technology Data Exchange (ETDEWEB)
Matloka, K.; Sah, A. K.; Peters, M. W.; Srinivasan, P.; Gelis, A. V.; Regalbuto, M.; Scott, M. J.; Univ. of Florida
2007-12-10
Structural modifications of carbamoylmethylphosphine oxide (CPMO)-functionalized triphenoxymethane platforms are described, and the influence of these changes on the ability of the ligand to extract actinides from simulated acidic nuclear waste streams has been evaluated. The ligand system has been shown to have excellent binding efficiency and a selectivity for An(IV) in comparison to the a simple monomeric CMPO ligand under analogous conditions. Both the extraction efficiency and selectivity are strongly dependent on the flexibility and electronic properties of the ligating units in the triphenoxymethane construct. The Tb(III) and Bi(III) nitrate complexes of tris-CMPO derivatives have been isolated, and their structures were elucidated by NMR, ESI FT-ICR MS, and X-ray analysis, providing information on the interactions between metal ions and the tris-CMPO molecules.
The theory of spherically symmetric thin shells in conformal gravity
Berezin, Victor; Dokuchaev, Vyacheslav; Eroshenko, Yury
The spherically symmetric thin shells are the nearest generalizations of the point-like particles. Moreover, they serve as the simple sources of the gravitational fields both in General Relativity and much more complex quadratic gravity theories. We are interested in the special and physically important case when all the quadratic in curvature tensor (Riemann tensor) and its contractions (Ricci tensor and scalar curvature) terms are present in the form of the square of Weyl tensor. By definition, the energy-momentum tensor of the thin shell is proportional to Diracs delta-function. We constructed the theory of the spherically symmetric thin shells for three types of gravitational theories with the shell: (1) General Relativity; (2) Pure conformal (Weyl) gravity where the gravitational part of the total Lagrangian is just the square of the Weyl tensor; (3) Weyl-Einstein gravity. The results are compared with these in General Relativity (Israel equations). We considered in detail the shells immersed in the vacuum. Some peculiar properties of such shells are found. In particular, for the traceless ( = massless) shell, it is shown that their dynamics cannot be derived from the matching conditions and, thus, is completely arbitrary. On the contrary, in the case of the Weyl-Einstein gravity, the trajectory of the same type of shell is completely restored even without knowledge of the outside solution.
Spherically symmetric solutions of general second-order gravity
International Nuclear Information System (INIS)
Whitt, B.
1988-01-01
The general second-order gravity theory, whose Lagrangian includes higher powers of the curvature, is considered in arbitrary dimensions. It is shown that spherically symmetric solutions are static, except in certain, special, unphysical cases. Spherically symmetric solutions are found and classified. Each theory's solutions fall into a number of distinct branches, which may represent finite space with two singular boundaries, or an asymptotically either flat or (anti--)de Sitter space with one singular boundary. A theory may contain at most one branch of solutions in which all singularities are hidden by event horizons. Such horizons generally emit Hawking radiation, though in certain cases the horizon may have zero temperature. Black holes do not necessarily radiate away all their mass: they may terminate in a zero-temperature black hole, a naked singularity, or a hot black hole in equilibrium with a ''cosmological'' event horizon. The thermodynamics of black-hole solutions is discussed; entropy is found to be an increasing function of horizon area, and the first law is shown to hold
Quantum effects in non-maximally symmetric spaces
International Nuclear Information System (INIS)
Shen, T.C.
1985-01-01
Non-Maximally symmetric spaces provide a more general background to explore the relation between the geometry of the manifold and the quantum fields defined in the manifold than those with maximally symmetric spaces. A static Taub universe is used to study the effect of curvature anisotropy on the spontaneous symmetry breaking of a self-interacting scalar field. The one-loop effective potential on a λphi 4 field with arbitrary coupling xi is computed by zeta function regularization. For massless minimal coupled scalar fields, first order phase transitions can occur. Keeping the shape invariant but decreasing the curvature radius of the universe induces symmetry breaking. If the curvature radius is held constant, increasing deformation can restore the symmetry. Studies on the higher-dimensional Kaluza-Klein theories are also focused on the deformation effect. Using the dimensional regularization, the effective potential of the free scalar fields in M 4 x T/sup N/ and M 4 x (Taub) 3 spaces are obtained. The stability criterions for the static solutions of the self-consistent Einstein equations are derived. Stable solutions of the M 4 x S/sup N/ topology do not exist. With the Taub space as the internal space, the gauge coupling constants of SU(2), and U(1) can be determined geometrically. The weak angle is therefore predicted by geometry in this model
Spherically symmetric self-similar universe
Energy Technology Data Exchange (ETDEWEB)
Dyer, C C [Toronto Univ., Ontario (Canada)
1979-10-01
A spherically symmetric self-similar dust-filled universe is considered as a simple model of a hierarchical universe. Observable differences between the model in parabolic expansion and the corresponding homogeneous Einstein-de Sitter model are considered in detail. It is found that an observer at the centre of the distribution has a maximum observable redshift and can in principle see arbitrarily large blueshifts. It is found to yield an observed density-distance law different from that suggested by the observations of de Vaucouleurs. The use of these solutions as central objects for Swiss-cheese vacuoles is discussed.
Dijet rates with symmetric Et cuts
International Nuclear Information System (INIS)
Banfi, Andrea; Dasgupta, Mrinal
2004-01-01
We consider dijet production in the region where symmetric cuts on the transverse energy, E t , are applied to the jets. In this region next-to-leading order calculations are unreliable and an all-order resummation of soft gluon effects is needed, which we carry out. Although, for illustrative purposes, we choose dijets produced in deep inelastic scattering, our general ideas apply additionally to dijets produced in photoproduction or gamma-gamma processes and should be relevant also to the study of prompt di-photon E t spectra in association with a recoiling jet, in hadron-hadron processes. (author)
Covariant, chirally symmetric, confining model of mesons
International Nuclear Information System (INIS)
Gross, F.; Milana, J.
1991-01-01
We introduce a new model of mesons as quark-antiquark bound states. The model is covariant, confining, and chirally symmetric. Our equations give an analytic solution for a zero-mass pseudoscalar bound state in the case of exact chiral symmetry, and also reduce to the familiar, highly successful nonrelativistic linear potential models in the limit of heavy-quark mass and lightly bound systems. In this fashion we are constructing a unified description of all the mesons from the π through the Υ. Numerical solutions for other cases are also presented
Elastic energy for reflection-symmetric topologies
International Nuclear Information System (INIS)
Majumdar, A; Robbins, J M; Zyskin, M
2006-01-01
Nematic liquid crystals in a polyhedral domain, a prototype for bistable displays, may be described by a unit-vector field subject to tangent boundary conditions. Here we consider the case of a rectangular prism. For configurations with reflection-symmetric topologies, we derive a new lower bound for the one-constant elastic energy. For certain topologies, called conformal and anticonformal, the lower bound agrees with a previous result. For the remaining topologies, called nonconformal, the new bound is an improvement. For nonconformal topologies we derive an upper bound, which differs from the lower bound by a factor depending only on the aspect ratios of the prism
Nanotribology of Symmetric and Asymmetric Liquid Lubricants
Directory of Open Access Journals (Sweden)
Shinji Yamada
2010-03-01
Full Text Available When liquid molecules are confined in a narrow gap between smooth surfaces, their dynamic properties are completely different from those of the bulk. The molecular motions are highly restricted and the system exhibits solid-like responses when sheared slowly. This solidification behavior is very dependent on the molecular geometry (shape of liquids because the solidification is induced by the packing of molecules into ordered structures in confinement. This paper reviews the measurements of confined structures and friction of symmetric and asymmetric liquid lubricants using the surface forces apparatus. The results show subtle and complex friction mechanisms at the molecular scale.
Unary self-verifying symmetric difference automata
CSIR Research Space (South Africa)
Marais, Laurette
2016-07-01
Full Text Available stream_source_info Marais_2016_ABSTRACT.pdf.txt stream_content_type text/plain stream_size 796 Content-Encoding ISO-8859-1 stream_name Marais_2016_ABSTRACT.pdf.txt Content-Type text/plain; charset=ISO-8859-1 18th... International Workshop on Descriptional Complexity of Formal Systems, 5 - 8 July 2016, Bucharest, Romania Unary self-verifying symmetric difference automata Laurette Marais1,2 and Lynette van Zijl1(B) 1 Department of Computer Science, Stellenbosch...
Characterisation of an AGATA symmetric prototype detector
International Nuclear Information System (INIS)
Nelson, L.; Dimmock, M.R.; Boston, A.J.; Boston, H.C.; Cresswell, J.R.; Nolan, P.J.; Lazarus, I.; Simpson, J.; Medina, P.; Santos, C.; Parisel, C.
2007-01-01
The Advanced GAmma Tracking Array (AGATA) symmetric prototype detector has been tested at University of Liverpool. A 137 Ce source, collimated to a 2 mm diameter, was scanned across the front face of the detector and data were acquired utilising digital electronics. Pulse shapes from a selection of well-defined photon interaction positions have been analysed to investigate the position sensitivity of the detector. Furthermore, the application of the electric field simulation software, Multi Geometry Simulation (MGS) to generate theoretical pulse shapes for AGATA detectors has been presented
How Symmetrical Assumptions Advance Strategic Management Research
DEFF Research Database (Denmark)
Foss, Nicolai Juul; Hallberg, Hallberg
2014-01-01
We develop the case for symmetrical assumptions in strategic management theory. Assumptional symmetry obtains when assumptions made about certain actors and their interactions in one of the application domains of a theory are also made about this set of actors and their interactions in other...... application domains of the theory. We argue that assumptional symmetry leads to theoretical advancement by promoting the development of theory with greater falsifiability and stronger ontological grounding. Thus, strategic management theory may be advanced by systematically searching for asymmetrical...
Characterisation of an AGATA symmetric prototype detector
Energy Technology Data Exchange (ETDEWEB)
Nelson, L. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom)]. E-mail: ln@ns.ph.liv.ac.uk; Dimmock, M.R. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom)]. E-mail: mrd@ns.ph.liv.ac.uk; Boston, A.J. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom)]. E-mail: ajb@ns.ph.liv.ac.uk; Boston, H.C. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom); Cresswell, J.R. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom); Nolan, P.J. [Oliver Lodge Laboratory, University of Liverpool, Oxford Street, Liverpool L69 7ZE (United Kingdom); Lazarus, I. [CCLRC Daresbury Laboratory, Daresbury, Warrington WA4 4AD (United Kingdom); Simpson, J. [CCLRC Daresbury Laboratory, Daresbury, Warrington WA4 4AD (United Kingdom); Medina, P. [Institut de Recherches Subatomiques, Strasbourg BP28 67037 (France); Santos, C. [Institut de Recherches Subatomiques, Strasbourg BP28 67037 (France); Parisel, C. [Institut de Recherches Subatomiques, Strasbourg BP28 67037 (France)
2007-04-01
The Advanced GAmma Tracking Array (AGATA) symmetric prototype detector has been tested at University of Liverpool. A {sup 137}Ce source, collimated to a 2 mm diameter, was scanned across the front face of the detector and data were acquired utilising digital electronics. Pulse shapes from a selection of well-defined photon interaction positions have been analysed to investigate the position sensitivity of the detector. Furthermore, the application of the electric field simulation software, Multi Geometry Simulation (MGS) to generate theoretical pulse shapes for AGATA detectors has been presented.
Soft theorems for shift-symmetric cosmologies
Finelli, Bernardo; Goon, Garrett; Pajer, Enrico; Santoni, Luca
2018-03-01
We derive soft theorems for single-clock cosmologies that enjoy a shift symmetry. These so-called consistency conditions arise from a combination of a large diffeomorphism and the internal shift symmetry and fix the squeezed limit of all correlators with a soft scalar mode. As an application, we show that our results reproduce the squeezed bispectrum for ultra-slow-roll inflation, a particular shift-symmetric, nonattractor model which is known to violate Maldacena's consistency relation. Similar results have been previously obtained by Mooij and Palma using background-wave methods. Our results shed new light on the infrared structure of single-clock cosmological spacetimes.
Pion condensation in symmetric nuclear matter
International Nuclear Information System (INIS)
Shamsunnahar, T.; Saha, S.; Kabir, K.; Nath, L.M.
1991-01-01
We have investigated the possibility of pion condensation in symmetric nuclear matter using a model of pion-nucleon interaction based essentially on chiral SU(2) x SU(2) symmetry. We have found that pion condensation is not possible for any finite value of the density. Consequently, no critical opalescence phenomenon is likely to be seen in pion-nucleus scattering nor is it likely to be possible to explain the EMC effect in terms of an increased number of pions in the nucleus. (author)
Baryon symmetric big-bang cosmology
Energy Technology Data Exchange (ETDEWEB)
Stecker, F.W.
1978-04-01
The framework of baryon-symmetric big-bang cosmology offers the greatest potential for deducing the evolution of the universe as a consequence of physical laws and processes with the minimum number of arbitrary assumptions as to initial conditions in the big-bang. In addition, it offers the possibility of explaining the photon-baryon ratio in the universe and how galaxies and galaxy clusters are formed, and also provides the only acceptable explanation at present for the origin of the cosmic gamma ray background radiation.
Baryon symmetric big-bang cosmology
International Nuclear Information System (INIS)
Stecker, F.W.
1978-04-01
The framework of baryon-symmetric big-bang cosmology offers the greatest potential for deducing the evolution of the universe as a consequence of physical laws and processes with the minimum number of arbitrary assumptions as to initial conditions in the big-bang. In addition, it offers the possibility of explaining the photon-baryon ratio in the universe and how galaxies and galaxy clusters are formed, and also provides the only acceptable explanation at present for the origin of the cosmic gamma ray background radiation
Geometrodynamics of spherically symmetric Lovelock gravity
International Nuclear Information System (INIS)
Kunstatter, Gabor; Taves, Tim; Maeda, Hideki
2012-01-01
We derive the Hamiltonian for spherically symmetric Lovelock gravity using the geometrodynamics approach pioneered by Kuchar (1994 Phys. Rev. D 50 3961) in the context of four-dimensional general relativity. When written in terms of the areal radius, the generalized Misner-Sharp mass and their conjugate momenta, the generic Lovelock action and Hamiltonian take on precisely the same simple forms as in general relativity. This result supports the interpretation of Lovelock gravity as the natural higher dimensional extension of general relativity. It also provides an important first step towards the study of the quantum mechanics, Hamiltonian thermodynamics and formation of generic Lovelock black holes. (fast track communication)
Directory of Open Access Journals (Sweden)
Anatoliy Klimyk
2006-01-01
Full Text Available In the paper, properties of orbit functions are reviewed and further developed. Orbit functions on the Euclidean space E_n are symmetrized exponential functions. The symmetrization is fulfilled by a Weyl group corresponding to a Coxeter-Dynkin diagram. Properties of such functions will be described. An orbit function is the contribution to an irreducible character of a compact semisimple Lie group G of rank n from one of its Weyl group orbits. It is shown that values of orbit functions are repeated on copies of the fundamental domain F of the affine Weyl group (determined by the initial Weyl group in the entire Euclidean space E_n. Orbit functions are solutions of the corresponding Laplace equation in E_n, satisfying the Neumann condition on the boundary of F. Orbit functions determine a symmetrized Fourier transform and a transform on a finite set of points.
Institute of Scientific and Technical Information of China (English)
马金全; 葛临东; 童莉
2014-01-01
脉冲噪声环境下波达方向( DOA)估计是阵列信号处理领域一个新兴研究方向。针对α稳定分布噪声环境下经典MUSIC算法性能退化的问题,提出了一种新的基于非线性压缩核函数( NCCF)的DOA估计算法。该算法利用基于NCCF的有界矩阵代替了MUSIC的协方差矩阵,通过对有界矩阵进行特征分解确定信号子空间和噪声子空间,借用MUSIC谱估计公式进行谱峰搜索,得到DOA的估计值。仿真结果表明,NCCF-MUSIC算法运算复杂度较低,相比于基于分数低阶统计量( FLOS)的MUSIC方法和基于广义类相关熵( GCAS)的MUSIC算法,该方法具有更好的准确度和稳定性。%Direction of arrival ( DOA) estimation in the impulse noise environment is a new research direc-tion in the array signal processing field. To solve the problem of performance degradation when applying classic MUSIC algorithm for DOA estimation in the α-stable distribution noise environment,a novel DOA estimation algorithm based on a nonlinear compress core function ( NCCF ) is provided and named as the NCCF-MUSIC. To obtain a DOA estimation,the NCCF-MUSIC method replaces the covariance matrix in MUSIC by a bounded matrix based on the NCCF,and then determines the signal subspace and the noise subspace by feature decomposition, and finally, introduces the MUSIC spectrum estimation algorithm to make a spectral peak searching. Simulation results show that the new NCCF-MUSIC method with a lower computation cost has the higher performance in accuracy and validity than the MUSIC methods based on fractional lower order statistics ( FLOS) or based on generalized correntropy-analogous statistics ( GCAS) .
An existence proof of a symmetric periodic orbit in the octahedral six-body problem
Cavalcanti, Anete Soares
2016-01-01
We present a proof of the existence of a periodic orbit for the Newtonian six-body problem with equal masses. This orbit has three double collisions each period and no multiple collisions. Our proof is based on the minimization of the Lagrangian action functional on a well chosen class of symmetric loops.
On the Decay of Correlations in Non-Analytic SO(n)-Symmetric Models
Naddaf, Ali
We extend the method of complex translations which was originally employed by McBryan-Spencer [2] to obtain a decay rate for the two point function in two-dimensional SO(n)-symmetric models with non-analytic Hamiltonians for $.
The symmetric = ω -semi-classical orthogonal polynomials of class one
Maroni, P.; Mejri, M.
2008-12-01
We give the system of Laguerre-Freud equations associated with the = ω -semi-classical functionals of class one, where = ω is the divided difference operator. This system is solved in the symmetric case. There are essentially two canonical cases. The corresponding integral representations are given.
Azizov, Tomas; Ćurgus, Branko; Dijksma, Aad
2003-01-01
Certain meromorphic matrix valued functions on C\\R, the so-called boundary coefficients, are characterized in terms of a standard symmetric operator S in a Pontryagin space with finite (not necessarily equal) defect numbers, a meromorphic mapping into the defect subspaces of S, and a boundary
The general class of the vacuum spherically symmetric equations of the general relativity theory
International Nuclear Information System (INIS)
Karbanovski, V. V.; Sorokin, O. M.; Nesterova, M. I.; Bolotnyaya, V. A.; Markov, V. N.; Kairov, T. V.; Lyash, A. A.; Tarasyuk, O. R.
2012-01-01
The system of the spherical-symmetric vacuum equations of the General Relativity Theory is considered. The general solution to a problem representing two classes of line elements with arbitrary functions g 00 and g 22 is obtained. The properties of the found solutions are analyzed.
DEFF Research Database (Denmark)
Gadegaard, N.; Almdal, K.; Larsen, N.B.
1999-01-01
The lamellar structure of a symmetric diblock copolymer was studied as a function of temperature. We used dPEP-PDMS with a molecular weight of 8.3 kg/mol as model system. The polymer was dissolved in chloroform and spin-casted on silicon wafers into thin uniform films. The degree and direction...
Morse potential, symmetric Morse potential and bracketed bound-state energies
Czech Academy of Sciences Publication Activity Database
Znojil, Miloslav
2016-01-01
Roč. 31, č. 14 (2016), s. 1650088 ISSN 0217-7323 R&D Projects: GA ČR GA16-22945S Institutional support: RVO:61389005 Keywords : quantum bound states * special functions * Morse potential * symmetrized Morse potential * upper and lower energy estimates * computer-assisted symbolic manipulations Subject RIV: BE - Theoretical Physics Impact factor: 1.165, year: 2016
Iterative methods for symmetric ill-conditioned Toeplitz matrices
Energy Technology Data Exchange (ETDEWEB)
Huckle, T. [Institut fuer Informatik, Muenchen (Germany)
1996-12-31
We consider ill-conditioned symmetric positive definite, Toeplitz systems T{sub n}x = b. If we want to solve such a system iteratively with the conjugate gradient method, we can use band-Toeplitz-preconditioners or Sine-Transform-peconditioners M = S{sub n}{Lambda}S{sub n}, S{sub n} the Sine-Transform-matrix and {Lambda} a diagonal matrix. A Toeplitz matrix T{sub n} = (t{sub i-j)}{sub i}{sup n},{sub j=1} is often related to an underlying function f defined by the coefficients t{sub j}, j = -{infinity},..,-1,0, 1,.., {infinity}. There are four cases, for which we want to determine a preconditioner M: - T{sub n} is related to an underlying function which is given explicitly; - T{sub n} is related to an underlying function that is given by its Fourier coefficients; - T{sub n} is related to an underlying function that is unknown; - T{sub n} is not related to an underlying function. Especially for the first three cases we show how positive definite and effective preconditioners based on the Sine-Transform can be defined for general nonnegative underlying function f. To define M, we evaluate or estimate the values of f at certain positions, and build a Sine-transform matrix with these values as eigenvalues. Then, the spectrum of the preconditioned system is bounded from above and away from zero.
Wu, Jiaye; Yang, Xiangbo
2017-10-30
In this paper, we construct a 1D PT-symmetric Thue-Morse aperiodic optical waveguide network (PTSTMAOWN) and mainly investigate the ultrastrong extraordinary transmission and reflection. We propose an approach to study the photonic modes and solve the problem of calculating photonic modes distributions in aperiodic networks due to the lack of dispersion functions and find that in a PTSTMAOWN there exist more photonic modes and more spontaneous PT-symmetric breaking points, which are quite different from other reported PT-symmetric optical systems. Additionally, we develop a method to sort spontaneous PT-symmetric breaking point zones to seek the strongest extraordinary point and obtain that at this point the strongest extraordinary transmission and reflection arrive at 2.96316 × 10 5 and 1.32761 × 10 5 , respectively, due to the PT-symmetric coupling resonance and the special symmetry pattern of TM networks. These enormous gains are several orders of magnitude larger than the previous results. This optical system may possess potential in designing optical amplifier, optical logic elements in photon computers and ultrasensitive optical switches with ultrahigh monochromatity.
Electroweak Baryogenesis in R-symmetric Supersymmetry
Energy Technology Data Exchange (ETDEWEB)
Fok, R.; Kribs, Graham D.; Martin, Adam; Tsai, Yuhsin
2013-03-01
We demonstrate that electroweak baryogenesis can occur in a supersymmetric model with an exact R-symmetry. The minimal R-symmetric supersymmetric model contains chiral superfields in the adjoint representation, giving Dirac gaugino masses, and an additional set of "R-partner" Higgs superfields, giving R-symmetric \\mu-terms. New superpotential couplings between the adjoints and the Higgs fields can simultaneously increase the strength of the electroweak phase transition and provide additional tree-level contributions to the lightest Higgs mass. Notably, no light stop is present in this framework, and in fact, we require both stops to be above a few TeV to provide sufficient radiative corrections to the lightest Higgs mass to bring it up to 125 GeV. Large CP-violating phases in the gaugino/higgsino sector allow us to match the baryon asymmetry of the Universe with no constraints from electric dipole moments due to R-symmetry. We briefly discuss some of the more interesting phenomenology, particularly of the of the lightest CP-odd scalar.
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.
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.
Serafin, R. A.; Wnuk, E.
The relative accuracy of ordinary and symmetric difference quotients for elementary functions employed in orbit corrections is investigated analytically. The theoretical results of Serafin (1982) are applied to numerical computations in rectangular coordinates, and results for a number of generalized and practical problems are presented in extensive graphs and discussed in detail. The numerical results confirm that symmetric difference quotients give significantly more accurate predictions than ordinary difference quotients.
Statistical properties of anti-symmetrized molecular dynamics
International Nuclear Information System (INIS)
Ohnishi, A.; Randrup, J.
1993-01-01
We study the statistical equilibrium properties of the recently developed anti-symmetrized molecular dynamics model for heavy-ion reactions. We consider A non-interacting fermions in one dimension, either bound in a common harmonic potential or moving freely within an interval, and perform a Metropolis sampling of the corresponding parameter space. Generally the average excitation and the specific heat, considered as functions of the imposed temperature, behave in a classical manner when the canonical weight is calculated in the mean-field approximation. However, it is possible to obtain results that are much closer to the quantal behavior by modifying the weight to take approximate account of the energy fluctuations within the individual wave packets. (orig.)
Symmetric coupling of angular momenta, quadratic algebras and discrete polynomials
International Nuclear Information System (INIS)
Aquilanti, V; Marinelli, D; Marzuoli, A
2014-01-01
Eigenvalues and eigenfunctions of the volume operator, associated with the symmetric coupling of three SU(2) angular momentum operators, can be analyzed on the basis of a discrete Schrödinger–like equation which provides a semiclassical Hamiltonian picture of the evolution of a 'quantum of space', as shown by the authors in [1]. Emphasis is given here to the formalization in terms of a quadratic symmetry algebra and its automorphism group. This view is related to the Askey scheme, the hierarchical structure which includes all hypergeometric polynomials of one (discrete or continuous) variable. Key tool for this comparative analysis is the duality operation defined on the generators of the quadratic algebra and suitably extended to the various families of overlap functions (generalized recoupling coefficients). These families, recognized as lying at the top level of the Askey scheme, are classified and a few limiting cases are addressed
Strain gradient elasticity within the symmetric BEM formulation
Directory of Open Access Journals (Sweden)
S. Terravecchia,
2014-07-01
Full Text Available The symmetric Galerkin Boundary Element Method is used to address a class of strain gradient elastic materials featured by a free energy function of the (classical strain and of its (first gradient. With respect to the classical elasticity, additional response variables intervene, such as the normal derivative of the displacements on the boundary, and the work-coniugate double tractions. The fundamental solutions - featuring a fourth order partial differential equations (PDEs system - exhibit singularities which in 2D may be of the order 1/ r 4 . New techniques are developed, which allow the elimination of most of the latter singularities. The present paper has to be intended as a research communication wherein some results, being elaborated within a more general paper [1], are reported.
3He/4He production ratios by tetrahedral symmetric condensation
International Nuclear Information System (INIS)
Takahashi, Akito
2006-01-01
The present paper treats application of the Electronic Quasi-Particle Expansion Theory (EQPET) model for Tetrahedral Symmetric Condensate (TSC) of H/D mixed systems for Pd host metal. Production ratios of 3 He/ 4 He for multi-body fusion reactions in H/D mixed TSC systems are calculated as a function of H/D mixing ratio. The model is further extended to treat direct nuclear interactions between host-metal nucleus and TSC of pure four protons (or four deuterons), since TSC can become very small (far less than 1 pm radius) charge-neutral pseudo-particle. Results for the case of Ni + 4p/TSC are discussed with Ni + p capture reactions and Ni + 4p fission reactions. (authors)
Generation of spherically symmetric metrics in f(R) gravity
Energy Technology Data Exchange (ETDEWEB)
Amirabi, Z.; Halilsoy, M.; Mazharimousavi, S.H. [Eastern Mediterranean University, Department of Physics, Gazimagusa (Turkey)
2016-06-15
In D-dimensional spherically symmetric f(R) gravity there are three unknown functions to be determined from the fourth order differential equations. It is shown that the system remarkably may be integrated to relate two functions through the third one to provide a reduction to second order equations accompanied with a large class of potential solutions. The third function, which acts as the generator of the process, is F(R) = (df(R))/(dR). We recall that our generating function has been employed as a scalar field with an accompanying self-interacting potential previously, which is entirely different from our approach. Reduction of f(R) theory into a system of equations seems to be efficient enough to generate a solution corresponding to each generating function. As particular examples, besides the known ones, we obtain new black hole solutions in any dimension D. We further extend our analysis to cover non-zero energy-momentum tensors. Global monopole and Maxwell sources are given as examples. (orig.)
Cryptographic Properties of the Hidden Weighted Bit Function
2013-12-23
valid OMB control number. 1. REPORT DATE 23 DEC 2013 2. REPORT TYPE 3. DATES COVERED 00-00-2013 to 00-00-2013 4. TITLE AND SUBTITLE...K. Feng, An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity, in: IWCC 2009, In: LNCS
On the Relations between the Attacks on Symmetric Homomorphic Encryption over the Residue Ring
Directory of Open Access Journals (Sweden)
Alina V. Trepacheva
2017-06-01
Full Text Available The paper considers the security of symmetric homomorphic cryptosystems (HC over the residue ring. The main task is to establish an equivalence between ciphertexts only attack (COA and known plaintexts attack (KPA for HC. The notion of reducibility between attacks and sufficient condition of reducibility from COA to KPA are given for this purpose. The main idea is: to prove reducibility from COA to KPA we need to find a function over residue ring being efficiently computable and having a small image size comparing with the size of residue ring. The study of reducibility existence is important since it allows to understand better the security level of symmetric HC proposed in literature. A vulnerability against KPA has been already found for the majority of these HC. Thus the reducibility presence can demonstrate that cryptosystems under the study are not secure even against COA, and therefore they are totally insecure and shouldn’t be used in practice. We give an example of reducibility from COA to KPA for residue ring being a simple field. Based on this example we show an efficient COA on one symmetric HC for small field. Also we separately consider the case of residue ring composed using number n being hard-to-factor. For such n an efficient algorithm to construct an efficiently computable function with small image is unknown so far. So further work related to cryptanalysis of existing symmetric HC will be directed into study of functions properties over residue rings modulo numbers hard for factorization.
Geometric inequalities for axially symmetric black holes
International Nuclear Information System (INIS)
Dain, Sergio
2012-01-01
A geometric inequality in general relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities play an important role in the characterization of the gravitational collapse; they are closely related with the cosmic censorship conjecture. Axially symmetric black holes are the natural candidates to study these inequalities because the quasi-local angular momentum is well defined for them. We review recent results in this subject and we also describe the main ideas behind the proofs. Finally, a list of relevant open problems is presented. (topical review)
A symmetric bipolar nebula around MWC 922.
Tuthill, P G; Lloyd, J P
2007-04-13
We report regular and symmetric structure around dust-enshrouded Be star MWC 922 obtained with infrared imaging. Biconical lobes that appear nearly square in aspect, forming this "Red Square" nebula, are crossed by a series of rungs that terminate in bright knots or "vortices," and an equatorial dark band crossing the core delimits twin hyperbolic arcs. The intricate yet cleanly constructed forms that comprise the skeleton of the object argue for minimal perturbation from global turbulent or chaotic effects. We also report the presence of a linear comb structure, which may arise from optically projected shadows of a periodic feature in the inner regions, such as corrugations in the rim of a circumstellar disk. The sequence of nested polar rings draws comparison with the triple-ring system seen around the only naked-eye supernova in recent history: SN1987A.
Minimal Left-Right Symmetric Dark Matter.
Heeck, Julian; Patra, Sudhanwa
2015-09-18
We show that left-right symmetric models can easily accommodate stable TeV-scale dark matter particles without the need for an ad hoc stabilizing symmetry. The stability of a newly introduced multiplet either arises accidentally as in the minimal dark matter framework or comes courtesy of the remaining unbroken Z_{2} subgroup of B-L. Only one new parameter is introduced: the mass of the new multiplet. As minimal examples, we study left-right fermion triplets and quintuplets and show that they can form viable two-component dark matter. This approach is, in particular, valid for SU(2)×SU(2)×U(1) models that explain the recent diboson excess at ATLAS in terms of a new charged gauge boson of mass 2 TeV.
Design and Analysis of Symmetric Primitives
DEFF Research Database (Denmark)
Lauridsen, Martin Mehl
. In the second part, we delve into the matter of the various aspects of designing a symmetric cryptographic primitive. We start by considering generalizations of the widely acclaimed Advanced Encryption Standard (AES) block cipher. In particular, our focus is on a component operation in the cipher which permutes...... analyze and implement modes recommended by the National Institute of Standards and Technology (NIST), as well as authenticated encryption modes from the CAESAR competition, when instantiated with the AES. The data processed in our benchmarking has sizes representative to that of typical Internet traffic...... linear cryptanalysis. We apply this model to the standardized block cipher PRESENT. Finally, we present very generic attacks on two authenticated encryption schemes, AVALANCHE and RBS, by pointing out severe design flaws that can be leveraged to fully recover the secret key with very low complexity...
Quasiaxially symmetric stellarators with three field periods
International Nuclear Information System (INIS)
Garabedian, P.; Ku, L.
1999-01-01
Compact hybrid configurations with two field periods have been studied recently as candidates for a proof of principle experiment at the Princeton Plasma Physics Laboratory. This project has led us to the discovery of a family of quasiaxially symmetric stellarators with three field periods that have significant advantages, although their aspect ratios are a little larger. They have reversed shear and perform better in a local analysis of ballooning modes. Nonlinear equilibrium and stability calculations predict that the average beta limit will be at least as high as 4% if the bootstrap current turns out to be as big as that expected in comparable tokamaks. The concept relies on a combination of helical fields and bootstrap current to achieve adequate rotational transform at low aspect ratio. copyright 1999 American Institute of Physics
Primordial two-component maximally symmetric inflation
Enqvist, K.; Nanopoulos, D. V.; Quirós, M.; Kounnas, C.
1985-12-01
We propose a two-component inflation model, based on maximally symmetric supergravity, where the scales of reheating and the inflation potential at the origin are decoupled. This is possible because of the second-order phase transition from SU(5) to SU(3)×SU(2)×U(1) that takes place when φ≅φcinflation at the global minimum, and leads to a reheating temperature TR≅(1015-1016) GeV. This makes it possible to generate baryon asymmetry in the conventional way without any conflict with experimental data on proton lifetime. The mass of the gravitinos is m3/2≅1012 GeV, thus avoiding the gravitino problem. Monopoles are diluted by residual inflation in the broken phase below the cosmological bounds if φcUSA.
Lovelock black holes with maximally symmetric horizons
Energy Technology Data Exchange (ETDEWEB)
Maeda, Hideki; Willison, Steven; Ray, Sourya, E-mail: hideki@cecs.cl, E-mail: willison@cecs.cl, E-mail: ray@cecs.cl [Centro de Estudios CientIficos (CECs), Casilla 1469, Valdivia (Chile)
2011-08-21
We investigate some properties of n( {>=} 4)-dimensional spacetimes having symmetries corresponding to the isometries of an (n - 2)-dimensional maximally symmetric space in Lovelock gravity under the null or dominant energy condition. The well-posedness of the generalized Misner-Sharp quasi-local mass proposed in the past study is shown. Using this quasi-local mass, we clarify the basic properties of the dynamical black holes defined by a future outer trapping horizon under certain assumptions on the Lovelock coupling constants. The C{sup 2} vacuum solutions are classified into four types: (i) Schwarzschild-Tangherlini-type solution; (ii) Nariai-type solution; (iii) special degenerate vacuum solution; and (iv) exceptional vacuum solution. The conditions for the realization of the last two solutions are clarified. The Schwarzschild-Tangherlini-type solution is studied in detail. We prove the first law of black-hole thermodynamics and present the expressions for the heat capacity and the free energy.
Polyhomogeneous expansions from time symmetric initial data
Gasperín, E.; Valiente Kroon, J. A.
2017-10-01
We make use of Friedrich’s construction of the cylinder at spatial infinity to relate the logarithmic terms appearing in asymptotic expansions of components of the Weyl tensor to the freely specifiable parts of time symmetric initial data sets for the Einstein field equations. Our analysis is based on the assumption that a particular type of formal expansions near the cylinder at spatial infinity corresponds to the leading terms of actual solutions to the Einstein field equations. In particular, we show that if the Bach tensor of the initial conformal metric does not vanish at the point at infinity then the most singular component of the Weyl tensor decays near null infinity as O(\\tilde{r}-3\\ln \\tilde{r}) so that spacetime will not peel. We also provide necessary conditions on the initial data which should lead to a peeling spacetime. Finally, we show how to construct global spacetimes which are candidates for non-peeling (polyhomogeneous) asymptotics.
From Symmetric Glycerol Derivatives to Dissymmetric Chlorohydrins
Directory of Open Access Journals (Sweden)
Gemma Villorbina
2011-03-01
Full Text Available The anticipated worldwide increase in biodiesel production will result in an accumulation of glycerol for which there are insufficient conventional uses. The surplus of this by-product has increased rapidly during the last decade, prompting a search for new glycerol applications. We describe here the synthesis of dissymmetric chlorohydrin esters from symmetric 1,3-dichloro-2-propyl esters obtained from glycerol. We studied the influence of two solvents: 1,4-dioxane and 1-butanol and two bases: sodium carbonate and 1-butylimidazole, on the synthesis of dissymmetric chlorohydrin esters. In addition, we studied the influence of other bases (potassium and lithium carbonates in the reaction using 1,4-dioxane as the solvent. The highest yield was obtained using 1,4-dioxane and sodium carbonate.
Bidding behavior in a symmetric Chinese auction
Directory of Open Access Journals (Sweden)
Mauricio Benegas
2015-01-01
Full Text Available This paper purposes a symmetric all-pay auction where the bidders compete neither for an object nor the object itself but for a lottery on receive. That lottery is determined endogenously through the bids. This auction is known as chance auction or more popularly as Chinese auction. The model considers the possibility that for some bidders the optimal strategy is to bid zero and to rely on luck. It showed that bidders become less aggressive when the lottery satisfies a variational condition. It was also shown that luck factor is decisive to determine if the expected payoff in Chinese auction is bigger or smaller than expected payoff in standard all-pay auction.
Cryptanalysis of Some Lightweight Symmetric Ciphers
DEFF Research Database (Denmark)
Abdelraheem, Mohamed Ahmed Awadelkareem Mohamed Ahmed
In recent years, the need for lightweight encryption systems has been increasing as many applications use RFID and sensor networks which have a very low computational power and thus incapable of performing standard cryptographic operations. In response to this problem, the cryptographic community...... on a variant of PRESENT with identical round keys. We propose a new attack named the Invariant Subspace Attack that was specifically mounted against the lightweight block cipher PRINTcipher. Furthermore, we mount several attacks on a recently proposed stream cipher called A2U2....... of the international standards in lightweight cryptography. This thesis aims at analyzing and evaluating the security of some the recently proposed lightweight symmetric ciphers with a focus on PRESENT-like ciphers, namely, the block cipher PRESENT and the block cipher PRINTcipher. We provide an approach to estimate...
Cosmic ray antimatter and baryon symmetric cosmology
Stecker, F. W.; Protheroe, R. J.; Kazanas, D.
1982-01-01
The relative merits and difficulties of the primary and secondary origin hypotheses for the observed cosmic-ray antiprotons, including the new low-energy measurement of Buffington, et al. We conclude that the cosmic-ray antiproton data may be evidence for antimatter galaxies and baryon symmetric cosmology. The present bar P data are consistent with a primary extragalactic component having /p=/equiv 1+/- 3.2/0.7x10 = to the -4 independent of energy. We propose that the primary extragalactic cosmic ray antiprotons are most likely from active galaxies and that expected disintegration of bar alpha/alpha ban alpha/alpha. We further predict a value for ban alpha/alpha =/equiv 10 to the -5, within range of future cosmic ray detectors.
Symmetric Topological Phases and Tensor Network States
Jiang, Shenghan
Classification and simulation of quantum phases are one of main themes in condensed matter physics. Quantum phases can be distinguished by their symmetrical and topological properties. The interplay between symmetry and topology in condensed matter physics often leads to exotic quantum phases and rich phase diagrams. Famous examples include quantum Hall phases, spin liquids and topological insulators. In this thesis, I present our works toward a more systematically understanding of symmetric topological quantum phases in bosonic systems. In the absence of global symmetries, gapped quantum phases are characterized by topological orders. Topological orders in 2+1D are well studied, while a systematically understanding of topological orders in 3+1D is still lacking. By studying a family of exact solvable models, we find at least some topological orders in 3+1D can be distinguished by braiding phases of loop excitations. In the presence of both global symmetries and topological orders, the interplay between them leads to new phases termed as symmetry enriched topological (SET) phases. We develop a framework to classify a large class of SET phases using tensor networks. For each tensor class, we can write down generic variational wavefunctions. We apply our method to study gapped spin liquids on the kagome lattice, which can be viewed as SET phases of on-site symmetries as well as lattice symmetries. In the absence of topological order, symmetry could protect different topological phases, which are often referred to as symmetry protected topological (SPT) phases. We present systematic constructions of tensor network wavefunctions for bosonic symmetry protected topological (SPT) phases respecting both onsite and spatial symmetries.
The radiation chemistry of symmetric aliphatic polyesters
International Nuclear Information System (INIS)
Babanalbandi, A.; Hill, D.J.T.; Pomery, P.J.; Whittaker, A.K.
1996-01-01
Full text: Naturally occurring, symmetric polyesters, including polyglycolic acid, polylactic acid and polyhydroxybutyrate, have found biomedical applications in areas as diverse as the controlled release of pharmaceuticals and the manufacture of surgical sutures. As biomedical products, the materials require sterilization by high energy radiation. This has provided the motivation for the present work. D'Alelio et al. have reported that linear, asymmetric polyesters undergo scission on irradiation, but that branched polyesters containing a methyl group in the diol segments undergo crosslinking. However, for the symmetric polyhydroxybutyrate, Carswell-Pomerantz et al. have reported that only scission occurs on radiolysis, with the evolution of CO and CO 2 as a result of the loss of ester linkages. These workers also found that G(CO + CO 2 ) was approximately equal to G(S) for this polyester. By contrast, Collett et al. have reported that G(S) = 1.26 and G(X) = 0.53 for polylactic acid, which indicates that the polymer undergoes nett crosslinking on radiolysis to form a gel. They have also reported that poly(lactic-co-glycolic acid) should form a gel on radiolysis, since G(S) = 1.66 and G(X) = 0.65 for a 1:1 copolymer composition. In the present work the radiolysis of polylactic acid and poly(lactic-co-glycolic acid) have been reinvestigated in order to resolve the differences between the work of Collett et al. and that of Carswell-Pomerantz et al. In these studies, ESR has been used to study the radicals formed, GPC has been used to investigate scission and crosslinking, GC has been used to study the small molecule volatile products and NMR spectroscopy has been used to identify and measure the new chemical structures formed in the polymers
Axially symmetric Lorentzian wormholes in general relativity
International Nuclear Information System (INIS)
Schein, F.
1997-11-01
The field equations of Einstein's theory of general relativity, being local, do not fix the global structure of space-time. They admit topologically non-trivial solutions, including spatially closed universes and the amazing possibility of shortcuts for travel between distant regions in space and time - so-called Lorentzian wormholes. The aim of this thesis is to (mathematically) construct space-times which contain traversal wormholes connecting arbitrary distant regions of an asymptotically flat or asymptotically de Sitter universe. Since the wormhole mouths appear as two separate masses in the exterior space, space-time can at best be axially symmetric. We eliminate the non-staticity caused by the gravitational attraction of the mouths by anchoring them by strings held at infinity or, alternatively, by electric repulsion. The space-times are obtained by surgically grafting together well-known solutions of Einstein's equations along timelike hypersurfaces. This surgery naturally concentrates a non-zero stress-energy tensor on the boundary between the two space-times which can be investigated by using the standard thin shell formalism. It turns out that, when using charged black holes, the provided constructions are possible without violation of any of the energy conditions. In general, observers living in the axially symmetric, asymptotically flat (respectively asymptotically de Sitter) region axe able to send causal signals through the topologically non-trivial region. However, the wormhole space-times contain closed timelike curves. Because of this explicit violation of global hyperbolicity these models do not serve as counterexamples to known topological censorship theorems. (author)
On the symmetric α-stable distribution with application to symbol error rate calculations
Soury, Hamza
2016-12-24
The probability density function (PDF) of the symmetric α-stable distribution is investigated using the inverse Fourier transform of its characteristic function. For general values of the stable parameter α, it is shown that the PDF and the cumulative distribution function of the symmetric stable distribution can be expressed in terms of the Fox H function as closed-form. As an application, the probability of error of single input single output communication systems using different modulation schemes with an α-stable perturbation is studied. In more details, a generic formula is derived for generalized fading distribution, such as the extended generalized-k distribution. Later, simpler expressions of these error rates are deduced for some selected special cases and compact approximations are derived using asymptotic expansions.
All static spherically symmetric perfect-fluid solutions of Einstein's equations
International Nuclear Information System (INIS)
Lake, Kayll
2003-01-01
An algorithm based on the choice of a single monotone function (subject to boundary conditions) is presented which generates all regular static spherically symmetric perfect-fluid solutions of Einstein's equations. For physically relevant solutions the generating functions must be restricted by nontrivial integral-differential inequalities. Nonetheless, the algorithm is demonstrated here by the construction of an infinite number of previously unknown physically interesting exact solutions
Energy Technology Data Exchange (ETDEWEB)
Viswanathan, K. K.; Aziz, Z. A.; Javed, Saira; Yaacob, Y. [Universiti Teknologi Malaysia, Johor Bahru (Malaysia); Pullepu, Babuji [S R M University, Chennai (India)
2015-05-15
Free vibration of symmetric angle-ply laminated truncated conical shell is analyzed to determine the effects of frequency parameter and angular frequencies under different boundary condition, ply angles, different material properties and other parameters. The governing equations of motion for truncated conical shell are obtained in terms of displacement functions. The displacement functions are approximated by cubic and quintic splines resulting into a generalized eigenvalue problem. The parametric studies have been made and discussed.
International Nuclear Information System (INIS)
Viswanathan, K. K.; Aziz, Z. A.; Javed, Saira; Yaacob, Y.; Pullepu, Babuji
2015-01-01
Free vibration of symmetric angle-ply laminated truncated conical shell is analyzed to determine the effects of frequency parameter and angular frequencies under different boundary condition, ply angles, different material properties and other parameters. The governing equations of motion for truncated conical shell are obtained in terms of displacement functions. The displacement functions are approximated by cubic and quintic splines resulting into a generalized eigenvalue problem. The parametric studies have been made and discussed.
Magnetospectroscopy of symmetric and anti-symmetric states in double quantum wells
Marchewka, M.; Sheregii, E. M.; Tralle, I.; Ploch, D.; Tomaka, G.; Furdak, M.; Kolek, A.; Stadler, A.; Mleczko, K.; Zak, D.; Strupinski, W.; Jasik, A.; Jakiela, R.
2008-02-01
The experimental results obtained for magnetotransport in the InGaAs/InAlAs double quantum well (DQW) structures of two different shapes of wells are reported. A beating effect occurring in the Shubnikov-de Haas (SdH) oscillations was observed for both types of structures at low temperatures in the parallel transport when the magnetic field was perpendicular to the layers. An approach for the calculation of the Landau level energies for DQW structures was developed and then applied to the analysis and interpretation of the experimental data related to the beating effect. We also argue that in order to account for the observed magnetotransport phenomena (SdH and integer quantum Hall effect), one should introduce two different quasi-Fermi levels characterizing two electron subsystems regarding the symmetry properties of their states, symmetric and anti-symmetric ones, which are not mixed by electron-electron interaction.
Aymard, François; Gulminelli, Francesca; Margueron, Jérôme
2016-08-01
The problem of determination of nuclear surface energy is addressed within the framework of the extended Thomas Fermi (ETF) approximation using Skyrme functionals. We propose an analytical model for the density profiles with variationally determined diffuseness parameters. In this first paper, we consider the case of symmetric nuclei. In this situation, the ETF functional can be exactly integrated, leading to an analytical formula expressing the surface energy as a function of the couplings of the energy functional. The importance of non-local terms is stressed and it is shown that they cannot be deduced simply from the local part of the functional, as it was suggested in previous works.
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.
Entangling capabilities of symmetric two-qubit gates
Indian Academy of Sciences (India)
Com- putational investigation of entanglement of such ensembles is therefore impractical for ... the computational complexity. Pairs of spin-1 ... tensor operators which can also provide different symmetric logic gates for quantum pro- ... that five of the eight, two-qubit symmetric quantum gates expressed in terms of our newly.
SUSY formalism for the symmetric double well potential
Indian Academy of Sciences (India)
symmetric double well potential barrier we have obtained a class of exactly solvable potentials subject to moving boundary condition. The eigenstates are also obtained by the same technique. Keywords. SUSY; moving boundary condition; exactly solvable; symmetric double well; NH3 molecule. PACS Nos 02.30.Ik; 03.50.
A New Formulation for Symmetric Implicit Runge-Kutta-Nystrom ...
African Journals Online (AJOL)
In this paper we derive symmetric stable Implicit Runge-Kutta –Nystrom Method for the Integration of General Second Order ODEs by using the collocation approach.The block hybrid method obtained by the evaluation of the continuous interpolant at different nodes of the polynomial is symmetric and suitable for stiff intial ...
Crossing symmetric solution of the Chew-Low equation
International Nuclear Information System (INIS)
McLeod, R.J.; Ernst, D.J.
1982-01-01
An N/D dispersion theory is developed which solves crossing symmetric Low equations. The method is used to generate crossing symmetric solutions to the Chew-Low model. We show why the technique originally proposed by Chew and Low was incapable of producing solutions. (orig.)
Sparse symmetric preconditioners for dense linear systems in electromagnetism
Carpentieri, Bruno; Duff, Iain S.; Giraud, Luc; Monga Made, M. Magolu
2004-01-01
We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. In particular, we report on the numerical behaviour of the classical incomplete Cholesky factorization as well as some of its recent
Stability of transparent spherically symmetric thin shells and wormholes
International Nuclear Information System (INIS)
Ishak, Mustapha; Lake, Kayll
2002-01-01
The stability of transparent spherically symmetric thin shells (and wormholes) to linearized spherically symmetric perturbations about static equilibrium is examined. This work generalizes and systematizes previous studies and explores the consequences of including the cosmological constant. The approach shows how the existence (or not) of a domain wall dominates the landscape of possible equilibrium configurations
Coupled dilaton and electromagnetic field in cylindrically symmetric ...
Indian Academy of Sciences (India)
The dilaton black hole solutions have attracted considerable attention for the ... theory and study the corresponding cylindrically symmetric spacetime, where .... where Йm and Йe are integration constants to be interpreted later as the ..... feature is apparent for the cylindrically symmetric spacetime in the presence of the dila-.
Radon transformation on reductive symmetric spaces: support theorems
Kuit, J.J.|info:eu-repo/dai/nl/313872589
2011-01-01
In this thesis we introduce a class of Radon transforms for reductive symmetric spaces, including the horospherical transforms, and study some of their properties. In particular we obtain a generalization of Helgason's support theorem for the horospherical transform on a Riemannian symmetric space.
New approach to solve symmetric fully fuzzy linear systems
Indian Academy of Sciences (India)
In this paper, we present a method to solve fully fuzzy linear systems with symmetric coefﬁcient matrix. The symmetric coefﬁcient matrix is decomposed into two systems of equations by using Cholesky method and then a solution can be obtained. Numerical examples are given to illustrate our method.
Synthesis & Characterization of New bis-Symmetrical Adipoyl ...
African Journals Online (AJOL)
Full Title: Synthesis and Characterization of New bis-Symmetrical Adipoyl, Terepthaloyl, Chiral Diimido-di-L-alanine Diesters and Chiral Phthaloyl-L-alanine Ester of Tripropoxy p-tert-Butyl Calix[4]arene and Study of Their Hosting Ability for Alanine and Na+. Bis-symmetrical tripropoxy p-tert-butyl calix[4]arene esters were ...